In this letter, the problem of estimating the physical layer (PL) scrambling code sequence of DVB-S2 is studied. We present the first ever scheme to estimate the scrambling sequence. The scheme is based on hypothesis testing. By analyzing the PL scrambling process, we construct a new sequence equivalent to the scrambling sequence. We then use hypothesis testing to estimate the new sequence. The threshold for the hypothesis testing is also discussed. The experiment results show that the performance of our estimation scheme can work even under high BER.
In the DVB-S2 system, the scrambling code sequence is unequivocally associated with each satellite operator or satellite or transponder [1]. For non-cooperative communication, we can identify the transmitter from the scrambling code sequence. Only after we obtain the scrambling code sequence can the physical layer frame (PLFrame) be recovered. Hence, estimation of the scrambling code sequence is very significant for non-cooperative communication. At present, research about scrambling code mainly focuses on the estimation of the generator polynomial. For example, when some input and scrambled bits are known, the Berlekamp-Massey (BM) algorithm can be used to reconstruct the feedback polynomial [2]. If only the scrambled bits are known, Cluzeau’s proposed algorithm can be used [3], [4]. The BM algorithm is based on the scrambling code sequence, but this algorithm does not provide the solution obtaining the scrambling code sequence. Cluzeau’s algorithm is only applicable to a single-channel scrambled code sequence. Regarding the scrambled code sequence of DVB-S2, the scrambling code sequence is separated into the in-phase channel and the quadrature channel. Hence, Cluzeau’s algorithm is inapplicable to DVB-S2. The problem of estimating the scrambling code sequence, especially for DVB-S2, has yet to be solved. In this letter, we propose the first ever scheme to estimate the PL scrambling code sequence of DVB-S2.
II. Physical Layer Scrambling of DVB-S2
Prior to modulation, each PLFrame of DVB-S2, excluding the physical layer header (PLHeader), shall be randomized for energy by multiplying the (I+jQ) samples by a complex randomization sequence (CI+ jCQ), as shown in Fig. 1.
The scrambling sequence is constructed by combining two real m-sequences into a complex sequence. The resulting sequence thus constitutes segments of a set in a Gold sequence. Let x and y be the two sequences. The x sequence is constructed using the primitive polynomial 1+x7+x18. The y sequence is constructed using the polynomial 1+y5+y7+y10+y18.The construction of m-sequences x and y is as follows [1]. The initial conditions areandThe recursive definition of subsequent symbols iswhere mod(,) is the modulus operator. The n-th Gold code sequence zn is then defined as [1]The binary sequence is converted to integer-valued sequence Rn by the following transformation [1]:Finally, the n-th complex scrambling code sequence, CI (i) + jCQ (i), is defined as [1]The relationship between the above-listed sequences is shown in Table 1.
Relationship between scrambled sequence and scrambling sequence.
Rn
CI
CQ
Iscrambled
Qscrambled
Iscrambled* Qscrambled
zn (i)
0
1
0
I
Q
IQ
0
1
0
1
−Q
I
−IQ
1
2
−1
0
−I
−Q
IQ
0
3
0
−1
Q
−I
−IQ
1
III. Estimation of Scrambling Code Sequence
In this section, we assume that bit synchronization and frame synchronization are achieved. Therefore, we must only focus on the baseband signal. From Table 1, it can be observed that the Iscrambled sequence and Qscrambled sequence are both a mix of sequences I and Q. We cannot obtain the Gold code sequence zn(i) from either Iscrambled or Qscrambled. To recover the scrambling code sequence, we construct a new sequence, F, by multiplying Iscrambled and Qscrambled.where S = (s1,s2,… ,sN) is an unknown sequence equivalent to the scrambling sequence obtained in the following and N is the PLFrame length.We regard the product of the I-Q sequence to be the input bits C = (c1,c2,…,cN).Rewrite (8) asFrom Table 1, we getFrom (6), we can writeComparing (11) and (12), we obtainThe problem of estimating the scrambling sequence zn now becomes the problem of estimating sequence S.Assuming the biased memoryless source sequence to be bi[2],Then,Rewriting
2 ε 0 2
as ε, according to (9) and (15), we getEach element of the v-th PLFrame of the PL scrambled sequence can be expressed as
F v def = [ f v,0 , f v,1 ,..., f v,j ,..., f v,N−1 ],
where v = 0, 1, ..., K−1 and K is the PLFrame number, fv,j=cv,jsj. We use the sum of fv,j to estimate the PL scrambling code sequence.The log likelihood ratio of cv,j can be facilitated by [5]Then, we haveThe following section, we shall illustrate two different cases. The first case is ε > 0 , assuming two hypothesizes,We get the probability distribution function (PDF) of each hypothesis.where
( K ( K+ x j ) /2 )
means the number of combinations of K taken (K+xj)/2 at a time.If we use the Neyman-Pearson theorem [6], giving the probability of false alam (PFA) β=10−3, thenThe likelihood ratio isThen,From (23) and (26), we obtainAccording to (25), we can getThe probability of detection (PD) is [6]The detection performance is poor. We use the difference of the PD and the PFA to determine the detection threshold for hypothesis testing. According to (25) and (26), we can writeRewriting γ′ as
log e γ Λ
, we getUnify the variable in (29) and (31) as α and calculate the difference of the PD and the PFA.as shown in Fig. 2.
Then, we calculate the threshold xth from the following equality instead of from (26):Using the new threshold, we get the estimation rule.When ε < 0, then, (22) and (23) can be rewritten asWe get the following estimation rule:
IV. Numerical Results
To validate the estimation scheme performance, simulation experiments are conducted under different situations. Firstly, the BER of the PL scrambled sequence is 0.1. As illustrated in Fig. 3, the performance of estimation decreases when ε lessens. In other words, we need more PLFrames to estimate the scrambling code sequence.
Secondly, when ε is 0.075, the BERs of the PL scrambled sequence are chosen as variable values. Figure 4 shows that the estimation accuracy slightly decreases as the BER increases. When the frame number is larger than 2,000, the estimation accuracy is still bigger than 0.8, even when the BER=0.3. Although the estimation accuracy is less than 0.7 when the frame number is 500, it is enough for us to obtain the scrambling sequence. According to [1], sequences x and y are invariable. If we are able to obtain the order n of Gold code sequence Zn, as in (5), we can then obtain the whole scrambling code sequence. From (5) and (13), we can get
z ^ n (i) = (1 − s ^ j ) / 2,
x ^ (mod((i + n), 2 18 − 1)) = mod( z ^ n (i) + y(i),2).
Then, we calculate the cross correlation of x(i) and
x ^ (mod((i+n), 2 18 −1))
. The value of the x coordinate corresponding to the maximum is of order n.
A robust estimation scheme of the PL scrambling code sequence was presented in this letter. The scheme is based on the hypothesis testing of a new estimation variable. As for the judgment threshold, we proposed a new get method instead of using the Neyman-Pearson theorem. We considered the probability of detection and the probability of false alarm. The simulation results show that the performance of our estimation scheme can work even under high BER.
2006
ETSI EN 302-307, “Digital Video Broadcasting (DVB) — Second Generation Framing Structure, Channel Coding and Modulation Systems for Broadcasting, Interactive Services, News Gathering, and Other Broadband Satellite Applications,” V1.1.2
Liu X.-B.
2012
“Reconstructing a Linear Scrambler with Improved Detection Capability and in the Presence of Noise,”
IEEE Trans. Inf. Foren. Sec.
7
(1)
208 -
218
DOI : 10.1109/TIFS.2011.2169790
Hagenauer J.
,
Offer E.
,
Papke L.
1996
“Iterative Decoding of Binary Block and Convolutional Codes,”
IEEE Trans. Inf. Theory
42
(2)
429 -
445
DOI : 10.1109/18.485714
@article{ HJTODO_2014_v36n2_329}
,title={Estimation of Physical Layer Scrambling Code Sequence of DVB-S2}
,volume={2}
, url={http://dx.doi.org/10.4218/etrij.14.0213.0444}, DOI={10.4218/etrij.14.0213.0444}
, number= {2}
, journal={ETRI Journal}
, publisher={Electronics and Telecommunications Research Institute}
, author={Wu, Hao
and
Xie, Hui
and
Huang, Zhi-Tao
and
Zhou, Yi-Yu}
, year={2014}
, month={Apr}
TY - JOUR
T2 - ETRI Journal
AU - Wu, Hao
AU - Xie, Hui
AU - Huang, Zhi-Tao
AU - Zhou, Yi-Yu
SN - 1225-6463
TI - Estimation of Physical Layer Scrambling Code Sequence of DVB-S2
VL - 36
PB - Electronics and Telecommunications Research Institute
DO - 10.4218/etrij.14.0213.0444
PY - 2014
UR - http://dx.doi.org/10.4218/etrij.14.0213.0444
ER -
Wu, H.
,
Xie, H.
,
Huang, Z. T.
,
&
Zhou, Y. Y.
( 2014).
Estimation of Physical Layer Scrambling Code Sequence of DVB-S2.
ETRI Journal,
36
(2)
Electronics and Telecommunications Research Institute.
doi:10.4218/etrij.14.0213.0444
Wu, H
,
Xie, H
,
Huang, ZT
,
&
Zhou, YY
2014,
Estimation of Physical Layer Scrambling Code Sequence of DVB-S2,
ETRI Journal,
vol. 2,
no. 2,
Retrieved from http://dx.doi.org/10.4218/etrij.14.0213.0444
[1]
H Wu
,
H Xie
,
ZT Huang
,
and
YY Zhou
,
“Estimation of Physical Layer Scrambling Code Sequence of DVB-S2”,
ETRI Journal,
vol. 2,
no. 2,
Apr
2014.
Wu, Hao
Xie, Hui
Huang, Zhi-Tao
et al.
“Estimation of Physical Layer Scrambling Code Sequence of DVB-S2”
ETRI Journal,
2.
2
2014:
Wu, H
,
Xie, H
,
Huang, ZT
,
Zhou, YY
Estimation of Physical Layer Scrambling Code Sequence of DVB-S2.
ETRI Journal
[Internet].
2014.
Apr ;
2
(2)
Available from http://dx.doi.org/10.4218/etrij.14.0213.0444
Wu, Hao
,
Xie, Hui
,
Huang, Zhi-Tao
,
and
Zhou, Yi-Yu
,
“Estimation of Physical Layer Scrambling Code Sequence of DVB-S2.”
ETRI Journal
2
no.2
()
Apr,
2014):
http://dx.doi.org/10.4218/etrij.14.0213.0444