TWO FAST ALGORITHMS OF DE-AMBIGUOUS TECHNIQUE IN RANGING RADAR
测距雷达解距离模糊的两种快速算法

In ranging radar, range ambiguity usually exists. Computing amount of overall search algorithm to solve the problem is analyzed, and it is pointed out that this algorithm is unsuitable for ranging in real time. Then two fast algorithms that can attain the true solution of original equation set under certain evaluation function are put forward. These algorithms' effectiveness is proved by theory analyses and computer simulation.