An ldpcc decoding algorithm based on bowman-levin approximation -comparison with bp and cccp

Masato Inoue, Miho Komiya, Yoshiyuki Kabashima

Research output: Contribution to journalConference articlepeer-review

Abstract

Belief propagation (BP) and the concave convex procedure (CCCP) are both methods that utilize the Bethe free energy as a cost function and solve information processing tasks. We have developed a new algorithm that also uses the Bethe free energy, but changes the roles of the master variables and the slave variables. This is called the Bowman-Levin (BL) approximation in the domain of statistical physics. When we applied the BL algorithm to decode the Gallager ensemble of short-length regular low-density parity check codes (LDPCC) over an additive white Gaussian noise (AWGN) channel, its average performance was somewhat better than that of either BP or CCCP. This implies that the BL algorithm can also be successfully applied to other problems to which BP or CCCP has already been applied.

Original languageEnglish
Article number1523373
JournalIEEE International Symposium on Information Theory - Proceedings
Volume2005-January
DOIs
Publication statusPublished - 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 2005 Sep 42005 Sep 9

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'An ldpcc decoding algorithm based on bowman-levin approximation -comparison with bp and cccp'. Together they form a unique fingerprint.

Cite this