Information Bottleneck Decoding of Rate-Compatible 5G-LDPC Codes

by   Maximilian Stark, et al.

The new 5G communications standard increases data rates and supports low-latency communication that places constraints on the computational complexity of channel decoders. 5G low-density parity-check (LDPC) codes have the so-called protograph-based raptor-like (PBRL) structure which offers inherent rate-compatibility and excellent performance. Practical LDPC decoder implementations use message-passing decoding with finite precision, which becomes coarse as complexity is more severely constrained. Performance degrades as the precision becomes more coarse. Recently, the information bottleneck (IB) method was used to design mutual-information-maximizing lookup tables that replace conventional finite-precision node computations. Additionally, the IB approach exchanges messages represented by integers with very small bit width. This paper extends the IB principle to the flexible class of PBRL LDPC codes as standardized in 5G. The extensions includes puncturing and rate-compatible IB decoder design. As an example of the new approach, a 4-bit information bottleneck decoder is evaluated for PBRL LDPC codes over a typical range of rates. Bit error rate simulations show that the proposed scheme outperforms offset min-sum decoding algorithms and operates within 0.2 dB of double-precision sum-product belief propagation decoding.



There are no comments yet.


page 1


Decoding of Non-Binary LDPC Codes Using the Information Bottleneck Method

Recently, a novel lookup table based decoding method for binary low-dens...

Memory Efficient Mutual Information-Maximizing Quantized Min-Sum Decoding for Rate-Compatible LDPC Codes

In this letter, we propose a two-stage design method to construct memory...

A 588 Gbps LDPC Decoder Based on Finite-Alphabet Message Passing

An ultra-high throughput low-density parity check (LDPC) decoder with an...

A 594 Gbps LDPC Decoder Based on Finite-Alphabet Message Passing

An ultra-high throughput low-density parity check (LDPC) decoder with an...

Uniform Vs. Non-Uniform Coarse Quantization in Mutual Information Maximizing LDPC Decoding

Recently, low-resolution LDPC decoders have been introduced that perform...

A Reconstruction-Computation-Quantization (RCQ) Approach to Node Operations in LDPC Decoding

In this paper, we propose a finite-precision decoding method that featur...

A Novel Stochastic Decoding of LDPC Codes with Quantitative Guarantees

Low-density parity-check codes, a class of capacity-approaching linear c...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.