By Topic

Bounds on tracking errors for adaptive signal processing 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)
Farden, D.C. ; University of Rochester, Rochester, NY, USA ; Smith, M.

New upper bounds on the norm of the error between a parameter vector obtained by an adaptive signal processing algorithm and the desired parameter vector are presented. The family of algorithms treated includes the Widrow-Hoff LMS algorithm. The results are applicable to heavily correlated training data satisfying very mild covariance decay-rate conditions. The main result is a new proof for the almost sure exponential convergence of matrix products which arise in the analysis of adaptive signal processing algorithms. This result includes an estimate for the convergence rate of such products.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '81.  (Volume:6 )

Date of Conference:

Apr 1981