改进的深插LLL算法在模糊度解算中的应用  

An improved deep interpolation LLL algorithm for integer ambiguity resolving

作　　者：田晨冬 李克昭[1,2] 焦迎香 申运炎 王凯 吕帅康 岳哲 TIAN Chendong;LI Kezhao;JIAO Yingxiang;SHEN Yunyan;WANG Kai;LYU Shuaikang;YUE Zhe(School of Surveying and Landing Information Engineering,Henan Polytechnic University,Jiaozuo,Henan 454000,China;Collaborative Innovation Center of BDS Research Application,Zhengzhou 450052,China)

机构地区：[1]河南理工大学测绘与国土信息工程学院,河南焦作454000 [2]北斗导航应用技术协同创新中心,郑州450052

出　　处：《测绘科学》2024年第2期29-36,共8页Science of Surveying and Mapping

基　　金：国家自然科学基金项目(41774039,42204040)。

摘　　要：针对全球卫星导航系统(GNSS)载波相位高精度定位中的整周模糊度快速解算问题,该文利用格基规约的思想,基于基向量的Gram-Schmidt长度平方和与格基规约之间的关系对现有的深插LLL进行改进,提出了IDLLL格基规约算法。采用仿真实验与实测数据,分别从Hadamard比率、深插次数和规约效率3个方面,将IDLLL规约算法与改进前算法的格基规约性能进行对比。实验结果表明IDLLL算法在获得了跟深插LLL算法相当的规约效果的同时,提升了规约效率,平均提升率为54.18%。This paper addresses the problem of fast integer ambiguity resolution in high-precision positioning of GNSS carrier phase,Utilizing the idea of lattice basis reduction,based on the relationship between the sum of squared lengths of Gram-Schmidt orthogonalized basis vectors and lattice basis reduction,the existing deep insert LLL algorithm was improved and the IDLLL lattice basis reduction algorithm was proposed in this paper.By conducting simulation experiments and using real measured data,the lattice basis reduction performance of the IDLLL algorithm was compared with the performance of the algorithm before improvement from three aspects:Hadamard ratio,deep insert iterations,and reduction efficiency.Experimental results showed that the IDLLL algorithm not only achieved comparable reduction effects to the deep insert LLL algorithm but also improved the reduction efficiency,with an average improvement rate of 54.18%.

关 键 词：模糊度解算 GNSS 去相关算法 格基规约 

分 类 号：P228.4[天文地球—大地测量学与测量工程]