Sequential matrix diagonalization algorithms for polynomial EVD of parahermitian matrices

Soydan Redif, Stephan Weiss, John G. McWhirter

Research output: Contribution to journalArticle

59 Citations (Scopus)
142 Downloads (Pure)

Abstract

For parahermitian polynomial matrices, which can be used, for example, to characterise space-time covariance in broadband array processing, the conventional eigenvalue decomposition (EVD) can be generalised to a polynomial matrix EVD (PEVD). In this paper, a new iterative PEVD algorithm based on sequential matrix diagonalisation (SMD) is introduced. At every step the SMD algorithm shifts the dominant column or row of the polynomial matrix to the zero lag position and eliminates the resulting instantaneous correlation. A proof of convergence is provided, and it is demonstrated that SMD establishes diagonalisation faster and with lower order operations than existing PEVD algorithms.
Original languageEnglish
Pages (from-to)81-89
Number of pages9
JournalIEEE Transactions on Signal Processing
Volume63
Issue number1
Early online date4 Nov 2014
DOIs
Publication statusPublished - 1 Jan 2015

Keywords

  • parahermitian matrix
  • paraunitary matrix
  • broadband communication
  • covariance matrices
  • jacobian matrices

Fingerprint Dive into the research topics of 'Sequential matrix diagonalization algorithms for polynomial EVD of parahermitian matrices'. Together they form a unique fingerprint.

Cite this