Please use this identifier to cite or link to this item:
Fulltext available Open Access
Publisher DOI: 10.3390/app8101884
Title: Information-Bottleneck Decoding of High-Rate Irregular LDPC Codes for Optical Communication Using Message Alignment
Language: English
Authors: Stark, Maximilian  
Lewandowsky, Jan 
Bauch, Gerhard 
Keywords: channel coding;low-density parity-check codes;iterative decoding;information-bottleneck signal processing;clustering;machine learning
Issue Date: 11-Oct-2018
Publisher: Multidisciplinary Digital Publishing Institute
Source: Applied Sciences 8 (10): 1884 (2018)
Journal or Series Name: Applied Sciences 
Abstract (english): In high-throughput applications, low-complexity and low-latency channel decoders are inevitable. Hence, for low-density parity-check (LDPC) codes, message passing decoding has to be implemented with coarse quantization—that is, the exchanged beliefs are quantized with a small number of bits. This can result in a significant performance degradation with respect to decoding with high-precision messages. Recently, so-called information-bottleneck decoders were proposed which leverage a machine learning framework (i.e., the information bottleneck method) to design coarse-precision decoders with error-correction performance close to high-precision belief-propagation decoding. In these decoders, all conventional arithmetic operations are replaced by look-up operations. Irregular LDPC codes for next-generation fiber optical communication systems are characterized by high code rates and large maximum node degrees. Consequently, the implementation complexity is mainly influenced by the memory required to store the look-up tables. In this paper, we show that the complexity of information-bottleneck decoders remains manageable for irregular LDPC codes if our proposed construction approach is deployed. Furthermore, we reveal that in order to design information bottleneck decoders for arbitrary degree distributions, an intermediate construction step which we call message alignment has to be included. Exemplary numerical simulations show that incorporating message alignment in the construction yields a 4-bit information bottleneck decoder which performs only 0.15 dB worse than a double-precision belief propagation decoder and outperforms a min-sum decoder.
DOI: 10.15480/882.1798
ISSN: 2076-3417
Institute: Nachrichtentechnik E-8 
Type: (wissenschaftlicher) Artikel
Project: Open Access Publizieren 2018 - 2019 / TU Hamburg 
License: In Copyright In Copyright
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
applsci-08-01884-v2.pdf832,82 kBAdobe PDFThumbnail
Show full item record

Page view(s)

Last Week
Last month
checked on Sep 29, 2020


checked on Sep 29, 2020

Google ScholarTM


Note about this record


This item is licensed under a Creative Commons License Creative Commons