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

Pseudocode 3

Pseudocodes of WBFSBP.

0: Set iteration number 𝑘=0, take 𝑘_max as the maximum number of iteration, pick up 𝑤_𝑛,𝑚,

 Set every 𝑚_𝑐→𝑣=0, every 𝑚_{𝑣𝑗→𝑐𝑖}=𝐶_𝑣𝑗.

1: Compute 𝑠^𝑘=𝑧^𝑘𝐻^𝑇, if 𝑠^𝑘=𝟎, stop decoding and output 𝑧^𝑘.

2: For 𝑛=1,2,…𝑁, compute

          𝑒^𝑘_WBF,𝑛=∑_{𝑚∈𝒩(𝑛)}(2𝑠^𝑘_𝑚−1)𝑤_𝑛,𝑚−𝛼𝑦_𝑛

3: sort 𝐸^𝑘_WBF,𝑚 in descending order and put the corresponding check-nodes to 𝑈

4: while stop rules unsatisfied  do

5:  for 𝑖  do

6:   for 𝑖th check-node 𝑐_𝑈𝑖 in 𝑈

7:   for every 𝑣_𝑏∈𝒩(𝑐_𝑈𝑖)  do

8:   compute and generate 𝑚_{𝑣𝑏→𝑐𝑈𝑖}

9:   end for

10:    for every 𝑣_𝑏∈𝒩(𝑐_𝑈𝑖)  do

11:    compute and generate 𝑚_{𝑐𝑈𝑖→𝑣𝑏}

12:    end for

13:  end for

14: end while