EIGENVALUE SHIFT SUPERRESOLUTION ALGORITHM

Zhang Yongjun; Chen Zongzhi

Volume 18 Issue 5

Sep. 1996

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1996 > 18(5): 449-454

Zhang Yongjun, Chen Zongzhi . EIGENVALUE SHIFT SUPERRESOLUTION ALGORITHM[J]. Journal of Electronics & Information Technology, 1996, 18(5): 449-454.

Citation:

Zhang Yongjun, Chen Zongzhi . EIGENVALUE SHIFT SUPERRESOLUTION ALGORITHM[J]. Journal of Electronics & Information Technology, 1996, 18(5): 449-454.

Zhang Yongjun, Chen Zongzhi . EIGENVALUE SHIFT SUPERRESOLUTION ALGORITHM[J]. Journal of Electronics & Information Technology, 1996, 18(5): 449-454.

Citation:

Zhang Yongjun, Chen Zongzhi . EIGENVALUE SHIFT SUPERRESOLUTION ALGORITHM[J]. Journal of Electronics & Information Technology, 1996, 18(5): 449-454.

PDF( 760 KB)

EIGENVALUE SHIFT SUPERRESOLUTION ALGORITHM

Zhang Yongjun^{①;陈宗骘},
Chen Zongzhi

Received Date: 1994-11-16
Rev Recd Date: 1995-04-13
Publish Date: 1996-09-19

Abstract

Abstract

The convergence of the inverse correlation matrix iteration algorithm is analyzed. In order to avoid computing the inverse correlation matrix in the algorithm, this paper presents an eigenvalue shift iteration algorithm, and analyzes its convergence. Finally, the simulated results are given.

FullText(HTML)

References(1)

References

Durrani T S, Sharman K C. IEE Proc一F, 1983, 130(1): 22-28.[2]Ziskind I, Wax M. IEEE Trans. on ASSP, 1988, ASSP-36(10): 1553-1560.[3]Marcos S, Benidier M. On high resolution array processing non-based on the eigenanalysis approach, Proc. of ICASSP, Abuquerque, New Mexico, U. S. A. 1990: 2956-2959.

Relative Articles

Supplements(0)

Cited By

Proportional views