Acta Geodaetica et Cartographica Sinica ›› 2016, Vol. 45 ›› Issue (2): 147-156.doi: 10.11947/j.AGCS.2016.20150370

Previous Articles     Next Articles

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)

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

CLC Number: