A novel approach to introducing adaptive filters based on the LMS algorithm and its variants

This paper presents a new approach to introducing adaptive filters based on the least-mean-square (LMS) algorithm and its variants in an undergraduate course on digital signal processing. Unlike other filters currently taught to undergraduate students, these filters are nonlinear and time variant. T...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on education Vol. 47; no. 1; pp. 127 - 133
Main Authors Soria, E., Calpe, J., Chambers, J., Martinez, M., Camps, G., Guerrero, J.D.M.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.02.2004
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0018-9359
1557-9638
1557-9638
DOI10.1109/TE.2003.822632

Cover

More Information
Summary:This paper presents a new approach to introducing adaptive filters based on the least-mean-square (LMS) algorithm and its variants in an undergraduate course on digital signal processing. Unlike other filters currently taught to undergraduate students, these filters are nonlinear and time variant. This proposal introduces adaptive filtering in the context of a linear time-invariant system using a real problem. In this way, introducing adaptive filters using concepts already familiar to the students motivates their interest through practical application. The key point for this simplification is that the input to the filter is constant so that the adaptive filter becomes linear. Therefore, a complete arsenal of mathematical tools, already known by the students, is available to analyze the performance of the filters and obtain the key parameters to adaptive filters, e.g., speed of convergence and stability. Several variants of the basic LMS algorithm are described the same way.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-9359
1557-9638
1557-9638
DOI:10.1109/TE.2003.822632