Fast Subspace Decomposition

IEEE Transactions on Signal Processing

Volumn 42, Issue 3, 1994, Pages 539-551

  Xu, Guanshan ^a   Kailath, Thomas ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; SPECTRUM ANALYSIS;

ARRAY SIGNAL PROCESSING; SUBSPACE DECOMPOSITION; SYSTEM IDENTIFICATION;

SIGNAL PROCESSING;

EID: 0028385915     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.277846     Document Type: Article

References (36)

1. V. F. Pisarenko, “The retrieval of harmonics from a covariance function,” Geophys. J. Roy. Astron. Soc., vol. 33, pp. 347–366, 1973.
2. J. A. Cadzow, “Spectral estimation: An overdetermined rational model equation approach,” Proc. IEEE, vol. 70, 907–939, Sept. 1982.
3. D. W. Tufts and R. Kumaresan, “Estimation of frequencies of multiple sinusoids: Making linear prediction perform like maximum likelihood,” Proc. IEEE, vol. 70, no. 9, pp. 975–989, Sept. 1982.
4. D. W. Tufts and R. Kumaresan, “Estimating the parameters of exponentially damped sinusoids and pole-zero modeling in noise,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, no. 6, pp. 883–840, Dec. 1982.
5. J. A. Cadzow, Y. Kim, D. C. Shiue, Y. Sun, and G. Xu, “Resolution of coherent signals using a linear array,” in Proc. ICASSP87 Conf., (Dallas), Apr. 1987, pp. 1597–1600, vol. 1.
6. R. O. Schmidt, “A signal subspace approach to multiple emitter location and spectral estimation,” Ph.D. thesis, Stanford Univ., Stanford, CA. Nov. 1981.
7. G. Bienvenu and L. Kopp, “Optimality of high resolution array processing,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, no. 5, pp. 953–964, Oct. 1983.
8. D. H. Johnson and S. R. DeGraaf, “Improving the resolution of bearing in passive sonar arrays by eigenvalue analysis,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, no. 4, pp. 638–647, Aug. 1982.
9. H. Wang and M. Kaveh, “Coherent signal-subspace processing for detection and estimation of angles of arrival of multiple wide-band sources,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, no. 5, pp. 823–831, Oct. 1985.
10. R. H. Roy, “ESPRIT, Estimation of signal parameters via rotational invariance techniques,” Ph.D. thesis, Stanford Univ., Stanford, CA, Aug. 1987.
11. K. Buckley and L. Griffiths, “Direct broad-band array data processing for source location estimation,” in Proc. IEEE ASSP 3rd Workshop Spectrum Estimation Modeling, Nov. 1986, pp. 145–148, vol. 1.
12. B. E. Ottersten, “Parametric subspace fitting methods for array signal processing,” Ph.D. thesis, Stanford Univ., Stanford, CA, Dec. 1989.
13. M. Viberg, “Subspace fitting concepts in sensor array processing,” Ph.D. thesis, Linkoping Univ., Linkoping, Sweden, Oct. 1989.
14. J. A. Cadzow and O. M. Solomoner, “Algebraic approach to system identification,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, no. 3, pp. 462–468, June 1986.
15. G. Xu, J. A. Cadzow, and R. C. White, “A new system identification algorithm based on iterative algebraic filtering,” in Proc. ICASSP88 Conf., (New York), Apr. 1988, pp. 2232–2235, vol. 4.
16. J. A. Cadzow, “Signal enhancement—A composite property mapping algorithm,” IEEE Trans. Acoust. Speech Signal Processing, vol. 36, no. 1, pp. 49–62, Jan. 1988.
17. J. A. Cadzow and T. Chen, “Multidimensional recursive digital filter sythesis: A signal enhancement approach,” in Proc. 21st Asilomar Conf. Signals Syst. Comput., (Pacific Grove, CA), Nov. 1987, pp. 384–388, vol. 1.
18. D. W. Tufts and C. D. Melissinos, “Simple, effective computation of principal eigenvectors and their eigenvalues and application to high-resolution estimation of frequencies,” IEEE Trans. Acoust. Speech Signal Processing, vol. 5, no. 34, pp. 1046–1052, Oct. 1986.
19. J. P. Reilly, “A real-time high-resolution technique for angle-of-arrival estimation,” Proc. IEEE, vol. 75, no. 12, pp. 1692–1694, Dec. 1987.
20. P. Comon, “Fast updating of a low-rank approximation to a varying hermitian matrix,” in Proc. 22nd Asilomar Conf. Signals Syst. Comput., (Pacific Grove, CA), Nov. 1988, pp. 358–362, vol. 1.
21. P. Comon and G. Golub, “Tracking a few extreme singular values and vectors in signal processing,” Proc. IEEE, vol. 78, no. 8, pp. 1327–1343, Aug. 1990.
22. I. Karasalo, “Estimating the covariance matrix by signal subspace averaging,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-34, no. 1, pp. 8–12, Jan. 1986.
23. G. Xu and T. Kailath, “Fast signal subspace decomposition without eigendecomposition,” in Proc. 24th Asilomar Conf. Signals Syst. Comput., (Pacific Grove, CA), Nov. 1990, pp. 966–970, vol. 2.
24. W. F. Stout, Almost Sure Convergence. New York: Academic, 1974.
25. T. W. Anderson, “Asymptotic theory for principal component analysis,” Ann. Math. Stat., vol. 34, pp. 122–148, 1963.
26. G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD: Johns Hopkins University Press, 1990.
27. D. N. Lawley, “Test of significance of the latent roots of the covariance and correlation matrices,” Biometrica, vol. 43, pp. 128–136, 1956.
28. M. Wax and T. Kailath, “Detection of signals by information theoretic criteria,” IEEE Trans. Acoust., Speech Signal Processing, vol. 33, no. 2, 387–392, Apr. 1985.
29. B. N. Parlett, The Symmetric Eigenvalue Problem. Englewood Cliffs, NJ: Prentice-Hall, 1980.
30. G. Xu, “Fast subspace decomposition and its applications,” Ph.D. thesis, Stanford Univ., Stanford, CA, Sept. 1991.
31. M. S. Bartlett, “A note on the multiplying factors for various λ2 approximations,” J. Roy. Stat., Ser. B, vol. 16, pp. 296–298, 1954.
32. R. P. Gupta, “Asymptotic theory for principal component analysis in the complex case,” J. Indian Stat. Assoc., vol. 3, pp. 97–106, 1965.
33. K. V. Mardia, J. T. Kent, and J. M. Bibby, Multivariate Analysis. London: Academic, 1979.
34. L. C. Zhao, P. R. Krishnaiah, and Z. D. Bai, “On detection of the number of signals in presence of white noise,” J. Multivariate Anal., vol. 20, no. 1, pp. 1–25, Oct. 1986.
35. C. C. Paige, “The computation of eigenvalues and eigenvectors of very large sparse matrices,” Ph.D. thesis, Univ. London, 1971.
36. C. C. Paige, “Computational variants of the lanczos method for eigen-problem,” J. Inst. Math. Appl., vol. 10, pp. 373–381, 1987.