Blind source separation using time-frequency distributions: algorithm and asymptotic performance

This paper addresses the problem of the blind source separation which consists of recovering a set of signals of which only instantaneous linear mixtures are observed. A blind source separation approach exploiting the difference in the time-frequency (t-f) signatures of the sources is considered. The approach is based on the diagonalization of a combined set of 'spatial time-frequency distributions'. Asymptotic performance analysis of the proposed method is performed. Numerical simulations are provided to demonstrate the effectiveness of our approach and to validate the theoretical expression of the asymptotic performance.

[1]  Gene H. Golub,et al.  Matrix computations , 1983 .

[2]  Christian Jutten,et al.  Detection de grandeurs primitives dans un message composite par une architecture de calcul neuromime , 1985 .

[3]  Lang Tong,et al.  BLIND ESTIMATION OF CORRELATED SOURCE SIGNALS , 1990, 1990 Conference Record Twenty-Fourth Asilomar Conference on Signals, Systems and Computers, 1990..

[4]  Jechang Jeong,et al.  Kernel design for reduced interference distributions , 1992, IEEE Trans. Signal Process..

[5]  J. Cardoso,et al.  An efficient technique for the blind separation of complex sources , 1993, [1993 Proceedings] IEEE Signal Processing Workshop on Higher-Order Statistics.

[6]  Douglas L. Jones,et al.  A signal-dependent time-frequency representation: optimal kernel design , 1993, IEEE Trans. Signal Process..

[7]  Pierre Comon,et al.  Independent component analysis, A new concept? , 1994, Signal Process..

[8]  Kiyotoshi Matsuoka,et al.  A neural net for blind separation of nonstationary signals , 1995, Neural Networks.

[9]  Eric Moulines,et al.  A blind source separation technique using second-order statistics , 1997, IEEE Trans. Signal Process..

[10]  Moeness G. Amin,et al.  Blind source separation based on time-frequency signal representations , 1998, IEEE Trans. Signal Process..