By Topic

A Mean Convergence Analysis for Partial Update NLMS 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
$31 $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 ; George Washington Univ., Washington ; Doroslovacki, M.

This paper discusses the convergence rates of partial update normalized least mean square (NLMS) algorithms for long, finite impulse response (FIR) adaptive filters. We specify the general form of convergence of tap weight vector's mean deviation for white Guassian input, and analyze several best known partial update algorithms' performance. These results are compared with the conventional NLMS algorithm. We further discuss the similarity in update effects of some partial update algorithms and proportionate-type NLMS algorithms. This theoretically demonstrates that for sparse impulse response system identification with white Guassian input, properly designed partial update NLMS algorithms, although need only a fraction of the fully updated NLMS algorithm's computational power, have the potential of achieving better performance than conventional NLMS.

Published in:

Information Sciences and Systems, 2007. CISS '07. 41st Annual Conference on

Date of Conference:

14-16 March 2007