Minimum mean square deviation in ZA-NLMS algorithm

Abdullah Al-Shabili, Shihab Jimaa, Luis Weruaga

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The ZA-NLMS (for zero-attractor) represents arguably the seminal sparsity-aware gradient adaptive algorithm. As it is constraint by the ℓ1-norm of the filter weights, the underlying problem turns convex, hence with unique solution (in expected sense). Despite these friendly properties, the algorithm convergence and, more important, the best-performing sparsity tradeoff are yet to be effectively studied. This paper presents a comprehensive analytical study on ZA-NLMS' convergence, which results in the optimal (constant) sparsity tradeoff. The value of this decisive hyperparameter from a practitioner point of view turns out related to the 3/2-power of the adaptive filter length. This outcome, difficult to argue intuitively, as well as the convergence model, have been exhaustively validated with numerical experiments.

Original languageBritish English
Title of host publication2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3869-3873
Number of pages5
ISBN (Electronic)9781509041176
DOIs
StatePublished - 16 Jun 2017
Event2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - New Orleans, United States
Duration: 5 Mar 20179 Mar 2017

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Conference

Conference2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017
Country/TerritoryUnited States
CityNew Orleans
Period5/03/179/03/17

Keywords

  • mean square deviation
  • modal analysis
  • NLMS
  • optimal tradeoff
  • Sparsity
  • ℓ norm

Fingerprint

Dive into the research topics of 'Minimum mean square deviation in ZA-NLMS algorithm'. Together they form a unique fingerprint.

Cite this