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

IEEE Communications Letters

Hard-Information Bit-Reliability Based Decoding Algorithm for Majority-Logic Decodable Nonbinary LDPC Codes

Xiangcheng Li, Tuanfa Qin, Haiqiang Chen, Youming Sun, Qi Liang, Liping Luo

Published Mar 3, 2016• 10 citations
Publisher

Abstract

A modified bit-reliability based decoding algorithm is presented based on a recent work by Huang et al. For the presented algorithm, only one Galois field element is passed and exchanged along the edges of the Tanner graph. At variable nodes, full messages rather than extrinsic messages are processed to further reduce the computational complexity. At check nodes, only hard reliability is considered and the main operation is to compute the check-sum and send one extrinsic symbol back to variable nodes. Simulation results show that, even with lower complexity and less memory consumption, the presented algorithm still can perform very closely to the original wBRB algorithm with low quantization bits (3 ~ 4 bits) when decoding the majority-logic decodable nonbinary LDPC codes. For codes constructed in high order fields, the presented algorithm can even outperform the original wBRB algorithm.

DOI
10.1109/lcomm.2016.2537812

Related papers

Bit-Reliability Based Low-Complexity Decoding Algorithms for Non-Binary LDPC Codes

Qin Huang, Mu Zhang, Zulin Wang +1 more

This paper presents bit-reliability based majority-logic decoding (MLgD) algorithms for non-binary LDPC codes. The proposed algorithms pass only one Galois field element and its reliability along each edge of the Tanner graph of a non-binary LDPC code. Since their reliability updates are in terms of bits rather than symbols, they are more efficient than traditional MLgD based decoding algorithms. By weighting the soft reliability of the extrinsic information-sums based on their hard reliability, the proposed algorithms can achieve good error performance for non-binary LDPC codes with various column weights. Moreover, their computational complexity and memory consumption are remarkably reduced compared with existing MLgD based decoding algorithms. As a result, they provide effective tradeoffs between error performance and complexity for decoding of non-binary LDPC codes.

IEEE Transactions on Communications•Nov 12, 2014•36 citations

A BRB Algorithm for Non-Binary LDPC Decoding With Single-Symbol Extrinsic Information Modification

Xiangcheng Li, Ziyun Ruan, Dongri Ban +2 more

In the weighted bit-reliability based (wBRB) Non-binary LDPC decoding algorithm, using the minimum bit-reliability as the reliability of the entire symbol for information updating significantly decreases the decoding performance in cases of a large order of Galois field or small column weight. The improved algorithm——MwBRB increases the decoding performance by introducing three kinds of extrinsic information transfer but suffers from high decoding complexity. To address these problems, a BRB Non-binary LDPC decoding algorithm based on single-symbol extrinsic information modification is proposed. At the variable node$V_{j}$, using a symbol-related reliability calculation method, the maximum reliability information and its corresponding most possible Galois field symbol are obtained, and then transferred to the check node$C_{i}$; at the check node$C_{i}$, only the most possible Galois field symbol is used for extrinsic information processing, and its reliability of the extrinsic information is represented by the minimum reliability of other Galois field symbols. Finally, at the check node$C_{i}$, the extrinsic information is processed by based on the Hamming distance coefficient in terms of bits. Simulation and performance analysis show that the proposed algorithm reduces the complexity by over 50% compared to the MwBRB algorithm, and maintains consistent or slightly superior decoding performance. Additionally, the proposed algorithm exhibits similar decoding performance to LDPC codes constructed by different methods and shows better robustness.

IEEE Access•Jan 1, 2024•0 citations

Two Enhanced Reliability-Based Decoding Algorithms for Nonbinary LDPC Codes

Liyuan Song, Qin Huang, Zulin Wang +2 more

The weighted bit-reliability-based (wBRB) algorithm for nonbinary LDPC codes suffers certain loss of symbol-reliability. Thus, this paper enhances its soft-decision version by passing multiple symbol-reliability instead of bit-reliability. Furthermore, it demonstrates that plurality robustly indicates symbol-reliability of extrinsic information-sums. Thus, this paper enhances the hard-decision version by introducing symbol-reliability from plurality. Analysis results show that these two enhanced decoding algorithms significantly outperform the wBRB algorithm with reasonable overhead.

IEEE Transactions on Communications•Dec 25, 2015•17 citations

Bit Reliability-Based Decoders for Non-Binary LDPC Codes

Qin Huang, Shuai Yuan

