Applied Interval Based Integer Ambiguity Resolution

E. van Kampen, E. de Weerdt, Q.P. Chu, and J.A. Mulder

Peer Reviewed

Abstract:	This paper provides improvements on the interval integer ambiguity resolution algorithm BOUNDS, which can give theoretical guarantees on finding the correct integers. The BOUNDS algorithm is validated by applying it to real GPS data and comparing it to the LAMBDA method. The first improvement is a transformation of the search space, which reduces dependency. Secondly the process of using multiple frequencies is explained and demonstrated. The third improvement, called contractions, quickly reduces the search space and increases solution accuracy. Finally, matrix computations are introduced to decrease the computational load. Previous research into BOUNDS indicated that defining correct noise bands is an important step of the algorithm. This is investigated in more detail, discussing several noise iteration schemes and noise models based on the signal-to-noise ratio. Application of the improved BOUNDS algorithm to the attitude determination problem for a static baseline shows considerable reduction in computation time and improvement in accuracy.
Published in:	NAVIGATION: Journal of the Institute of Navigation, Volume 56, Number 3
Pages:	205 - 219
Cite this article:	van Kampen, E., de Weerdt, E., Chu, Q.P., Mulder, J.A., "Applied Interval Based Integer Ambiguity Resolution", NAVIGATION: Journal of The Institute of Navigation, Vol. 56, No. 3, Fall 2009, pp. 205-219.
Full Paper:	ION Members/Non-Members: 1 Download Credit Sign In