Maximum Likelihood Blind Separation of Convolutively Mixed Discrete Sources

• Published in: China communications Vol. 10; no. 6; pp. 60 - 67
• Main Authors: Fanglin, Gu, Hang, Zhang, Desheng, Zhu
• Format: Journal Article
• Language: Chinese; English
• Published: China Communications Magazine Co. Ltd 01.06.2013; College of Communication Engineering, PLA University of Science and Technology, Nanjing 210007, China
• Subjects: Algorithm design and analysis; Blind source separation; convo-lutive mixture; EM算法; Filtering algorithms; Finite Alphabet; Maximum likelihood estimation; MIMO; Sensors; Source separation; 协方差矩阵; 最大似然算法; 期望最大化; 混合离散; 盲分离; 迭代计算; 鲁棒性能; Blind Source Separation; EM; Finite Alphabet; convolutive mixture
• ISSN: 1673-5447
• DOI: 10.1109/CC.2013.6549259

In this paper, a Maximum Likelihood （ML） approach, implemented by Expectation-Maximization （EM） algorithm, is proposed to blind separation of convolutively mixed discrete sources. In order to carry out the expectation procedure of the EM algorithm with a less computational load, the algorithm named Iterative Maximum Likelihood algorithm （IML） is proposed to calculate the likelihood and recover the source signals. An important feature of the ML approach is that it has robust performance in noise environments by treating the covariance matrix of the additive Gaussian noise as a parameter. Another striking feature of the ML approach is that it is possible to separate more sources than sensors by exploiting the finite alphabet property of the sources. Simulation results show that the proposed ML approach works well either in determined mixtures or underdetermined mixtures. Furthermore, the performance of the proposed ML algorithm is close to the performance with perfect knowledge of the channel filters.