English

Mean-square Analysis of the NLMS Algorithm

Signal Processing 2021-08-10 v1 Information Theory math.IT

Abstract

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 (uD12)(uD22)1(||{\bf u}||_{{\bf D}_1}^2)(||{\bf u}||_{{\bf D}_2}^2)^{-1} where u{\bf u} is an isotropic vector and D1{\bf D}_1 and D2{\bf 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.

Keywords

Cite

@article{arxiv.2108.03721,
  title  = {Mean-square Analysis of the NLMS Algorithm},
  author = {Tareq Y. Al-Naffouri and Muhammad Moinuddin and Anum Ali},
  journal= {arXiv preprint arXiv:2108.03721},
  year   = {2021}
}
R2 v1 2026-06-24T04:55:46.419Z