Decoding of Non-Binary LDPC Codes Using the Information Bottleneck Method

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

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Stark, Maximilian, Lewandowsky, Jan, Saha, Souradip, Bauch, Gerhard
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 23.10.2019
Subjects
Algorithms
Binary codes
Binary system
Bit error rate
Codes
Computer Science - Information Theory
Computer Science - Learning
Computer simulation
Decoding
Error correcting codes
Integers
Lookup tables
Machine learning
Mathematics - Information Theory
Message passing
Nodes
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.1810.08921