Share Email Print

Proceedings Paper

Subspace tracking with quasi-rectangular data windows
Author(s): Daniel J. Rabideau
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In signal processing, it is often necessary to decompose sampled data into its principal components. In adaptive sensor array processing, for example, Singular Value Decomposition (SVD) and/or Eigenvalue Decomposition (EVD) can be used to separate sensor data into “signal” and “noise” subspaces. Such decompositions are central to a number of techniques, such as MUSIC, ESPIRIT, and the Eigencanceller. Unfortunately, SVD and EVD algorithms are computationally intensive. When the underlying signals are nonstationary, “fast subspace tracking” methods provide a far less complex alternative to standard SVD methods. This paper addresses a class of subspace tracking methods known as “QR-Jacobi methods.” These methods can track the r principal eigenvectors of a correlation matrix in O(Nr) operations, where N is the dimensionality of the correlation matrix. Previously, QR-Jacobi methods have been formulated to track the principal eigenvectors of an “exponentially windowed” data correlation matrix. Finite duration data windowing strategies were not addressed. This paper extends the prior QR-Jacobi methods so as to implement rectangular sliding data windows, as well as other windows. Illustrated examples are provided.

Paper Details

Date Published: 25 August 2003
PDF: 13 pages
Proc. SPIE 5096, Signal Processing, Sensor Fusion, and Target Recognition XII, (25 August 2003); doi: 10.1117/12.487346
Show Author Affiliations
Daniel J. Rabideau, MIT Lincoln Lab. (United States)

Published in SPIE Proceedings Vol. 5096:
Signal Processing, Sensor Fusion, and Target Recognition XII
Ivan Kadar, Editor(s)

© SPIE. Terms of Use
Back to Top