Adaptive sparsity tradeoff for ℓ1-constraint NLMS algorithm

Abdullah Al-Shabili, Luis Weruaga, Shihab Jimaa

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

7 Scopus citations

Abstract

Embedding the norm in gradient-based adaptive filtering is a popular solution for sparse plant estimation. Even though the foundations are well understood, the selection of the sparsity hyper-parameter still remains today matter of study. Supported on the modal analysis of the adaptive algorithm near steady state, this paper shows that the optimal sparsity tradeoff depends on filter length, plant sparsity and signal-to-noise ratio. In a practical implementation, these terms are obtained with an unsupervised mechanism tracking the filter weights. Simulation results prove the robustness and superiority of the novel adaptive-tradeoff sparsity-aware method.

Original languageBritish English
Title of host publication2016 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4707-4711
Number of pages5
ISBN (Electronic)9781479999880
DOIs
StatePublished - 18 May 2016
Event41st IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016 - Shanghai, China
Duration: 20 Mar 201625 Mar 2016

Publication series

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

Conference

Conference41st IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016
Country/TerritoryChina
CityShanghai
Period20/03/1625/03/16

Keywords

  • expectation-maximization
  • Gaussian mixture models
  • modal analysis
  • NLMS
  • norm
  • Sparsity

Fingerprint

Dive into the research topics of 'Adaptive sparsity tradeoff for ℓ1-constraint NLMS algorithm'. Together they form a unique fingerprint.

Cite this