Recursive least-squares-based subspace tracking

Bin Yang

doi:10.1117/12.190847

28 October 1994 Recursive least-squares-based subspace tracking

Bin Yang

Author Affiliations +

Proceedings Volume 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V; (1994) https://doi.org/10.1117/12.190847
Event: SPIE's 1994 International Symposium on Optics, Imaging, and Instrumentation, 1994, San Diego, CA, United States

Abstract

In this paper, we introduce a new interpretation of the signal subspace as the solution of an unconstrained minimization problem. We show that recursive least squares techniques can be applied to track the signal subspace recursively by making an appropriate projection approximation of the cost function. The resulting algorithms have a computational complexity of O(nr) where n is the input vector dimension and r(r<n) is the number of desired eigen components. We demonstrate that this approach can also be extended to track the rank, i.e. the number of signals, at the same order of linear (approximately n) computational complexity. Simulation results show that our algorithms offer a comparable and in some cases more robust performance than the spherical tracker by DeGroat, the URV updating by Stewart, and even the exact eigenvalue decomposition.

Citation Download Citation

Bin Yang "Recursive least-squares-based subspace tracking", Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); https://doi.org/10.1117/12.190847

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE