A subspace tracking algorithm using the fast Fourier transform

A subspace tracking algorithm using the fast Fourier transform

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-c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE signal processing letters 2004-01, Vol.11 (1), p.30-32
Hauptverfasser: Cooley, J.W., Toolan, T.M., Tufts, D.W.
Format: Artikel
Sprache:eng
Schlagworte:
Adaptive algorithms
Adaptive signal detection
Algorithms
Approximation
Convolution
Discrete Fourier transforms
Displays
Fast Fourier transforms
Fourier transforms
Interference
Matrix decomposition
Signal processing
Signal processing algorithms
Singular value decomposition
Subspaces
Tracking
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2003.819352