By Topic

Convergence analysis of an adaptive filter equipped with the sign-sign 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)
Eweda, E. ; Mil. Tech. Coll., Cairo, Egypt

Convergence with probability 1 of the sign-sign algorithm with a decreasing step size is proven when it is used in adaptive plant identification. The plant input and plant noise are assumed stationary and M-dependent. The assumptions do not pose any upper bound on the memory, M, of the plant input and plant noise, and hence, they allow arbitrarily strong correlation in these signals. A main interest of the paper is that it provides a condition of persistent excitation of the algorithm. Examples satisfying this condition are provided

Published in:

Automatic Control, IEEE Transactions on  (Volume:40 ,  Issue: 10 )