Research Article
Low-Complexity LDPC Decoding Algorithm Based on Layered Vicinal Variable Node Scheduling
| 1: Initialize all , and Itermax | | 2: for to Itermax do | | 3: for every ordered based on the influence metric do | | 4: for every do | | 5: for every do | | 5: Generate and propagate | | 6: end for line 5 | | 7: end for line 4 | | 8: for every do | | 7: Calculate | | 8: Generate and propagate | | 9: enf for line 8 | | 10: Calculate | | 11: end for line 3 | | 12: if stopping rule is not satisfied then | | 13: Go back to line 3 | | 14: end if | | 15: end for line 2 |
|