GNSS Signal Acquisition in the Presence of Sign Transition

Presti, Letizia Lo; Zhu, Xiao‐Wei; Fantino, Maurizio; Mulassano, Paolo

doi:10.1109/jstsp.2009.2024592

Cited by 64 publications

(53 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been several propositions to overcome this problem [5]. The straightforward solution consists in using two consecutive periods of the incoming primary code and one period of primary code padded with zeros for the local replica to perform the correlation [6], [4].…”

Section: Straightforward Solutionmentioning

confidence: 99%

Acquisition of modern GNSS signals using a modified parallel code-phase search architecture

2014

View full text Add to dashboard Cite

The acquisition of global navigation satellite system signals can be performed using a fast Fourier transform (FFT). The FFT-based acquisition performs a circular correlation, and is thus sensitive to potential transitions between consecutive periods of the code. Such transitions are not occurring often for the GPS L1 C/A signal because of the low data rate, but very likely for the new GNSS signals having a secondary code. The straightforward solution consists in using two periods of the incoming primary code and using zeropadding for the local code to perform the correlation. However, this solution increases the complexity, and is moreover not efficient since half of the points calculated are discarded. This has led us to research for a more efficient algorithm, which discards less points by calculating several sub-correlations.It is applied to the GPS L5, Galileo E5a, E5b and E1 signals. Considering the radix-2 FFT, the proposed algorithm is more efficient for the L5, E5a and E5b signals, and possibly for the E1 signal. The theoretical number of operations can be reduced by 21 %, the processing time measured on a * Corresponding author Email address: jerome.leclere@epfl.ch (Jérôme Leclère)Preprint submitted to Signal Processing July 2, 2013 software implementation is reduced by 39 %, and the memory resources are almost halved for an FPGA implementation.

show abstract

Section: Straightforward Solutionmentioning

confidence: 99%

Acquisition of modern GNSS signals using a modified parallel code-phase search architecture

2014

View full text Add to dashboard Cite

show abstract

“…21,22) It performs moving average (MA) filtering in a preassigned frequency bandwidth that spans the interval…”

Section: Energy-based Search Spacementioning

confidence: 99%

“…Although the energy-based searches need an additional averaging process, the increment in complexity because of MA filtering is approximately 4% of the calculation time for the evaluation of a single CAF envelope. 22) The acquisition time for the BTC method is the shortest because of the double Doppler bin size. In this simulation, the mean calculation time of the BTC method is better than that of the conventional maximum likelihood method.…”

Section: )mentioning

confidence: 99%

“…18,19) Two-stage fine acquisition consisting of circular correlation and frequency analysis is applied. 20) Another studies 21,22) are good examples that present the problem of sign transitions because of data or secondary-code chips and propose a modification of the two-dimensional (2-D) function evaluated in the cells of the search space.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Analysis of GNSS Signal Acquisition Methods for the Bit-Transition Problem for a Single Code Period

Jeon

Kim

et al. 2013

Trans. Japan Soc. Aero. S Sci.

View full text Add to dashboard Cite

A signal-acquisition process using the fast Fourier transform algorithm enables parallel correlation based on the circularity of code sequences. If a bit transition exists in the received signal sample, the correlation peak does not represent the maximum value at the true Doppler shift. Although there has been some research to solve the bit-transition problem, an analysis of this research with a performance index does not exist. This paper analyzes and compares calculation time and the signal detection probability of two existing methods and a new method for single-period code acquisition. Simulation results indicate that although the zero-padding method shows the best performance based on signal detection probability, the calculation time of the new method is the fastest of the test methods.

show abstract

“…This problem, in weak signal condition, results in a biased estimation of the code delay and the Doppler shift [34]. Among the first methods proposed to overcome the bit transition problem is that based on the energy invariance property of the CAF [35]. The authors in [36] proposed a novel two-step based bitsign transition cancellation method.…”

Section: Introductionmentioning

confidence: 99%