Fast Ambiguity Search Filter (FASF): A Nova1 Concept for GPS Ambiguity Resolution

Dingsheng Chen

Abstract:	A fundamental problem of rapid static and precise kinematic GPS positioning is integer carrier phase ambiguity resolution. This paper presents an effective novel approach for ambiguity resolution: the East Ambiguity Search Eilter (FASF). One of the critical aspects of this approach is the determination of the search range for each ambiguity parameter. In the past, the search range of each ambiguity was determined separately regardless of the assumed integers of the other ambiguities. In the new FASF approach, the ambiguity ranges are determined recursively and are related to each other. Another important characteristic is that all observations from the initial to the current epoch are taken into account by Kalman filtering. To assess the newly developed algorithm, an experimental data set is used. Test results show that the computation time for ambiguity searching is nearly negligible even for an initial search range of a hundred meters. This method is therefore especially useful for real time applications using: either single or dual frequency receivers in a high data collection rate. Further refinements being implemented and tested are also briefly discussed.
Published in:	Proceedings of the 6th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GPS 1993) September 22 - 24, 1993 Salt Palace Convention Center Salt Lake City, UT
Pages:	781 - 787
Cite this article:	Chen, Dingsheng, "Fast Ambiguity Search Filter (FASF): A Nova1 Concept for GPS Ambiguity Resolution," Proceedings of the 6th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GPS 1993), Salt Lake City, UT, September 1993, pp. 781-787.
Full Paper:	ION Members/Non-Members: 1 Download Credit Sign In