2008
DOI: 10.1049/iet-rsn:20070147
|View full text |Cite
|
Sign up to set email alerts
|

Fast acquisition implementation for high sensitivity global positioning systems receivers based on joint and reduced space search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 3 publications
0
16
0
Order By: Relevance
“…If d = 0, the multiple delays based estimation is simplified to be based on single delay. Just like the direct FFT based acquisition algorithms to reduce the complexity of computing the correlation [4], the whole sequence of (5) can be realized by M -point FFT/IFFT (M = 2N + 2) for higher computational efficiency.…”
Section: A Joint Code Acquisition and Doppler Estimationmentioning
confidence: 99%
See 1 more Smart Citation
“…If d = 0, the multiple delays based estimation is simplified to be based on single delay. Just like the direct FFT based acquisition algorithms to reduce the complexity of computing the correlation [4], the whole sequence of (5) can be realized by M -point FFT/IFFT (M = 2N + 2) for higher computational efficiency.…”
Section: A Joint Code Acquisition and Doppler Estimationmentioning
confidence: 99%
“…Acquisition time was shortened through increasing the hardware costs. Alternative technique based on the fast Fourier transform (FFT) in the frequency domain have been extensively studied for fast code acquisition [4]. FFT was used to compute the correlations for all the code phases at one candidate Doppler frequency, so that the average acquisition time was reduced.…”
Section: Introductionmentioning
confidence: 99%
“…Tsui (2000) and Borre et al (2007) discussed suitable GNSS signal processing algorithms for software receivers. Suitable algorithms for GNSS signal acquisition can be found in Sagiraju et al (2008) and Juang and Chen (2010). In a software receiver, the correlation operation is the most demanding task, and a bit-wise parallel method was proposed by Ledvina et al (2004a) to improve the efficiency of this.…”
Section: R E L At E D W O R Kmentioning
confidence: 99%
“…Among different methods, there is the basic serial search (SS) [16], there are one-dimensional parallel searches such as the parallel frequency search (PFS) and the PCS [16], [17,Chap. 2], and there are two-dimensional parallel searches such as the DBZP method [11,12] (which is an extension of the PFS) or the methods proposed in [18,19]. The parallel code search method seems to be among the most attractive methods for the acquisition of modern signals, because it can compensate the code Doppler (especially important with signals having a high chipping rate and with weak signals requiring a long integration) whereas some other methods (such as those based on the PFS) cannot compensate it [20], and onedimensional parallel methods are less complex to implement than two-dimensional parallel methods.…”
Section: Problem and Current Solutionsmentioning
confidence: 99%