Some Notes on the CCCP Decoding of Linear Codes

スポンサーリンク

概要

• 論文の詳細を見る

• Since the joint distribution considered in the CCCP decoding presented in the previous work is different from the a posteriori probability considered in the usual sum-product decoding, there is the possibility that the direct comparison of error performance of those decoding algorithms might be unfair. In this paper, we clear up this suspicion by showing that an objective function that is equivalent to the one minimized in the conventional CCCP decoding can be derived from the a posteriori probability distribution treated in the sum-product algorithm. Moreover, we present more efficient implementation of the CCCP decoding.

• 社団法人電子情報通信学会の論文
• 2005-05-19

著者

• Shibuya Tomoharu

  R&D Department, National Institute of Multimedia Education

• Shibuya Tomoharu

  Sophia Univ. Tokyo Jpn

関連論文

• Design of IRA codes with Joint Degree Distributions
• Detailedly Represented Irregular Low-Density Parity-Check Codes(Coding Theory)(Information Theory and Its Applications)
• Iterative Decoding Based on the Concave-Convex Procedure(Coding Theory)
• On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs(Coding Theory)(Information Theory and Its Applications)
• Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure(Cording Theory)(Information Theory and Its Applications)
• Some Notes on the CCCP Decoding of Linear Codes

スポンサーリンク