By Topic

A FFT based long-code acquisition algorithm suitable for FPGA implementation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Liu Suxiao ; Sch. of Electron. & Inf. Eng., Beijing Univ. of Aeronaut. & Astronaut., Beijing, China ; Feng Wenquan ; Xiong Huagang ; Wang Dong
more authors

Using longer pseudo-random code in spread spectrum communication system can provide many benefits, such as improving the security of communication, increasing the ambiguous distance of pseudo code ranging. But it has comparatively difficulty in code acquisition. In this paper, the disadvantages of traditional FFT acquisition algorithm are analyzed firstly. The correlation peak affects the acquisition at low signal to noise ratio under the influence of the initial phase of pseudo code. To this problem, an improved FFT fast acquisition algorithm is proposed, which uses two channels correlation results to make acquisition. It can increase the detecting probability, and solve the problem of acquisition at low noise carrier to noise ratio. The FFT transform result of local pseudo code is stored in ROM to reduce the computational complexity and make it more suitable for hardware implementation. Finally the performance of the algorithm is analyzed, and the results of FPGA simulation are presented.

Published in:

Electric Information and Control Engineering (ICEICE), 2011 International Conference on

Date of Conference:

15-17 April 2011