Algorithm for the Weak Target Joint Detection and Ambiguity Resolution Based on Ambiguity Matrix

The looking-down mode of space airship bistatic radars faces complex sea–land clutter, and the mode of wide-range surveillance and the over-sight detection of the satellite platform generates a low SNR and range–Doppler ambiguity. The method traditionally used involves the transmission of multiple Pulse Repetition Frequencies (PRFs) and correlating them to solve the ambiguity. However, with a low SNR, the traditional disambiguation fails due to the large number of false alarms and target omissions. In order to solve this problem, a new algorithm for multi-target joint detection and range–Doppler disambiguation based on an ambiguity matrix is presented. Firstly, all possible state values corresponding to the ambiguous sequence are filled into the ambiguity matrix one by one. Secondly, the state values in the matrix cell are divided into several groups of subsequences according to the PRF. By disambiguating multiple sets of subsequences, performing subsequence fusion, and then undertaking point aggregation, the targets can be effectively detected in scenarios with a strong clutter rate, the false alarms can be suppressed, and the disambiguation of the range and Doppler is completed. The simulation shows that the proposed algorithm has the strong ability to detect targets and perform ambiguity resolution in the scenario of a multi-target and multi-false alarm.