Skip to main navigation Skip to search Skip to main content

Regularized LAD algorithms for sparse time-varying system identification with outliers

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

Two regularized least mean absolute deviation (LAD) algorithms are proposed for sparse system identification, which are referred to as zero-Attracting LAD (ZA-LAD) and re-weighted zero-Attracting LAD (RZA-LAD), respectively. The LAD type algorithms are robust to the impulsive noises. Furthermore, ℓ1-norm penalty is imposed on the filter coefficients to exploit sparsity of the system. The performance of ZA-LAD type algorithms is evaluated for linear time varying system identification under impulsive noise environments through computer simulations.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE International Conference on Digital Signal Processing, DSP 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages609-612
Number of pages4
ISBN (Electronic)9781509041657
DOIs
Publication statusPublished - Oct 2016
Event2016 IEEE International Conference on Digital Signal Processing, DSP 2016 - Beijing, China
Duration: 16 Oct 201618 Oct 2016

Publication series

NameInternational Conference on Digital Signal Processing, DSP
Volume0

Conference

Conference2016 IEEE International Conference on Digital Signal Processing, DSP 2016
Country/TerritoryChina
CityBeijing
Period16/10/1618/10/16

Keywords

  • least mean absolute deviation
  • outliers
  • sparsity
  • time-varying system identification
  • zero-Attracting

ASJC Scopus subject areas

  • Signal Processing

Fingerprint

Dive into the research topics of 'Regularized LAD algorithms for sparse time-varying system identification with outliers'. Together they form a unique fingerprint.

Cite this