ON THE ROBUSTNESS OF LMS ALGORITHM

摘要

Robustness of the Least Mean Square algorithm (LMS) with respect to non-additive noise is considered in this paper. Under very general assumptions, an almost sure upper bound for the asymptotic deviation of algorithm iterations from the solution of the corresponding Wiener-Hopf equation has been determined.