By Topic

A Class of Adaptively Regularised PNLMS Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Beth Jelfs ; Department of Electrical & Electronic Engineering, Imperial College London, UK. E-mail: ; Danilo P. Mandic ; Jacob Benesty

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.

Published in:

2007 15th International Conference on Digital Signal Processing

Date of Conference:

1-4 July 2007