A Fast Satellite Selection Algorithm: Beyond Four Satellites
A Fast Satellite Selection Algorithm: Beyond Four Satellites
复制标题
一种快速卫星选择算法：超越四颗卫星
DOI：
10.1109/jstsp.2009.2028381
复制
发表时间：
2009-10-01
影响因子：
7.5
通讯作者：
Zhang, Jun
中科院分区：
文献类型：
--
作者：
Zhang, Miaoyan;Zhang, Jun
对于频道数量和实时处理能力有限的全球定位系统 (GPS) 接收器（例如移动电话、汽车和航天器中使用的接收器）来说，卫星选择是一个重要的执行逻辑，可以首先防止不必要的导航信号。在本文中，我们提出了一种快速卫星选择算法，根据最佳几何形状选择四颗以上卫星，可以获得最小的几何精度稀释（GDOP）值。这种快速算法的主要思想是选择视野中所有卫星的子集，其几何形状与最佳几何形状最相似。计算机仿真表明，该算法的耗时与准优选星算法非常接近，明显低于传统优选星算法最小化GDOP因子的时间，但相对于最小GDOP值增加的GDOP值远小于准优选星算法。
Satellite selection is an important executive logic to prevent unnecessary navigation signals in the first place for Global Positioning System (GPS) receivers with limited number of channels and real-time processing power, such as those used in mobile phones, cars, and space crafts. In this paper, we propose a fast satellite selection algorithm to select more than four satellites based on the optimal geometries, which can obtain the smallest geometric dilution of precision (GDOP) values. The main idea of this fast algorithm is to select a subset of all satellites in view whose geometry is the most similar to the optimal geometry. Computer simulation shows that the consumed time of this algorithm is very close to that of the quasi-optimal satellite selection algorithm and obviously lower than that of the traditional optimal satellite selection algorithm to minimize GDOP factor, but the increased GDOP values relative to the minimal GDOP values are much smaller than those of the quasi-optimal satellite selection algorithm.