Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

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

Zhanzhan Zhao, Xiaopeng Jiao, Jianjun Mu, Yucheng He, Junjun Guo

Published Jun 30, 2019• 1 citation
Publisher

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 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.

DOI
10.1587/transfun.e102.a.930

Related papers

A Stopping Criterion for Symbol Flipping Decoding of Non-Binary LDPC Codes

Zhanzhan Zhao, Xiaopeng Jiao, Jianjun Mu +1 more

A properly designed stopping criterion for iterative decoding algorithms can save a number of iterations and lead to a considerable reduction of system latency. The symbol flipping decoding algorithms based on prediction (SFDP) have been proposed recently for efficient decoding of non-binary low-density parity-check (LDPC) codes. To detect the decoding frames with slow convergence or even non-convergence, we track the number of oscillations on the value of objective function during the iterations. Based on this tracking number, we design a simple stopping criterion for the SFDP algorithms. Simulation results show that the proposed stopping criterion can significantly reduce the number of iterations at low signal-to-noise ratio regions with slight error performance degradation.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•May 9, 2021•0 citations

Randomly Penalized Symbol Flipping Decoding of Non-Binary LDPC Codes

Zhanzhan Zhao, Xiaopeng Jiao, Jianjun Mu +1 more

Symbol flipping decoding (SFD) of non-binary low-density parity-check (NB-LDPC) codes has lower implementation complexity at a cost of performance degradation, when compared with other belief propagation decoding algorithms. This paper proposes modified SFD algorithms based on prediction (SFDP) for NB-LDPC codes by introducing random penalty items into the flipping metrics. Two types of noise with uniform and Gaussian distributions are considered. A probabilistic analysis shows theoretically that the randomly penalized SFDP algorithms can be advantageous in the correct flipping probability over their original versions. Simulation results show that the proposed penalizing methods exhibit significant performance gains for both regular and irregular NB-LDPC codes with different rates and alphabet sizes in both the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC).

IEEE Transactions on Vehicular Technology•Dec 31, 2020•4 citations

Dynamic Multi-Symbol Flipping Decoding of Non-Binary LDPC Codes

Xiuwen Bao, Ming Jiang, Dongli Fan +1 more

A dynamic multi-symbol (DM) flipping scheme is proposed for various symbol flipping decodings of non-binary low-density parity-check (NB-LDPC) codes. This new approach divides the whole decoding process into multiple stages according to the number of iterations and allows a different maximum number of symbols to be flipped in each stage. Numerical analysis reveals that the proposed multi-symbol flipping scheme can yield a higher probability of correct flipping with the dynamic flipping threshold. The proposed DM scheme can be highly parallelized, extensively improving the decoder throughput over existing symbol flipping decoding algorithms based on prediction (SFDP). Numerical results show that the DM scheme can significantly enhance the error correction capability and achieve faster convergence speed with little increase in average computational complexity.

IEEE Open Journal of the Communications Society•Jan 1, 2022•2 citations

Two Low-complexity Symbol Flipping Decoding Algorithms for Non-binary LDPC Codes

Haiqiang Chen, Yaolin Wang, Wenjuan Wei +4 more

Two low-complexity symbol flipping decoding algorithms, the Improved weighted-Algorithm B algorithm (Iwtd-AlgB) and the Truncation-based Distance-Symbol-Flipping-Decoding with Prediction (TD-SFDP) algorithm, are presented for non-binary Low Density Parity Check (LDPC) codes. For the Iwtd-AlgB algorithm, the scaling factor of the flipping metric can be replaced by the simple sums of the extrinsic information and the distance-based parameter, which can avoid the multiplication operations in the iterations and thus can reduce the decoding complexity. For the presented TD-SFDP algorithm, the variable nodes and the finite field symbols are truncated and classified based on the extrinsic information frequency and the flipping function. Only those nodes/symbols that satisfy the designed conditions can be involved in the message updating process. Simulations and numeric results show that, the presented two decoding algorithms can reduce the computational complexity at each iteration with a controllable performance degradation, thus can make efficient trade-offs between performance and complexity.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Jan 15, 2021•0 citations

Low-Complexity Symbol-Flipping Decoding Algorithms for Nonbinary LDPC Codes

박성현

Low-density parity-check (LDPC) codes have been shown to have near Shannon-limit performance when a probabilistic decoding is used and the code length goes to infinity. On the other hand, non-binary low-density parity-check (NB-LDPC) codes outperform binary LDPC codes for short code lengths. However, the coding gain of NB-LDPC codes comes from the expense of computational complexity. \n \nIn this thesis, we consider the problem of a trade-off between reasonable complexity and good error-rate performance of decoding nonbinary LDPC codes over GF($q$). We first introduce the existing decoding algorithms of nonbinary LDPC codes and compare with decoding algorithms of binary LDPC codes. Second, low-complexity decoding algorithms of nonbinary LDPC codes is considered and two low-complexity symbol-flipping algorithms based on D-SFDP is proposed. These algorithms outperform the existing D-SFDP algorithm by improving the flipping metric. Proposed algorithms provide good trade-off between complexity and error performance.

•Jan 1, 2018•0 citations

Momentum-Based Symbol Flipping Decoding Algorithms for Non-Binary LDPC Codes

Zhanzhan Zhao, Xiaopeng Jiao, Jianjun Mu +2 more

This paper investigates the application of gradient descent with momentum in symbol flipping decoding algorithms based on prediction (SFDP) for non-binary low-density parity-check (NB-LDPC) codes. The momentum added in the objective function of SFDP algorithms can provide inertia to the decoding process by considering the flipping states in the past iterations. Simulation results show that the proposed momentum-based SFDP algorithms perform significantly better than the original SFDP algorithms with low extra complexity. Furthermore, to lower the error floor of momentum-based SFDP algorithms, we also introduce artificial noises into the objective functions of momentum-based SFDP algorithms to help the iterative decoding escape from local optimum.

IEEE Transactions on Vehicular Technology•Feb 22, 2023•1 citation
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.
A properly designed stopping criterion for iterative decoding algorithms can save a number of iterations and lead to a considerable reduction of system latency. The symbol flipping decoding algorithms based on prediction (SFDP) have been proposed recently for efficient decoding of non-binary low-density parity-check (LDPC) codes. To detect the decoding frames with slow convergence or even non-convergence, we track the number of oscillations on the value of objective function during the iterations. Based on this tracking number, we design a simple stopping criterion for the SFDP algorithms. Simulation results show that the proposed stopping criterion can significantly reduce the number of iterations at low signal-to-noise ratio regions with slight error performance degradation.
Symbol flipping decoding (SFD) of non-binary low-density parity-check (NB-LDPC) codes has lower implementation complexity at a cost of performance degradation, when compared with other belief propagation decoding algorithms. This paper proposes modified SFD algorithms based on prediction (SFDP) for NB-LDPC codes by introducing random penalty items into the flipping metrics. Two types of noise with uniform and Gaussian distributions are considered. A probabilistic analysis shows theoretically that the randomly penalized SFDP algorithms can be advantageous in the correct flipping probability over their original versions. Simulation results show that the proposed penalizing methods exhibit significant performance gains for both regular and irregular NB-LDPC codes with different rates and alphabet sizes in both the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC).
A dynamic multi-symbol (DM) flipping scheme is proposed for various symbol flipping decodings of non-binary low-density parity-check (NB-LDPC) codes. This new approach divides the whole decoding process into multiple stages according to the number of iterations and allows a different maximum number of symbols to be flipped in each stage. Numerical analysis reveals that the proposed multi-symbol flipping scheme can yield a higher probability of correct flipping with the dynamic flipping threshold. The proposed DM scheme can be highly parallelized, extensively improving the decoder throughput over existing symbol flipping decoding algorithms based on prediction (SFDP). Numerical results show that the DM scheme can significantly enhance the error correction capability and achieve faster convergence speed with little increase in average computational complexity.
Two low-complexity symbol flipping decoding algorithms, the Improved weighted-Algorithm B algorithm (Iwtd-AlgB) and the Truncation-based Distance-Symbol-Flipping-Decoding with Prediction (TD-SFDP) algorithm, are presented for non-binary Low Density Parity Check (LDPC) codes. For the Iwtd-AlgB algorithm, the scaling factor of the flipping metric can be replaced by the simple sums of the extrinsic information and the distance-based parameter, which can avoid the multiplication operations in the iterations and thus can reduce the decoding complexity. For the presented TD-SFDP algorithm, the variable nodes and the finite field symbols are truncated and classified based on the extrinsic information frequency and the flipping function. Only those nodes/symbols that satisfy the designed conditions can be involved in the message updating process. Simulations and numeric results show that, the presented two decoding algorithms can reduce the computational complexity at each iteration with a controllable performance degradation, thus can make efficient trade-offs between performance and complexity.
Low-density parity-check (LDPC) codes have been shown to have near Shannon-limit performance when a probabilistic decoding is used and the code length goes to infinity. On the other hand, non-binary low-density parity-check (NB-LDPC) codes outperform binary LDPC codes for short code lengths. However, the coding gain of NB-LDPC codes comes from the expense of computational complexity. \n \nIn this thesis, we consider the problem of a trade-off between reasonable complexity and good error-rate performance of decoding nonbinary LDPC codes over GF(qqq). We first introduce the existing decoding algorithms of nonbinary LDPC codes and compare with decoding algorithms of binary LDPC codes. Second, low-complexity decoding algorithms of nonbinary LDPC codes is considered and two low-complexity symbol-flipping algorithms based on D-SFDP is proposed. These algorithms outperform the existing D-SFDP algorithm by improving the flipping metric. Proposed algorithms provide good trade-off between complexity and error performance.
This paper investigates the application of gradient descent with momentum in symbol flipping decoding algorithms based on prediction (SFDP) for non-binary low-density parity-check (NB-LDPC) codes. The momentum added in the objective function of SFDP algorithms can provide inertia to the decoding process by considering the flipping states in the past iterations. Simulation results show that the proposed momentum-based SFDP algorithms perform significantly better than the original SFDP algorithms with low extra complexity. Furthermore, to lower the error floor of momentum-based SFDP algorithms, we also introduce artificial noises into the objective functions of momentum-based SFDP algorithms to help the iterative decoding escape from local optimum.