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

<div>Cycle of length 4 between <svg height="11.3463pt" id="M83" style="vertical-align:-5.52893pt" version="1.1" viewbox="-0.0498162 -5.81737 10.3582 11.3463" width="10.3582pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M219 86C216 168 211 250 206 337C201 410 189 448 163 448C131 448 79 396 43 344L60 322C91 359 110 375 118 375S132 358 136 298C141 238 152 81 155 -12H182C242 62 331 177 390 258C435 321 451 360 451 391C450 424 432 448 408 448C390 448 372 435 366 419C362 410 362 401 366 394C373 383 376 367 376 350C376 283 262 138 221 86H219Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,5.811,3.132)"><path d="M400 606C400 634 383 656 353 656C316 656 294 620 294 593C294 564 317 545 343 545C375 545 400 573 400 606ZM366 351C379 413 381 451 356 451C323 451 251 408 183 341L199 313C223 335 267 365 277 365C285 365 284 354 277 312C245 132 222 27 193 -100C182 -148 160 -188 131 -188C113 -188 90 -178 75 -170C64 -164 55 -168 48 -175C38 -185 24 -203 24 -222S48 -257 71 -257C89 -257 131 -241 186 -192C243 -141 286 -46 310 74L366 351Z"></path></g></svg> and their vicinal variable nodes.</div>

Modelling and Simulation in Engineering

fig4

Figure 4

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