By Topic

Convergence of the sign algorithm for adaptive filtering with correlated 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)
Eweda, E. ; Dept of Electr. Eng., Mil. Tech. Coll., Cairo, Egypt

Convergence of a decreasing gain sign algorithm (SA) for adaptive filtering is analyzed. The presence of the hard limiter in the algorithm makes a rigorous analysis difficult. Therefore, there are few results available. Such results normally include restrictive assumptions such as the assumptions that successive observation vectors are independent and the new error signal of the adaptive filter has a time invariant probability density function. The former assumption is not valid in the context of adaptive filtering since two successive observation vectors share most of their components, while the latter assumption is a restriction on the adaptive weights whose evolution is a priori unknown. In lieu of using these assumptions, an almost-sure convergence of the SA is proved under the assumption that the sequence of observation vectors is M-dependent. This assumption allows strong correlation between successive observations

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 5 )