TY - JOUR
T1 - An ldpcc decoding algorithm based on bowman-levin approximation -comparison with bp and cccp
AU - Inoue, Masato
AU - Komiya, Miho
AU - Kabashima, Yoshiyuki
N1 - Funding Information:
ACKNOWLEDGEMENTS This work was partially supported by a Grant-in-Aid for Scientific Research on Priority Areas No. 14084206.
Publisher Copyright:
© 2005 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85114372723&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85114372723&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2005.1523373
DO - 10.1109/ISIT.2005.1523373
M3 - Conference article
AN - SCOPUS:85114372723
SN - 2157-8095
VL - 2005-January
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
M1 - 1523373
T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05
Y2 - 4 September 2005 through 9 September 2005
ER -