Some Properties of Laurent Polynomial Matrices

In the context of multivariate signal processing, factorizations involving so-called para-unitary matrices are relevant as well demonstrated in the book of Vaidyanathan, and more recently in a series of papers by McWhirter and co-authors. However, known factorizations of matrix polynomials, such as the Smith form, involve unimodular matrices but usual factorizations such as QR, eigenvalue or singular value decompositions, have not been proved to exist for polynomial matrices, if defined with para-unitary matrices, except for very restrictive matrices. It is clear that Cholesky factorization requires square roots, and that EVD and SVD require roots of higher degree polynomials. But one can ask oneself whether the closure of the field of polynomial coefficients is enough or not. It turns out that it is not. Nevertheless, density arguments allow to approximate any polynomial matrix by an SVD-type factorization involving paraunitary polynomial matrices. With that goal, we define the appropriate framework for Laurent polynomial matrices, that is, polynomial matrices with both positive and negative powers in a single variable, particularly the notion of ordrer and degree. We introduce a Smith form for these matrices involving ''L-unimodular'' matrices which are matrices with a monomial non-zero determinant. The 'Elementary Polynomial Givens Rotations' of Foster and McWhirter are of that kind.

[1]  Hiroshi Nakazato,et al.  On the shape of numerical range of matrix polynomials , 2001 .

[2]  Otto F. G. Schilling,et al.  Basic Abstract Algebra , 1975 .

[3]  Ali H. Sayed,et al.  A survey of spectral factorization methods , 2001, Numer. Linear Algebra Appl..

[4]  Ruey-Wen Liu,et al.  A system-theoretic foundation for blind equalization of an FIR MIMO channel system , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[5]  S. Liberty,et al.  Linear Systems , 2010, Scientific Parallel Computing.

[6]  Robert Bregovic,et al.  Multirate Systems and Filter Banks , 2002 .

[7]  John G. McWhirter,et al.  An Algorithm for Calculating the QR and Singular Value Decompositions of Polynomial Matrices , 2010, IEEE Transactions on Signal Processing.

[8]  John G. McWhirter,et al.  An EVD Algorithm for Para-Hermitian Polynomial Matrices , 2007, IEEE Transactions on Signal Processing.

[9]  Truong Q. Nguyen,et al.  On factorization of M-channel paraunitary filterbanks , 2001, IEEE Trans. Signal Process..