### Abstract

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.

Original language | English |
---|---|

Number of pages | 1 |

Journal | IEEE International Symposium on Information Theory - Proceedings |

Publication status | Published - 2001 Sep 12 |

Event | 2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States Duration: 2001 Jun 24 → 2001 Jun 29 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics

## Fingerprint Dive into the research topics of 'An iterative algorithm for calculating posterior probability and model representation'. Together they form a unique fingerprint.

## Cite this

Matsushima, T., Matsushima, T. K., & Hirasawa, S. (2001). An iterative algorithm for calculating posterior probability and model representation.

*IEEE International Symposium on Information Theory - Proceedings*.