Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Generalized eigenvector problem for Hermitian Toeplitz matrices and its application to beamforming
Zhang L., Liu W., Peng B. Signal Processing92 (2):374-380,2012.Type:Article
Date Reviewed: Jun 21 2012

Zhang et al. present the problem of computing the output signal-to-interference-plus-noise ratio (SINR) as a generalized eigenvalue problem involving two symmetric positive definite Toeplitz matrices, the correlation matrix of the signal and the correlation matrix of noise plus interference. The significance of this problem in signal processing is in determining the direction of arrival of the interferences. The formulation is based upon the Capon beamformer [1]. The authors are also updating the work of Magi et al. [2].

The authors exploit the Toeplitz structure of the two correlation matrices to prove theorems about the eigenvectors computed above and the roots of a related filter function. The most important of these theorems is the last one, which shows that if the maximum or minimum eigenvalue is distinct, then all roots of the filter function lie on the unit circle of the complex plane. Subsequent sections of the paper explain the application of their result to beamforming and give a simple three-sensor array example.

I suggest that the authors read the work of Speiser and Van Loan [3], which gives an alternative formulation in terms of the generalized singular value decomposition. Their formulation of the generalized Toeplitz eigenproblem may be the best for exploiting Toeplitz structure, but it produces a nonsymmetric problem and the symmetry in this problem is easy to preserve. Overall, this paper gives an interesting update on a generalized eigenvalue problem arising in beamforming.

Reviewer:  Jesse L. Barlow Review #: CR140292 (1211-1161)
1) Capon, J. High-resolution frequency-wavenumber spectrum analysis. Proceedings of the IEEE 57, 8(1969), 1408–1418.
2) Magi, C.; Bdckstrvm, T.; Alku, P. Simple proofs of root locations of two symmetric linear prediction models. Signal Processing 88, 7(2008), 1894–1897.
3) Speiser, J.; Van Loan, C. Signal processing computations and the generalized singular value decomposition. In Real-Time Signal Processing VII SPIE, 1984, 47–57.
Bookmark and Share
  Editor Recommended
 
 
Eigenvalues And Eigenvectors (Direct And Iterative Methods) (G.1.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Eigenvalues And Eigenvectors (Direct And Iterative Methods)": Date
On two more Eigenvalue methods for an alternating sequential parallel system
Wallach Y. Computing 32(1): 33-41, 1984. Type: Article
Feb 1 1985
Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
Courtois P., Semal P. Journal of the ACM 31(4): 804-825, 1984. Type: Article
Jun 1 1985
Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
Grimes R., Simon H. (ed) ACM Transactions on Mathematical Software 14(3): 241-256, 1988. Type: Article
Mar 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy