The wavelet transform-domain least-mean square (WT-DLMS) algorithm is known
to have, in general, a faster convergence rate than the time-domain LMS al
gorithm, and can find many applications in signal processing and communicat
ions areas. However, the computational complexity of the wavelet filter ban
k is relatively high. In this brief, we show how to exploit the redundancy
which exists in the computation of the wavelet coefficients between success
ive iterations so as to significantly reduce the computational load of the
algorithm.