Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure

Tomoharu SHIBUYA

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E86-A    No.10    pp.2601-2606
Publication Date: 2003/10/01
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
LDPC codes,  iterative decoding,  belief propagation,  concave-convex procedure,  Bethe free energy,  

Full Text: PDF>>
Buy this Article

In this letter, we show the effectiveness of a double-loop algorithm based on the concave-convex procedure (CCCP) in decoding linear codes. For this purpose, we numerically compare the error performance of CCCP-based decoding algorithm with that of a conventional iterative decoding algorithm based on belief propagation (BP). We also investigate computational complexity and its relation to the error performance.