By Topic

Nonstationary learning characteristics of the LMS algorithm

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

1 Author(s)

Upper and lower bounding first-order linear recursions for the mean-squared error realized with the LMS algorithm subjected to a sequence of independent nonstationary training vectors are derived. These bounds coincide to give the exact evolution of mean-squared error for the problem of identification of a nonrecursive time-varying system with white-noise excitation. This leads to an exact formula for time-averaged mean-squared error that is used to study optimization of the step-size parameter for minimum time-average misadjustment. New results on dependence of the minimal step size and the minimum misadjustment on the degree of nonstationarity are obtained.

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:34 ,  Issue: 10 )