Overcomplete Blind Source Separation of Finite Alphabet Sources
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E84-D No.1 pp.209-212
- Publication Date
- 2001/01/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Algorithms
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Bin-Chul IHM, Dong-Jo PARK, Young-Hyun KWON, "Overcomplete Blind Source Separation of Finite Alphabet Sources" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 1, pp. 209-212, January 2001, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_1_209/_p
Copy
@ARTICLE{e84-d_1_209,
author={Bin-Chul IHM, Dong-Jo PARK, Young-Hyun KWON, },
journal={IEICE TRANSACTIONS on Information},
title={Overcomplete Blind Source Separation of Finite Alphabet Sources},
year={2001},
volume={E84-D},
number={1},
pages={209-212},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Overcomplete Blind Source Separation of Finite Alphabet Sources
T2 - IEICE TRANSACTIONS on Information
SP - 209
EP - 212
AU - Bin-Chul IHM
AU - Dong-Jo PARK
AU - Young-Hyun KWON
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2001
AB - 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.
ER -
English
