arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.5121cs.ITmath.IT
收藏

基于基函数逼近的机载雷达低秩STAP算法

Low-Rank STAP Algorithm for Airborne Radar Based on Basis-Function Approximation

R. Fa, R. C. de Lamare

摘要:

本文提出了一种基于自适应基函数逼近(ABFA)的降秩空时自适应处理(STAP)算法。该算法采用了众所周知的旁瓣消除器(SLC)结构的框架,并由选定的基函数集,执行降维和自适应降秩滤波器。与传统的降秩技术相比,该方案是在瞬时基础上工作的,在每个时刻选择最合适的基函数集,以最小化平方误差。此外,我们推导出随机梯度(SG)和递归最小二乘(RLS)算法,有效地实现建议ABFA计划。仿真结果表明,该算法在收敛和跟踪性能上明显优于现有的降秩算法,且复杂度明显降低。

英文摘要:

In this paper, we develop a novel reduced-rank space-time adaptive processing (STAP) algorithm based on adaptive basis function approximation (ABFA) for airborne radar applications. The proposed algorithm employs the well-known framework of the side-lobe canceller (SLC) structure and consists of selected sets of basis functions that perform dimensionality reduction and an adaptive reduced-rank filter. Compared to traditional reduced-rank techniques, the proposed scheme works on an instantaneous basis, selecting the best suited set of basis functions at each instant to minimize the squared error. Furthermore, we derive stochastic gradient (SG) and recursive least squares (RLS) algorithm for efficiently implementing the proposed ABFA scheme. Simulations for a clutter-plus-jamming suppression application show that the proposed STAP algorithm outperforms the state-of-the-art reduced-rank schemes in convergence and tracking at significantly lower complexity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