Constraint relaxation and annealed belief propagation for binary networks

Yen Chih Chen*, Yu-Ted Su

*此作品的通信作者

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose two novel generalized belief propagation (BP) algorithms to improve the convergence behavior of the conventional BP algorithm. By incorporating a dynamic temperature into the free energy formulation, message passing is performed on a dynamic surface of energy cost. The proposed cooling process helps BP converge to a stable fixed point with a lower energy value that leads to better estimations. For decoding turbo-like error correcting codes, we adopt a parametric Gaussian approximation to relax the binary parity check constraints and generalize the conventional binary networks as well. Both the computational complexity and the convergence rate of the proposed annealed BP algorithms are almost the same as those of the conventional BP algorithm. Simulated performance of the proposed algorithms when they are used to decode a low density parity check (LDPC) code and the (23,12) Golay code is presented to validate our proposals.

原文English
主出版物標題Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
頁面321-325
頁數5
DOIs
出版狀態Published - 1 十二月 2007
事件2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
持續時間: 24 六月 200729 六月 2007

出版系列

名字IEEE International Symposium on Information Theory - Proceedings
ISSN(列印)2157-8101

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
國家/地區France
城市Nice
期間24/06/0729/06/07

指紋

深入研究「Constraint relaxation and annealed belief propagation for binary networks」主題。共同形成了獨特的指紋。

引用此