Relevance of polynomial matrix decompositions to broadband blind signal separation

Soydan Redif, Stephan Weiss, John G. McWhirter

Research output: Contribution to journalArticle

25 Citations (Scopus)
56 Downloads (Pure)

Abstract

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 review of the theoretical foundations of the PEVD and to highlight practical applications in the area of broadband blind source separation (BSS). Based on basic definitions of polynomial matrix terminology such as parahermitian and paraunitary matrices, strong decorrelation and spectral majorization, the PEVD and its theoretical foundations will be briefly outlined. The paper then focuses on the applicability of the PEVD and broadband subspace techniques — enabled by the diagonalization and spectral majorization capabilities of PEVD algorithms—to define broadband BSS solutions that generalise well-known narrowband techniques based on the EVD. This is achieved through the analysis of new results from three exemplar broadband BSS applications — underwater acoustics, radar clutter suppression, and domain-weighted broadband beamforming — and their comparison with classical broadband methods.
Original languageEnglish
Pages (from-to)76-86
Number of pages11
JournalSignal Processing
Volume134
Early online date25 Nov 2016
DOIs
Publication statusPublished - 31 May 2017

Keywords

  • paraunitary matrix
  • parahermitian matrix
  • polynomial matrix eigenvalue decomposition
  • broadband blind signal separation,
  • broadband adaptive beamforming
  • radar
  • sonar

Fingerprint Dive into the research topics of 'Relevance of polynomial matrix decompositions to broadband blind signal separation'. Together they form a unique fingerprint.

  • Projects

    Cite this