载波相位模糊度递推最小二乘逼近算法  

A Recursive Least Square Approaching Algorithm for Carrier Phase Ambiguity

作　　者：张晓安[1] 何晓峰[1] 逯亮清[1] 吴美平[1] 

机构地区：[1]国防科技大学机电工程与自动化学院,湖南长沙410073

出　　处：《无线电工程》2010年第2期28-31,共4页Radio Engineering

基　　金：国家863计划项目(2006AA12Z319);高等学校博士学科点专项科研基金资助(20069998009);航天支撑技术基金

摘　　要：针对目前常用的载波相位模糊度浮点解逼近算法存在收敛时间较长的缺点,利用递推最小二乘方法,对于单频载波相位双差模糊度进行递推解算,实现模糊度的快速逼近,加快了模糊度的搜索。实验结果表明,当采用单频GPS进行精密相对定位,采用本文模糊度逼近算法,使用伪距双差解作为初始值,静态条件下10s内模糊度浮点解收敛至真值整周模糊度的2个波长范围内,相对于传统算法大大加快了收敛时间,且适合实时解算。An approaching algorithm for single-frequency carrier phase ambiguity based on recursive least square is proposed to overcome the long time convergence shortcoming of current methods and to reduce the ambiguity searching space greatly.The performance of this approach is evaluated by real GPS accuracy relative positioning experiments.Using static experimental data the ambiguity float resolutions become convergent within 2 wavelengths of L1 frequency carrier phase in 10 seconds with the present algorithm when double-difference pseudo-range resolutions are adopted as the initial values.

关 键 词：全球卫星导航系统 整周模糊度 递推最小二乘 相对定位 

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