By Topic

Fast Principal Component Extraction Using Givens Rotations

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)
Bartelmaos, S. ; TSI Dept., Telecom Paris, Paris ; Abed-Meraim, K.

In this letter, we elaborate a new version of the orthogonal projection approximation and subspace tracking (OPAST) for the extraction and tracking of the principal eigenvectors of a positive Hermitian covariance matrix. The proposed algorithm referred to as principal component OPAST (PC-OPAST) estimates the principal eigenvectors (not only a random basis of the principal subspace as for OPAST) of the considered covariance matrix. Also, it guarantees the orthogonality of the weight matrix at each iteration and requires flops per iteration, where is the size of the observation vector and is the number of eigenvectors to estimate. (The number of flops per iteration represents the total number of multiplication, division, and square root operations that are required to extract the desired eigenvectors at each iteration.) The estimation accuracy and tracking properties of PC-OPAST are illustrated through simulation results and compared with the well-known singular value decomposition (SVD) method and other recently proposed PCA algorithms.

Published in:

Signal Processing Letters, IEEE  (Volume:15 )