Low-Complexity Reduced-Rank Beamforming Algorithms
classification
💻 cs.IT
math.IT
keywords
algorithmsadaptivebeamformingperformancereduced-ranktechniquesachieveanalyze
pith:TNOV2CXF Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{TNOV2CXF}
Prints a linked pith:TNOV2CXF badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
A reduced-rank framework with set-membership filtering (SMF) techniques is presented for adaptive beamforming problems encountered in radar systems. We develop and analyze stochastic gradient (SG) and recursive least squares (RLS)-type adaptive algorithms, which achieve an enhanced convergence and tracking performance with low computational cost as compared to existing techniques. Simulations show that the proposed algorithms have a superior performance to prior methods, while the complexity is lower.
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.