Title :
The wavelet transform-domain LMS algorithm: a more practical approach
Author_Institution :
Centre for Wireless Commun., Nat. Univ. of Singapore, Singapore
fDate :
3/1/2000 12:00:00 AM
Abstract :
The wavelet transform-domain least-mean square (WTDLMS) algorithm is known to have, in general, a faster convergence rate than the time-domain LMS algorithm, and can find many applications in signal processing and communications areas. However, the computational complexity of the wavelet filter bank is relatively high. In this work, we show how to exploit the redundancy which exists in the computation of the wavelet coefficients between successive iterations so as to significantly reduce the computational load of the algorithm
Keywords :
computational complexity; convergence of numerical methods; least mean squares methods; redundancy; signal processing; wavelet transforms; communications; computational complexity; computational load reduction; convergence rate; least-mean square algorithm; redundancy; signal processing; successive iterations; wavelet coefficients computation; wavelet filter bank; wavelet transform-domain LMS algorithm; Circuits and systems; Computational complexity; Delay; Finite impulse response filter; Frequency domain analysis; Frequency response; Interpolation; Least squares approximation; Polynomials; Signal processing algorithms;
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
