DeepAI AI Chat
Log In Sign Up

Transient performance analysis of zero-attracting LMS

08/25/2016
by   Jie Chen, et al.
Université Nice Sophia Antipolis
IEEE
0

Zero-attracting least-mean-square (ZA-LMS) algorithm has been widely used for online sparse system identification. It combines the LMS framework and ℓ_1-norm regularization to promote sparsity, and relies on subgradient iterations. Despite the significant interest in ZA-LMS, few works analyzed its transient behavior. The main difficulty lies in the nonlinearity of the update rule. In this work, a detailed analysis in the mean and mean-square sense is carried out in order to examine the behavior of the algorithm. Simulation results illustrate the accuracy of the model and highlight its performance through comparisons with an existing model.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/09/2019

A Complete Transient Analysis for the Incremental LMS Algorithm

The incremental least mean square (ILMS) algorithm was presented in <cit...
08/08/2021

Mean-square Analysis of the NLMS Algorithm

This work presents a novel approach to the mean-square analysis of the n...
12/22/2010

Regularized Least-Mean-Square Algorithms

We consider adaptive system identification problems with convex constrai...
09/09/2023

Transient Attack against the VMG-KLJN Secure Key Exchanger

The security vulnerability of the Vadai, Mingesz, and Gingl (VMG) Kirchh...
10/01/2012

Sparse LMS via Online Linearized Bregman Iteration

We propose a version of least-mean-square (LMS) algorithm for sparse sys...
03/25/2020

Robustness Analysis of the Data-Selective Volterra NLMS Algorithm

Recently, the data-selective adaptive Volterra filters have been propose...