Abstract:

The one dimensional clustering range resolution algorithm is a common stable ambiguity resolution in radar detection. The one dimensional algorithm can acquire the unambiguous range by optimizing the least cost error. Based on the idea of reducing the range error step by step, a three step search algorithm is presented to solve the range ambiguity. First three different range errors are given corresponding to the radar system parameters, then the cost error is demanded to reduce gradually, meanwhile the ambiguity region is shrunk compared with the preceding region until the ambiguous range is acquired. The experimental results show that the three step search algorithm is efficient for range ambiguity resolution.