Performance of proportionate-type NLMS algorithm with gain allocation proportional to the mean square weight deviation

The complex colored water-filling algorithm for gain allocation has been shown to provide improved mean square error convergence performance, relative to standard complex proportionate-type normalized least mean square algorithms. This algorithm requires sorting operations and matrix multiplication...

Full description

Saved in:
Bibliographic Details
Published in2014 48th Asilomar Conference on Signals, Systems and Computers pp. 886 - 890
Main Authors Wagner, Kevin, Doroslovacki, Milos I.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2014
Subjects
Adaptive filtering
Computational complexity
Convergence
Covariance matrices
Estimation
least mean square algorithms
Resource management
Signal processing algorithms
Speech
Online AccessGet full text

Cover

More Information
Summary:The complex colored water-filling algorithm for gain allocation has been shown to provide improved mean square error convergence performance, relative to standard complex proportionate-type normalized least mean square algorithms. This algorithm requires sorting operations and matrix multiplication on the order of the size of the impulse response at each iteration. In this paper, the mean square weight deviation and two suboptimal gain allocation algorithms are presented. They are motivated by similar algorithms introduced before for real-valued signals and systems. The presented algorithms no longer require sorting. It is shown that they provide significant computational complexity savings while maintaining comparable mean square error convergence performance. The algorithms are also investigated in the case of unknown input correlation matrix and speech input signals.
ISSN:2576-2303
DOI:10.1109/ACSSC.2014.7094579