Parallel VLSI Matrix Pencil Algorithm for High Resolution Direction Finding

IEEE Transactions on Signal Processing

Volumn 39, Issue 2, 1991, Pages 383-394

  van der Veen, Alle Jan ^a   Deprettere, Ed F ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; DIRECTION FINDING SYSTEMS; MATHEMATICAL TECHNIQUES - ESTIMATION;

ARRAY PROCESSING; BEARING ESTIMATION; CORDIC PROCESSORS; DIRECTION OF ARRIVAL ESTIMATION; MATRIX PENCIL ALGORITHM;

SIGNAL PROCESSING;

EID: 0026105510     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.80822     Document Type: Article

References (29)

1. A. J. van der Veen and E. F. Deprettere, “A parallel VLSI direction finding algorithm,” Proc. SPIE Int. Soc. Opt. Eng., vol. 975, pp. 289–299, 1988.
2. G. Cohen, D. Dubois, J. P. Quadrat, and M. Vlot, “A linear-system-theoretic system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing,” IEEE Trans. Automat. Contr., vol. AC-30, no. 3, pp. 210–220, 1985.
3. K. Jainandunsing and E. F. Deprettere, “A new class of highly structured algorithms for solving systems of linear equations,” SIAM J. Sci. Stat. Comput., Sept. 1989.
4. R. Roy, “ESPRIT,” Ph.D. dissertation, Stanford University, Stanford, CA, 1987.
5. G. W. Stewart, “A Jacobi-like algorithm for computing the Schur decomposition of a non-Hermitian matrix,” SIAM J. Sci. Stat. Comput., vol. 6, pp. 853–864, 1985.
6. A. Paulraj, R. Roy, and T. Kailath, “A subspace rotation approach to signal parameter estimation,” Proc. IEEE, vol. 74, no. 7, pp. 1044–1045, 1986.
7. B. Ottersten and T. Kailath, “ESPRIT for wide-band signals,” in Proc. 21st Asilomar Conf. Signal Syst. Comput., 1988, pp. 98–102.
8. S. Y. Kung, VLSI Array Processors. Englewood Cliffs, NJ: Prentice-Hall, 1987.
9. V. U. Reddy, A. Paulray, and T. Kailath, “Lecture notes on array signal processing,” Stanford University, Stanford, CA, 1987.
10. G. H. Golub and C. F. van Loan, Matrix Computations. Baltimore, MD: John Hopkins University Press, 1984.
11. J. M. Speiser, “Some observations concerning the ESPRIT direction finding method,” Proc. SPIE Int. Soc. Opt. Eng., vol. 826, pp. 178–185, 1987.
12. C. F. van Loan, “A unitary method for the ESPRIT direction-of-arrival of-arrival estimation algorithm,” Proc. SPIE Int. Soc. Opt. Eng., vol. 826, pp. 170–176, 1987.
13. H. Ouibrahim, D. D. Weiner, and T. K. Sarkar, “A generalized approach to direction finding,” presented at IEEE Mil. Comm. Conf., 1986.
14. G. H. Golub and C. F. van Loan, “An analysis of the total least squares problem,” SIAM J. Numer. Anal., vol. 17, no. 6, pp. 883–892, 1980.
15. S. van Huffel, “Analysis of the TLS problem and its use in parameter estimation: Computation, properties, and applications,” Ph.D. dissertation, Kath. University Louvain, Louvain, Belgium, 1987.
16. F. T. Luk, “Architectures for computing eigenvalues and SVD’s,” Proc. SPIE Int. Soc. Opt. Eng., vol. 614, pp. 24–33, 1986.
17. R. P. Brent, F. T. Luk, and C. F. van Loan, “Computation of the singular value decomposition using mesh-connected processors,” J. VLSI Comput. Syst., vol. 3, 242–270, 1985.
18. R. P. Brent and F. T. Luk, “The solution of singular value and symmetric eigenvalue problems on multiprocessor arrays,” SIAM J. Sci. Stat. Comput., vol. 6, 69–84, 1985.
19. U. Schwiegelshohn and L. Thiele, “A systolic array for cyclic-by-rows by-rows Jacobi algorithms,” J. Parallel Distributed Comput., vol. 4, pp. 334–340, 1987.
20. P. J. Eberlein, “On the Schur decomposition of a matrix for parallel computation,” IEEE Trans. Comput., vol. C-36, pp. 167–174, 1987.
21. K. V. Fernando, “Global convergence of the cyclic Kogbetliantz method,” Numerical Algorithms Group Ltd., Oxford, NAG Tech. Rep., 1986.
22. F. T. Luk, “On the equivalence and convergence of parallel Jacobi SVD algorithms,” Proc. SPIE Int. Soc. Opt. Eng., vol. 826, pp. 152–159, 1987.
23. J. E. Voider, “The CORDIC trigonometric computing technique,” IEEE Trans. Electron. Comput., vol. EC-9, pp. 227–231, 231, 1960.
24. J. R. Cavallaro and F. T. Luk, “CORDIC arithmetic for an SVD processor,” in IEEE Proc. 8th Symp. Comp. Arithmetic, 1987, pp. 113–120.
25. J. M. Delosme, “A processor for two-dimensional symmetric eigenvalue genvalue and singular value arrays,” in Proc. 21st Asilomar Conf. Signal Syst. Comput., 1988, pp. 217–221.
26. A. A. J. de Lange, A. van der Hoeven, J. Bu, and E. F. Deprettere, tere, “A floating-point pipelined CMOS CQRDIC processor,” in Proc. ISCAS’88, 1988.
27. F. T. Luk, “A parallel method for computing the generalized SVD,” J. Parallel Distributed Comput., vol. 2, pp. 250–260, 1985.
28. C. B. Moler and G. W. Stewart, “An algorithm for generalized matrix eigenvalue problems,” SIAM J. Numer. Anal., vol. 10, no. 2, pp. 241–256, 1973.
29. P. Van Dooren and J. P. Charlier, “Jacobi-like algorithm for computing the generalized Schur form of a regular pencil,” Proc. SPIE Int. Soc. Opt. Eng., vol. 1152, Aug. 1989.