返回
Low-Complexity Off-Grid STAP Algorithm Based on Local Search Clutter Subspace Estimation
DOI:10.1109/LGRS.2018.2865536.png)
摘要
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.
Keyword:
Clutter subspace
off-grid
space-time adaptive processing (STAP)
sparse recovery (SR)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
16.4
论文数:
1.0W
被引数:
5.1K
机构
引用论文
Parameter-searched OMP method for eliminating basis mismatch in space-time spectrum estimation
SIGNAL PROCESSING
IF3.6
Clutter suppression algorithm based on fast converging sparse Bayesian learning for airborne radar
SIGNAL PROCESSING
IF3.6

