Abstract
The fast and accurate solution of integer ambiguity is the key to achieve GNSS high-precision positioning. Based on the lattice theory of high-dimensional ambiguity solving, the reduction time consumption is much larger than the search time consumption, and it is especially important to improve the efficiency of the lattice basis reduction algorithm. The Householder QR decomposition with minimal column pivoting is utilized to pre-sort the basis vectors and reduce the number of basis vector exchanges during the reduction process by partial size reduction and relaxing the basis vector exchange condition to improve the reduction efficiency of the LLL algorithm. The improved algorithm is validated using simulated and measured data, respectively, and the performance advantages and disadvantages of the improved algorithm are evaluated from the perspectives of the extent of reduction basis orthogonality and the quality of reduction basis size reduction. The results show that the improved LLL algorithm can significantly reduce the number of basis vector exchanges and the reduction time consumption. The HSLLL and PSLLL algorithms with the Siegel condition as the basis vector exchange condition have a better reduction effect, but are slightly less stable. The PLLLR algorithm significantly improves the search ambiguity resolution efficiency, which is conducive to the rapid realization of ambiguity resolution.