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

Publikationstyp
Conference Paper
Date Issued
2019-05
Sprache
English
Author(s)
Stark, Maximilian  orcid-logo
Bauch, Gerhard  
Lewandowsky, Jan  
Saha, Souradip  
Institut
Nachrichtentechnik E-8  
TORE-URI
http://hdl.handle.net/11420/3214
Volume
2019
Article Number
8761712
Citation
IEEE International Conference on Communications (2019): 8761712 (2019-05)
Contribution to Conference
IEEE International Conference on Communications, ICC 2019  
Publisher DOI
10.1109/ICC.2019.8761712
Scopus ID
2-s2.0-85070229619
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.
Subjects
MLE@TUHH