Delayed least-mean-square algorithm

The conventional delayed least-mean-square (LMS) algorithm converges more slowly than the LMS algorithm due to the delay introduced in coefficient adaptation. The authors derive a new delayed LMS algorithm, which is a realisation of the orthogonality principle, by minimising the a posteriori squared error. Computer simulations show that it does not suffer from the introduced delay and has comparable convergence performance to the LMS algorithm.

[1]  Fuyun Ling,et al.  Corrections to 'The LMS algorithm with delayed coefficient adaptation' , 1992, IEEE Trans. Signal Process..

[2]  Neil J. Bershad,et al.  Analysis of the normalized LMS algorithm with Gaussian inputs , 1986, IEEE Trans. Acoust. Speech Signal Process..

[3]  Steven Kay,et al.  Modern Spectral Estimation: Theory and Application , 1988 .

[4]  John G. Proakis,et al.  Digital Communications , 1983 .

[5]  B. Widrow,et al.  Stationary and nonstationary learning characteristics of the LMS adaptive filter , 1976, Proceedings of the IEEE.

[6]  Fuyun Ling,et al.  The LMS algorithm with delayed coefficient adaptation , 1989, IEEE Trans. Acoust. Speech Signal Process..

[7]  David Falconer,et al.  Adaptive Reference Echo Cancellation , 1982, IEEE Trans. Commun..