Efficient Implementation of Iterative Polynomial Matrix EVD Algorithms Exploiting Structural Redundancy and Parallelisation

Fraser K. Coutts

doi:10.1109/TCSI.2019.2937006

Return

Efficient Implementation of Iterative Polynomial Matrix EVD Algorithms Exploiting Structural Redundancy and Parallelisation

2019-12-01

Fraser K. Coutts

Ian K. Proudler

Stephan Weiss *

DOI：10.1109/TCSI.2019.2937006

Original

Save

View PDF

Abstract

En 中文

A number of algorithms are capable of iteratively calculating a polynomial matrix eigenvalue decomposition (PEVD), which is a generalisation of the EVD and will diagonalise a parahermitian polynomial matrix via paraunitary operations. While offering promising results in various broadband array processing applications, the PEVD has seen limited deployment in hardware due to the high computational complexity of these algorithms. Akin to low complexity divide-and-conquer (DaC) solutions to eigenproblems, this paper addresses a partially parallelisable DaC approach to the PEVD. A novel algorithm titled parallel-sequential matrix diagonalisation exhibits significantly reduced algorithmic complexity and run-time when compared with existing iterative PEVD methods. The DaC approach, which is shown to be suitable for multi-core implementation, can improve eigenvalue resolution at the expense of decomposition mean squared error, and offers a trade-off between the approximation order and accuracy of the resulting paraunitary matrices.

Keywords:

Covariance matrices

Matrix decomposition

Eigenvalues and eigenfunctions

Broadband communication

Iterative algorithms

Hardware

Signal processing algorithms

Parahermitian matrix

paraunitary matrix

polynomial matrix eigenvalue decomposition

parallel

algorithm

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.