By Topic

An Array Recursive Least-Squares Algorithm With Generic Nonfading Regularization Matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tsakiris, M.C. ; Dept. of Electron. Syst., Univ. of Sao Paulo, Sao Paulo, Brazil ; Lopes, C.G. ; Nascimento, V.H.

We present a novel array RLS algorithm with forgetting factor that circumvents the problem of fading regularization, inherent to the standard exponentially-weighted RLS, by allowing for time-varying regularization matrices with generic structure. Simulations in finite precision show the algorithm's superiority as compared to alternative algorithms in the context of adaptive beamforming.

Published in:

Signal Processing Letters, IEEE  (Volume:17 ,  Issue: 12 )