Study of Robust Two-Stage Reduced-Dimension Sparsity-Aware STAP with Coprime Arrays
arXiv:2001.01560
Abstract
Space-time adaptive processing (STAP) algorithms with coprime arrays can provide good clutter suppression potential with low cost in airborne radar systems as compared with their uniform linear arrays counterparts. However, the performance of these algorithms is limited by the training samples support in practical applications. To address this issue, a robust two-stage reduced-dimension (RD) sparsity-aware STAP algorithm is proposed in this work. In the first stage, an RD virtual snapshot is constructed using all spatial channels but only adjacent Doppler channels around the target Doppler frequency to reduce the slow-time dimension of the signal. In the second stage, an RD sparse measurement modeling is formulated based on the constructed RD virtual snapshot, where the sparsity of clutter and the prior knowledge of the clutter ridge are exploited to formulate an RD overcomplete dictionary. Moreover, an orthogonal matching pursuit (OMP)-like method is proposed to recover the clutter subspace. In order to set the stopping parameter of the OMP-like method, a robust clutter rank estimation approach is developed. Compared with recently developed sparsity-aware STAP algorithms, the size of the proposed sparse representation dictionary is much smaller, resulting in low complexity. Simulation results show that the proposed algorithm is robust to prior knowledge errors and can provide good clutter suppression performance in low sample support.
arXiv comment13 figures, 18 pages
References in corpus (6)
- Coarrays, MUSIC, and the Cramér Rao Bound
- Branch-and-Bound Precoding for Multiuser MIMO Systems with 1-Bit Quantization
- Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques
- Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage
- Adaptive Reduced-Rank Minimum Symbol-Error-Rate Receive Processing for Large-Scale Multiple-Antenna Systems
- Direction Finding Algorithms with Joint Iterative Subspace Optimization