A new satellite selection algorithm in GNSS

In Global Navigation Satellite System(GNSS), the visible satellite number can reach more than 30 in the same epoch moment. Therefore, selecting reasonable satellites from the combined constellation is very important. The classical optimal algorithm selects n satellite subset from m visible satellites, the satellite subset has the feature of minimum GDOP(Geometry Dilution of Precision), its computation amount is very large especially for much many satellites. This paper put forwards a new satellite selection algorithm, this algorithm is very effective. And the simulation result indicate the effectiveness of this new satellite selection algorithm, it can shorten greatly the computation time, also it has much lower computation load than traditional algorithm.