Stark, Maximilian
[Verfasser:in];
Wang, Linfang
[Verfasser:in];
Bauch, Gerhard
[Verfasser:in];
Wesel, Richard D.
[Verfasser:in]
;
Technische Universität Hamburg,
Technische Universität Hamburg Institut für Nachrichtentechnik
Decoding rate-compatible 5G-LDPC codes with coarse quantization using the information bottleneck method
Anmerkungen:
Sonstige Körperschaft: Technische Universität Hamburg
Sonstige Körperschaft: Technische Universität Hamburg, Institut für Nachrichtentechnik
Beschreibung:
Increased data rates and very low-latency requirements place strict constraints on thecomputational complexity of channel decoders in the new 5G communications standard. Practicallow-density parity-check (LDPC) decoder implementations use message-passing decoding with finiteprecision, which becomes coarse as complexity is more severely constrained. In turn, performance degradesas the precision becomes more coarse. Recently, the information bottleneck (IB) method was used to designmutual-information-maximizing mappings that replace conventional finite-precision node computations. Asa result, the exchanged messages in the IB approach can be represented with a very small number of bits.5G LDPC codes have the so-called protograph-based raptor-like (PBRL) structure which offers inherentrate-compatibility and excellent performance. This paper extends the IB principle to the flexible class ofPBRL LDPC codes as standardized in 5G. The extensions include IB decoder design for puncturing andrate-compatibility. In contrast to existing IB decoder design techniques, the proposed decoder can be usedfor a large range of code rates with a static set of optimized mappings. The proposed construction approachis evaluated for a typical range of code rates and bit resolutions ranging from 3 bit to 5 bit. Frame errorrate simulations show that the proposed scheme always outperforms min-sum decoding algorithms andoperates close to double-precision sum-product belief propagation decoding. Furthermore, alternatives tothe lookup table implementations of the mutual-information-maximizing mappings are investigated.