期刊
IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 71, 期 -, 页码 1642-1656出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2023.3269664
关键词
Eigenvalue decomposition; parahermitian matrix factorisation; analytic functions; phase retrieval; quadratic programming with quadratic constraints
By analyzing parahermitian matrices, we can obtain an eigenvalue decomposition with analytic eigenvalues and eigenvectors. However, determining analytic eigenvectors is not straightforward, and we propose an iterative algorithm that converges to the best stationary point for extracting analytic eigenvectors.
An analytic parahermitian matrix admits in almost all cases an eigenvalue decomposition (EVD) with analytic eigenvalues and eigenvectors. We have previously defined a discrete Fourier transform (DFT) domain algorithm which has been proven to extract the analytic eigenvalues. The selection of the eigenvalues as analytic functions guarantees in turn the existence of unique one-dimensional eigenspaces in which analytic eigenvectors can exist. Determining such eigenvectors is not straightforward, and requires three challenges to be addressed. Firstly, one-dimensional subspaces for eigenvectors have to be woven smoothly across DFT bins where a non-trivial algebraic multiplicity causes ambiguity. Secondly, with the one-dimensional eigenspaces defined, a phase smoothing across DFT bins aims to extract analytic eigenvectors with minimum time domain support. Thirdly, we need to check whether the DFT length, and thus the approximation order, is sufficient. We propose an iterative algorithm for the extraction of analytic eigenvectors and prove that this algorithm converges to the best of a set of stationary points. We provide a number of numerical examples and simulation results, in which the algorithm is demonstrated to extract the ground truth analytic eigenvectors arbitrarily closely.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据