Analysing the performance of divide-and-conquer sequential matrix diagonalisation for large broadband sensor arrays
Coutts, Fraser K. and Thompson, Keith and Weiss, Stephan and Proudler, Ian K. (2017) Analysing the performance of divide-and-conquer sequential matrix diagonalisation for large broadband sensor arrays. In: IEEE International Workshop on Signal Processing Systems, 2017-10-03 - 2017-10-05. (https://doi.org/10.1109/SiPS.2017.8109976)
Preview |
Text.
Filename: Coutts_etal_SPS_2017_performance_of_divide_and_conquer_sequential_matrix_diagonalisation_for_large_broadband_sensor_arrays.pdf
Accepted Author Manuscript Download (170kB)| Preview |
Abstract
A number of algorithms capable of iteratively calculating a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is an extension of the ordinary EVD to polynomial matrices and will diagonalise a parahermitian matrix using paraunitary operations. Inspired by recent work towards a low complexity divide-and-conquer PEVD algorithm, this paper analyses the performance of this algorithm - named divide-and-conquer sequential matrix diagonalisation (DC-SMD) - for applications involving broadband sensor arrays of various dimensionalities. We demonstrate that by using the DC-SMD algorithm instead of a traditional alternative, PEVD complexity and execution time can be significantly reduced. This reduction is shown to be especially impactful for broadband multichannel problems involving large arrays.
-
-
Item type: Conference or Workshop Item(Paper) ID code: 62531 Dates: DateEvent3 October 2017Published29 June 2017AcceptedSubjects: Technology > Electrical engineering. Electronics Nuclear engineering Department: Faculty of Engineering > Electronic and Electrical Engineering
Technology and Innovation Centre > Sensors and Asset ManagementDepositing user: Pure Administrator Date deposited: 06 Dec 2017 10:29 Last modified: 25 Apr 2024 01:45 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/62531