By Topic

Performance analysis of adaptive eigenanalysis algorithms

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

2 Author(s)
Solo, V. ; Dept. of Stat., Macquarie Univ., North Ryde, NSW, Australia ; Kong, X.

We present a rigorous analysis of several popular forms of short memory adaptive eigenanalysis algorithms using a stochastic averaging method. A first-order analysis shows that the algorithms do not have any equilibrium points despite published claims to the contrary. Through averaging analysis, we show that they hover around an appropriate eigenvector. A second-order analysis is also given without the Gaussian noise assumption, and our results greatly outperform an earlier approximation in the literature. The second-order analysis has been of much interest in the offline study but, in the dynamic adaptive case, is uncommon

Published in:

Signal Processing, IEEE Transactions on  (Volume:46 ,  Issue: 3 )