By Topic

Adaptive algorithms for estimating eigenvectors of correlation type matrices

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)
J. Karhunen ; Helsinki University of Technology, Espoo, Finland

In several applications of signal processing recursive algorithms for estimating a few eigenvectors of correlation or covariance matrices directly from the incoming samples are desirable. In this paper such algorithms are derived by starting from an extension of the classical power method of numerical analysis, instead of the usual gradient approach. This viewpoint leads to useful and relatively simple rules for determining the gain parameters of Owsley's stochastic gradient ascent algorithm for sensor array processing and Thompson's adaptive algorithm for unbiased frequency estimation using the Pisarenko method. A new, promising algorithm for adaptive estimation of eigenvectors corresponding to the smallest eigenvalues is introduced. Preliminary numerical results and comparisons are given, and a generalization of Thompson's algorithm for estimating several eigenvectors is represented.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '84.  (Volume:9 )

Date of Conference:

Mar 1984