By Topic

Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking

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

3 Author(s)
Badeau, R. ; Dept. of Signal & Image Process., TELECOM ParisTech, Paris ; Richard, G. ; David, B.

This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the subspace projection (SP) algorithm by Davila, which was known for its exceptional convergence rate, compared with other classical principal subspace trackers. The novelty in the YAST algorithm was the lower computational cost (linear if the data correlation matrix satisfies a so-called shift-invariance property), and the extension to minor subspace tracking. However, the original implementation of the YAST algorithm suffered from a numerical stability problem (the subspace weighting matrix slowly loses its orthonormality). We thus propose in this paper a new implementation of YAST, whose stability is established theoretically and tested via numerical simulations. This algorithm combines all the desired properties for a subspace tracker: remarkably high convergence rate, lowest steady-state error, linear complexity, and numerical stability regarding the orthonormality of the subspace weighting matrix.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 8 )