ABSTRACT
Consider the conventional least mean-square (LMS) algorithm with the fixed step-size parameter µ replaced with a time-varying variable µ(n) as follows (we substitute 2µ with µ for simplicity): () w ( n + 1 ) = w ( n ) + μ ( n ) e ( n ) x ( n ) https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781315215136/85154af4-39d8-4b43-ae90-9b7d84af8606/content/eq953.tif"/>
