Fast-Converging Flipping Rules for Symbol Flipping Decoding of Non-Binary LDPC Codes
Symbol (formal)
DOI:
10.1587/transfun.e102.a.930
Publication Date:
2019-06-30T18:10:35Z
AUTHORS (5)
ABSTRACT
The symbol flipping decoding algorithms based on prediction (SFDP) for non-binary LDPC codes perform well in terms of error performances but converge slowly when compared to other algorithms. In order improve the convergence rate, we design new rules with two phases SFDP first phase, or more symbols are flipped at each iteration allow a quick increase objective function. While second only one is avoid oscillation decoder function close its maximum. Simulation results show that proposed can reduce average number iterations significantly, whereas having similar original
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (11)
CITATIONS (1)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....