摘要
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.
源语言 | 英语 |
---|---|
页(从-至) | 90-94 |
页数 | 5 |
期刊 | IEEE Signal Processing Letters |
卷 | 29 |
DOI | |
出版状态 | 已出版 - 2022 |