Enhanced-Convergence Normalized LMS Algorithm[DSP Tips & Tricks]
M. Givens
Abstract
M. Givens
Abstract
Least mean square (LMS) algorithms have found great utility in many adaptive filtering applications. This article shows how the traditional constraints placed on the update gain of normalized LMS algorithms are overly restrictive. We present relaxed update gain constraints that significantly improve normalized LMS algorithm convergence speed.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Least mean square (LMS) algorithms have found great utility in many adaptive filtering applications. This article shows how the traditional constraints placed on the update gain of normalized LMS algorithms are overly restrictive. We present relaxed update gain constraints that significantly improve normalized LMS algorithm convergence speed.
Key concepts: Least mean squares filter, Convergence (economics), Algorithm, Adaptive filter, Computer science, Digital signal processing, Algorithm design, Economics