A Family of Adaptive Decorrelation NLMS Algorithms and Its Diffusion Version Over Adaptive Networks

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

20 Scopus Citations
View graph of relations


Related Research Unit(s)


Original languageEnglish
Article number8013755
Pages (from-to)638-649
Journal / PublicationIEEE Transactions on Circuits and Systems I: Regular Papers
Issue number2
Online published21 Aug 2017
Publication statusPublished - Feb 2018


In order to increase the convergence rate of the normalized least mean square (NLMS) algorithm for highly correlated signals, a family of adaptive decorrelation NLMS variants is proposed in this paper. First, an adaptive decorrelation NLMS algorithm is presented to reduce the computational complexity of the existing decorrelation NLMS scheme. Then, by introducing a norm constraint on the decorrelation filter taps, the weight-constraint decorrelation NLMS (WCDNLMS) method is proposed. Third, on the WCDNLMS basis, a combination scheme of two weight-constraint decorrelation filters is developed to obtain an appropriate decorrelation parameter in different stages, i.e., large norm at transient state and small norm upon convergence. In addition, by extending the filter combination to adaptive networks, the diffusion combined weight-constraint decorrelation NLMS algorithm is devised for distributed estimation with colored inputs, and its theoretical performance is also analyzed. Finally, computer simulations are conducted to demonstrate the efficiency of the proposed algorithms and agreement with theoretical calculations.

Research Area(s)

  • Adaptive filter, adaptive networks, decorrelation, NLMS

Citation Format(s)