New look at the power method for fast subspace tracking

Digital Signal Processing: A Review Journal

Volumn 9, Issue 4, 1999, Pages 297-314

  Hua, Yingbo ^a   Xiang, Yong ^a   Chen, Tianping ^c   Abed Meraim, Karim ^b   Miao, Yongfeng ^c  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b TELECOM PARISTECH   (France)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATHEMATICAL OPERATORS; VECTORS;

FAST SUBSPACE TRACKING METHODS; NOVEL INFORMATION CRITERION METHOD; OJA METHOD; POWER BASED METHOD; PROJECTION APPROXIMATION SUBSPACE TRACKING METHOD;

DIGITAL SIGNAL PROCESSING;

EID: 0033314570     PISSN: 10512004     EISSN: None     Source Type: None    
DOI: 10.1006/dspr.1999.0348     Document Type: Article

References (25)

1. Comon P., Golub G. H. Tracking a few extreme singular values and vectors in signal processing. Proc. IEEE. 78:1990;1327-1343.
2. Juang, B. H, Kung, S. Y, and, Kamm, C. A. (Eds.), Proc. 1991 IEEE Workshop on Neural Networks for Signal Processin, Princeton, NJ, Sept. 30-Oct. 2, 1991.
3. Oja E. A simplified neuron model as a principal component analyzer. J. Math. Biol. 15:1982;267-273.
4. Kung S. Y., Diamantaras K. I., Taur J. S. Adaptive principal component extraction (APEX) and applications. IEEE Trans. Signal Process. 42:1994;1202-1217.
5. Yan W. Y., Helmke U., Moore J. B. Global analysis of Oja's flow for neural networks. IEEE Trans. Neural Networks. 5:1994;674-683.
6. Chen T., Hua Y., Yan W. Global convergence of Oja's subspace algorithm for principal component extraction. IEEE Trans. Neural Networks. 9:1998;58-67.
7. Xu L. Least mean square error reconstruction principle for self-organizing neural nets. Neural Networks. 6:1993;627-648.
8. Yang B. Projection approximation subspace tracking. IEEE Trans. Signal Process. 43:1995;95-107.
9. Miao Y., Hua Y. Fast subspace tracking and neural network learning by a novel information criterion. IEEE Trans. Signal Process. 46:1998;1967-1979.
10. Golub G. H., Van Loan C. F. Matrix Computations. 1989.
11. Oja E. Neural networks, principal components, and subspaces. Int. J. Neural Systems. 1:1989;61-68.
12. Riou, C. and Chonavel, T.Fast adaptive eigenvalue decomposition: A maximum likelihood approach, in Proc. of IEEE ICASSP'97, pp. 3565-3568.
13. MacInnes, C. S.Fast, accurate subspace tracking using operator restriction analysis, Proc. of IEEE ICASSP'98, pp. 1357-1360.
14. Chen, T. and, Hua, Y. Convergence analysis of the NIC algorithm for subspace tracking, manuscript.
15. Helmke U., Moore J. B. Optimization and Dynamical Systems. 1994;Springer-Verlag, New York/Berlin.
16. Wang X., Poor H. V. Blind adaptive multiuser detection in multipath CDMA channels based on subspace tracking. IEEE Trans. Signal Process. 46:1998;3030-3044.
17. Liu H., Xu G. A subspace method for signal waveform estimation in synchronous CDMA systems. IEEE Trans. Commun. 44:1996;1346-1354.
18. Champagne B. Adaptive eigendecomposition of data covariance matrices based on first-order perturbations. IEEE Trans. Signal Process. 42:1994;2758-2770.
19. DeGroat R. D. Noniterative subspace tracking. IEEE Trans. Signal Process. 40:1992;571-577.
20. Stewart G. W. An updating algorithm for subspace tracking. IEEE Trans. Signal Process. 40:1992;1535-1541.
21. Yang B. An extension of the PASTd algorithm to both rank and subspace tracking. IEEE Signal Process. Lett. 2:1995;179-182.
22. Wax M., Kailath T. Detection of signals by information theoretic criteria. IEEE Trans. Signal Process. 33:1985;387-392.
23. Tufts, D., Real, E., and Cooley, J.Fast approximate subspace tracking (FAST), in Proc of the ICASSP'97, April 1997, pp. 547-550.
24. Hua Y., Abed-Meraim K., Wax M. Blind system identification using minimum noise subspace. IEEE Trans. Signal Process. 45:1997;770-773.
25. Strobach P. Bi-iteration SVD subspace tracking algorithms. IEEE Trans. Signal Process. 45:1997;1222-1240.