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

<table class="table-group" id="tab4"><tr><td><table class="table"><tr><td class="thead-hr" colspan="5"><hr/></td></tr><tr class="thead"><td class="align_left">Algorithms</td><td class="align_center">GBF, SBF</td><td class="align_center">WBF</td><td class="align_center">GDBF, NGDBF</td><td class="align_center">TRSBF</td></tr><tr><td class="thead-hr" colspan="5"><hr/></td></tr><tr><td class="align_left"><b>Complexity</b></td><td class="align_center">O (I<sub>tr</sub>. m.n)</td><td class="align_center">O (I<sub>tr</sub>. m.n)</td><td class="align_center">O (I<sub>tr</sub>. m.n<sup>2</sup>)</td><td class="align_center">O (I<sub>tr</sub>. m.n<sup>2</sup>)</td></tr><tr class="table-tr"><td colspan="5"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>The complexity of the BF algorithms.</div>

Wireless Communications and Mobile Computing

tab4

Table 4

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