Wavelet transform domain LMS algorithm
- 1 January 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 508-510 vol.3
- https://doi.org/10.1109/icassp.1993.319546
Abstract
A novel normalized wavelet domain least-mean-square (LMS) algorithm is described. The faster convergence rate of this algorithm as compared with time-domain LMS is established. The wavelet domain LMS algorithm requires only real arithmetic. In its most basic form it has a computational complexity that is higher than that of the traditional LMS technique by a factor of cN, where N is the length of the transformed vector (or sliding analysis window) and c is the length of the analysis wavelet. Other preconditioning strategies that yield a faster convergence rate for a given fixed excess mean squared error are discussed. The authors also describe low-complexity implementations of the wavelet domain LMS algorithm. These implementations exploit the structure of the wavelet transform of the underlying stochastic process.<>Keywords
This publication has 8 references indexed in Scilit:
- Adaptive filtering in sub-bandsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Wavelet transform domain LMS algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Fast wavelet transforms and numerical algorithms ICommunications on Pure and Applied Mathematics, 1991
- Multifrequency channel decompositions of images and wavelet modelsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Orthonormal bases of compactly supported waveletsCommunications on Pure and Applied Mathematics, 1988
- Transform domain LMS algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- Adaptive frequency sampling filtersIEEE Transactions on Circuits and Systems, 1981
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-MatrixMathematics of Computation, 1977