Multichannel spectral factorization algorithm using polynomial matrix eigenvalue decomposition

Zeliang Wang, John G. McWhirter, Stephan Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

10 Citations (Scopus)
30 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publication2015 49th Asilomar Conference on Signals, Systems and Computers
Place of PublicationPiscataway, N.J.
PublisherIEEE
Pages1714-1718
Number of pages5
ISBN (Print)978-1-4673-8576-3
DOIs
Publication statusPublished - 29 Feb 2016
Event49th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, United States
Duration: 8 Nov 201511 Nov 2015

Conference

Conference49th Asilomar Conference on Signals, Systems and Computers
Country/TerritoryUnited States
CityPacific Grove
Period8/11/1511/11/15

Keywords

  • signal processing
  • eigenvalues
  • eigenfunctions
  • Hermitian matrices

Fingerprint

Dive into the research topics of 'Multichannel spectral factorization algorithm using polynomial matrix eigenvalue decomposition'. Together they form a unique fingerprint.

Cite this