抄録
In this paper, we introduce a representation method of probability models that can be applied to any code such as turbo, LDPC or tail-biting code. Moreover, we propose an iterative algorithm that calculates marginal posterior probabilities on the introduced probability model class. The decoding error probability for the LDPC codes of the proposed algorithm is less than that of the sum-product algorithm.
| 元の言語 | English |
|---|---|
| ホスト出版物のタイトル | IEEE International Symposium on Information Theory - Proceedings |
| ページ | 236 |
| ページ数 | 1 |
| 出版物ステータス | Published - 2001 |
| イベント | 2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States 継続期間: 2001 6 24 → 2001 6 29 |
Other
| Other | 2001 IEEE International Symposium on Information Theory (ISIT 2001) |
|---|---|
| 国 | United States |
| 市 | Washington, DC |
| 期間 | 01/6/24 → 01/6/29 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
これを引用
An iterative algorithm for calculating posterior probability and model representation. / Matsushima, Toshiyasu; Matsushima, T. K.; Hirasawa, S.
IEEE International Symposium on Information Theory - Proceedings. 2001. p. 236.研究成果: Conference contribution
}
TY - GEN
T1 - An iterative algorithm for calculating posterior probability and model representation
AU - Matsushima, Toshiyasu
AU - Matsushima, T. K.
AU - Hirasawa, S.
PY - 2001
Y1 - 2001
N2 - In this paper, we introduce a representation method of probability models that can be applied to any code such as turbo, LDPC or tail-biting code. Moreover, we propose an iterative algorithm that calculates marginal posterior probabilities on the introduced probability model class. The decoding error probability for the LDPC codes of the proposed algorithm is less than that of the sum-product algorithm.
AB - In this paper, we introduce a representation method of probability models that can be applied to any code such as turbo, LDPC or tail-biting code. Moreover, we propose an iterative algorithm that calculates marginal posterior probabilities on the introduced probability model class. The decoding error probability for the LDPC codes of the proposed algorithm is less than that of the sum-product algorithm.
UR - http://www.scopus.com/inward/record.url?scp=0034863979&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034863979&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0034863979
SP - 236
BT - IEEE International Symposium on Information Theory - Proceedings
ER -