A TQR-Iteration Based Adaptive SVD for Real Time Angle and Frequency Tracking

IEEE Transactions on Signal Processing

Volumn 42, Issue 4, 1994, Pages 914-926

  Dowling, Eric M ^a   Ammann, Larry P ^a   DeGroat, Ronald D ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; SIGNAL INTERFERENCE; WHITE NOISE;

ADAPTIVE MATRIX; ARRAY PROCESSING; FREQUENCY TRACKING;

SIGNAL PROCESSING;

EID: 0028408794     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.285654     Document Type: Article

References (47)

1. V. F. Pisarenko, “The retrieval of harmonics from a covariance function,” Geophys. J. Roy. Astron. Soc., vol. 33, pp. 347–366, 1973.
2. R. Schmidt, “Multiple emitter location and signal parameter estimation,” in Proc. RADC Spectrum Estimation Workshop, Oct. 1979.
3. R. Schmidt, “Multiple emitter location and signal parameter estimation,” IEEE Trans. Antenn. Propagat., vol. AP-34, Mar. 1986.
4. D. W. Tufts and R. Kumaresan, “Singular value decomposition and improved frequency estimation using linear prediction,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, pp. 671–675, Aug. 1982.
5. R. Kumaresan and D. W. Tufts, “Estimating the angles of arrival of multiple plane waves,” IEEE Trans. Aerosp. Electron. Syst., vol. AES-19, pp. 134–139, Jan. 1982.
6. B. D. VanVeen and R. A. Roberts, “Eigenstructrure based partially adaptive array design,” IEEE Trans. Antenn. Propagat., vol. 36, no. 3, pp. 650–662, 1988.
7. S. VanHuffel and J. Vandewalle, The Total Least Squares Problem: Computational Aspects and Analysis. Philadelphia: Siam, 1991.
8. K. Fukunaga, Introduction to Statistical Pattern Recognition. New York: Academic, 1972.
9. G. H. Golub and C. F. VanLoan, Matrix Computations, 2nd ed. Baltimore, MD: Johns Hopkins University Press, 1989.
10. G. H. Golub, “Some modified matrix eigenvalue problems,” SIAM Rev., vol. 15, pp. 318–334, 1973.
11. J. R. Bunch and C. P. Nielsen, “Rank one modification of the symmetric eigenproblem,” Numer. Math., vol. 31, pp. 31-48, 1978.
12. J. R. Bunch and C. P. Nielson, “Updating the singular value decomposition,” Numer. Math., pp. 111–129, 1978.
13. R. Schreiber, “Implementation of adaptive array algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 1038–1045, Oct. 1986.
14. I. Karasalo, “Estimating the convariance matrix by signal subspace averaging,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 8–12, Feb. 1986.
15. R. D. DeGroat and R. A. Roberts, “Efficient, numerically stablized rank-one eigenstructure updating,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 38, pp. 301–316, Feb. 1990.
16. K. B. Yu, “Recursive updating the eigenvalue decomposition of a covariance matrix,” IEEE Trans. Signal Processing, vol. 39, pp. 1136–1145, May 1991.
17. N. L. Owsley, “Adaptive data orthogonalization,” in Proc. ICASSP, 1978.
18. J. F. 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, Feb. 1988.
19. J. Karhunen, “Adaptive algorithms for estimating eigenvectors of correlation type matrices,” in Proc. Int. Conf. Acoust., Speech, Signal Processing, 1984, pp. 14.6.1-14.6.4.
20. M. Moonen, P. VanDooren, and J. Vanderwalle, “Updating singular value decompositions. A parallel implementation,” in Proc. SPIE Advanced Algorithms, Architectures for Signal Processing (San Diego, CA), 1989, pp. 80–91.
21. W. Ferzali and J. G. Proakis, “Adaptive SVD algorithm and applications,” in SVD and Signal Processing II. New York: Elsevier, 1992.
22. P. Comon and G. H. Golub, “Tracking a few extreme singular values and vectors in signal processing,” Proc. IEEE, vol. 78, pp. 1327–1343, Aug. 1990.
23. D. R. Fuhrmann, “An algorithm for subspace computation, with applications in signal processing,” SIAM J. Matrix Anal., Applicat., vol. 9, pp. 213–220, Apr. 1988.
24. G. Xu, H. Zha, G. Golub, and T. Kailath, “Fast and robust algorithms for updating signal subspaces,” IEEE Trans. Circuits Syst, to be published.
25. R. D. DeGroat, “Non-iterative subspace tracking,” IEEE Trans. Signal Processing, vol. 40, pp. 571–577, Mar. 1992.
26. R. D. DeGroat and E. M. Dowling, “Non-iterative subspace updating,” in Proc. SPIE Advanced Signal Processing Algorithms, Architectures, Implementations II (San Diego, CA), July 1991, pp. 376–387.
27. G. W. Stewart, “An updating algorithm for subspace tracking,” IEEE Trans. Signal Processing, vol. SP-40, pp. 1535–1541, June 1992.
28. G. Adams, M. F. Griffin and G. W. Stewart, “Direction of arrival estimation using the rank revealing URV decomposition,” in Proc. ICASSP’91 (Toronto, Canada), 1991, pp. 1385–1388.
29. M. F. Griffin and G. W. Stewart, “Updating MUSIC and root-MUSIC with the rank revealing URV decomposition,” in Proc. Twenty-fifth Asilomar Conf. Signals, Syst., Comput., Nov. 1991, 277–281.
30. M. F. Griffin, E. C. Boman, and G. W. Stewart, “Min-norm updating with the rank reveling URV decomposition,” in Proc. Int. Conf. Acoust., Speech, Signal Processing, Mar. 1992, pp. V293-V296.
31. M. P. Fargues, “Tracking moving sources using the rank revealing QR factorization,” in Proc. Twenty-fifth Asilomar Conf. Signals, Syst. Comput., Nov. 1991, pp. 292–295.
32. E. M. Dowling and R. D. DeGroat, “Adaptation dynamics of the spherical subspace tracker,” IEEE Trans. Signal Processing, pp. 2599–2602, Oct. 1992.
33. R. D. DeGroat and E. M. Dowling, “Spherical subspace tracking: Analysis, convergence and detection schemes,” 26th Annu. Asilomar Conf. Signals, Syst., Comput. (invited paper), Oct. 1992.
34. S. Prasad and B. Chandna, “Direction-of-arrival estimation using the rank revealing QR factorization,” IEEE Trans. Signal Processing, vol. 39, pp. 1224–1229, May 1991.
35. T. F. Chan, “Rank revealing QR factorizations,” Linear Algebra, Applicat., vol. 88/89, pp. 67–82, 1987.
36. A. H. Abdallah and Y. H. Hu, “Parallel VLSI computing array implementation for signal subspace updating algorithm,” IEEE Trans. Acoust. Speech, Signal Processing, vol. 37, pp. 742–748, May 1989.
37. S. Erlich and K. Yao, “Architecture for adaptive eigenstructure decomposition based on systolic QRD,” in Proc. SPIE Adaptive Signal Processing (San Diego, CA), 47–55, July 1991.
38. G. W. Stewart, “Updating URV decompositions in parallel,” tech, rep., Dept, of Comput. Sci., Univ. of MD, College Park, 1992.
39. L. P. Ammann, “Robust singular value decompositions—a new approach to projection pursuit,” J. Amer. Stat. Assoc., vol. 88, pp. 505–514, June 1993.
40. R. Roy and T. Kailath, “Esprit-estimation of signal parameters via rotational invariance techniques,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, pp. 984–995, July 1989.
41. E. M. Dowling, L. P. Ammann, and R. D. DeGroat, “SVD tracking with TQR iterations,” UTD Tech. Rep., 1992.
42. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems. Englewood Cliffs, NJ: Prentice-Hall, 1974.
43. S. Haykin, Adaptive Filter Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1991.
44. W. M. Gentleman and H. T. Kung, ‘‘Matrix triangularization by systolic arrays,” in Proc. SPIE Real Time Signal Processing IV, 1981, pp. 19–26.
45. S. Haykin, Modern Filters. New York: Macmillan, 1989.
46. R. P. Brent and F. T. Luk, “The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays,” SIAM J. Sci. Statist. Comput., vol. 6, pp. 69–84, Jan. 1985.
47. S. Y. Kung, VLSI Array Processors. Englewood Cliffs, NJ: Prentice-Hall, 1988.