Abstract

Carrier phase ambiguity resolution is the key to precise positioning with a global navigation satellite system (GNSS); therefore, quite a few ambiguity resolution methods have been developed in the past two decades. In this paper, a new ambiguity searching algorithm by treating part of normal equations as constraints is developed. The process starts with the truncation of the terms with respect to the small eigenvalues from the normal equations of a least-squares estimation problem. The remaining normal equations are employed as the constraint equations for the efficient searching of integer ambiguities. In the case of short single baseline rapid GNSS positioning with double differenced phase measurements, there are only three real parameters of the position to be estimated. Therefore three terms of the normal equations should be truncated off due to the fact that there is a large difference between the last three eigenvalues of the normal matrix of the float solution and the others, and then the remainin...

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.