Fast-Converging Flipping Rules for Symbol Flipping Decoding of Non-Binary LDPC Codes

Zhanzhan ZHAO  Xiaopeng JIAO  Jianjun MU  Yu-Cheng HE  Junjun GUO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A   No.7   pp.930-933
Publication Date: 2019/07/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.930
Type of Manuscript: LETTER
Category: Coding Theory
non-binary LDPC codes,  symbol flipping decoding,  flipping rules,  

Full Text: PDF>>
Buy this Article

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 symbol flipping decoding algorithms. In order to improve the convergence rate, we design new flipping rules with two phases for the SFDP algorithms. In the first phase, two or more symbols are flipped at each iteration to allow a quick increase of the objective function. While in the second phase, only one symbol is flipped to avoid the oscillation of the decoder when the objective function is close to its maximum. Simulation results show that the SFDP algorithms with the proposed flipping rules can reduce the average number of iterations significantly, whereas having similar performances when compared to the original SFDP algorithms.