Advertisement

Journal of Geodesy

, Volume 72, Issue 10, pp 606–612 | Cite as

Success probability of integer GPS ambiguity rounding and bootstrapping

  • P. J. G. Teunissen
Article

Abstract.

Global Positioning System ambiguity resolution is usually based on the integer least-squares principle (Teunissen 1993). Solution of the integer least-squares problem requires both the execution of a search process and an ambiguity decorrelation step to enhance the efficiency of this search. Instead of opting for the integer least-squares principle, one might also want to consider less optimal integer solutions, such as those obtained through rounding or sequential rounding. Although these solutions are less optimal, they do have one advantage over the integer least-squares solution: they do not require a search and can therefore be computed directly. However, in order to be confident that these less optimal solutions are still good enough for the application at hand, one requires diagnostic measures to predict their rate of success. These measures of confidence are presented and it is shown how they can be computed and evaluated.

Key words. GPS ambiguity Probability Integer rounding Integer bootstrapping 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • P. J. G. Teunissen
    • 1
  1. 1.Delft Geodetic Computing Centre (LGR), Faculty of Geodesy, Delft University of Technology, Thijsseweg 11, 2629 JA, The Netherlands E-mail: P.J.G. Teunissen@geo.tudelft.nlNL

Personalised recommendations