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

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

박성현

Published Jan 1, 2018• 0 citations
OpenAlex

Abstract

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.

Related papers

비이진 LDPC 부호를 위한 낮은 복잡도를 가지는 복호 알고리즘

조한설

Low complexity parity-check (LDPC) codes have been shown to approach Shannon-limit performance for long code length. On the other hand, for moderate code length, the error performance can be improved by constructing LDPC codes over finite fleld fields GF(q). However, this improvement is achieved at the expense of increased decoding complexity.In this thesis, we consider the problem of decoding nonbinary LDPC codes over GF(q) with reasonable complexity and good error-rate performance. Two decoding algorithms with low complexity for nonbinary LDPC codes are proposed. First algorithm is the extension of weighted symbol-flipping (WSF) algorithm, and it is called multiple weighted symbol-flipping (MWSF) algorithm in this thesis. Second algorithm is based on Iterative Soft-Based Majority logic (ISBM) algorithm, and it is called extended ISBM (EISBM) in this thesis. These algorithms provide effective trade-off between decoding complexity and error-performance compared to the existing decoding algorithms.

•Jan 1, 2012•0 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

Parallel Symbol-Flipping Decoding for Non-Binary LDPC Codes

Chao-Cheng Huang, Chi‐Jen Wu, Chao‐Yu Chen +1 more

A new low-complexity parallel symbol-flipping decoding algorithm for non-binary low-density parity-check (NB-LDPC) codes is proposed. The algorithm outperforms quite a number of existing reliability-based message-passing algorithms, and its computation complexity is smaller than that of almost all the previously proposed iterative decoding algorithms for NB-LDPC codes. It is suitable for decoding NB-LDPC codes whose parity-check matrices have large column weights.

IEEE Communications Letters•Jun 1, 2013•25 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

비이진 LDPC 부호를 위한 낮은 복잡도의 복호 방법 및 인터리버 설계

김경범

Low density parity-check (LDPC) codes have been shown to approach the Shannon-limit performance when the code length goes to infinify. On the other hand, for moderate code lengths, the error performance can be farther improved by constructing LDPC codes over finite fleld fields GF(q). However, this improvement is achieved at the expense of increased decoding complexity.In this thesis, we consider the problem of decoding nonbinary LDPC codes over GF(q) with reasonable complexity and good error-rate performance. First, the decoding algorithm with low complexity for nonbinary LDPC codes is proposed, named the weighted symbol reliablity algorithm (WSR) which uses syndrome checking result for measuring reliability of symbol nodes. Second, we analyze the extended min-sum (EMS) algorithm proposed by Declearq and Fossorier. These two approaches provide an effective trade-off between decoding complexity and error-performance, compared with the existing decoding algorithms. We also consider nonbinary LDPC codes conbined with high order QAM in order to apply them to realistic communication systems.

•Jan 1, 2014•0 citations

Reduced complexity and improved performance decoding algorithm for nonbinary LDPC codes over GF(q)

Xin Chen, Aidong Men

Low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, we present a new reduced-complexity belief propagation (BP) decoding algorithm for GF(q)-LDPC codes by analyzing the reliability of code symbols. Instead of update all the variable nodes during iteration, we just update variable nodes which are mostly to be in an error. The algorithm also shows a property to reduce the effects of oscillating on decoding. The simulations prove that we could improve performance and reduce complexity at the same time for short and medium GF(q)-LDPC codes.

IEEE International Conference on Communication Technology (ICCT)•Nov 1, 2008•6 citations
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.
Low complexity parity-check (LDPC) codes have been shown to approach Shannon-limit performance for long code length. On the other hand, for moderate code length, the error performance can be improved by constructing LDPC codes over finite fleld fields GF(q). However, this improvement is achieved at the expense of increased decoding complexity.In this thesis, we consider the problem of decoding nonbinary LDPC codes over GF(q) with reasonable complexity and good error-rate performance. Two decoding algorithms with low complexity for nonbinary LDPC codes are proposed. First algorithm is the extension of weighted symbol-flipping (WSF) algorithm, and it is called multiple weighted symbol-flipping (MWSF) algorithm in this thesis. Second algorithm is based on Iterative Soft-Based Majority logic (ISBM) algorithm, and it is called extended ISBM (EISBM) in this thesis. These algorithms provide effective trade-off between decoding complexity and error-performance compared to the existing decoding algorithms.
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.
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).
Low density parity-check (LDPC) codes have been shown to approach the Shannon-limit performance when the code length goes to infinify. On the other hand, for moderate code lengths, the error performance can be farther improved by constructing LDPC codes over finite fleld fields GF(q). However, this improvement is achieved at the expense of increased decoding complexity.In this thesis, we consider the problem of decoding nonbinary LDPC codes over GF(q) with reasonable complexity and good error-rate performance. First, the decoding algorithm with low complexity for nonbinary LDPC codes is proposed, named the weighted symbol reliablity algorithm (WSR) which uses syndrome checking result for measuring reliability of symbol nodes. Second, we analyze the extended min-sum (EMS) algorithm proposed by Declearq and Fossorier. These two approaches provide an effective trade-off between decoding complexity and error-performance, compared with the existing decoding algorithms. We also consider nonbinary LDPC codes conbined with high order QAM in order to apply them to realistic communication systems.
Low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, we present a new reduced-complexity belief propagation (BP) decoding algorithm for GF(q)-LDPC codes by analyzing the reliability of code symbols. Instead of update all the variable nodes during iteration, we just update variable nodes which are mostly to be in an error. The algorithm also shows a property to reduce the effects of oscillating on decoding. The simulations prove that we could improve performance and reduce complexity at the same time for short and medium GF(q)-LDPC codes.