Abstract

In this letter, we propose a variable step-size normalized least mean square (NLMS) algorithm. We study the relationship among the NLMS, recursive least square and Kalman filter algorithms. Based on the relationship, we derive an equation to determine the step-size of NLMS algorithm at each time instant. In steady state, the convergence of the proposed algorithm is verified by using the equation, which describes the relationship among the mean-square error, excess mean-square error, and measurement noise variance. Through computer simulation results, we verify the performance of the proposed algorithm and the change in the variable step-size over iterations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call