Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm

J Corr, K Thompson, S Weiss, I K Proudler, J G McWhirter

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

22 Downloads (Pure)

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.
Original languageEnglish
Title of host publication2nd IET International Conference on Intelligent Signal Processing 2015
Place of PublicationStevenage
Pages1-5
Number of pages5
Publication statusPublished - Dec 2015
Event2nd IET International Conference on Intelligent Signal Processing - Kensington Close Hotel, London, United Kingdom
Duration: 1 Dec 2015 → 2 Dec 2015

Conference

Conference2nd IET International Conference on Intelligent Signal Processing
CountryUnited Kingdom
CityLondon
Period1/12/15 → 2/12/15

Keywords

  • multiple shift maximum element
  • sequential matrix diagonalisation
  • polynomial matrix eigenvalue decomposition

Access to Document

    Fingerprint Dive into the research topics of 'Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm'. Together they form a unique fingerprint.

    Cite this