|Publisher DOI:||10.1109/ICC.2019.8761712||Title:||Decoding of Non-Binary LDPC Codes using the Information Bottleneck Method||Language:||English||Authors:||Stark, Maximilian
|Issue Date:||May-2019||Source:||IEEE International Conference on Communications (2019): 8761712 (2019-05)||Journal or Series Name:||IEEE International Conference on Communications||Abstract (english):||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.||URI:||http://hdl.handle.net/11420/3214||ISBN:||978-153868088-9||ISSN:||1550-3607||Institute:||Nachrichtentechnik E-8||Type:||InProceedings (Aufsatz / Paper einer Konferenz etc.)|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Sep 28, 2020
Add Files to Item
Note about this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.