Investigations on Sparse System Identification with l0-LMS, Zero-Attracting LMS and Linearized Bregman Iterations

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

Abstract

Identifying a sparse system impulse response is often performed with the l0-LMS-, or the zero-attracting LMS algorithm. Recently, a linearized Bregman (LB) iteration based sparse LMS algorithm has been proposed for this task. In this contribution, the mentioned algorithms are compared with respect to their parameter dependency, convergence speed, mean-squared error (MSE), and sparsity of the estimate. The performance of the LB iteration based sparse LMS algorithm only slightly depends on its parameters. In our opinion it is the favorable choice in terms of achieving sparse impulse response estimates and low MSE. Especially when using an extension called micro-kicking the LB based algorithms converge much faster than the l0-LMS.
Original languageEnglish
Title of host publicationComputer Aided Systems Theory - EUROCAST 2017
EditorsFranz Pichler, Roberto Moreno-Diaz, Alexis Quesada-Arencibia
Place of PublicationCham
PublisherSpringer International Publishing
Pages161-169
Number of pages9
Volume10672
ISBN (Print)978-3-319-74727-9
DOIs
Publication statusPublished - Jan 2018

Publication series

NameLecture Notes in Computer Science (LNCS)

Fields of science

  • 202 Electrical Engineering, Electronics, Information Engineering
  • 202022 Information technology
  • 202037 Signal processing

JKU Focus areas

  • Computation in Informatics and Mathematics
  • Mechatronics and Information Processing

Cite this