For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Iterative Decoding Based on the Concave-Convex Procedure
Tomoharu SHIBUYA Ken HARADA Ryosuke TOHYAMA Kohichi SAKANIWA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Coding Theory
concave-convex procedure, iterative decoding, Bethe free energy, LDPC codes, belief propagation,
Full Text: PDF>>
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.