Complexity and search space reduction in cyclic-by-row PEVD algorithms

Coutts, Fraser K., Corr, Jamie, Thompson, Keith, Weiss, Stephan, Proudler, Ian K. and McWhirter, John G. ORCID: https://orcid.org/0000-0003-1810-3318 2017. Complexity and search space reduction in cyclic-by-row PEVD algorithms. Presented at: 2016 50th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 6-9 November 2016. 2016 50th Asilomar Conference on Signals, Systems and Computers. IEEE, pp. 1349-1353. 10.1109/ACSSC.2016.7869595

Preview

PDF - Accepted Post-Print Version Download (137kB) | Preview

Abstract

In recent years, several algorithms for the iterative calculation of a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is a generalisation of the ordinary EVD and uses paraunitary operations to diagonalise a parahermitian matrix. This paper addresses potential computational savings that can be applied to existing cyclic-by-row approaches for the PEVD. These savings are found during the search and rotation stages, and do not significantly impact on algorithm accuracy. We demonstrate that with the proposed techniques, computations can be significantly reduced. The benefits of this are important for a number of broadband multichannel problems.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Engineering
Publisher:	IEEE
ISBN:	978-1-5386-3954-2
Related URLs:	Organisation
Date of First Compliant Deposit:	22 November 2017
Last Modified:	02 Nov 2022 11:44
URI:	https://orca.cardiff.ac.uk/id/eprint/102931

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item