RLS algorithm with convex regularization

Ender M. Eksioglu*, A. Korhan Tanc

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

129 Citations (Scopus)

Abstract

In this letter, the RLS adaptive algorithm is considered in the system identification setting. The RLS algorithm is regularized using a general convex function of the system impulse response estimate. The normal equations corresponding to the convex regularized cost function are derived, and a recursive algorithm for the update of the tap estimates is established. We also introduce a closed-form expression for selecting the regularization parameter. With this selection of the regularization parameter, we show that the convex regularized RLS algorithm performs as well as, and possibly better than, the regular RLS when there is a constraint on the value of the convex function evaluated at the true weight vector. Simulations demonstrate the superiority of the convex regularized RLS with automatic parameter selection over regular RLS for the sparse system identification setting.

Original languageEnglish
Article number5873123
Pages (from-to)470-473
Number of pages4
JournalIEEE Signal Processing Letters
Volume18
Issue number8
DOIs
Publication statusPublished - 2011

Keywords

  • Adaptive filter
  • convex regularization
  • l0 norm
  • l1 norm
  • RLS
  • sparsity

Fingerprint

Dive into the research topics of 'RLS algorithm with convex regularization'. Together they form a unique fingerprint.

Cite this