From: Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms
N | L (SB) | L (MB) | L (upper bound) | \(\frac {L}{N}\) (SB) | \(\frac {L}{N}\) (MB) | \(\frac {L}{N}\) (upper bound) |
---|---|---|---|---|---|---|
1000 | 651 | 649 | 736 | 0.651 | 0.649 | 0.736 |
2640 | 1743 | 1738 | 1943 | 0.66122 | 0.65833 | 0.735984 |
4000 | 2645 | 2640 | 2820 | 0.66125 | 0.66 | 0.705 |
4896 | 3245 | 3243 | 3468 | 0.66278 | 0.66237 | 0.708333 |
8000 | 5307 | 5310 | 5536 | 0.66337 | 0.66375 | 0.692 |
10000 | 6652 | 6649 | 6845 | 0.6652 | 0.6649 | 0.6845 |