Transient analysis of zero attracting NLMS algorithm without Gaussian inputs assumption

Authors:
Sheng Zhang;Jiashu Zhang
Affiliations:
-;-
Venue:
Signal Processing
Year:
2014

Citing 13
Cited 0

Sparse LMS for system identification

ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Steady-state performance analysis for adaptive filters with error nonlinearities

ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Convergence Behavior of NLMS Algorithm for Gaussian Inputs: Solutions Using Generalized Abelian Integral Functions and Step Size Selection

Journal of Signal Processing Systems
On the Performance Analysis of the Least Mean M-Estimate and Normalized Least Mean M-Estimate Algorithms with Gaussian Inputs and Additive Gaussian and Contaminated Gaussian Noises

Journal of Signal Processing Systems
Fast communication: Convergence analysis of sparse LMS algorithms with l1-norm penalty based on white input signal

Signal Processing
Exact performance analysis of the ε-NLMS algorithm for colored circular Gaussian inputs

IEEE Transactions on Signal Processing
Normalized data nonlinearities for LMS adaptation

IEEE Transactions on Signal Processing
On the convergence behavior of the LMS and the normalized LMSalgorithms

IEEE Transactions on Signal Processing
A unified approach to the steady-state and tracking analyses ofadaptive filters

IEEE Transactions on Signal Processing
Transient analysis of data-normalized adaptive filters

IEEE Transactions on Signal Processing
Transient analysis of adaptive filters with error nonlinearities

IEEE Transactions on Signal Processing
Convergence and performance analysis of the normalized LMS algorithm with uncorrelated Gaussian data

IEEE Transactions on Information Theory
Nonnegative Least-Mean-Square Algorithm

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

The zero attracting normalized least mean square (ZA-NLMS) algorithm achieves lower steady-state error than the normalized least mean square (NLMS) algorithm for sparse system identification. Most of the available analytical results on several versions of the zero attracting least mean square algorithms assume white Gaussian inputs. This paper presents the individual weight error variance (IWV) analysis of the ZA-NLMS algorithm without Gaussian inputs assumption. The IWV analysis is based on exact individual weight error relation and used to derive the transient and steady-state behavior of the ZA-NLMS algorithm without restricting the input to being Gaussian or white, whereas some assumptions are introduced to overcome weight nonlinearity in evaluating certain expectations involved. Extensive simulations are used to verify the analysis results presented.