Sciweavers

ACSSC
2015

Multichannel spectral factorization algorithm using polynomial matrix eigenvalue decomposition

8 years 14 days ago
Multichannel spectral factorization algorithm using polynomial matrix eigenvalue decomposition
—In this paper, we present a new multichannel spectral factorization algorithm which can be utilized to calculate the approximate spectral factor of any para-Hermitian polynomial matrix. The proposed algorithm is based on an iterative method for polynomial matrix eigenvalue decomposition (PEVD). By using the PEVD algorithm, the multichannel spectral factorization problem is simply broken down to a set of single channel problems which can be solved by means of existing one-dimensional spectral factorization algorithms. In effect, it transforms the multichannel spectral factorization problem into one which is much easier to solve.
Zeliang Wang, John G. McWhirter, Stephan D. Weiss
Added 13 Apr 2016
Updated 13 Apr 2016
Type Journal
Year 2015
Where ACSSC
Authors Zeliang Wang, John G. McWhirter, Stephan D. Weiss
Comments (0)