By Topic

A New Subspace Tracking Algorithm Using Approximation of Gram-Schmidt Procedure

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

3 Author(s)
Imran Ali ; Center for Adv. Studies in Telecommun., COMSATS Inst. of Inf. Technol., Islamabad, Pakistan ; Doug Nyun Kim ; Taikyeong Ted Jeong

In this paper, we develop a new algorithm for the principle subspace tracking by orthonormalizing the eigenvectors using an approximation of Gram-Schmidt procedure. We carry out mathematical derivation to show that when this approximated version of Gram-Schmidt procedure is added to a modified form of Projection Approximation Subspace Tracking deflation (PASTd) algorithm, the eigenvectors can be orthonormalized within a linear computational complexity. While the PASTd algorithm tries to extracts orthonormalized eigenvectors, the new scheme orthonormalizes the eigenvectors after their extraction, yielding much more tacking efficiency. In the end, simulation results are presented to demonstrate the performance of the proposed algorithm.

Published in:

Information and Multimedia Technology, 2009. ICIMT '09. International Conference on

Date of Conference:

16-18 Dec. 2009