A new fast satellite selection algorithm for BDS-GPS receivers

Satellite selection plays an important role in preventing unnecessary computation for the receivers with limited processing units in GPS and BDS dual-mode Global Navigation Satellite System (GNSS). Conventional optimal satellite selection algorithm for computing Geometric Dilution of Precision (GDOP) is full of complexity, which restricts the implementation of real-time position resolving significantly. In this paper, we propose a new fast satellite selection algorithm based on both Newton´s identities for GDOP fast computation and optimal satellite geometric distribution for less cycle computation. We find an effective closed-form formula for computing GDOP, avoiding traditional matrix inversion and multiplying. According to optimal satellite geometric distribution, we decrease computational cycles at the same time, which enhance the efficiency of satellite selection dramatically. Simulation and real measurement show that this algorithm can reduce more than 99% computational complexity by the cost of little higher GDOP whereas achieve better performance compared with quasi-optimal satellite selection algorithm.