Row-shift corrected truncation of paraunitary matrices for PEVD algorithms

Corr, Jamie, Thompson, Keith, Weiss, Stephen, Proudler, Ian K. and McWhirter, John ORCID: https://orcid.org/0000-0003-1810-3318 2015. Row-shift corrected truncation of paraunitary matrices for PEVD algorithms. Presented at: 23rd European Signal Processing Conference (EUSIPCO), Nice, France, 31 August - 4 September 2015. 2015 23rd European Signal Processing Conference (EUSIPCO). IEEE, pp. 849-853. 10.1109/EUSIPCO.2015.7362503

Preview

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

Abstract

In this paper, we show that the paraunitary (PU) matrices that arise from the polynomial eigenvalue decomposition (PEVD) of a parahermitian matrix are not unique. In particular, arbitrary shifts (delays) of polynomials in one row of a PU matrix yield another PU matrix that admits the same PEVD. To keep the order of such a PU matrix as low as possible, we propose a row-shift correction. Using the example of an iterative PEVD algorithm with previously proposed truncation of the PU matrix, we demonstrate that a considerable shortening of the PU order can be accomplished when using row-corrected truncation.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Published Online
Status:	Published
Schools:	Schools > Engineering
Subjects:	T Technology > TA Engineering (General). Civil engineering (General)
Publisher:	IEEE
ISBN:	978-0-9928-6263-3
ISSN:	2076-1465
Funders:	EPSRC
Date of First Compliant Deposit:	21 April 2016
Date of Acceptance:	31 August 2015
Last Modified:	01 Nov 2022 09:55
URI:	https://orca.cardiff.ac.uk/id/eprint/89670

Citation Data

Cited 30 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item