Decoding Algorithm of Low Density Parity Check Code

摘要

LDPC decoding is based on iterative algorithms. It propagates extrinsic and a priori information through the bipartite graph which is the link between variable nodes and parity check nodes. In this paper, we compute and we compare the performance of the rst introduced LDPC decoding algorithms (BP and BP-Based) in terms of binary operation numbers in order to construct cryptographic shemes.