By Topic

Partial update NLMS algorithm for sparse system identification with switching between coefficient-based and input-based selection

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

2 Author(s)
Jinhong Wu ; ECE Department, The George Washington University, DC 20052, USA ; Milos Doroslovacki

Long impulse response system identification presents two challenges for standard normalized least mean square (NLMS) filtering method: heavy computational load and slow convergence. When the response is sparse, partial update algorithms can reduce the computational complexity, but most often at the expense of performance. This paper discusses the tap selection rule for partial update NLMS algorithm in the case of white Gaussian input. We consider output mean square error (MSE) minimization based on gradient analysis and propose an algorithm that switches tap selection criterion between the one based on filter coefficient magnitudes and the one based on input magnitudes. We show that for identifying sparse systems, the new algorithm can outperform standard NLMS significantly with a reduced computational load.

Published in:

Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on

Date of Conference:

19-21 March 2008