TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publications
  4. Information-Bottleneck Decoding of High-Rate Irregular LDPC Codes for Optical Communication Using Message Alignment
 
Options

Information-Bottleneck Decoding of High-Rate Irregular LDPC Codes for Optical Communication Using Message Alignment

Citation Link: https://doi.org/10.15480/882.1798
Publikationstyp
Journal Article
Date Issued
2018-10-11
Sprache
English
Author(s)
Stark, Maximilian  orcid-logo
Lewandowsky, Jan  
Bauch, Gerhard  
Institut
Nachrichtentechnik E-8  
TORE-DOI
10.15480/882.1798
TORE-URI
http://hdl.handle.net/11420/1801
Journal
Applied Sciences (Basel)  
Volume
8.2018
Start Page
1884
End Page
17 Seiten
Citation
Applied Sciences 8 (10): 1884 (2018)
Publisher DOI
10.3390/app8101884
Scopus ID
2-s2.0-85054770380
Publisher
Multidisciplinary Digital Publishing Institute
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 <i>information-bottleneck</i> 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 <i>information-bottleneck</i> 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 <i>message alignment</i> 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 <inline-formula> <math display="inline"> <semantics> <mrow> <mn>0.15</mn> </mrow> </semantics> </math> </inline-formula> dB worse than a double-precision belief propagation decoder and outperforms a min-sum decoder.
Subjects
channel coding
low-density parity-check codes
iterative decoding
information-bottleneck signal processing
clustering
machine learning
DDC Class
620: Ingenieurwissenschaften
Funding(s)
Open Access Publizieren 2018 - 2019 / TU Hamburg  
Publication version
publishedVersion
Lizenz
https://creativecommons.org/licenses/by/4.0/
Loading...
Thumbnail Image
Name

applsci-08-01884-v2.pdf

Size

832.82 KB

Format

Adobe PDF

TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback