GPS carrier phase ambiguity fixing concepts

DOI: 10.1007/BFb0117685

ABSTRACT High precision relative GPS positioning is based on the very precise career phase measurements. A prerequisite for obtaining high precision relative positioning results, is that the double-differenced carrier phase ambiguities become sufficiently separable from the baseline coordinates. Different approaches are in use and have been proposed to ensure a sufficient separability between these two groups of parameters. In particular, the approaches that explicitly aim at resolving the integer-values of the double-differenced ambiguities have been very successful. Once the integer ambiguities are successfully fixed, the carrier phase measurements will start to act as if they were high-precision pseudorange measurements, thus allowing for a baseline solution with a comparable high precision. The fixing of the ambiguities on integer values is however a non-trivial problem, in particular if one aims at numerical efficiency. This topic has therefore been a rich source of GPS-research over the last decade or so. Starting from rather simple but timeconsuming integer rounding schemes, the methods have evolved into complex and effective algorithms. Among the different approaches that have been proposed for cartier phase ambiguity fixing are those documented in Counselman and Gourevitch [1981], Remondi [1984;1986;1991], Hatch [1986; 1989; 1991], Hofmann-WeUenhof and Remondi [1988], Seeber and Wtibbena [1989], Blewitt [1989], Abott et al. [1989], Frei and Beutler [1990], Euler and Goad [1990], Kleusberg [1990], Frei [1991], Wiibbena [1991], Euler and Landau [1992], Erickson [1992], Goad [1992], Teunissen [1993a; 1994a, b], Hatch and Euler [1994], Mervart et al. [1994], De Jonge and Tiberius [1994], Goad and Yang [1994]. The purpose of the present lecture notes is to present the theoretical concepts of the GPS ambiguity fixing problem, to formulate procedures of solving it and to outline some of the intricacies involved. Several examples are included in the

  • Source
    Proceedings of International Global Navigation Satellite Systems Society, IGNSS Symposium 2011; 01/2011
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Next generation Global Navigation Satellite Systems will open the door to a whole new field of applications, for example in Earth observation, construction, and safety-of-life navigation. This implies very high requirements not only on precision and availability, but also on reliability. Integer carrier phase ambiguity resolution is the key to (near) real-time and high-precision GNSS positioning and navigation. The reliability of integer ambiguity estimation depends on the strength of the underlying GNSS model and on the applied integer estimation method. This brings certain challenges and limitations that need to be addressed and have not all been solved so far. The aim of this contribution is to address these remaining challenges and limitations: it will be explained why it is important to do so, and how solutions can be obtained. Experimental results will be used to underpin the importance and potential improvement in terms of precision and/or reliability.
    Proceedings of 6th ESA Workshop on Satellite Navigation Technologies, NAVITEC 2012; 01/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Solving an integer least squares (ILS) problem usually consists of two stages: reduction and search. This thesis is concerned with the reduction process for the ordinary ILS problem and the ellipsoid-constrained ILS problem. For the ordinary ILS problem, we dispel common misconceptions on the reduction stage in the literature and show what is crucial to the efficiency of the search process. The new understanding allows us to design a new reduction algorithm which is more efficient than the well-known LLL reduction algorithm. Numerical stability is taken into account in designing the new reduction algorithm. For the ellipsoid-constrained ILS problem, we propose a new reduction algorithm which, unlike existing algorithms, uses all the available information. Simulation results indicate that new algorithm can greatly reduce the computational cost of the search process when the measurement noise is large.