A new quick algorithm for GPS/Galileo/BD satellite selection

There will be 70-90 navigation satellites in the sky at the same time when GALILEO and BD reach full operation capability, and the visible satellite number can reach 30. Then satellite selection will be very important to decrease computing time for many applications whose processing capability and time are limited such as aviation. The classical optimal algorithm selects a n -satellite subset from m visible satellites with the minimum GDOP. It requires a long time for computing especially for much many satellites. This paper proposes a quickly satellite selection algorithm which is more adaptive when the number of visible satellites is very large. The computer simulation results show that the quickly satellite selection algorithm has much lower computation load, shortens the computation time greatly than the optimal algorithm and the increased GDOP is less than 10%.