By Topic

A subspace tracking algorithm using the fast Fourier transform

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)
Cooley, James W. ; Dept. of Electr. Eng., Univ. of Rhode Island, Kingston, RI, USA ; Toolan, T.M. ; Tufts, D.W.

E.C. Real et al. have presented an algorithm for fast tracking of a signal subspace or interference subspace for application in adaptive detection or estimation (see ICASSP '97; IEEE Trans. Sig. Processing, vol.47, p.1036-45, 1999). For cases in which the signal matrix is formed from a single-channel discrete-time signal, we show how one can further reduce computation in the fast approximate subspace tracking (FAST) algorithm by using the fast Fourier transform.

Published in:

Signal Processing Letters, IEEE  (Volume:11 ,  Issue: 1 )