### Abstract

The best-known algorithm for the decoding of low-density parity-check (LDPC) codes is the sum-product algorithm (SPA). The SPA is a message-passing algorithm on a graphical model called a factor graph (FG). The performance of the SPA depends on a structure of loops in a FG. Pearl showed that loops in a graphical model could be erased by the clustering method. This method clusters plural nodes into a single node. In this paper, we show several examples about a decoding on a FG to which the clustering method is applied. And we propose an efficient decoding algorithm for it.

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

Title of host publication | Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 |

Pages | 108-112 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2005 |

Event | IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 - Rotorua Duration: 2005 Aug 29 → 2005 Sep 1 |

### Other

Other | IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 |
---|---|

City | Rotorua |

Period | 05/8/29 → 05/9/1 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005*(pp. 108-112). [1531867] https://doi.org/10.1109/ITW.2005.1531867

**A note on a decoding algorithm of codes on graphs with small loops.** / Kobayashi, Naoto; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

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

*Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005.*, 1531867, pp. 108-112, IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005, Rotorua, 05/8/29. https://doi.org/10.1109/ITW.2005.1531867

}

TY - GEN

T1 - A note on a decoding algorithm of codes on graphs with small loops

AU - Kobayashi, Naoto

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2005

Y1 - 2005

N2 - The best-known algorithm for the decoding of low-density parity-check (LDPC) codes is the sum-product algorithm (SPA). The SPA is a message-passing algorithm on a graphical model called a factor graph (FG). The performance of the SPA depends on a structure of loops in a FG. Pearl showed that loops in a graphical model could be erased by the clustering method. This method clusters plural nodes into a single node. In this paper, we show several examples about a decoding on a FG to which the clustering method is applied. And we propose an efficient decoding algorithm for it.

AB - The best-known algorithm for the decoding of low-density parity-check (LDPC) codes is the sum-product algorithm (SPA). The SPA is a message-passing algorithm on a graphical model called a factor graph (FG). The performance of the SPA depends on a structure of loops in a FG. Pearl showed that loops in a graphical model could be erased by the clustering method. This method clusters plural nodes into a single node. In this paper, we show several examples about a decoding on a FG to which the clustering method is applied. And we propose an efficient decoding algorithm for it.

UR - http://www.scopus.com/inward/record.url?scp=33646808731&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646808731&partnerID=8YFLogxK

U2 - 10.1109/ITW.2005.1531867

DO - 10.1109/ITW.2005.1531867

M3 - Conference contribution

AN - SCOPUS:33646808731

SN - 078039481X

SN - 9780780394810

SP - 108

EP - 112

BT - Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

ER -