.png){kind=icon}
.png){kind=icon}
返回
Robust and fast iterative sparse recovery method for space-time adaptive processing
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-016-5533-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Conventional space-time adaptive processing (STAP) requires large numbers of independent and identically distributed (i.i.d) training samples to ensure the performance of clutter suppression, which is hard to be achieved in practical complex nonhomogeneous environment. In order to improve the performance of clutter suppression with small training sample support, a robust and fast iterative sparse recovery method for STAP is proposed in this paper. In the proposed method, the sparse recovery of clutter spatial-temporal spectrum and the calibration of space-time overcomplete dictionary are achieved iteratively. Firstly, the robust solution of sparse recovery is derived by regularized processing, which can be calculated recursively based on the block Hermitian matrix property, afterwards the mismatch of space-time overcomplete dictionary is calibrated by minimizing the cost function. The proposed method can not only alleviate the effect of noise and dictionary mismatch, but also reduce the computational cost caused by direct matrix inversion. Finally, the proposed method is verified based on the simulated and the actual airborne phased array radar data, which shows that the proposed method is suitable for practical complex nonhomogeneous environment and provides better performance compared with conventional STAP methods.
Keyword:
space-time adaptive processing (STAP)
sparse recovery
robust
iteration
computational complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。