Time-Domain Blind Signal Separation of Convolutive Mixtures via Multidimensional Independent Component Analysis

Takahiro MURAKAMI  Toshihisa TANAKA  Yoshihisa ISHIDA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E92-A   No.3   pp.733-744
Publication Date: 2009/03/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E92.A.733
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Latest Advances in Fundamental Theories of Signal Processing)
Category: 
Keyword: 
blind signal separation,  convolutive mixture,  multidimensional independent component analysis,  independent subspace analysis,  

Full Text: PDF>>
Buy this Article




Summary: 
An algorithm for blind signal separation (BSS) of convolutive mixtures is presented. In this algorithm, the BSS problem is treated as multidimensional independent component analysis (ICA) by introducing an extended signal vector which is composed of current and previous samples of signals. It is empirically known that a number of conventional ICA algorithms solve the multidimensional ICA problem up to permutation and scaling of signals. In this paper, we give theoretical justification for using any conventional ICA algorithm. Then, we discuss the remaining problems, i.e., permutation and scaling of signals. To solve the permutation problem, we propose a simple algorithm which classifies the signals obtained by a conventional ICA algorithm into mutually independent subsets by utilizing temporal structure of the signals. For the scaling problem, we prove that the method proposed by Koldovský and Tichavský is theoretically proper in respect of estimating filtered versions of source signals which are observed at sensors.