Low-Complexity LDPC Decoding Algorithm Based on Layered Vicinal Variable Node Scheduling

Figure 3

(a) Example of parity check matrix. (b) Its corresponding parity check equations, where ⊕ denotes a modulo 2 addition (i.e., XOR); the variable node appear in , , and ; the variable nodes are the vicinal of .

(a)

(b)