### 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 |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Pages | 236 |

Number of pages | 1 |

Publication status | Published - 2001 |

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

### Other

Other | 2001 IEEE International Symposium on Information Theory (ISIT 2001) |
---|---|

Country | United States |

City | Washington, DC |

Period | 01/6/24 → 01/6/29 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*(pp. 236)

**An iterative algorithm for calculating posterior probability and model representation.** / Matsushima, Toshiyasu; Matsushima, T. K.; Hirasawa, S.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Symposium on Information Theory - Proceedings.*pp. 236, 2001 IEEE International Symposium on Information Theory (ISIT 2001), Washington, DC, United States, 01/6/24.

}

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

SP - 236

BT - IEEE International Symposium on Information Theory - Proceedings

ER -