By Topic

Acceleration of normalized adaptive filtering data-reusing methods using the Tchebyshev and conjugate gradient methods

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

3 Author(s)
Soni, R.A. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Jenkins, W.K. ; Gallivan, K.A.

New normalized data reusing can significantly improve convergence rates over traditional LMS adaptive filtering methods. However, these methods can still be slow to converge for highly-correlated input data. The convergence rate of this normalized adaptive algorithm can be significantly improved by accelerating these methods using the conjugate gradient and Tchebyshev algorithms. Use of these acceleration techniques can be shown to be approximately equivalent to the popular methods of affine projection albeit at a lower overall computational complexity. Simulation examples illustrate that significant performance improvement may be obtained using these methods of acceleration. Theoretically optimal performance bounds for this method of data reusing are illustrated by proof and simulation

Published in:

Circuits and Systems, 1998. ISCAS '98. Proceedings of the 1998 IEEE International Symposium on  (Volume:5 )

Date of Conference:

31 May-3 Jun 1998