By Topic

Asymptotic behavior of an adaptive estimation algorithm with application to M-dependent data

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
$33 $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)
S. Ata ; Adersa-Gerbios, Palaiseau, France

Theoretical results are presented concerning the asymptotic behavior of the parameter estimates generated by an adaptive algorithm in stationary dependent random situations. Proofs are exhibited in the general case and derived for the case of statistical dependence in the input for a finite number of lags. It is found that the estimate mean-error norm converges to an asymptotic bound, giving a finite bias, generally nonzero, and that the asymptotic mean-norm square error is bounded and can be arbitrarily reduced by decreasing the adaptation factor.

Published in:

IEEE Transactions on Automatic Control  (Volume:27 ,  Issue: 6 )