Overcomplete blind source separation of finite alphabet sources

Abstract

We propose a blind source separation algorithm fur the mixture of finite alphabet sources where sensors are less than sources. The algorithm consists of an update Equation of an estimated mixing matrix and enumeration of the inferred sources. We present the bound Of a steb size for the stability of the algorithm and two methods of assignment of the initial point of the estimated mixing matrix. Simulation results verify the proposed algorithm.