A DFT-based approximate eigenvalue and singular value decomposition of polynomial matrices

33Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this article, we address the problem of singular value decomposition of polynomial matrices and eigenvalue decomposition of para-Hermitian matrices. Discrete Fourier transform enables us to propose a new algorithm based on uniform sampling of polynomial matrices in frequency domain. This formulation of polynomial matrix decomposition allows for controlling spectral properties of the decomposition. We set up a nonlinear quadratic minimization for phase alignment of decomposition at each frequency sample, which leads to a compact order approximation of decomposed matrices. Compact order approximation of decomposed matrices makes it suitable in filterbank and multiple-input multiple-output (MIMO) precoding applications or any application dealing with realization of polynomial matrices as transfer function of MIMO systems. Numerical examples demonstrate the versatility of the proposed algorithm provided by relaxation of paraunitary constraint, and its configurability to select different properties. © 2013 Tohidian et al.; licensee Springer.

Cite

CITATION STYLE

APA

Tohidian, M., Amindavar, H., & Reza, A. M. (2013). A DFT-based approximate eigenvalue and singular value decomposition of polynomial matrices. Eurasip Journal on Advances in Signal Processing, 2013(1). https://doi.org/10.1186/1687-6180-2013-93

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free