Fast Algorithms for Updating Signal Subspaces

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

Volumn 41, Issue 8, 1994, Pages 537-549

  Xu, Guanghan ^a   Zha, Hongyuan ^b   Golub, Gene ^c   Kailath, Thomas ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS; REAL TIME SYSTEMS; SIGNAL THEORY; STATE ESTIMATION; VECTORS;

COVARIANCE MATRICES; DATA MATRICES; EIGENDECOMPOSITION; SIGNAL SUBSPACES; SINGULAR VALUE DECOMPOSITION;

DIGITAL SIGNAL PROCESSING;

EID: 0028482633     PISSN: 10577130     EISSN: None     Source Type: Journal    
DOI: 10.1109/82.318942     Document Type: Article

References (27)

1. J. R. Bunch, C. P. Nielsen, and D. C. Sorensen, “Rank-one modification of the symmetric eigenproblem,” Numerische Mathematik, vol. 31, pp. 31–48, 1978.
2. J. R. Bunch and C. P. Nielsen, “updating the singular value decomposition,” Numerische Mathematik, vol. 31, pp. 111–129, 1978.
3. G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD: Johns Hopkins Univ. Press, 1990.
4. P. Comon and G. Golub, “Tracking a few extreme singular values and vectors in signal processing,” Proc. IEEE, vol. 78, pp. 1327–1343, Aug. 1990.
5. G. Golub and W. Kahan, “Calculating the singular values and pseudoinverse of a matrix,”SIAM J. Numerical Anal., vol. 2, pp. 205–224, 1965.
6. P. Comon, “Fast updating of a low-rank approximation to a varying hermitian matrix,” in Proc. 22nd Asilomar Conf. Sig., Syst. Comput., Pacific Grove, CA, Nov. 1988, vol. 1, pp 358–362.
7. J. F. Yang and M. Kaveh, “Adaptive eigensubspace algorithms for direction or frequency estimation and tracking,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-36, pp. 241–251, Feb. 1988.
8. D. R. Fuhrmann, “An algorithm for subspace computation with applications in signal processing,” SIAM J. Matrix Anal. App., vol. 9, no. 1, 1988.
9. W. R. Femg, G. H. Golub, and R. J. Plemmons, “Lanczos methods for recursive condition estimation,” Numerical Algorithm, vol. 1. pp. 1–20, 1991.
10. G. W. Stewart, “An updating algorithm for signal subspace tracking,” Tech. Rep. CS-TR 2494, Univ. Maryland, Comput. Sci. Tech. Rep., College Park, MD, 1990.
11. M. F. Griffin and G. W. Stewart, “Updating MUSIC and root-MUSIC with the rank-revealing URV decomposition,” in Proc. 25th Asilomar Conference on Sig., Syst. Comput., Pacific Grove, CA, Nov. 1991, pp. 277–281.
12. M. F. Griffin, E. C. Boman, and G. W. Stewart, “Minimum-norm updating with the rank-revealing URV decomposition,” in Proc. ICASSP’92, San Francisco, CA, 1992, pp. 293–296.
13. I. Karasalo, “Estimating the covariance matrix by signal subspace averaging,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 8–12, Jan. 1986.
14. R. DeGroat and R. Roberts, “Efficient, numerically stabilized rankone eigenstructure updating,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 301–316, Oct. 1986.
15. R. DeGroat, “Noniterative subspace tracking,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 38, pp. 571–577, Mar. 1992.
16. G. Xu and T. Kailath, “A fast algorithm for signal subspace decomposition and its performance analysis,” in Proc. ICASSP 91 Conf., Toronto, ON, Canada, May 1991, vol. 5, pp. 3069–3072.
17. G. Xu, “Fast subspace decomposition and its applications,” Ph. D. dissertation, Stanford University, Stanford, CA, Sept. 1991.
18. T. W. Anderson, “Asymptotic theory for principal component analysis,” Ann. Math. Statist., vol. 34, pp. 122–148, 1963.
19. G. H. Golub, “Matrix decompositions and statistical computation,” in Statistical Computation, R. C. Milton and J. A. Nelder, eds. New York: Academic Press, 1969, pp. 365–397.
20. M. Wax and T. Kailath, “Detection of signals by information theoretic criteria,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 387–392, Apr. 1985.
21. W. F. Stout, Almost Sure Convergence. New York: Academic Press, 1974.
22. G. Xu and T. Kailath, “Fast subspace decomposition,” IEEE Trans. Sig. Proc., vol. 42, pp. 539–551, Mar. 1994.
23. P. E. Gill, C. H. Golub, W. Murray, and A. Saunders, “Methods for modifying matrix factorizations,” Math. Comp., vol. 28, no. 126, pp. 505–535, Apr. 1974.
24. R. Onn, A. Steinhardt, and A. Bojanczyk, “Hyperbolic singular value decomposition and applications,” IEEE Trans. Sig. Proc., vol. 39, July 1991.
25. C. C. Paige, “The computation of eigenvalues and eigenvectors of very large sparse matrices,” Ph. D. dissertation, Univ. London, London, U.K., 1971.
26. A. Paulraj, R. Roy, and T. Kailath, “A subspace rotation approach to signal parameter estimation},” Proc. IEEE, vol. 74 pp. 1044–1045, July 1986.
27. R. Roy and T. Kailath, “ESPRIT—Estimation of signal parameters via rotational invariance techniques,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 32, pp. 984–995, July 1989.