For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Overcomplete Blind Source Separation of Finite Alphabet Sources
Bin-Chul IHM Dong-Jo PARK Young-Hyun KWON
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/01/01
Print ISSN: 0916-8532
Type of Manuscript: LETTER
overcomplete, blind source separation, maximum likelihood, step size, initialization,
Full Text: PDF(3.3MB)>>
We propose a blind source separation algorithm for 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 step 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.