Iterative Decoding Based on the Concave-Convex Procedure

Tomoharu SHIBUYA  Ken HARADA  Ryosuke TOHYAMA  Kohichi SAKANIWA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E88-A   No.5   pp.1346-1364
Publication Date: 2005/05/01
Online ISSN: 
DOI: 10.1093/ietfec/e88-a.5.1346
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Coding Theory
Keyword: 
concave-convex procedure,  iterative decoding,  Bethe free energy,  LDPC codes,  belief propagation,  

Full Text: PDF>>
Buy this Article




Summary: 
New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding.