Abstract:

In order to reduce the test number of cycle ambiguity space searching algorithms, a novel method based on matching search for ambiguity resolution is proposed. First, three pulsars are used to determine the position of aircraft, and a set of planes are established by bringing in an additional pulsar. Then the ambiguity vectors are evaluated by calculating the minimum distances between aircraft and the above planes. Secondly, the relationships among the minimum distances, cycle sets and phase differences are exhibited and the influences on the minimum distances due to the variation of integer cycles are analyzed. After that, a searching template is built to refrain from testing each candidate cycle set and obtain the cycle ambiguity resolution. Therefore, the test number is cut down. Finally, simulation results show that, in the same experimental environment, the test number of the matching search algorithm is reduced by four orders of magnitude compared with the existing algorithms.