一种矩阵分块的GNSS相位模糊度快速解算方法  

A Fast Solution Method for GNSS Phase Ambiguity of Matrix Partitioning

作　　者：李克昭[1,2] 朱国库 LI Kezhao;ZHU Guoku(School of Surveying and Land Information Engineering,Henan Polytechnic University,2001 Shiji Road,Jiaozuo 454003,China;Collaborative Innovation Center of BDS Research Application,62 Kexue Road,Zhengzhou 450001,China)

机构地区：[1]河南理工大学测绘与国土信息工程学院,河南省焦作市454003 [2]北斗导航应用技术协同创新中心,郑州市450001

出　　处：《大地测量与地球动力学》2023年第1期1-5,33,共6页Journal of Geodesy and Geodynamics

基　　金：国家自然科学基金(41774039)。

摘　　要：为解决GNSS模糊度解算中最小二乘模糊度去相关(least-square ambiguity decorrelation adjustment,LAMBDA)算法涉及大量矩阵运算、降相关耗时较长等问题,提出一种对条件方差矩阵进行分块的最小二乘模糊度去相关(blocking in least-square ambiguity decorrelation adjustment,BLAMBDA)算法。该算法对条件方差矩阵进行分块,减少条件方差排序次数,并在此基础上对Cholesky分解公式进行整合,减少Cholesky分解过程中的数乘运算。仿真实验和实测结果表明,与LAMBDA算法相比,BLAMBDA算法的整体解算效率提升显著,且更加稳定。Least-square ambiguity decorrelation adjustment(LAMBDA)algorithm involves a lot of matrix operations and takes a long time to reduce correlation in GNSS ambiguity resolution.So,we propose a blocking in least-square ambiguity decorrelation adjustment(BLAMBDA)algorithm for conditional variance matrix partitioning.In this algorithm,the conditional variance matrix is divided into blocks to reduce the ranking times of conditional variance,and on this basis,the Cholesky decomposition formula is integrated to reduce the number multiplication operation in the process of Cholesky decomposition.Simulation experiments and measured results show that,compared with LAMBDA algorithm,the overall efficiency of BLAMBDA algorithm improves significantly,and the BLAMBDA algorithm is more stable.

关 键 词：GNSS 模糊度解算 矩阵分块 BLAMBDA算法 去相关算法 

分 类 号：P228[天文地球—大地测量学与测量工程]