Analysis of GPS static positioning problems

摘要

Global positioning system (GPS) static positioning solution algorithms for solving the receiver’s position and clock bias using pseudorange measurements are investigated. The nonlinearized iterative version based on the linearized iterative version of Noe et al.’s algorithm and the iterative version based on the direct version of Bancroft’s algorithm have been derived. Noe et al.’s, Bancroft’s, and Biton et al.’s algorithms were examined to analyze accuracy and efficiency. The errors in the solutions of the algorithms were very small and there was only a small difference between the solution errors of the algorithms. The direct version of Biton et al.’s algorithm proved to be more computationally efficient on the basis of the execution times and the number of iterations than the other algorithms. However, the differences between the timing results of the algorithms were not significant. All the solution algorithms were also tested using real GPS data. The nonlinearized iterative version of Noe et al.’s algorithm and the iterative version of Bancroft’s algorithm give accuracy and efficiency comparable to the other algorithms as well.