Professional Documents
Culture Documents
Abstract—This paper presents a novel code acquisition correlation. The frequency offset is still estimated by the
algorithm that can overcome the reduction of correlation peak received signal.
caused by the Doppler offset in high dynamic environment and
thereby increasing the acquisition probability. Compared with II. SIGNAL MODLE
the existing code acquisition algorithms, this algorithm can We refer to the local acquisition sequence as
improve the acquisition probability under the same false alarm
probability without increasing the algorithm complexity. This
algorithm can deal with high dynamic environments with x ª¬ x1 x2 xL1 º¼
greater frequency offset, such as high-speed open space
communications and airborne communications. With a
number of simulation experience, the efficacy of the proposed where L1 is the length of the local acquisition sequence. The
acquisition algorithm is validated by the numerical results. ith differential coding output is given by
Keywords-syncronization; acquisition; high dynamic
environment
yi =xi yi 1
rn
sn exp j 2S'fnTsamp 'T wn B. Frequency Offset Estimation
A multi-level frequency offset estimation conducted after
the completion of acquisition. The received signal before the
with ^wn ` denotes the nth noise sample of additive white differential demodulation is used to implement a partial
Gaussian noise (AWGN), 'f represents the frequency offset, correlation with the local acquisition signal waveform to
obtain the partial correlation values, which can be used to
'T represents the phase offset, and Tsamp is the sample time. calculate the frequency offset.
To understand the influence of frequency offset on the
correlator output. If the phase between the transmitter and IV. PERFORMANCE ANALYSIS
receiver is aligned and noise is ignored, the correlation peak
can be rewritten with the presence of Doppler shift as A. Theoretical Performance Analysis
The received sequence has the form:
1 sin S f d N samp L1Tsamp
cn
N samp L1 sin S f d Tsamp § ·
rn
Ps sn wn exp ¨ j 2S'f
¨
n
Rsymb N samp
¸¸
© ¹
1
0.9
0.8
where wn subject to complex Gaussian distribution and can
Absolute Values of Correlation Peaks
0.7
be written as
0.6
0.5
wn ~ CN 0, 2V 2
0.4
0.3
Then power of each received signal sample is given by
0.2
rn rn ~ F 2 2, O
2 2
0.1
Pn
0
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2
Doppler offset,Hz 5
x 10
1408
where O E 2 ª¬ rn º¼ E 2 ª¬ rn º¼ Ps , rn and It approximately obeying the complex Gaussian
distribution with expectations and variance written as
rn are the real and imaginary parts of rn , respectively.
The expectation and variance of Ps can be written as 1 L1 1
° E ( zn )
° L1
¦ x E d =μ
i 0
*
i n i z
®
° E Pn 2V Ps
2
° D( z ) 1 L1 1
Ps 4 PsV 2 +4V 4
®
°̄ D Pn 4V 4V Ps
4 2
° n
L12
D d n ¦ xi
*
=
L1
2V 2
z
¯ i 0
The samples after extraction are independent and The second-order normalized correlation value thus can
identically distributed, so that the symbol-level average be written as
1 LP
power U ¦ Pi approximately obeying the Gaussian 1 L2 1
LP i 1
distribution when L P is long enough, with expectations and
cn
L2
¦b z
i 0
*
i n +iLacq
variance written as
The module value of the first-order normalized
PU E U =2V 2 Ps correlation value is given by
°
® 2 4V 4 +4V 2 Ps
D U =
L1 1
°V U 1
¯ LP vn cn
L1
¦x d
i 0
*
i n i
μc = Re μc Im μc
2 2
where the characteristic function of yn is given by a
·¸
And the noise variance is given by
¨ s
§ 2V 2Z 2 2 P 2 2 jZ Re E r 2 Im E r 2
n n
exp ¨ ¸ Ps 4 PsV 2 +4V 4
¨ 2 1 4V Z
4 2
¸ 2V c 2 =
\ y Z © ¹ L2 L1
1 4V 4Z 2
The probability of a false alarm of the secondary
correlation is given as
According to the relationship between the characteristic
equation and the moment, the variance of yn can be derived f
Pfa P V t VT ³ fV v dv
as VT
§ a GU·
D yn Ps 4V Ps 4V
2 4 =Q1 ¨ , t1 ¸
© Vc Vc ¹
The first-order normalized correlation value can be where
written as
f
§ x2 D 2 ·
1 L1 1
Q1 D , E ³E x exp ¨ ¸I 0 D x dx
zn
L1
¦x d
i 0
*
i n i © 2 ¹
1409
The threshold is given by VT Gt1U , where U can be complexity of these two algorithms, time complexity of the
scheme in this paper is L L1 , while the time complexity of
2
written as U 2V +Ps when the receiving sequence is long
2
enough and Gt1 is the threshold factor that can be derived by PMF-FFT is L3 L2 lg L .
(14) according to the false alarm probability requirement. 1
Acquisition Probability
0.7
the algorithm introduced in this paper with conventional
sequential acquisition method in AWGN channel under the 0.6
same false alarm probability. The length of local acquisition
0.5
sequence is L1 127 and the length of local secondary
acquisition pattern is L2 7 . When Es / N0 =0dB , the false 0.4
-4
alarm probability of both methods is 10 . 0.3
Algorithm in this paper L=889
The curves in Figure 3 consider a Doppler offset of 3.5 0.2 PMF-FFT Algorithm L=889 N=1024
kHz. Note that when acquisition probability of both methods PMF-FFT Algorithm L=889 N=2048
is 0.9, the acquisition performance of this new acquisition 0.1 PMF-FFT Algorithm L=511 N=1024
scheme is 2dB better than the conventional scheme. 0
PMF-FFT Algorithm L=1023 N=2048
Furthermore, the method in this paper can reach an -9 -8 -7 -6 -5 -4 -3 -2
Es/N0(dB)
acquisition probability of 0.9 at a Es / N0 =-2.5dB and a
100kHz frequency offset, in which environment the Figure 4. Acquisition peformance of PMF-FFT algorithm and algorithm
in this paper using different FFT sizes and different acquisition sequences.
conventional acquisition scheme cannot cope with the high
Doppler offset at all. The performance simulation of frequency offset is
1
conducted for each Es / N0 between 0~10dB with an initial
0.9 frequency offset of 100 kHz. Figure 5 presents the
0.8 comparison of multiple-level frequency offset estimation
algorithm and single-level traditional algorithm, which
0.7
shows that the RMSE of the multiple-level estimation is
Acquisition Probability
0.2
Conventional Algorithm 'f 3.5kHz 25
0.1 Algorithm in this paper 'f 3.5kHz
Algorithm in this paper 'f 100kHz 20
-8 -6 -4 -2 0 2 4 6
Es / N 0 dB 15
1410
environment without requiring additional time for the [6] Kai Zhang. Research on Fast Acquisition Method of High Dynamic
frequency search. Simulation results showed that the Signals [D]. XiDian University, 2014.
acquisition probability of this novel scheme increased [7] Peng Jia, Tuanfeng Wu, Zhuoyu Hu. Fast Acquisition of High
Dynamic Short - time Spread Spectrum SignalJ]. Commnunicatin
dramatically compared with conventional method. Moreover, Technology, 2015, 48(6):657-661.
compared with the FFT based method, the acquisition [8] Fen Qin, Wenchao Wei, Guangcai Li. Research on Fast Acquisition
probability is still 1~1.5 dB better with a drop of time Technology of High Dynamic Spread Spectrum Measurement and
complexity at the same time. Control Signal [J]. Digital Technology and Application, 2016(7):28-
29.
ACKNOWLEDGMENT [9] Pickholtz R, Schilling D, Milstein L. Revisions to "Theory of Spread-
This work was supported in part by the Fund Project of Spectrum Communications - A Tutorial"[J]. IEEE Transactions on
Communications, 2003, 32(2):211-212.
National Key Laboratory of Science and Technology on
[10] Mengyun Yuan, Jina Zhang, Zhongkai Zhao. Fast Acquisition of
Communications under Grant 150C02006, the Science and High Dynamic Spread Spectrum Signal Based on FFT[J]. Applied
Technology on Communication Networks Laboratory Science and Technology, 2016(1):13-16.
Program under grant KX172600032. [11] Pan Y, Zhang T, Zhang G, et al. Analysis of an improved acquisition
method for high-dynamic BOC signal[J]. Journal of Systems
REFERENCES Engineering & Electronics, 2017, 27(6):1158-1167.
[1] R.B. Ward and K.P. Yiu, “Acquisition of Pseudonoise Signals by [12] Qi J, Luo F, Song Q. Fast acquisition method of navigation receiver
Recursion-Aided Sequential Estimation”,IEEE Trans. Commun., Vol. based on folded PMF-FFT[C]// Computing, Communications and It
COM-25, pp. 784–794, 1977. Applications Conference. IEEE, 2015:62-66.
[2] K.K. Chawla and D.V. Sarwate, “Parallel Acquisition of PN [13] Bian C, Haibo G E, Chen R. High-precision algorithm in PN code
Sequences in DS/SS System”, IEEE. Trans.Commun., Vol. COM-42, acquisition based on PMF-FFT[J]. Video Engineering, 2016.
pp. 2155–2164, 1994 [14] Qi J, Luo F, Song Q. Fast acquisition method of navigation receiver
[3] A. Polydoros and C.L. Weber, “A Unified Approach to Serial Search based on folded PMF-FFT[C]// Computing, Communications and It
Spread Spectrum Code Acquisition Part I/II”, IEEE Trans. Commun., Applications Conference. IEEE, 2015:62-66.
Vol. COM-32, No. 5, pp. 549–560, 1984. [15] Ma Y, Sun H, Yuan W. BDS/GPS Satellite Signal Acquisition
[4] Spangenberg S M, Scott I, Mclaughlin S, et al. An FFT-Based Algorithm Research Basedof PMF (Partial Matched Filter) and
Approach for Fast Acquisition in Spread Spectrum Communication FFT[C]// International Conference on Network and Information
Systems[J]. Wireless Personal Communications, 2000, 13(1):27-55. Systems for Computers. IEEE Computer Society, 2015:194-196.
[5] Van Nee D J R, Coenen A. New fast GPS code-acquisition technique
using FFT[J]. Electronics Letters, 1991, 27(2):158-160.
1411