Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm

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, Stevenage, pp. 1-5. ISBN 9781785611360

[img]
Preview
Text (Corr-etal-ISP-2015-multiple-shift-maximum-element-sequential-matrix-diagonalisation)
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.