|Publisher DOI:||10.1109/GLOCOM.2018.8648053||Title:||Information-Optimum LDPC Decoders with Message Alignment for Irregular Codes||Authors:||Stark, Maximilian
|Issue Date:||2018||Source:||IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings : 8648053 (2018)||Abstract (english):||In practical implementations, message passing decoding of LDPC codes has to be implemented with finite precision, i.e., the messages are quantized with a small number of bits. This results in a significant performance degradation with respect to decoding with high-precision messages. Recently, we have proposed so-called information bottleneck decoders to design finite-precision decoders with error-correction performance close to high-precision belief-propagation decoding. Earlier works solely focus on the design of information bottleneck decoders for regular LDPC codes or specifically optimized irregular LDPC codes. In this paper, we extend the concept of information bottleneck decoders to irregular LDPC with arbitrary degree distribution. We show that this extension is not straightforward and requires an additional information-optimum step. Therefore, we devise a novel intermediate construction step which we call message alignment. Exemplary numerical simulations using an irregular LDPC code taken from the IEEE 802.11 standard 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.||URI:||http://hdl.handle.net/11420/3342||ISBN:||978-153864727-1||Institute:||Nachrichtentechnik E-8||Type:||Sonstiges|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Sep 19, 2019
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.