Two-Round Selection-Based Bit Flipping Decoding Algorithm for LDPC Codes

Algorithm 1

Gallager BF algorithm.

Step 0: Initialize the parameters: p = 0 (p is the iteration counter) and T (depends on the variant of the algorithm).

Step 1: Compute s = (s₀, s₁… s_m-1) ← z.H^T. If s = 0, then stops the algorithm.

Step 2: Compute for all indices k.

Step 3: If max () < T (or max() < T), then stops the algorithm.

Step 4: Flip all bits , in the sequence z, with ≥ T, p ← p + 1.

Step 5: If p > p_max, then stop the algorithm. Else go to Step 1.