A Computationally Efficient Ambiguity Resolution Technique

Ron Hatch and Tenny Sharpe

Abstract:	A new method of carrier-phase ambiguity resolution is described. The new technique is a variation of the leastsquares residual search technique in the ambiguity domain. It uses a very efficient algorithm to compute the residuals associated with each potential combination of ambiguities to be tested. Several other techniques are employed to simplify the calculations and to enhance the probability of identifying the correct ambiguity vector. The intent is to minimize the number of data epochs required to correctly identify the integer ambiguity values. The capability of the technique to rapidly identify the correct ambiguity vector is illustrated by plotting the results of scoring runs which exercise the search algorithms using recorded field data taken over different rover-to-base separation distances. To maximize the number of searches exercised in these runs, as soon as the ambiguity vector is identified, the results are cleared and a new search is initiated with all navigation parameters reinitialized. Some navigation results are also shown which are typical of RTK carrier-phase navigation results.
Published in:	Proceedings of the 14th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GPS 2001) September 11 - 14, 2001 Salt Palace Convention Center Salt Lake City, UT
Pages:	1558 - 1564
Cite this article:	Hatch, Ron, Sharpe, Tenny, "A Computationally Efficient Ambiguity Resolution Technique," Proceedings of the 14th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GPS 2001), Salt Lake City, UT, September 2001, pp. 1558-1564.
Full Paper:	ION Members/Non-Members: 1 Download Credit Sign In