Blind source separation of discrete finite alphabet sources using a single mixture

This paper deals with blind separation of finite alphabet sources where we have n sources and only one observation. The method is applied directly in time (spatial) domain and no transformation is needed. It follows a two stage procedure. In the first stage the mixing coefficients are estimated, and in the second stage the sources are separated using the estimated mixing coefficients. We also study restrictions of this method and conditions for which its performance is acceptable. Simulation results are presented to show the ability of this method to source separation in images and pulse amplitude modulation (PAM) signals.

[1]  A. Cichocki,et al.  Blind Separation and Extraction of Binary Sources , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[2]  Terrence J. Sejnowski,et al.  Learning Overcomplete Representations , 2000, Neural Computation.

[3]  K.I. Diamantaras,et al.  Blind separation of two multi-level sources from a single linear mixture , 2008, 2008 IEEE Workshop on Machine Learning for Signal Processing.

[4]  Daniel W. C. Ho,et al.  Underdetermined blind source separation based on sparse representation , 2006, IEEE Transactions on Signal Processing.

[5]  Abdeldjalil Aïssa-El-Bey,et al.  Underdetermined Blind Separation of Nondisjoint Sources in the Time-Frequency Domain , 2007, IEEE Transactions on Signal Processing.

[6]  Terrence J. Sejnowski,et al.  Blind source separation of more sources than mixtures using overcomplete representations , 1999, IEEE Signal Processing Letters.

[7]  Michael Zibulevsky,et al.  Underdetermined blind source separation using sparse representations , 2001, Signal Process..