Sequential matrix diagonalization algorithms for polynomial EVD of parahermitian matrices

Tools

Redif, Soydan and Weiss, Stephan and McWhirter, John G. (2015) Sequential matrix diagonalization algorithms for polynomial EVD of parahermitian matrices. IEEE Transactions on Signal Processing, 63 (1). pp. 81-89. ISSN 1053-587X (https://doi.org/10.1109/TSP.2014.2367460)

[thumbnail of Redif-etal-IEEETSP-2015-Sequential-matrix-diagonalization-algorithms]
Preview
 PDF. Filename: Redif_etal_IEEETSP_2015_Sequential_matrix_diagonalization_algorithms.pdf
Accepted Author Manuscript
Download (853kB)| Preview

Abstract

For parahermitian polynomial matrices, which can be used, for example, to characterise space-time covariance in broadband array processing, the conventional eigenvalue decomposition (EVD) can be generalised to a polynomial matrix EVD (PEVD). In this paper, a new iterative PEVD algorithm based on sequential matrix diagonalisation (SMD) is introduced. At every step the SMD algorithm shifts the dominant column or row of the polynomial matrix to the zero lag position and eliminates the resulting instantaneous correlation. A proof of convergence is provided, and it is demonstrated that SMD establishes diagonalisation faster and with lower order operations than existing PEVD algorithms.

ORCID iDs

Redif, Soydan, Weiss, Stephan ORCID logoORCID: https://orcid.org/0000-0002-3486-7206 and McWhirter, John G.;
CORE (COnnecting REpositories)