Skip to main navigation Skip to search Skip to main content

Transient Performance Analysis of the ℓ1-RLS

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

The recursive least-squares algorithm with ℓ1-norm regularization (ℓ1-RLS) exhibits excellent performance in terms of convergence rate and steady-state error in identification of sparse systems. Nevertheless few works have studied its stochastic behavior, in particular its transient performance. In this letter, we derive analytical models of the transient behavior of the ℓ1-RLS in the mean and mean-square error sense. Simulation results illustrate the accuracy of these models.

Original languageEnglish
Pages (from-to)90-94
Number of pages5
JournalIEEE Signal Processing Letters
Volume29
DOIs
StatePublished - 2022

Keywords

  • Transient analysis
  • online identification
  • sparse system
  • ℓ-RLS

Fingerprint

Dive into the research topics of 'Transient Performance Analysis of the ℓ1-RLS'. Together they form a unique fingerprint.

Cite this