Abstract
In several practical applications of the LMS algorithm, including certain VLSI implementations, the coefficient adaptation can be performed only after some fixed delay. The resulting algorithm is known as the delayed LMS (DLMS) algorithm in the literature. In this paper we consider a normalized version of this algorithm with a decreasing step size, μ(n), and discuss the almost sure convergence of the non-homogeneous algorithm, assuming a mixing input condition and the satisfaction of a certain law of large numbers.
Original language | English (US) |
---|---|
Article number | 390005 |
Pages (from-to) | III401-III404 |
Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
Volume | 3 |
DOIs | |
State | Published - 1994 |
Event | Proceedings of the 1994 IEEE International Conference on Acoustics, Speech and Signal Processing. Part 2 (of 6) - Adelaide, Aust Duration: Apr 19 1994 → Apr 22 1994 |
ASJC Scopus subject areas
- Software
- Signal Processing
- Electrical and Electronic Engineering