摘要

To improve the performance of the recently developed parameter-dependent sparse recovery (SR) space-time adaptive processing (STAP) algorithms in real-world applications, the authors propose a novel clutter suppression algorithm with multiple measurement vectors (MMVs) using sparse Bayesian learning (SBL) strategy. First, the necessary and sufficient condition for uniqueness of sparse solutions to the SR STAP with MMV is derived. Then the SBL STAP algorithm in MMV case is introduced, and the process for hyperparameters estimation via expectation maximisation is given. Finally, a computational complexity comparison with the existing algorithms and an analysis of the proposed algorithm are conducted. Results with both simulated and the Mountain-Top data demonstrate the fast convergence and good performance of the proposed algorithm.