FAst approximate joint diagonalization of positive definite Hermitian matrices

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

17 Scopus citations

Abstract

In this paper, a new efficient iterative algorithm for approximate joint diagonalization of positive-definite Hermitian matrices is presented. The proposed algorithm, named as SVDJD, estimates the diagonalization matrix by iterative optimization of a maximum likelihood based objective function. The columns of the diagonalization matrix is not assumed to be orthogonal, and they are estimated separately by using iterative singular value decompositions of a weighted sum of the matrices to be diagonalized. The performance of the proposed SVDJD algorithm is evaluated and compared to other existing stateof-the-art algorithms for approximate joint diagonalization. The results imply that the SVDJD algorithm is computationally efficient with performance similar to state-of-the-art algorithms for approximate joint diagonalization.

Original languageEnglish
Title of host publication2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07
PagesIII1373-III1376
DOIs
StatePublished - 6 Aug 2007
Event2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07 - Honolulu, HI, United States
Duration: 15 Apr 200720 Apr 2007

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume3
ISSN (Print)1520-6149

Conference

Conference2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07
Country/TerritoryUnited States
CityHonolulu, HI
Period15/04/0720/04/07

Keywords

  • BSS
  • Joint diagonalization
  • SVD

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'FAst approximate joint diagonalization of positive definite Hermitian matrices'. Together they form a unique fingerprint.

Cite this