On Almost-Sure Bounds for the LMS Algorithm

Abstract

Almost-sure (as.) bounds for linear, constant-gain, generd pseudo-stationarity and dependence conditions on the driving data { J ~ k , k = 1 , 2 , 3 ,... }, { Y k , l i = 0 , 1 , 2 ,... } as. convergence and r a t s of a.s. convergence (as the algorithm gain c + 0) are established for the LMS algorithm second-order stochastic processes defined on a common… (More)
DOI: 10.1109/18.312160

Topics

Cite this paper

@article{Kouritzin1994OnAB, title={On Almost-Sure Bounds for the LMS Algorithm}, author={Michael A. Kouritzin}, journal={IEEE Trans. Information Theory}, year={1994}, volume={40}, pages={372-383} }