Fast algorithms for subspace tracking
Authors:
- K. Abed-MeraimKAK. Abed-Meraim
- 1 July 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 8 (7) , 203-206
Abstract
We present two normalized versions of Oja's (1992) algorithm (NOja and NOOja), which can be used for the estimation of minor and principal subspaces of a vector sequence. The new algorithms offer, as compared to Oja, a faster convergence, orthogonality, and a better numerical stability with a slight increase in computational complexity.Keywords
This publication has 7 references indexed in Scilit:
- Revisiting adaptive signal subspace estimation based on Rayleigh's quotient2002
- Orthogonal Oja algorithmIEEE Signal Processing Letters, 2000
- A self-stabilized minor subspace ruleIEEE Signal Processing Letters, 1998
- A unified algorithm for principal and minor components extractionNeural Networks, 1998
- Blind multiuser detection: a subspace approachIEEE Transactions on Information Theory, 1998
- Projection approximation subspace trackingIEEE Transactions on Signal Processing, 1995
- Principal components, minor components, and linear neural networksNeural Networks, 1992