Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm

Tools

Corr, J and Thompson, K and Weiss, S and Proudler, I K and McWhirter, J G; (2015) Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm. In: 2nd IET International Conference on Intelligent Signal Processing 2015. IET, GBR, pp. 1-5. ISBN 9781785611360

[thumbnail of Corr-etal-ISP-2015-multiple-shift-maximum-element-sequential-matrix-diagonalisation]
Preview
 Text. Filename: Corr_etal_ISP_2015_multiple_shift_maximum_element_sequential_matrix_diagonalisation.pdf
Accepted Author Manuscript
Download (161kB)| Preview

Abstract

The Multiple Shift Maximum Element Sequential Matrix Diagonalisation (MSME-SMD) algorithm is a powerful but costly method for performing approximate polynomial eigenvalue decomposition (PEVD) for space-time covariance-type matrices encountered in e.g. broadband array processing. This paper discusses a newly developed search method that restricts the order growth within the MSME-SMD algorithm. In addition to enhanced control of the polynomial degree of the paraunitary and parahermitian factors in this decomposition, the new search method is also computationally less demanding as fewer elements are searched compared to the original while the excellent diagonalisation of MSME-SMD is maintained.

ORCID iDs

Corr, J ORCID logoORCID: https://orcid.org/0000-0001-9900-0796, Thompson, K ORCID logoORCID: https://orcid.org/0000-0003-0727-7347, Weiss, S ORCID logoORCID: https://orcid.org/0000-0002-3486-7206, Proudler, I K and McWhirter, J G;
CORE (COnnecting REpositories)