Paper Info
Title
Decoding Algorithm of Low-density Parity-check Codes based on Bowman-Levin Approximation
Abstract
Belief propagation (BP) and the concave-convex procedure (CCCP) are algorithms that use the Bethe free energy as a cost function and are used to solve information processing tasks. We have developed a new algorithm that also uses the Bethe free energy but changes the roles of the master and slave variables. This is called the Bowman-Levin (BL) approximation in the domain of statistical physics. When we applied the BL approximation to decode the regular low-density parity-check (LDPC) codes over an additive white Gaussian noise (AWGN) channel, its average performance was roughly similar to that of either BP or CCCP, but slightly outperforms them if the vast calculation cost is not prohibitive. This implies that our algorithm based on the BL approximation can be successfully applied to other problems to which BP or CCCP have already been applied. We also found that the decoding dynamics of the BL algorithm particularly depend on the number of inner loops. These differences from BP may be important in understanding the complicated landscape of the Bethe free energy.
Year
DOI
Venue
2009
10.1007/s00354-008-0069-1
New Generation Comput.
Keywords
Field
DocType
Bethe Free Energy,Error Correcting Code,Low-density Parity-check (LDPC) Codes,Bowman-Levin Approximation,Belief Propagation (BP)
Information processing,Low-density parity-check code,Computer science,Algorithm,Communication channel,Theoretical computer science,Error detection and correction,Decoding methods,Additive white Gaussian noise,Low density parity check ldpc codes,Belief propagation
Journal
Volume
Issue
ISSN
27
4
0288-3635
Citations 
PageRank 
References 
0
0.34
5
Authors
4
Name
Order
Citations
PageRank
Ken-ichi Tamura100.34
Miho Komiya200.68
Masato Inoue3174.13
Yoshiyuki Kabashima413627.83