Algebraic Joint Zero-Diagonalization and Blind Sources Separation

Authors:
G. Chabriel;J. Barrere;N. Thirion-Moreau;E. Moreau
Affiliations:
Univ. of Sud Toulon-Var, La Garde;-;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2008

Citing 0
Cited 5

Nonorthogonal approximate joint diagonalization with well-conditioned diagonalizers

IEEE Transactions on Neural Networks
Blind underdetermined mixture identification by joint canonical decomposition of HO cumulants

IEEE Transactions on Signal Processing
Gradient-based joint block diagonalization algorithms: Application to blind separation of FIR convolutive mixtures

Signal Processing
Householder transform based joint diagonal zero diagonalization for source separation using time-frequency distributions

Multidimensional Systems and Signal Processing
Fast nonunitary joint block diagonalization with degenerate solution elimination for convolutive blind source separation

Digital Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

This paper adresses the problem of the joint zero-diagonalization of a given set of matrices. We establish the identiflability conditions of the zero-diagonalizer, and we propose a new algebraical algorithm based on the reformulation of the initial problem into a joint-diagonalization problem. The zero-diagonalizer is not constrained to be unitary. Computer simulations illustrate the behavior of the algorithm. Moreover, as an application, we show that the blind separation of correlated sources can be performed applying this algorithm to a particular set of spatial quadratic time-frequency distribution matrices. In this case, computer simulations are also provided in order to illustrate the performances of the proposed algorithm and to compare it with other existing ones.