Multiple LDPC Decoding Method and Device Based on Code Element Reliability Dominance Nodes Subset Partition Criterion
A multiple LDPC decoding method based on the code element reliability dominance node subset partition criterion, includes: Sl: computing and truncation initialization information; S2: judging 5 current and maximum number of iterations, if the current number equals the maximum number, exiting the ite...
Saved in:
Main Authors | , , , , , , , , , |
---|---|
Format | Patent |
Language | English |
Published |
24.03.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A multiple LDPC decoding method based on the code element reliability dominance node subset partition criterion, includes: Sl: computing and truncation initialization information; S2: judging 5 current and maximum number of iterations, if the current number equals the maximum number, exiting the iterative decoding, otherwise entering step S3: updating the information of the check nodes in processing subset M..., computing the external information and truncating the information, S4: replacing the external information of the check nodes, S5: computing the posterior probability . . L S . . Laß-"LI!" S . Lag-"LIN S . information "( ) and information vector "'" ( ), and replacmg "'" ( ); S6: conduct1ng fi] = arg max{LV (s)} 10 decision decoding on each variable node according to SEE] ' ; S7: checking result of . . . . AT _ . . . . . . . . the dec1s1on decod1ng, 1f HV _ 0, decod1ng 1s fin1shed, otherw1se, enter1ng step S8: part1tlon1ng the check nodes, of which the information needs to be updated in next iteration, into the subset M(1), simultaneously, making the number of iterations iter ziler +1, and jumping to S2 for the next iterative decoding. 28 |
---|---|
Bibliography: | Application Number: NL20202026064 |