摘要
针对LLL(Lenstra,Lenstra,Lovasz algorithm)算法的不足,提出了具有自适应性的整数正交变换算法,并采用此算法和升序排序调整矩阵对LLL算法进行了改进。通过LLL算法和改进的LLL算法对随机模拟的600个对称正定矩阵的模糊度方差-协方差阵和30组实测数据进行处理分析,发现改进的LLL算法能够更有效地降低协方差阵的条件数,减小备选模糊度组合数,更有利于整周模糊度的搜索和解算。
According to the deficiency of the LLL algorithm（A. K. Lenstra, H. W. Lenstra, L. Lovasz algorithm）, the adaptive integer orthogonal transformation algorithm is proposed in the paper. It can be used to improve the LLL algorithm with sort ascending matrix. Based on the condition number, comparison has been made between the LLL algorithm and the improved LLL method by using 600 symmetric and positive definite matrixes derived from random simulation, and as 30 sets of actual measuring data. Numerical results show that the improved LLL algorithm has better performance in decreasing matrix condition number and the number of candidate integer ambiguity. Thus it could decrease the searching time of the right integer ambiguity resolution.
出处
《武汉大学学报（信息科学版）》
EI
CSCD
北大核心
2010年第1期21-24,共4页
Geomatics and Information Science of Wuhan University
基金
云南省省院省校科技合作资助项目(2006YX36)
福建省自然科学基金资助项目(2008J0245)
福建省省教育厅科技资助项目(JB08203)
