Content area

Abstract

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.

Details

1009240
Title
Low-Rank STAP Algorithm for Airborne Radar Based on Basis-Function Approximation
Publication title
arXiv.org; Ithaca
Publication year
2013
Publication date
Mar 20, 2013
Section
Computer Science; Mathematics
Publisher
Cornell University Library, arXiv.org
Source
arXiv.org
Place of publication
Ithaca
Country of publication
United States
University/institution
Cornell University Library arXiv.org
e-ISSN
2331-8422
Source type
Working Paper
Language of publication
English
Document type
Working Paper
Publication history
 
 
Online publication date
2013-03-22
Milestone dates
2013-03-20 (Submission v1)
Publication history
 
 
   First posting date
22 Mar 2013
ProQuest document ID
2085155197
Document URL
https://www.proquest.com/working-papers/low-rank-stap-algorithm-airborne-radar-based-on/docview/2085155197/se-2?accountid=208611
Full text outside of ProQuest
Copyright
© 2013. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2023-03-03
Database
ProQuest One Academic