Name
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. |
Year | Venue | Field |
|---|---|---|
2015 | European Signal Processing Conference | Approximation algorithm,Signal processing,Truncation,Discrete mathematics,Polynomial matrix,Polynomial,Matrix (mathematics),Matrix decomposition,Algorithm,Eigendecomposition of a matrix,Mathematics |
DocType | ISSN | Citations |
Conference | 2076-1465 | 5 |
PageRank | References | Authors |
0.55 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jamie Corr | 1 | 11 | 2.78 |
| Keith Thompson | 2 | 7 | 3.31 |
| Weiss, Stephan | 3 | 209 | 33.25 |
| Ian K. Proudler | 4 | 63 | 12.78 |
| John G. McWhirter | 5 | 214 | 28.77 |