By Topic

An EVD Algorithm for Para-Hermitian Polynomial Matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)

An algorithm for computing the eigenvalue decomposition of a para-Hermitian polynomial matrix is described. This amounts to diagonalizing the polynomial matrix by means of a paraunitary "similarity" transformation. The algorithm makes use of "elementary paraunitary transformations" and constitutes a generalization of the classical Jacobi algorithm for conventional Hermitian matrix diagonalization. A proof of convergence is presented. The application to signal processing is highlighted in terms of strong decorrelation and multichannel data compaction. Some simulated results are presented to demonstrate the capability of the algorithm

Published in:

Signal Processing, IEEE Transactions on  (Volume:55 ,  Issue: 5 )