Sample convergence of the normed LMS algorithm with feedback delay

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

When a delay of even one iteration is introduced in the coefficient update loop, the projection properties of the NLMS (normed least mean square) algorithm are lost, allowing the error vector to increase as well as decrease in any given update. This makes the analysis of the algorithm with delay much more difficult. An exact analysis of the delayed update algorithm, on a sample function basis, is developed. It is shown that for any delay, the gain parameter, can be chosen sufficiently small to guarantee exponential convergence, assuming only that the input satisfies the standard mixing condition.

Original languageEnglish (US)
Title of host publicationProceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
PublisherPubl by IEEE
Pages2129-2132
Number of pages4
Volume3
ISBN (Print)078030033
StatePublished - 1991
EventProceedings of the 1991 International Conference on Acoustics, Speech, and Signal Processing - ICASSP 91 - Toronto, Ont, Can
Duration: May 14 1991May 17 1991

Other

OtherProceedings of the 1991 International Conference on Acoustics, Speech, and Signal Processing - ICASSP 91
CityToronto, Ont, Can
Period5/14/915/17/91

Fingerprint

Feedback
iteration
projection
coefficients

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering
  • Acoustics and Ultrasonics

Cite this

Voltz, P. (1991). Sample convergence of the normed LMS algorithm with feedback delay. In Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing (Vol. 3, pp. 2129-2132). Publ by IEEE.

Sample convergence of the normed LMS algorithm with feedback delay. / Voltz, Peter.

Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing. Vol. 3 Publ by IEEE, 1991. p. 2129-2132.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Voltz, P 1991, Sample convergence of the normed LMS algorithm with feedback delay. in Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing. vol. 3, Publ by IEEE, pp. 2129-2132, Proceedings of the 1991 International Conference on Acoustics, Speech, and Signal Processing - ICASSP 91, Toronto, Ont, Can, 5/14/91.
Voltz P. Sample convergence of the normed LMS algorithm with feedback delay. In Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing. Vol. 3. Publ by IEEE. 1991. p. 2129-2132
Voltz, Peter. / Sample convergence of the normed LMS algorithm with feedback delay. Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing. Vol. 3 Publ by IEEE, 1991. pp. 2129-2132
@inproceedings{765d94d89a5f4ff4b6fee6ec1cd678da,
title = "Sample convergence of the normed LMS algorithm with feedback delay",
abstract = "When a delay of even one iteration is introduced in the coefficient update loop, the projection properties of the NLMS (normed least mean square) algorithm are lost, allowing the error vector to increase as well as decrease in any given update. This makes the analysis of the algorithm with delay much more difficult. An exact analysis of the delayed update algorithm, on a sample function basis, is developed. It is shown that for any delay, the gain parameter, can be chosen sufficiently small to guarantee exponential convergence, assuming only that the input satisfies the standard mixing condition.",
author = "Peter Voltz",
year = "1991",
language = "English (US)",
isbn = "078030033",
volume = "3",
pages = "2129--2132",
booktitle = "Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Sample convergence of the normed LMS algorithm with feedback delay

AU - Voltz, Peter

PY - 1991

Y1 - 1991

N2 - When a delay of even one iteration is introduced in the coefficient update loop, the projection properties of the NLMS (normed least mean square) algorithm are lost, allowing the error vector to increase as well as decrease in any given update. This makes the analysis of the algorithm with delay much more difficult. An exact analysis of the delayed update algorithm, on a sample function basis, is developed. It is shown that for any delay, the gain parameter, can be chosen sufficiently small to guarantee exponential convergence, assuming only that the input satisfies the standard mixing condition.

AB - When a delay of even one iteration is introduced in the coefficient update loop, the projection properties of the NLMS (normed least mean square) algorithm are lost, allowing the error vector to increase as well as decrease in any given update. This makes the analysis of the algorithm with delay much more difficult. An exact analysis of the delayed update algorithm, on a sample function basis, is developed. It is shown that for any delay, the gain parameter, can be chosen sufficiently small to guarantee exponential convergence, assuming only that the input satisfies the standard mixing condition.

UR - http://www.scopus.com/inward/record.url?scp=0026287622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026287622&partnerID=8YFLogxK

M3 - Conference contribution

SN - 078030033

VL - 3

SP - 2129

EP - 2132

BT - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

PB - Publ by IEEE

ER -