Reduced-dimension space-time adaptive processing with sparse constraints on beam-Doppler selection

摘要

State-of-the-art space-time adaptive processing (STAP) algorithms devised in the beam-Doppler domain are confined by fixing the beam-Doppler cells used for adaptation, which may suffer from performance degradation. To overcome this drawback, a novel STAP algorithm in the beam-Doppler domain is proposed. The proposed algorithm adopts a generalized sidelobe canceller structure, and the filter design is formulated as a sparse representation problem by imposing a sparse constraint on the weight vector. As the sparse constraint enforces most of the elements in the weight vector to be zero (or sufficiently small in amplitude), the proposed algorithm can adaptively select the best beam-Doppler cells for adaptation, and thus it falls under the category of reduced-dimension approach. Simulation results illustrate that the proposed algorithm outperforms the existing STAP approaches with fixed beam-Doppler localized processing. (C) 2018 Elsevier B.V. All rights reserved.