A Multipath Pairing Method Based on Matrix Pencil
Xiaolong Yang, Quanchen Li, Qi Li, Mu Zhou, Yong Wang, Wei Nie
Abstract
Xiaolong Yang, Quanchen Li, Qi Li, Mu Zhou, Yong Wang, Wei Nie
Abstract
In this paper, an improved pairing method is proposed to solve the multi-pole problem in the parameter estimation of matrix pencil (MP) algorithm and its derivatives in a multipath environment. This method distinguishes eigenvalues obtained by decomposing the spatial dimension matrix, further constructs eigenvalues of the time dimension, and finally updates eigenvalues. Simulation results show that the MP algorithm based on this method avoids the failed pairing caused by the multiplicity of eigenvalues and achieves more accurate parameter estimation.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, an improved pairing method is proposed to solve the multi-pole problem in the parameter estimation of matrix pencil (MP) algorithm and its derivatives in a multipath environment. This method distinguishes eigenvalues obtained by decomposing the spatial dimension matrix, further constructs eigenvalues of the time dimension, and finally updates eigenvalues. Simulation results show that the MP algorithm based on this method avoids the failed pairing caused by the multiplicity of eigenvalues and achieves more accurate parameter estimation.
Key concepts: Pairing, Matrix pencil, Eigenvalues and eigenvectors, Eigendecomposition of a matrix, Pencil (optics), Dimension (graph theory), Algorithm, Multipath propagation