By Topic

Saving complexity of modified filtered-X-LMS and delayed update LMS algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Rupp, M. ; Wireless Technol. Res. Lab., Lucent Technol., Holmdel, NJ, USA

In some applications, like in active noise control, the error signal cannot be obtained directly but only a filtered version of it. A gradient adaptive algorithm that solves the identification problem under this condition is the well known Filtered-x Least-Mean-Squares (FxLMS) algorithm. If only one coefficient of this error-filter function is nonzero, a special case of the FxLMS algorithm, the Delayed-update Least-Mean-Squares (DLMS) algorithm is obtained. The drawback of these algorithms is the increased dynamic order which, in turn, decreases the convergence rate. Recently, some modifications for these algorithms have been proposed, overcoming the drawbacks by additional computations of the same filter order as the filter length M. In this contribution, an improvement is shown yielding reduced complexity if the error path filter order P is much smaller than the filter order M, which is the case for many applications. Especially for the DLMS algorithm a strong saving can be obtained

Published in:

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:44 ,  Issue: 1 )