Abstract

To have a further understanding of the recently developed space-time adaptive processing (STAP) methods based on sparse representation (SR-STAP), this letter details the clutter sparsity observed by STAP radar systems. First, we review the principle and discuss the existing problems about clutter sparsity of the SR-STAP-type algorithms. Then, a theoretical analysis on clutter sparsity for a side-looking uniform linear array with constant pulse repetition frequency, constant velocity, and no crab is performed. Some important conclusions are obtained, and simulations are used to validate the correctness of them.

Full Text
Published version (Free)

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 call