[HTML][HTML] Relevance of polynomial matrix decompositions to broadband blind signal separation

S Redif, S Weiss, JG McWhirter - Signal processing, 2017 - Elsevier
The polynomial matrix EVD (PEVD) is an extension of the conventional eigenvalue
decomposition (EVD) to polynomial matrices. The purpose of this article is to provide a …

Eigenvalue decomposition of a parahermitian matrix: Extraction of analytic eigenvectors

S Weiss, IK Proudler, FK Coutts… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
An analytic parahermitian matrix admits in almost all cases an eigenvalue decomposition
(EVD) with analytic eigenvalues and eigenvectors. We have previously defined a discrete …

Sequential matrix diagonalization algorithms for polynomial EVD of parahermitian matrices

S Redif, S Weiss, JG McWhirter - IEEE Transactions on Signal …, 2014 - ieeexplore.ieee.org
For parahermitian polynomial matrices, which can be used, for example, to characterize
space-time covariance in broadband array processing, the conventional eigenvalue …

Polynomial eigenvalue decomposition for multichannel broadband signal processing: a mathematical technique offering new insights and solutions

VW Neo, S Redif, JG McWhirter… - IEEE Signal …, 2023 - ieeexplore.ieee.org
This article is devoted to the polynomial eigenvalue decomposition (PEVD) and its
applications in broadband multichannel signal processing, motivated by the optimum …

On the existence and uniqueness of the eigenvalue decomposition of a parahermitian matrix

S Weiss, J Pestana, IK Proudler - IEEE Transactions on Signal …, 2018 - ieeexplore.ieee.org
This paper addresses the extension of the factorization of a Hermitian matrix by an
eigenvalue decomposition (EVD) to the case of a parahermitian matrix that is analytic at …

Design of FIR paraunitary filter banks for subband coding using a polynomial eigenvalue decomposition

S Redif, JG McWhirter, S Weiss - IEEE Transactions on Signal …, 2011 - ieeexplore.ieee.org
The problem of paraunitary (PU) filter bank design for subband coding has received
considerable attention in recent years, not least because of the energy preserving property …

Multiple shift maximum element sequential matrix diagonalisation for parahermitian matrices

J Corr, K Thompson, S Weiss… - … IEEE Workshop on …, 2014 - ieeexplore.ieee.org
A polynomial eigenvalue decomposition of paraher-mitian matrices can be calculated
approximately using iterative approaches such as the sequential matrix diagonalisation …

Row-shift corrected truncation of paraunitary matrices for PEVD algorithms

J Corr, K Thompson, S Weiss… - 2015 23rd European …, 2015 - ieeexplore.ieee.org
In this paper, we show that the paraunitary (PU) matrices that arise from the polynomial
eigenvalue decomposition (PEVD) of a parahermitian matrix are not unique. In particular …

Second order sequential best rotation algorithm with householder reduction for polynomial matrix eigenvalue decomposition

VW Neo, PA Naylor - ICASSP 2019-2019 IEEE International …, 2019 - ieeexplore.ieee.org
The Second-order Sequential Best Rotation (SBR2) algorithm, used for Eigenvalue
Decomposition (EVD) on para-Hermitian polynomial matrices typically encountered in …

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

M Tohidian, H Amindavar, AM Reza - EURASIP Journal on Advances in …, 2013 - Springer
In this article, we address the problem of singular value decomposition of polynomial
matrices and eigenvalue decomposition of para-Hermitian matrices. Discrete Fourier …