By Topic

Error bound method and its application to the LMS algorithm

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
$33 $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

2 Author(s)
H. Leung ; Commun. Res. Lab., McMaster Univ., Hamilton, Ont., Canada ; S. Haykin

A method to determine a bound on the error performance of an adaptive filter due to roundoff effects is described. The method converts the analysis of a recursive algorithm into two much simpler sub-problems: convergence and momentary error. To apply the method, the input data has to be bounded. By classifying convergence into different categories according to their rates, it is observed that adaptive filtering algorithms that belong to a particular class share similar behavior due to roundoff error or other perturbation effects. The merit of the method is its simplicity and general applicability. Based on this method, a sufficient condition for the numerical stability of an adaptive filter is derived. Application of the method to the least mean square (LMS) algorithm is described. The analysis may also be generalized to include other perturbation effects

Published in:

IEEE Transactions on Signal Processing  (Volume:39 ,  Issue: 2 )