DeepAI AI Chat
Log In Sign Up

Mean-square Analysis of the NLMS Algorithm

by   Tareq Y. Al-Naffouri, et al.
King Abdullah University of Science and Technology

This work presents a novel approach to the mean-square analysis of the normalized least mean squares (NLMS) algorithm for circular complex colored Gaussian inputs. The analysis is based on the derivation of a closed-form expression for the Cumulative Distribution Function (CDF) of random variables of the form (|| u||_ D_1^2)(|| u||_ D_2^2)^-1 where u is an isotropic vector and D_1 and D_2 are diagonal matrices and using that to derive some moments of these variables. These moments in turn completely characterize the mean-square behavior of the NLMS algorithm in explicit closed-form expressions. Specifically, the transient, steady-state, and tracking mean-square behavior of the NLMS algorithm is studied.


page 1

page 2

page 3

page 4


On the Correlation between the Noise and a Priori Error Vectors in Affine Projection Algorithms

This paper analyzes the correlation matrix between the a priori error an...

Regularized Least-Mean-Square Algorithms

We consider adaptive system identification problems with convex constrai...

Variants of Partial Update Augmented CLMS Algorithm and Their Performance Analysis

Naturally complex-valued information or those presented in complex domai...

Transient performance analysis of zero-attracting LMS

Zero-attracting least-mean-square (ZA-LMS) algorithm has been widely use...

A Complete Transient Analysis for the Incremental LMS Algorithm

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

Mean-Square Analysis of Discretized Itô Diffusions for Heavy-tailed Sampling

We analyze the complexity of sampling from a class of heavy-tailed distr...