This paper studies on a fast approach for the eigenproblems of correlation matrices used in direction-of-arrival (DOA) estimation algorithms, especially for the case that the number of arriving waves is a few. The eigenvalues and the corresponding eigenvectors can be obtained in a very short time by the algebraic solvent of up to quartic polynomials. We also confirm that the present approach does not make the accuracy worse when it is implemented by finite word-length processors like digital signal processor (DSP) or field programmable gate array (FPGA).
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Koichi ICHIGE, Masashi SHINAGAWA, Hiroyuki ARAI, "A Fast Algebraic Approach to the Eigenproblems of Correlation Matrices in DOA Estimation" in IEICE TRANSACTIONS on Communications,
vol. E86-B, no. 2, pp. 865-869, February 2003, doi: .
Abstract: This paper studies on a fast approach for the eigenproblems of correlation matrices used in direction-of-arrival (DOA) estimation algorithms, especially for the case that the number of arriving waves is a few. The eigenvalues and the corresponding eigenvectors can be obtained in a very short time by the algebraic solvent of up to quartic polynomials. We also confirm that the present approach does not make the accuracy worse when it is implemented by finite word-length processors like digital signal processor (DSP) or field programmable gate array (FPGA).
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e86-b_2_865/_p
Copy
@ARTICLE{e86-b_2_865,
author={Koichi ICHIGE, Masashi SHINAGAWA, Hiroyuki ARAI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Fast Algebraic Approach to the Eigenproblems of Correlation Matrices in DOA Estimation},
year={2003},
volume={E86-B},
number={2},
pages={865-869},
abstract={This paper studies on a fast approach for the eigenproblems of correlation matrices used in direction-of-arrival (DOA) estimation algorithms, especially for the case that the number of arriving waves is a few. The eigenvalues and the corresponding eigenvectors can be obtained in a very short time by the algebraic solvent of up to quartic polynomials. We also confirm that the present approach does not make the accuracy worse when it is implemented by finite word-length processors like digital signal processor (DSP) or field programmable gate array (FPGA).},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - A Fast Algebraic Approach to the Eigenproblems of Correlation Matrices in DOA Estimation
T2 - IEICE TRANSACTIONS on Communications
SP - 865
EP - 869
AU - Koichi ICHIGE
AU - Masashi SHINAGAWA
AU - Hiroyuki ARAI
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2003
AB - This paper studies on a fast approach for the eigenproblems of correlation matrices used in direction-of-arrival (DOA) estimation algorithms, especially for the case that the number of arriving waves is a few. The eigenvalues and the corresponding eigenvectors can be obtained in a very short time by the algebraic solvent of up to quartic polynomials. We also confirm that the present approach does not make the accuracy worse when it is implemented by finite word-length processors like digital signal processor (DSP) or field programmable gate array (FPGA).
ER -