Performance Analysis of Least Mean Square Algorithm for Time-Varying Systems
时变系统最小均方算法的性能分析(英文)

By means of stochastic process theory, the bounded convergence of least mean square algorithm (LMS) is studied without data stationary assumption and ergodicity condition. The upper bound of the estimation error is given, and the way of choosing the convergence factor or stepsize is stated so that the upper bound of the parameter estimation error is minimized. The convergence analyses indicate that i) for deterministic time invariant systems, LMS algorithm is convergent exponentially, ii) for deterministic time varying systems, the estimation error upper bound is minimal as the stepsize goes to unity, and iii) for time varying or time invariant stochastic systems, the estimation error is uniformly bounded.