Fast implementation of CCCP-based decoding algorithm for LDPC codes and an evaluation of its error performance

摘要

It is well known that a decoding algorithm based on sum-product algorithm requires a little computation to give extremely good decoding performance. A conventional CCCP-based decoding algorithm is expected to outperform sum-product decoding algorithm. However, it has huge computational complexity as opposed to sum-product algorithm. In our report, we propose a new CCCP-based decoding algorithm whose computational complexity is comparable to that of sum-product algorithm. We also show by numerical simulations that the decoding performance of the proposed algorithm is better than that of sum-product algorithm for an LDPC code with relatively short length.