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

[thumbnail of Corr-etal-ESPC-2015-Row-shift-corrected-truncation-of-paraunitary-matrices]
Preview
 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.

    ORCID iDs

    Corr, Jamie ORCID logoORCID: https://orcid.org/0000-0001-9900-0796, Thompson, Keith ORCID logoORCID: https://orcid.org/0000-0003-0727-7347, Weiss, Stephan ORCID logoORCID: https://orcid.org/0000-0002-3486-7206, Proudler, Ian K. and McWhirter, John G.;
    CORE (COnnecting REpositories)