Abstract
Abstract 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
