Back to search

University of York

Sparsity-Aware Adaptive Filtering Algorithms and Application to System Identification

Abstract

dc:description.abstract

In this thesis, low-complexity adaptive filtering algorithms that exploit the sparsity of signals and systems are derived and investigated. Specifically, sparsity-aware normalized least-mean square and affine projection algorithms are developed based on the l1-norm incorporated to their cost function, which we term zero-attracting NLMS (ZA-NLMS) and zero-attracting APA (ZA-APA). These algorithms are analyzed and applied to the identification of sparse systems. To further improve the filtering performance, the reweighted ZA-NLMS (RZA-NLMS) and reweighted ZA-APA (RZA-APA) are also proposed, which employs reweighted step sizes of the zero attractor for different taps, inducing the attractor to selectively promote zero taps rather than uniformly promote zeros on all the taps. We also develop zero forcing techniques to further improve their performance when the system has a significantly degree of sparsity, i.e., a very small number of non-zero coefficients. Simulation results show that the proposed algorithms outperform the standard NLMS and APA algorithms in both convergence rate and steady-state performance for sparse systems.

Degree

thesis:*
Name dc:type.qualificationname
M.Sc by research
Level dc:type.qualificationlevel
masters
Grantor dc:publisher.institution
University of York
Year dc:date.issued
2012

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Meng, Ran
Advisor dc:contributor.advisor
  • de Lamare, Rodrigo

Rights

Language dc:language.dcterms_iso639_2
eng

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Meng, Ran. Sparsity-Aware Adaptive Filtering Algorithms and Application to System Identification. masters thesis, University of York, 2012.