Two algorithms for fast approximate subspace tracking

Authors:
E.C. Real;D.W. Tufts;J.W. Cooley
Affiliations:
Signal Process. Center of Technol., Sanders Associates Inc., Nashua, NH;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
1999

Citing 0
Cited 2

Fast subspace tracking algorithm based on the constrained projection approximation

EURASIP Journal on Advances in Signal Processing
Physical layer metrics estimation for CSMA/CA networks using a Markov modeling and source enumeration

Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

New fast algorithms are presented for tracking singular values, singular vectors, and the dimension of a signal subspace through an overlapping sequence of data matrices. The basic algorithm is called fast approximate subspace tracking (FAST). The algorithm is derived for the special case in which the matrix is changed by deleting the oldest column, shifting the remaining columns to the left, and adding a new column on the right. A second algorithm (FAST2) is specified by modifying FAST to trade reduced accuracy for higher speed. The speed and accuracy are compared with the PL algorithm, the PAST and PASTd algorithms, and the FST algorithm. An extension to multicolumn updates for the FAST algorithm is also discussed