Row-shift corrected truncation of paraunitary matrices for PEVD algorithms
Corr, Jamie and Thompson, Keith and Weiss, Stephan and Proudler, Ian K. and McWhirter, John G.; (2015) Row-shift corrected truncation of paraunitary matrices for PEVD algorithms. In: 23rd European Signal Processing Conference. IEEE, pp. 849-853. ISBN 978-0-9928626-3-3
|
Text (Corr-etal-ESPC-2015-Row-shift-corrected-truncation-of-paraunitary-matrices)
Corr_etal_ESPC_2015_Row_shift_corrected_truncation_of_paraunitary_matrices.pdf Accepted Author Manuscript 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 pro- pose 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.
Creators(s): |
Corr, Jamie ![]() ![]() ![]() | Item type: | Book Section |
---|---|
ID code: | 53742 |
Keywords: | paraunitary matrices , row-shift correction, polynomial eigenvalue decomposition, Electrical engineering. Electronics Nuclear engineering, Electrical and Electronic Engineering |
Subjects: | Technology > Electrical engineering. Electronics Nuclear engineering |
Department: | Faculty of Engineering > Electronic and Electrical Engineering |
Depositing user: | Pure Administrator |
Date deposited: | 14 Jul 2015 08:32 |
Last modified: | 22 Jan 2021 04:02 |
Related URLs: | |
URI: | https://strathprints.strath.ac.uk/id/eprint/53742 |
Export data: |