Projection Approximation Subspace Tracking

IEEE Transactions on Signal Processing

Volumn 43, Issue 1, 1995, Pages 95-107

  Yang, Bin ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; LEAST SQUARES APPROXIMATIONS; MATRIX ALGEBRA; SIGNAL THEORY; VECTORS;

BATCH EIGENVALUE DECOMPOSITION; EIGENCOMPONENTS; PROJECTION APPROXIMATION SUBSPACE TRACKING; SIGNAL SUBSPACE; UNCONSTRAINED MINIMIZATION PROBLEM;

SIGNAL PROCESSING;

EID: 0029196852     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.365290     Document Type: Article

References (32)

1. R. O. Schmidt, “Multiple emitter location and signal parameter estimation,” in Proc. RADC Spectrum Estimation Workshop, 1979, pp. 243-258.
2. R. Kumaresan and D. W. Tufts, “Estimating the angles of arrival of multiple plane waves,” IEEE Trans. Aerospace Electron. Syst., vol. AES-19, pp. 134-139, 1983.
3. R. Roy and T. Kailath, “ESPRIT—estimation of signal parameters via rotational invariance techniques,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, 1989.
4. M. Viberg. B. Ottersten, and T. Kailath, “Detection and estimation in sensor arrays using weighted subspace fitting,” IEEE Trans. Signal Processing, vol. 39, pp. 2436-2449, 1991.
5. W. K. Pratt, Digital Image Processing. New York: Wiley, 1978.
6. P. Comon and G. H. Golub, “Tracking a few extreme singular values and vectors in signal processing,” Proc. IEEE, pp. 1327-1343, Aug. 1990.
7. N. L. Owsley, “Adaptive data orthogonalizaiton,” in Proc. IEEE ICASSP, 1978, pp. 109-112.
8. D. W. Tufts and C. D. Melissinos, “Simple, effective computation of principal eigenvectors and their eigenvalues and applications to high-resolution estimation of frequencies,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 1046-1053, 1986.
9. K. C. Sharman, “Adaptive algorithms for estimating the complete covariance eigenstructure,” in Proc. IEEE ICASSP (Tokyo, Japan), Apr. 1986, pp. 1401-1404.
10. M. Moonen. P. van Dooren, and J. Vandewalle, “Updating singular value decompositions: A parallel implementation,” in Proc. SPIE Adv. Algorithms Architectures Signal Processing (San Diego, CA), Aug. 1989, pp. 80-91.
11. J. R. Bunch, C. P. Nielsen, and D. Sorenson, “Rank-one modification of the symmetric eigenproblem,” Numerische Mathematik, vol. 31, pp. 31-48, 1978.
12. I. Karasalo, “Estimating the covariance matrix by signal subspace averaging,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, 8-12, 1986.
13. R. D. DeGroat, “Noniterative subspace tracking,” IEEE Trans. Signal vol. 40, 571-577, 1992.
14. P. A. Thompson, “An adaptive spectral analysis technique for unbiased frequency estimation in the presence of white noise,” in Proc. 13th Asilomar Conf. Circ. Syst. Comput., Nov. 1980, pp. 529-533.
15. E. Oja, “A simplified neuron model as a principal component analyzer,” J. Math. Bio., vol. 15, pp. 267-273, 1982.
16. J. Karhunen and E. Oja, “New methods for stochastic approximation of truncated Karhunen- Loeve expansions,” in Proc. 6th Int. Conf. Part. Recogn., Oct. 1982, pp. 550-553.
17. J. Karhunen, “Adaptive algorithms for estimating eigenvectors of correlation type matrices,” in Proc. IEEE ICASSP (San Diego, CA), Mar. 1984, pp. 14.6.1-14.6.4.
18. J. Yang and M. Kaveh, “Adaptive eigensubspace algorithms for direction or frequency estimation and tracking,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 36, pp. 241-251, 1988.
19. S. Y. Kung, Digital Neural Processing. Englewood Cliffs, NJ: Prentice Hall, 1993.
20. V. U. Reddy, B. Egardt, and T. Kailath, “Least squares type algorithm for adaptive implementation of Pisarenko's harmonic retrieval method,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, 1982.
21. S. Bannour and M. R. Azimi-Sadjadi, “An adaptive approach for optimal data reduction using recursive least squares learning method,” in Proc. IEEE ICASSP (San Francisco, CA), Mar. 1992, pp. II297-II300.
22. X. Yang, T. K. Sarkar. and E. Arvas, “A survey of conjugate gradient algorithms for solution of extreme eigen-problems of a symmetric matrix,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, pp. 1550-1556, 1989.
23. G. W. Stewart, “An updating algorithm for subspace tracking,” IEEE Trans. vol. 40, 1535-1541, 1992.
24. C. H. Bischof and G. M. Shroff, “On updating signal subspaces,” IEEE Trans. Signal Processing, vol. 40, pp. 96-105, 1992.
25. G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD: Johns Hopkins University Press, 1989, 2nd ed.
26. B. Yang, “Subspace tracking based on the projection approach and the recursive least squares method,” in Proc. IEEE ICASSP (Minneapolis, MN), 1993, IV145-IV148.
27. S. Haykin, Adaptive Filter Theorey. Englewood Cliffs, NJ: Prentice Hall, 1991, 2nd ed.
28. B. Yang and J. F. Bohme, “Rotation based RLS algorithms: Unified derivations, numerical properties and parallel implementations,” IEEE Trans. Signal Processing, vol. 40, pp. 1151-1167, 1992.
29. M. Wax and T. Kailath, “Detection of signals by information theoretic criteria,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 387-392, 1985.
30. B. Yang and F. Gersemsky, “An adaptive algorithm of linear computational complexity for both rank and subspace tracking,” in Proc. IEEE ICASSP (Adelaide), Apr. 1994.
31. H. B. Lee, “Eigenvalues and eigenvectors of covariance matrices for signals closely spaced in frequency,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 40, pp. 2518-2535, 1992.
32. D. H. Brandwood, “A complex gradient operator and its application in adaptive array theory,” Proc. Inst. Elect. Eng., vol. 130, pp. 11-16, 1983.