迭代最小二乘卫星定位算法  

Iterative Least Squares Method for Satellite Positioning

作　　者：王奉帅 刘聪锋[2] WANG Fengshuai;LIU Congfeng(The 54th Research Institute of CETC,Shijiazhuang 050081,China;Xidian University,Xi＇an 710071,China)

机构地区：[1]中国电子科技集团公司第五十四研究所,河北石家庄050081 [2]西安电子科技大学,陕西西安710071

出　　处：《无线电通信技术》2018年第4期339-342,共4页Radio Communications Technology

基　　金：国家重点研发计划(2016YFB0502100)

摘　　要：随着卫星定位系统的逐步完善,定位导航设备功能也不断增加,而数据处理器资源是有限的,为了降低定位解算时矩阵求逆的硬件复杂度和计算耗时,实现快速实时定位,可以利用坐标旋转数字计算方法对观测矩阵进行变换,将观测矩阵分解成上三角矩阵,然后解算出未知向量。通过对比迭代最小二乘定位算法在不同迭代次数下与传统最小二乘算法的定位精度和运算量,在相同的定位精度下,迭代最小二乘定位算法大大提高了运算效率,减轻了数据处理器的运算负担。With the gradual improvement of the satellite positioning system,the function of positioning equipment is promoted.But the data processor resource is limited.In order to reduce the hardware complexity and delay of matrix inversion to implement fast and real-time positioning,the coordinate rotation digital computing method can be used to decompose the measurement matrix into upper triangular matrix and compute the unknown vector.The comparative results show that the iterative least squares method can significantly improve the computational efficiency and reduce the computational complexity of data processor,compared with the traditional least squares positioning method.

关 键 词：导航定位 最小二乘方法 坐标旋转数字计算方法 正交三角分解 

分 类 号：TN961[电子电信—信号与信息处理]