The LMS algorithm with delayed coefficient adaptation (original) (raw)

The LMS algorithm with delayed coefficient adaptation

1989

Abstract

The behavior of the delayed least-mean-square (DLMS) algorithm is studied. It is found that the step size in the coefficient update plays a key role in the convergence and stability of the algorithm. An upper bound for the step size is derived that ensures the stability of the DLMS. The relationship between the step size and the convergence speed, and

Fuyun Ling hasn't uploaded this paper.

Let Fuyun know you want this paper to be uploaded.

Ask for this paper to be uploaded.