On the convergence of the LMS algorithm in adaptive filtering

摘要

An independence assumption on the input vectors is commonly used when stating the convergence of the least mean square algorithm is adaptive filtering. From this hypothesis a range in which the convergence factor must be chosen is determined. In this paper the independence assumption, unrealistic in the case of adaptive filtering, is avoided. From stability theory of discrete-time systems, a new range for the convergence factor is obtained.