Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm

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

Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm

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

Electronic And Electrical Engineering

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

25 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 language	English
Title of host publication	2nd IET International Conference on Intelligent Signal Processing 2015
Place of Publication	Stevenage
Pages	1-5
Number of pages	5
Publication status	Published - Dec 2015
Event	2nd IET International Conference on Intelligent Signal Processing - Kensington Close Hotel, London, United Kingdom Duration: 1 Dec 2015 → 2 Dec 2015

Conference

Conference	2nd IET International Conference on Intelligent Signal Processing
Country/Territory	United Kingdom
City	London
Period	1/12/15 → 2/12/15

Keywords

multiple shift maximum element
sequential matrix diagonalisation
polynomial matrix eigenvalue decomposition

Access to Document

Corr-etal-ISP-2015-multiple-shift-maximum-element-sequential-matrix-diagonalisationAccepted author manuscript, 157 KB

1 Finished

Signal Processing Solutions for the Networked Battlespace
Soraghan, J. & Weiss, S.
EPSRC (Engineering and Physical Sciences Research Council)
1/04/13 → 31/03/18
Project: Research

Cite this

@inproceedings{eda50001e10f4be0bf8ef7c2d59d6c15,

title = "Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm",

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 theparaunitary 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.",

keywords = "multiple shift maximum element, sequential matrix diagonalisation, polynomial matrix eigenvalue decomposition",

author = "J Corr and K Thompson and S Weiss and Proudler, {I K} and McWhirter, {J G}",

year = "2015",

month = dec,

language = "English",

isbn = "9781785611360",

pages = "1--5",

booktitle = "2nd IET International Conference on Intelligent Signal Processing 2015",

note = "2nd IET International Conference on Intelligent Signal Processing ; Conference date: 01-12-2015 Through 02-12-2015",

}

TY - GEN

T1 - Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm

AU - Corr, J

AU - Thompson, K

AU - Weiss, S

AU - Proudler, I K

AU - McWhirter, J G

PY - 2015/12

Y1 - 2015/12

N2 - 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 theparaunitary 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.

AB - 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 theparaunitary 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.

KW - multiple shift maximum element

KW - sequential matrix diagonalisation

KW - polynomial matrix eigenvalue decomposition

M3 - Conference contribution book

SN - 9781785611360

SP - 1

EP - 5

BT - 2nd IET International Conference on Intelligent Signal Processing 2015

CY - Stevenage

T2 - 2nd IET International Conference on Intelligent Signal Processing

Y2 - 1 December 2015 through 2 December 2015

ER -

Reduced search space multiple shift maximum element sequential matrix diagonalisation algorithm

Abstract

Conference

Keywords

Access to Document

Fingerprint

Projects

Signal Processing Solutions for the Networked Battlespace

Cite this