Cart (Loading....) | Create Account
Close category search window
 

A New Robust Variable Step-Size NLMS 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
$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

4 Author(s)
Rey Vega, L. ; Univ. de Buenos Aires, Buenos Aires ; Rey, H. ; Benesty, J. ; Tressens, S.

A new framework for designing robust adaptive filters is introduced. It is based on the optimization of a certain cost function subject to a time-dependent constraint on the norm of the filter update. Particularly, we present a robust variable step-size NLMS algorithm which optimizes the square of the a posteriori error. We also show the link between the proposed algorithm and another one derived using a robust statistics approach. In addition, a theoretical model for predicting the transient and steady-state behavior and a proof of almost sure filter convergence are provided. The algorithm is then tested in different environments for system identification and acoustic echo cancelation applications.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 5 )

Date of Publication:

May 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.