The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
우리는 센서 수가 소스보다 적은 유한 알파벳 소스의 혼합에 대한 블라인드 소스 분리 알고리즘을 제안합니다. 알고리즘은 추정된 혼합 행렬의 업데이트 방정식과 추론된 소스의 열거로 구성됩니다. 알고리즘의 안정성을 위한 단계 크기의 한계와 추정된 혼합 행렬의 초기점을 할당하는 두 가지 방법을 제시합니다. 시뮬레이션 결과는 제안된 알고리즘을 검증한다.
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.
부
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
부
@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},}
부
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 -