卫星导航系统基四选星算法  

A Four-Based Satellite Selection Algorithm for GNSS

作　　者：杨蓝[1] 王祖林[1] 尚佳栋[1] 周丽娜[1] 许建忠[2] 

机构地区：[1]北京航空航天大学,北京100191 [2]河北大学物理科学与技术学院,河北保定071002

出　　处：《电光与控制》2015年第7期61-65,共5页Electronics Optics & Control

基　　金：国家自然科学基金(61071070;61201156);河北省高等学校科学技术研究项目(Z2014158)

摘　　要：随着卫星导航系统的发展,可见星数大大增多,为了减少接收机运算量,需选择可见卫星的一个子类。本文分析了卫星导航系统中N个4星最优分布与某4星最优分布中的k(k≤3)个卫星(共4N+k颗卫星)的联合分布GDOP值,并以此为基础提出了一类低复杂度近似最优的基四选星算法。该算法以经典的4星选择算法(最大体积法和四步选择法)为基础,通过多次迭代与部分执行,实现任意多于4星的卫星选择。仿真结果表明该算法与准优算法相比运算复杂度和GDOP值都更低。With the development of the Global Navigation Satellite System（ GNSS） ,the number of visible satellites increases greatly. In order to lower the computational complexity of the receiver,a satellite selection algorithm is essential for choosing a subset of the visible satellites. This paper analyses the Global Dilution of Position（ GDOP） of a joint distribution,which contains the N optimal distributions of four satellites and the k（ k≤3） satellites in an optimal distribution of four satellites. According to the comparison of the GDOP between the joint distribution and the optimal distribution of 4N ＋ k satellites,a four-based satellite selection algorithm is proposed,which has low computational cost and is close to the optimal. The proposed algorithm can select any number of satellites more than four through the iteration and portion of the classic satellite selection algorithm of four satellites,such as maximum-volume algorithm and four-step satellite selection method. Simulations indicate that the proposed method requires less computational cost and achieves lower GDOP than the quasi-optimal algorithm.

关 键 词：卫星导航系统 卫星选择 几何精度因子 

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