DocumentCode
1275511
Title
Multichannel recursive least squares adaptive filtering without a desired signal
Author
Lewis, Paul S.
Author_Institution
Los Alamos Nat. Lab., NM, USA
Volume
39
Issue
2
fYear
1991
fDate
2/1/1991 12:00:00 AM
Firstpage
359
Lastpage
365
Abstract
The author presents a pair of adaptive QR decomposition-based algorithms for the adaptive mixed filter in which no desired signal is available, but the signal-to-data cross-correlation vector is known. The algorithms are derived by formulating the recursive mixed filter as a least-squares problem and then applying orthogonal QR -based techniques in its solution. This leads to algorithms with the performance, numerical, and structural advantages of the RLS/ QR algorithm, but without the requirement of a desired signal. Both Givens and square-root-free Givens rotations are used in implementing the recursive QR decomposition. Because of their structural regularity, the algorithms are easily implemented by triangular systolic array structures. Simulations show that these algorithms require fewer computations and less precision than recursive sample matrix inversion approaches
Keywords
adaptive filters; filtering and prediction theory; least squares approximations; signal processing; systolic arrays; adaptive QR decomposition-based algorithms; adaptive mixed filter; least-squares problem; multichannel filtering; orthogonal QR-based techniques; recursive least squares adaptive filtering; recursive mixed filter; signal processing; signal-to-data cross-correlation vector; square-root-free Givens rotations; structural regularity; triangular systolic array structures; Adaptive filters; Autocorrelation; Least squares approximation; Least squares methods; Matrix decomposition; Nonlinear filters; Recursive estimation; Resonance light scattering; Signal processing algorithms; Vectors;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.80819
Filename
80819
Link To Document