Message-passing decoders typically perform well for nonbinary low-density parity-check (NB-LDPC) codes with large computational complexity. As another type of simplified decoders, symbol-reliability-based decoders further reduce the computational complexity. However, the previously proposed algorithms suffer severe error performance degradation for NB-LDPC codes with low column weights. In this paper, a weighted bit-reliability based (wBRB) decoder for NB-LDPC codes is developed and implemented with efficient layered partial-parallel structure. It not only balances the tradeoff between complexity and error performance, but also reduces the memory usage significantly. Furthermore, to enhance the performance of the wBRB decoder, a full bit-reliability-based (FBRB) decoder is proposed. The FBRB decoder is derived based on the binary matrix representation of the nonzero entries in the parity-check matrix. Since more bit-reliability values are passed through the edges of the Tanner graph, the FBRB decoder can achieve better error performance and faster convergence rate than the wBRB decoder. Both of the decoders are implemented on a Xilinx Virtex-5 XC5VLX155T FPGA device for a (403,226) code over GF(25). The results shows that they achieve 118.98 and 95.73 Mbps throughput with 15 iterations, respectively.

IEEE Transactions on Communications•Nov 17, 2015•26 citations

Low error-floor majority-logic decoding based algorithm for non-binary LDPC codes

Liyuan Song, Mu Zhang, Qin Huang +1 more

The traditional majority-logic decoding (MLgD) based algorithms suffer error-floors for decoding non-binary LDPC codes with small column weights. This paper presents a bit-reliability based MLgD (BRB-MLgD) algorithm with low error-floors for non-binary LDPC codes. The proposed algorithm is carried out based on the binary representations of non-binary symbols. The reliability update along each edge of the Tanner graph of a non-binary LDPC code is in terms of bits rather than symbols. Thus, its computational complexity and memory consumption are less than those of the existing MLgD based algorithms. Simulation results indicate that the proposed algorithm can significantly reduce error-floors with small performance degradation in the waterfall region.

International Conference on Communications•Jun 1, 2015•2 citations

Dynamic Check Message Majority-Logic Decoding Algorithm for Non-binary LDPC Codes

Yichao Lu, Xiao Peng, Guifen Tian +1 more

