Decoding of Non-Binary LDPC Codes using the Information Bottleneck Method
Decoding of Non-Binary LDPC Codes using the Information Bottleneck Method
复制标题
使用信息瓶颈方法解码非二进制 LDPC 码
DOI：
10.1109/icc.2019.8761712
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
G. Bauch
中科院分区：
文献类型：
--
作者：
Maximilian Stark;J. Lewandowsky;Souradip Saha;G. Bauch
近年来，一种基于查找表的二进制低密度校验码译码方法引起了广泛的关注。在该方法中，互信息最大化查找表取代了消息传递解码中变量节点和校验节点的传统操作。此外，交换的消息由具有非常小的位宽的整数表示。一个被称为信息瓶颈方法的机器学习框架被用来设计相应的查找表。在本文中，我们将这种译码原理从二进制扩展到非二进制码。这不是一个简单的扩展，但需要一个更复杂的查找表设计，以科普高阶伽罗瓦域的算术。误码率仿真结果表明，我们提出的方案优于对数最大译码算法，接近和积译码。
Recently, a novel lookup table based decoding method for binary low-density parity-check codes has attracted considerable attention. In this approach, mutual-information-maximizing lookup tables replace the conventional operations of the variable nodes and the check nodes in message passing decoding. Moreover, the exchanged messages are represented by integers with very small bit width. A machine learning framework termed the information bottleneck method is used to design the corresponding lookup tables. In this paper, we extend this decoding principle from binary to non-binary codes. This is not a straightforward extension but requires a more sophisticated lookup table design to cope with the arithmetic in higher order Galois fields. Provided bit error rate simulations show that our proposed scheme outperforms the log-max decoding algorithm and operates close to sum-product decoding.