By Topic

A performance bound for the LMS estimator

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)
Quirk, K.J. ; Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA ; Milstein, L.B. ; Zeidler, J.R.

The least-mean-square (LMS) estimator is a nonlinear estimator with information dependencies spanning the entire set of data fed into it. The traditional analysis techniques used to model this estimator obscure these dependencies; to simplify the analysis they restrict the estimator to the finite set of data sufficient to span the length of its filter. Thus the finite Wiener filter is often considered a bound on the performance of the LMS estimator. Several papers have reported the performance of the LMS filter exceeding that of the finite Wiener filter. We derive a bound on the LMS estimator which does not exclude the contributions from data outside its filter length. We give examples of this bound in cases where the LMS estimator outperforms the finite Wiener filter

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 3 )