Improved GNSS integer ambiguity resolution method based on the column oriented Cholesky decomposition

Abstract

Because the traditional Cholesky decomposition algorithm still has some problems such as computational complexity and scattered structure among matrices when solving the GNSS ambiguity, in order to further improve the computational efficiency of the least squares ambiguity reduction correlation process in the carrier phase integer ambiguity solution. In this paper, the decomposition process of traditional matrix elements is divided into two steps: multiplication update and column reduction of square root calculation and column division calculation. The existing Cholesky decomposition algorithm is improved, and a column oriented Cholesky (C-Cholesky) algorithm is proposed to further improve the efficiency of matrix decomposition, so as to shorten the calculation time of integer ambiguity reduction correlation. The results show that this method is effective and superior, and can improve the data processing efficiency by about 12% without changing the integer ambiguity accuracy of the traditional Cholesky algorithm.