Almost-sure convergence of the non-homogeneous DNLMS algorithm with decreasing step size

Author

Ahn, Sang-Sik ; Voltz, Peter J.

Author_Institution

Dept. of Med. Electron., Korea Univ., Seoul, South Korea

Volume

iii

fYear

1994

fDate

19-22 Apr 1994

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. 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

Keywords

adaptive signal processing; convergence of numerical methods; delays; least mean squares methods; DLMS algorithm; LMS algorithm; VLSI; adaptive algorithms; coefficient adaptation; convergence; decreasing step size; delayed LMS; mixing input condition; non-homogeneous DNLMS algorithm; normalised delayed LMS; Adaptive algorithm; Adaptive control; Adaptive equalizers; Adaptive signal processing; Convergence; Decoding; Delay; Least squares approximation; Mean square error methods; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1994. ICASSP-94., 1994 IEEE International Conference on

Conference_Location

Adelaide, SA

ISSN

1520-6149

Print_ISBN

0-7803-1775-0

Type

conf

DOI

10.1109/ICASSP.1994.390005

Filename

390005