Research Article
Node-Subset Scheduling with a Subset-Reset Mechanism for the Decoding Algorithm of Nonbinary LDPC Codes
| (1) | for the given relevant parameters , initialize all , and set | | (2) | set , and put all check nodes into | | (3) | for to do | | (4) | update the check nodes in , and compute | | (5) | compute the , and update V2C message | | (6) | for to , do | | (7) | compute the estimated symbol | | | | | (8) | end for | | (9) | for all variable nodes, do | | (10) | mark according to equation (15) | | (11) | end for | | (12) | divide check nodes into two node subsets according to equation (15) | | (13) | collect the values of the last iterations | | (14) | if current iteration , then | | (15) | compute the and | | (16) | if, then | | (17) | reset the processing subset, and put all check nodes into | | (18) | end if | | (19) | end if | | (20) | if is not satisfied, then | | (21) | go back to line 4 | | (22) | else return estimated codeword | | (23) | end if | | (24) | end for | | (25) | return estimated codeword |
|
