摘要
在讨论整数可逆模糊度变换对模糊度搜索空间影响及直接取整法成功概率的基础上 ,结合Kalman滤波技术 ,提出一种新的GPS动态数据处理快速算法———基于概率计算的模糊度快速分解技术 (ProbabilityBasedFastAmbiguity resolutionTechnique ,简称PBFAT法 )。该算法在取整成功概率大于给定限值时 ,直接对浮点模糊度取整 ;若取整概率小于给定的值则进行一定范围的模糊度搜索。试验表明该方法的计算速度高于传统方法 ,所求的模糊度有一个明确的置信水平。
After discussing the affection of invertible integer ambiguity transformation on the search space of ambiguity and the computation of probability for rounding to the correct integer ambiguity, the paper presents a fast algorithm for kinematic GPS data processing by means of Kalman filtering technique--Probability Based Fast Ambiguity resolution Technique(PBFAT) method. Denoting by P the probability for rounding to the correct integer ambiguity, when P is larger than a critical value, the proposed algorithm goes directly into a rounding to integer subroutine, and returns to a search subroutine only when P is smaller than a critical value. Tests show that the proposed algorithm is faster than traditional methods and the validation of ambiguity is indicated by a given probability.
出处
《测绘学报》
EI
CSCD
北大核心
2002年第3期211-216,共6页
Acta Geodaetica et Cartographica Sinica
基金
国家自然科学基金资助项目 (4 97710 62 )
