Bit-Reliability Based Low-Complexity Decoding Algorithms for Non-Binary LDPC Codes
Bit-Reliability Based Low-Complexity Decoding Algorithms for Non-Binary LDPC Codes
复制标题
基于比特可靠性的非二进制 LDPC 码低复杂度解码算法
DOI：
10.1109/tcomm.2014.2370032
复制
发表时间：
2014
影响因子：
8.3
通讯作者：
Wang Lu
中科院分区：
文献类型：
--
作者：
Huang Qin;Zhang Mu;Wang Zulin;Wang Lu
本文提出了用于非二进制 LDPC 码的基于位可靠性的多数逻辑解码 (MLgD) 算法。所提出的算法仅传递一个伽罗瓦域元素及其沿着非二进制 LDPC 码的 Tanner 图的每条边的可靠性。由于它们的可靠性更新是以比特而不是符号为单位的，因此它们比传统的基于 MLgD 的解码算法更有效。通过根据外在信息和的硬可靠性对其软可靠性进行加权，所提出的算法对于具有不同列权重的非二进制LDPC码可以实现良好的误码性能。此外，与现有的基于 MLgD 的解码算法相比，它们的计算复杂度和内存消耗显着降低。因此，它们在非二进制 LDPC 码解码的错误性能和复杂性之间提供了有效的权衡。
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.