Convergence and steady-state analysis of a variable step-size normalized LMS algorithm

Ahmed I. Sulyman; Azzedine Zerguine

doi:10.1109/ISSPA.2003.1224946

Convergence and steady-state analysis of a variable step-size normalized LMS algorithm

Ahmed I. Sulyman, Azzedine Zerguine

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

Abstract

This paper presents a simple and robust variable step-size normalized LMS (VSS-NLAIS) adaptive algorithm. The fixed step-size NLMS algorithm (FSS- NLMS) usually results in a trade-off between the residual error and the convergence speed of the algorithm. The variable step-size NLMS algorithm presented here relaxes such trade-off. Both analysis and simulation results show that the proposed VSS-NLMS algorithm outperforms the FSS-NLMS algorithm.

Original language	English
Title of host publication	Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003
Publisher	IEEE Computer Society
Pages	591-594
Number of pages	4
ISBN (Print)	0780379462, 9780780379466
DOIs	https://doi.org/10.1109/ISSPA.2003.1224946
State	Published - 2003

Publication series

Name	Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003
Volume	2

ASJC Scopus subject areas

Signal Processing

Access to Document

10.1109/ISSPA.2003.1224946

Cite this

Sulyman, A. I., & Zerguine, A. (2003). Convergence and steady-state analysis of a variable step-size normalized LMS algorithm. In Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003 (pp. 591-594). Article 1224946 (Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003; Vol. 2). IEEE Computer Society. https://doi.org/10.1109/ISSPA.2003.1224946

@inproceedings{745113f239e04b199752632c5c199d87,

title = "Convergence and steady-state analysis of a variable step-size normalized LMS algorithm",

abstract = "This paper presents a simple and robust variable step-size normalized LMS (VSS-NLAIS) adaptive algorithm. The fixed step-size NLMS algorithm (FSS- NLMS) usually results in a trade-off between the residual error and the convergence speed of the algorithm. The variable step-size NLMS algorithm presented here relaxes such trade-off. Both analysis and simulation results show that the proposed VSS-NLMS algorithm outperforms the FSS-NLMS algorithm.",

author = "Sulyman, {Ahmed I.} and Azzedine Zerguine",

year = "2003",

doi = "10.1109/ISSPA.2003.1224946",

language = "English",

isbn = "0780379462",

series = "Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003",

publisher = "IEEE Computer Society",

pages = "591--594",

booktitle = "Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003",

address = "United States",

}

Sulyman, AI & Zerguine, A 2003, Convergence and steady-state analysis of a variable step-size normalized LMS algorithm. in Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003., 1224946, Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003, vol. 2, IEEE Computer Society, pp. 591-594. https://doi.org/10.1109/ISSPA.2003.1224946

Convergence and steady-state analysis of a variable step-size normalized LMS algorithm. / Sulyman, Ahmed I.; Zerguine, Azzedine.
Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003. IEEE Computer Society, 2003. p. 591-594 1224946 (Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Convergence and steady-state analysis of a variable step-size normalized LMS algorithm

AU - Sulyman, Ahmed I.

AU - Zerguine, Azzedine

PY - 2003

Y1 - 2003

N2 - This paper presents a simple and robust variable step-size normalized LMS (VSS-NLAIS) adaptive algorithm. The fixed step-size NLMS algorithm (FSS- NLMS) usually results in a trade-off between the residual error and the convergence speed of the algorithm. The variable step-size NLMS algorithm presented here relaxes such trade-off. Both analysis and simulation results show that the proposed VSS-NLMS algorithm outperforms the FSS-NLMS algorithm.

AB - This paper presents a simple and robust variable step-size normalized LMS (VSS-NLAIS) adaptive algorithm. The fixed step-size NLMS algorithm (FSS- NLMS) usually results in a trade-off between the residual error and the convergence speed of the algorithm. The variable step-size NLMS algorithm presented here relaxes such trade-off. Both analysis and simulation results show that the proposed VSS-NLMS algorithm outperforms the FSS-NLMS algorithm.

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

U2 - 10.1109/ISSPA.2003.1224946

DO - 10.1109/ISSPA.2003.1224946

M3 - Conference contribution

AN - SCOPUS:84863755602

SN - 0780379462

SN - 9780780379466

T3 - Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003

SP - 591

EP - 594

BT - Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003

PB - IEEE Computer Society

ER -

Sulyman AI, Zerguine A. Convergence and steady-state analysis of a variable step-size normalized LMS algorithm. In Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003. IEEE Computer Society. 2003. p. 591-594. 1224946. (Proceedings - 7th International Symposium on Signal Processing and Its Applications, ISSPA 2003). doi: 10.1109/ISSPA.2003.1224946

Convergence and steady-state analysis of a variable step-size normalized LMS algorithm

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this