DocumentCode :
2880667
Title :
A fast exact least mean square adaptive algorithm
Author :
Benesty, Jacob ; Duhamel, Pierre
Author_Institution :
CNET/PAB/RPE, Issy-les-Moulineaux, France
fYear :
1990
fDate :
3-6 Apr 1990
Firstpage :
1457
Abstract :
A general block-formulation is presented for the LMS (least-mean-square) algorithm for adaptive filtering. This formulation has an exact equivalence with the initial LMS, hence retaining the same convergence properties while allowing a reduction in the arithmetic complexity, even for very small block lengths. Furthermore, tradeoffs between number of operations and convergence rate are obtainable by applying certain approximations to a matrix involved in the algorithm. The usual block LMS (BLMS) hence appears as one of the possible approximations, which explains some of its properties
Keywords :
adaptive filters; convergence of numerical methods; filtering and prediction theory; least squares approximations; adaptive filtering; arithmetic complexity; block LMS; convergence properties; fast exact least mean square adaptive algorithm; general block-formulation; Adaptive algorithm; Adaptive filters; Approximation algorithms; Arithmetic; Convergence; Echo cancellers; Filtering algorithms; Finite impulse response filter; Jacobian matrices; Least squares approximation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1990. ICASSP-90., 1990 International Conference on
Conference_Location :
Albuquerque, NM
ISSN :
1520-6149
Type :
conf
DOI :
10.1109/ICASSP.1990.115671
Filename :
115671
Link To Document :
بازگشت