Research Article
Low-Complexity LDPC Decoding Algorithm Based on Layered Vicinal Variable Node Scheduling
Algorithm 2
Parallel layer variable nodes.
| 1: for every from 0 to do | | 2: Initialize all , | | 3: end for line 1 | | 4: for every from 0 to do | | 5: if | | 6: , | | 7: Search and assigned to each de | | 8: for each from 0 to do | | 9: if | | 10: Search | | 11: if there is no de that | | 12: | | 13: end if line 11 | | 13: end if line 9 | | 16: end for line 8 | | 13: end if line 5 | | 17: end for line 4 |
|