Referenced Items are not available for this document.
This paper proposes two modifications of the filtered-x least mean squares (FxLMS) algorithm with improved convergence behavior albeit at the same computational cost of 2M operations per time step as the original FxLMS update. The paper further introduces a generalized FxLMS recursion and establishes that the various algorithms are all of filtered-error form. A choice of the stepsize parameter that guarantees faster convergence and conditions for robustness are also derived. Several simulation results are included to illustrate the discussions
Published in:
Speech and Audio Processing, IEEE Transactions on
(Volume:6
,
Issue:
1
)
Date of Publication: Jan 1998
- Page(s):
- 78 - 85
- ISSN :
- 1063-6676
- INSPEC Accession Number:
- 5807382
- Digital Object Identifier :
- 10.1109/89.650314
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jan 1998
- Sponsored by :
- IEEE Signal Processing Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
