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

<div>BER vs. the maximum number of iteration of decoding algorithms: flooding, HS, OVRBP, and LWNS for irregular LDPC code (576, 144) at <svg height="12.5794pt" id="M175" style="vertical-align:-3.29107pt" version="1.1" viewbox="-0.0498162 -9.28833 63.7841 12.5794" width="63.7841pt" 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="M593 650H142L136 622C219 616 224 611 209 531L130 120C114 39 108 34 23 28L17 0H501C518 32 557 130 568 158L540 169C519 132 495 93 469 70C439 43 409 35 332 35C272 35 241 37 225 50C211 61 211 89 222 149L253 320H350C441 320 443 312 441 239H471L510 434H481C455 366 448 358 360 358H260L303 572C311 613 312 615 348 615H431C509 615 522 603 532 581C544 555 546 531 545 491L574 493C583 555 592 631 593 650Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,7.943,3.132)"><path d="M460 334C460 396 434 451 378 451C330 451 241 408 148 300H146L237 679C241 697 241 710 232 710C213 710 153 684 67 675L66 646H95C141 646 145 642 134 595L39 170C23 97 31 54 46 33C64 8 100 -12 137 -12C178 -12 234 3 298 43C391 101 460 222 460 334ZM371 320C371 204 316 89 248 51C230 41 208 37 192 37C143 37 102 72 119 166C124 194 129 215 135 235C202 323 298 392 335 392C353 392 371 372 371 320Z"></path></g><g transform="matrix(.013,0,0,-0.013,12.807,0)"><path d="M368 703H309L44 -163H104L368 703Z"></path></g><g transform="matrix(.013,0,0,-0.013,18.168,0)"><path d="M822 650H589L583 622C660 617 677 607 674 561C672 534 664 481 647 390L600 137H596L273 650H126L120 622C176 620 194 615 207 594C221 571 225 557 214 504L161 257C141 166 129 112 121 85C108 42 83 30 29 28L23 0H260L266 28C193 33 173 42 176 89C178 122 186 172 202 255L256 527H259L583 -8H612L690 390C708 481 720 535 728 558C744 603 756 619 816 622L822 650Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,28.23,3.132)"><path d="M245 635C92 635 37 457 37 312C37 149 91 -12 244 -12C395 -12 449 166 449 312C449 469 395 635 245 635ZM243 598C332 598 358 454 358 312C358 173 334 26 245 26C158 26 128 174 128 313S152 598 243 598Z"></path></g><g transform="matrix(.013,0,0,-0.013,36.809,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,48.072,0)"><path d="M285 378C315 398 338 416 353 432C373 451 384 474 384 503C384 579 325 635 236 635H235C182 635 136 610 108 579L65 516L85 496C110 533 150 575 205 575C258 575 300 543 300 481C300 407 232 369 141 339L147 310C163 315 188 321 211 321C268 321 338 284 338 192C338 94 288 40 217 40C160 40 119 68 93 91C85 98 77 97 69 91C60 84 47 71 46 58C44 46 48 35 62 22C75 10 116 -12 162 -12C234 -12 424 62 424 224C424 297 373 359 285 376V378Z"></path></g><g transform="matrix(.013,0,0,-0.013,54.312,0)"><path d="M113 -12C146 -12 170 11 170 46C170 78 146 103 114 103S58 78 58 46C58 11 82 -12 113 -12Z"></path></g><g transform="matrix(.013,0,0,-0.013,57.276,0)"><path d="M153 550H386L412 615L406 623H120L82 318C104 327 142 338 184 338C294 338 347 275 347 187C347 112 305 39 221 39C160 39 119 71 97 89C88 97 80 96 71 90C59 80 50 67 49 57C48 45 52 36 66 23C80 9 123 -12 169 -12C221 -11 288 15 342 59C403 109 431 165 431 225C431 308 366 395 238 395C212 395 165 379 127 364L153 550Z"></path></g></svg> dB.</div>

Modelling and Simulation in Engineering

fig10

Figure 10

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