Low-Rank STAP Algorithm for Airborne Radar Based on Basis-Function Approximation
pith:UFDIVKZP Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{UFDIVKZP}
Prints a linked pith:UFDIVKZP badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.