测绘学报 ›› 2016, Vol. 45 ›› Issue (2): 147-156.doi: 10.11947/j.AGCS.2016.20150370

• 大地测量学与导航 • 上一篇    下一篇

一种快速解算高维模糊度的LLL分块处理算法

刘万科1 2, 卢立果1 2, 单弘煜1   

  1. 1. 武汉大学测绘学院, 湖北 武汉 430079;
    2. 地球空间信息技术协同创新中心, 湖北 武汉 430079
  • 收稿日期:2015-07-13 修回日期:2015-09-17 出版日期:2016-02-20 发布日期:2016-02-29
  • 作者简介:刘万科(1978-),男,博士,副教授,研究方向为卫星导航定位和精密定轨数据处理方法。
  • 基金资助:
    国家自然科学基金(41204030;41374034);国家基础测绘科技项目(201420);中电集团54所高校合作项目(KX132600031);预研基金项目(9140A24020713JB11342;51324040103)

A New Block Processing Algorithm of LLL for Fast High-dimension Ambiguity Resolution

LIU Wanke1 2, LU Liguo1 2, SHAN Hongyu1   

  1. 1. School of Geodesy and Geomatics, Wuhan University, Wuhan 430079, China;
    2. Collaborative Innovation Center of Geospatial Technology, Wuhan 430079, China
  • Received:2015-07-13 Revised:2015-09-17 Online:2016-02-20 Published:2016-02-29
  • Supported by:
    The National Natural Science Foundation of China (Nos. 41204030;41374034);The National Basic Surveying and Mapping Science and Technology Project (No. 201420);CLP 54 Universities Cooperation Project (No. KX132600031);Pre-research Fund Project (Nos. 9140A24020713JB11342;51324040103)

摘要: 由于多频多模GNSS观测数据解算的模糊度具有较高的维数和精度,当采用常规的LLL算法进行模糊度整数估计时,规约耗时显著大于搜索耗时,成为限制高维模糊度解算计算效率的主要因素。针对这一问题,通过分析规约耗时与模糊度维数和精度之间的关系,提出了一种LLL分块处理算法。该算法通过对模糊度方差协方差阵进行分块处理,降低单个规约矩阵的维数,以减少规约耗时,从而提高模糊度解算计算效率。通过两组实测高维模糊度数据对本文提出的分块处理算法进行了效果验证。结果显示,当分块选择合理时,本文提出的算法相对于LLL算法的解算效率分别可提高65.2%和60.2%。

关键词: 高维模糊度, 格基规约, 分块LLL, 解算效率

Abstract: Due to high dimension and precision for the ambiguity vector under GNSS observations of multi-frequency and multi-system, a major problem to limit computational efficiency of ambiguity resolution is the longer reduction time when using conventional LLL algorithm. To address this problem, it is proposed a new block processing algorithm of LLL by analyzing the relationship between the reduction time and the dimensions and precision of ambiguity. The new algorithm reduces the reduction time to improve computational efficiency of ambiguity resolution, which is based on block processing ambiguity variance-covariance matrix that decreased the dimensions of single reduction matrix. It is validated that the new algorithm with two groups of measured data. The results show that the computing efficiency of the new algorithm increased by 65.2% and 60.2% respectively compared with that of LLL algorithm when choosing a reasonable number of blocks.

Key words: high-dimension ambiguity, lattice basis reduction, block LLL, resolution efficiency

中图分类号: