The 10th IEEE International Symposium on Signal Processing and Information Technology 2010
DOI: 10.1109/isspit.2010.5711784
|View full text |Cite
|
Sign up to set email alerts
|

Approximate iterative Least Squares algorithms for GPS positioning

Abstract: The efficient implementation of positioning algo rithms is investigated for Global Positioning System (GPS) and Differential GPS (DGPS). This is particularly important for smart phones with battery limitations. With the help of the information from base stations, Assisted GPS (AGPS) and DGPS can do the positioning more efficiently and more precisely than GPS. In order to do the positioning, the pseudoranges between the receiver and the satellites are required. The most commonly used algorithm for position comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(9 citation statements)
references
References 11 publications
0
7
0
Order By: Relevance
“…Therefore, the positioning matrix given by Equation 9easily becomes a near-singular matrix or an ill-conditioned matrix, which is difficult to solve. Thus, the Taylor series expansion method [29,30] or the least-squares method [31,32] is widely used in position estimation. Both of these methods require good initial values; otherwise, it is difficult for the solution to achieve convergence [33].…”
Section: Positioning Methods For a Single Shore Stationmentioning
confidence: 99%
“…Therefore, the positioning matrix given by Equation 9easily becomes a near-singular matrix or an ill-conditioned matrix, which is difficult to solve. Thus, the Taylor series expansion method [29,30] or the least-squares method [31,32] is widely used in position estimation. Both of these methods require good initial values; otherwise, it is difficult for the solution to achieve convergence [33].…”
Section: Positioning Methods For a Single Shore Stationmentioning
confidence: 99%
“…The batch least squares solution is given by, δX = (A T × A) -1 × A T ×δρ (5) At the end of first iteration, [5] the estimated satellite state is given by, Est_state_1 = Initial satellite state + δX.The initial satellite state here is as in table III and the δX obtained is a (6×1) matrix. For the second iteration, the estimated satellite state at the end of first iteration is considered as the initial state.…”
Section: Least Squares Solutionmentioning
confidence: 99%
“…Moreover, compared to (linearized) multilateration based on pairwise subtraction of the range measurement equations, significantly greater accuracy is achieved without major increase in computational complexity [8]. Indeed, several optimized variants of ILS have also been proposed in literature, which make ILS amenable to practical implementation even on resource-constrained devices, such as low-cost WSN nodes [56,57]. Although the whole localization procedure is suboptimal with respect to the initial ML estimation problem in Equation 8, we will show that the achievable performance of the proposed algorithm can be very close to the ones obtained via a two-dimensional grid search.…”
Section: Resolution Approachesmentioning
confidence: 99%