Affiliation:
1. Henan Polytechnic University
Abstract
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.
Publisher
Research Square Platform LLC
Reference33 articles.
1. A hybrid optical–wireless network for decimetre-level terrestrial positioning;Koelemeij JCJ;Nature,2022
2. E. D. Kaplan and J. H. Christopher, “Principle and application of GPS”, Electronic Industry Press, 2007.
3. P. Teunissen, P. Joosten, and D. Odijk, “The Reliability of GPS Ambiguity Resolution”, GPS Solutions, vol. 2, no. 3, pp. 63–69, 1999.
4. A comparative study of the integer ambiguity validation procedures;Wang J;Earth Planet Sp,2000
5. Success rate improvement of single epoch integer least-squares estimator for the GNSS attitude/short baseline applications with common clock scheme;Chen W;Acta Geod Geophys,2014