Multirate systems and filter banks
Multirate systems and filter banks
Matrix computations (3rd ed.)
Introduction to Space-Time Wireless Communications
Introduction to Space-Time Wireless Communications
A novel algorithm for calculating the QR decomposition of a polynomial matrix
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Polynomial matrix QR decomposition and iterative decoding of frequency selective MIMO channels
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
On factorization of M-channel paraunitary filterbanks
IEEE Transactions on Signal Processing
An EVD Algorithm for Para-Hermitian Polynomial Matrices
IEEE Transactions on Signal Processing
Hi-index | 35.68 |
In this paper, a new algorithm for calculating the QR decomposition (QRD) of a polynomial matrix is introduced. This algorithm amounts to transforming a polynomial matrix to upper triangular form by application of a series of paraunitary matrices such as elementary delay and rotation matrices. It is shown that this algorithm can also be used to formulate the singular value decomposition (SVD) of a polynomial matrix, which essentially amounts to diagonalizing a polynomial matrix again by application of a series of paraunitary matrices. Example matrices are used to demonstrate both types of decomposition. Mathematical proofs of convergence of both decompositions are also outlined. Finally, a possible application of such decompositions in multichannel signal processing is discussed.