Weighted-Bit-Flipping-Based Sequential Scheduling Decoding Algorithms for LDPC Codes

Abstract EN

Low-density parity-check (LDPC) codes can be applied in a lot of different scenarios such as video broadcasting and satellite communications.

LDPC codes are commonly decoded by an iterative algorithm called belief propagation (BP) over the corresponding Tanner graph.

The original BP updates all the variable-nodes simultaneously, followed by all the check-nodes simultaneously as well.

We propose a sequential scheduling algorithm based on weighted bit-flipping (WBF) algorithm for the sake of improving the convergence speed.

Notoriously, WBF is a low-complexity and simple algorithm.

We combine it with BP to obtain advantages of these two algorithms.

Flipping function used in WBF is borrowed to determine the priority of scheduling.

Simulation results show that it can provide a good tradeoff between FER performance and computation complexity for short-length LDPC codes.