Majority-logic algorithms are devised for decoding non-binary LDPC codes in order to reduce computational complexity. However, compared with conventional belief propagation algorithms, majority-logic algorithms suffer from severe bit error performance degradation. This paper presents a low-complexity reliability-based algorithm aiming at improving error correcting ability of majority-logic algorithms. Reliability measures for check nodes are novelly introduced to realize mutual update between variable message and check message, and hence more efficient reliability propagation can be achieved, similar to belief-propagation algorithm. Simulation results on NB-LDPC codes with different characteristics demonstrate that our algorithm can reduce the bit error ratio by more than one order of magnitude and the coding gain enhancement over ISRB-MLGD can reach 0.2-2.0dB, compared with both the ISRB-MLGD and IISRB-MLGD algorithms. Moreover, simulations on typical LDPC codes show that the computational complexity of the proposed algorithm is closely equivalent to ISRB-MLGD algorithm, and is less than 10% of Min-max algorithm. As a result, the proposed algorithm achieves a more efficient trade-off between decoding computational complexity and error performance.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2014•0 citations
A modified bit-reliability based decoding algorithm is presented based on a recent work by Huang et al. For the presented algorithm, only one Galois field element is passed and exchanged along the edges of the Tanner graph. At variable nodes, full messages rather than extrinsic messages are processed to further reduce the computational complexity. At check nodes, only hard reliability is considered and the main operation is to compute the check-sum and send one extrinsic symbol back to variable nodes. Simulation results show that, even with lower complexity and less memory consumption, the presented algorithm still can perform very closely to the original wBRB algorithm with low quantization bits (3 ~ 4 bits) when decoding the majority-logic decodable nonbinary LDPC codes. For codes constructed in high order fields, the presented algorithm can even outperform the original wBRB algorithm.
This paper presents bit-reliability based majority-logic decoding (MLgD) algorithms for non-binary LDPC codes. The proposed algorithms pass only one Galois field element and its reliability along each edge of the Tanner graph of a non-binary LDPC code. Since their reliability updates are in terms of bits rather than symbols, they are more efficient than traditional MLgD based decoding algorithms. By weighting the soft reliability of the extrinsic information-sums based on their hard reliability, the proposed algorithms can achieve good error performance for non-binary LDPC codes with various column weights. Moreover, their computational complexity and memory consumption are remarkably reduced compared with existing MLgD based decoding algorithms. As a result, they provide effective tradeoffs between error performance and complexity for decoding of non-binary LDPC codes.
In the weighted bit-reliability based (wBRB) Non-binary LDPC decoding algorithm, using the minimum bit-reliability as the reliability of the entire symbol for information updating significantly decreases the decoding performance in cases of a large order of Galois field or small column weight. The improved algorithm——MwBRB increases the decoding performance by introducing three kinds of extrinsic information transfer but suffers from high decoding complexity. To address these problems, a BRB Non-binary LDPC decoding algorithm based on single-symbol extrinsic information modification is proposed. At the variable nodeVjV_{j}Vj​, using a symbol-related reliability calculation method, the maximum reliability information and its corresponding most possible Galois field symbol are obtained, and then transferred to the check nodeCiC_{i}Ci​; at the check nodeCiC_{i}Ci​, only the most possible Galois field symbol is used for extrinsic information processing, and its reliability of the extrinsic information is represented by the minimum reliability of other Galois field symbols. Finally, at the check nodeCiC_{i}Ci​, the extrinsic information is processed by based on the Hamming distance coefficient in terms of bits. Simulation and performance analysis show that the proposed algorithm reduces the complexity by over 50% compared to the MwBRB algorithm, and maintains consistent or slightly superior decoding performance. Additionally, the proposed algorithm exhibits similar decoding performance to LDPC codes constructed by different methods and shows better robustness.
The weighted bit-reliability-based (wBRB) algorithm for nonbinary LDPC codes suffers certain loss of symbol-reliability. Thus, this paper enhances its soft-decision version by passing multiple symbol-reliability instead of bit-reliability. Furthermore, it demonstrates that plurality robustly indicates symbol-reliability of extrinsic information-sums. Thus, this paper enhances the hard-decision version by introducing symbol-reliability from plurality. Analysis results show that these two enhanced decoding algorithms significantly outperform the wBRB algorithm with reasonable overhead.
Message-passing decoders typically perform well for nonbinary low-density parity-check (NB-LDPC) codes with large computational complexity. As another type of simplified decoders, symbol-reliability-based decoders further reduce the computational complexity. However, the previously proposed algorithms suffer severe error performance degradation for NB-LDPC codes with low column weights. In this paper, a weighted bit-reliability based (wBRB) decoder for NB-LDPC codes is developed and implemented with efficient layered partial-parallel structure. It not only balances the tradeoff between complexity and error performance, but also reduces the memory usage significantly. Furthermore, to enhance the performance of the wBRB decoder, a full bit-reliability-based (FBRB) decoder is proposed. The FBRB decoder is derived based on the binary matrix representation of the nonzero entries in the parity-check matrix. Since more bit-reliability values are passed through the edges of the Tanner graph, the FBRB decoder can achieve better error performance and faster convergence rate than the wBRB decoder. Both of the decoders are implemented on a Xilinx Virtex-5 XC5VLX155T FPGA device for a (403,226) code over GF(25). The results shows that they achieve 118.98 and 95.73 Mbps throughput with 15 iterations, respectively.
The traditional majority-logic decoding (MLgD) based algorithms suffer error-floors for decoding non-binary LDPC codes with small column weights. This paper presents a bit-reliability based MLgD (BRB-MLgD) algorithm with low error-floors for non-binary LDPC codes. The proposed algorithm is carried out based on the binary representations of non-binary symbols. The reliability update along each edge of the Tanner graph of a non-binary LDPC code is in terms of bits rather than symbols. Thus, its computational complexity and memory consumption are less than those of the existing MLgD based algorithms. Simulation results indicate that the proposed algorithm can significantly reduce error-floors with small performance degradation in the waterfall region.
Majority-logic algorithms are devised for decoding non-binary LDPC codes in order to reduce computational complexity. However, compared with conventional belief propagation algorithms, majority-logic algorithms suffer from severe bit error performance degradation. This paper presents a low-complexity reliability-based algorithm aiming at improving error correcting ability of majority-logic algorithms. Reliability measures for check nodes are novelly introduced to realize mutual update between variable message and check message, and hence more efficient reliability propagation can be achieved, similar to belief-propagation algorithm. Simulation results on NB-LDPC codes with different characteristics demonstrate that our algorithm can reduce the bit error ratio by more than one order of magnitude and the coding gain enhancement over ISRB-MLGD can reach 0.2-2.0dB, compared with both the ISRB-MLGD and IISRB-MLGD algorithms. Moreover, simulations on typical LDPC codes show that the computational complexity of the proposed algorithm is closely equivalent to ISRB-MLGD algorithm, and is less than 10% of Min-max algorithm. As a result, the proposed algorithm achieves a more efficient trade-off between decoding computational complexity and error performance.