一种改进的整周模糊度去相关算法

An Improved Integer Ambiguity Drop Decorrelation Algorithm

目前LAMBDA算法中常用的2种去相关算法为逆整数乔里斯基算法和迭代法算法,这2种去相关算法在运算处理过程会出现病态的变换矩阵,影响去相关程度且降低了去相关的成功率。因此提出了一种改进去相关算法并进行了算法性能分析,通过从矩阵条件数和相关数对3种算法进行了仿真比较。结果表明,改进算法去相关处理效果得到明显改善。

LAMBDA algorithm is now widely recognized integer ambiguity algorithm, and one of its core is correlation processing of integer ambiguity drop decorrelation. The two kinds of decorrelation algorithm in the operation process will transform matrix ill conditioned, and reduce the influence to the degree of correlation to the success rate. Therefore, an improved integer ambiguity is put forward to analyze the algorithm performance. Through the matrix condition number and the number of related to three kinds of algorithms are compared and the result shows thatthe improved algorithm of decorrelation effects has been obviously improved.