Polynomial GEVD for Convolutive Broadband Blind Source Separation

Polynomial generalised eigenvalue decomposition (PGEVD), non-stationary broadband sources and polynomial-matrix demixing

My research on polynomial generalised eigenvalue decomposition (PGEVD) extends the conventional generalised eigenvalue approach from instantaneous, narrowband mixtures to polynomial matrices representing convolutive broadband systems. The central application considered here is blind source separation (BSS), where the objective is to recover unknown source signals from observed mixtures without prior knowledge of the mixing system.

In broadband problems the mixing process cannot in general be represented by a single scalar or instantaneous matrix. Propagation, reverberation and multipath effects introduce delays, so each source-to-sensor path is more naturally represented by a finite impulse response filter. Collecting these filters gives a polynomial mixing matrix. Polynomial-matrix decompositions therefore provide a natural framework for extending familiar narrowband matrix techniques to convolutive multichannel signal processing.

Polynomial GEVD framework for convolutive broadband blind source separation by Soydan Redif
Polynomial GEVD for convolutive broadband blind source separation. Non-stationary broadband sources undergo an unknown convolutive polynomial mixing system. Cross-spectral-density matrices estimated over different time intervals form a polynomial GEVD pair, from which a broadband demixing system can be constructed.

Convolutive broadband blind source separation

Let the broadband source vector be represented by S(z), the observed sensor signals by X(z), and the unknown convolutive mixing system by the polynomial matrix A(z). The mixing model can be written conceptually as

X(z) = A(z) S(z).

Each entry of A(z) represents a source-to-sensor transfer function. In the FIR case these entries are finite-order polynomials in the delay variable. The aim of broadband BSS is to determine a demixing polynomial matrix F(z) such that applying F(z) to the observations produces estimates of the original sources, subject to the usual scaling, filtering and permutation ambiguities of blind separation.

Using source non-stationarity

A useful source of information is temporal non-stationarity. Suppose the convolutive mixing system remains essentially unchanged while the second-order statistics of the sources vary between two time intervals. From the observed mixtures, two para-Hermitian polynomial cross-spectral-density matrices can then be estimated: Rx(1)(z) and Rx(2)(z).

The two matrices contain the same underlying mixing structure but reflect different source powers or second-order source statistics. This is the broadband analogue of the covariance-matrix pair used by narrowband GEVD-based source-separation methods. The change in source statistics provides information that can distinguish source components even though the unknown mixing system itself remains fixed.

Polynomial generalised eigenvalue decomposition

The polynomial GEVD seeks polynomial generalised eigenpairs that, in conceptual form, satisfy

Rx(1)(z) vi(z) = λi(z) Rx(2)(z) vi(z).

Unlike an ordinary GEVD, the matrices and eigenvectors are functions of the delay variable. Polynomial eigenvalue decomposition (PEVD) provides the broadband matrix-decomposition machinery needed to construct such a generalisation. The resulting generalised eigenvectors can be arranged to obtain a polynomial demixing system whose rows act as broadband filters on the observed sensor signals.

This formulation is important because it avoids reducing the broadband problem to a collection of unrelated narrowband frequency bins. Instead, the convolutional structure is represented directly in the polynomial domain. Para-Hermitian covariance or cross-spectral-density matrices, paraunitary transformations and polynomial eigenvalue decompositions therefore become central objects in the broadband formulation.

Practical interpretation. Polynomial decompositions implemented with finite-order filters are generally numerical approximations. Their performance depends on factors including source-statistical contrast, finite data, polynomial order, conditioning and the behaviour of eigenvalue trajectories across frequency.

Development of the PGEVD/BSS work

In 2017 I proposed an extension of the GEVD to polynomial matrices and applied it explicitly to convolutive blind signal separation of non-stationary broadband sources. The method used two related para-Hermitian polynomial matrices corresponding to different signal time intervals. This established a direct polynomial-matrix generalisation of GEVD-based narrowband BSS.

Subsequent work with Jennifer Pestana and Ian K. Proudler analysed the conditions under which this broadband GEVD-based separation approach can recover the sources. More broadly, polynomial matrix decompositions and PEVD provide a framework for broadband subspace processing, strong decorrelation, beamforming and other multichannel problems in which ordinary narrowband matrix decompositions are insufficient.

Selected publications

S. Redif (2017). “Convolutive blind signal separation via polynomial matrix generalised eigenvalue decomposition.” Electronics Letters, 53, pp. 87–89. DOI: 10.1049/el.2016.3200
S. Redif, J. Pestana and I. K. Proudler (2019). “Analysis of broadband GEVD-based blind source separation.” IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 8028–8032. DOI: 10.1109/ICASSP.2019.8683237
S. Redif, S. Weiss and J. G. McWhirter (2017). “Relevance of polynomial matrix decompositions to broadband blind signal separation.” Signal Processing, 134, pp. 76–86. DOI: 10.1016/j.sigpro.2016.11.019
V. W. Neo, S. Redif et al. (2023). “Polynomial eigenvalue decomposition for multichannel broadband signal processing: A mathematical technique offering new insights and solutions.” IEEE Signal Processing Magazine, 40(7), pp. 18–37. DOI: 10.1109/MSP.2023.3269200