.png){kind=icon}
.png){kind=icon}
Return
Low-Complexity Off-Grid STAP Algorithm Based on Local Search Clutter Subspace Estimation
.png){kind=icon}
PRE
AI
DOI：10.1109/LGRS.2018.2865536.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Space-time adaptive processing (STAP) based on sparse recovery (SR-STAP) techniques exhibits significantly better performance than conventional STAP algorithms within a very small number of snapshots. However, when the clutter patches do not locate exactly on the discrete space-time grid points, the performances of SR-STAP algorithms degrade severely. In this letter, a low-complexity off-grid STAP algorithm based on local search clutter subspace estimation is proposed to overcome this issue. In the proposed algorithm, the global atoms are first selected from the reduced-dimension global STAP dictionary using the design selection criterion. Then, the optimal atoms are searched from the local STAP dictionary. Finally, these space-time steering vectors corresponding to the optimal atoms are used to construct the clutter subspace iteratively, and the STAP weight is obtained by projecting the snapshot on the subspace orthogonal to the clutter subspace. Numerical experiments with both simulated and Mountain-Top data are carried out to demonstrate the effectiveness of the proposed algorithm.
Keywords:
Clutter subspace
off-grid
space-time adaptive processing (STAP)
sparse recovery (SR)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
16.4
Papers:
1.0W
Citations:
5.1K