Study of Weighted Residual Layered Belief Propagation for Decoding of LDPC Codes

TL;DR

The weighted residual layered belief propagation (WR-LBP) decoding algorithm is devised, which exploits the residual within a structured layer framework to speed the number of required decoding iterations.

Abstract

In this work, we investigate the decoding of Low-Density Parity-Check (LDPC) codes using informed dynamic scheduling algorithms that require a reduced number of iterations. In particular, we devise the weighted residual layered belief propagation (WR-LBP) decoding algorithm, which exploits the residual within a structured layer framework to speed the number of required decoding iterations. The proposed WR-LBP algorithm is assessed against important LDPC decoding algorithms, in terms of the number of iterations required for convergence and the bit error rates.

Figures (5)

• Figure 1: Basic elements of a digital communication system.
• Figure 2: Tanner Graph, exchanges intrinsic information between check nodes to variable nodes
• Figure 3: BER using 3 iterations and 5000 blocks.
• Figure 4: BER using 5 iterations and 5000 blocks.
• Figure 5: BER versus the number of iterations with $E_b/N_0$=3.5