A Class of Adaptively Regularised PNLMS Algorithms
- 1 July 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 19-22
Abstract
A class of algorithms representing a robust variant of the proportionate normalised least-mean-square (PNLMS) algorithm is proposed. To achieve this, adaptive regularisation is introduced within the PNLMS update, with the analysis conducted for both individual and global regularisation factors. The update of the adaptive regularisation parameter is also made robust, to improve steady state performance and reduce computational complexity. The proposed algorithms are better suited not only for operation in nonstationary environments, but are also less sensitive to changes in the input dynamics and the choice of their parameters. Simulations in a sparse environment show the proposed class of algorithms offer enhanced performance and increased stability over the standard PNLMS.Keywords
This publication has 9 references indexed in Scilit:
- Robust Regularization for Normalized LMS AlgorithmsIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 2006
- On Convergence of Proportionate-Type Nlms Adaptive Algorithms2006
- Proportionate adaptive algorithms for network echo cancellationIEEE Transactions on Signal Processing, 2006
- A Generalized Normalized Gradient Descent AlgorithmIEEE Signal Processing Letters, 2004
- Exploiting sparsity in adaptive filtersIEEE Transactions on Signal Processing, 2002
- An improved PNLMS algorithm2002
- Proportionate normalized least-mean-squares adaptation in echo cancelersIEEE Transactions on Speech and Audio Processing, 2000
- Training neural networks with additive noise in the desired signalIEEE Transactions on Neural Networks, 1999
- A stochastic gradient adaptive filter with gradient adaptive step sizeIEEE Transactions on Signal Processing, 1993