Generalized Mutual Information-Maximizing Quantized Decoding of LDPC Codes

by   Peng Kang, et al.

In this paper, we propose a general framework of the mutual infomration-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes, which can outperform the state-of-the-art lookup table (LUT) decoder by using simple mappings and fixed-point additions for the node updates. Our decoding method is generic in the sense that it can be applied to LDPC codes with arbitrary degree distributions, and it can be implemented based on either the belief propagation (BP) algorithm or the min-sum (MS) algorithm, leading to the MIM quantized BP (MIM-QBP) decoder and the MIM quantized MS (MIM-QMS) decoder, respectively. In particular, we approximate the check node (CN) update of the MIM-QBP decoder by a max-product operation and obtain the MIM-QMS decoder, which simplifies the decoder design and requires less resource consumption. To avoid the precision degradation, we introduce a dynamic reconstruction method to optimize the variable node update for different iterations. Some practical aspects of the proposed decoders such as the design and decoding complexity are also discussed. Simulation results show that the MIM-QBP decoder outperforms the LUT decoders in the waterfall region with both 3-bit and 4-bit precision. Moreover, the 4-bit MIM-QMS decoder can even surpass the floating-point BP decoder in the error-floor region.


Mutual Information-Maximizing Quantized Belief Propagation Decoding of LDPC Codes

A severe problem for mutual information-maximizing lookup table (MIM-LUT...

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

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

Learning to Decode Protograph LDPC Codes

The recent development of deep learning methods provides a new approach ...

Belief-Propagation Decoding of LDPC Codes with Variable Node-Centric Dynamic Schedules

Belief propagation (BP) decoding of low-density parity-check (LDPC) code...

Learning Quantization in LDPC Decoders

Finding optimal message quantization is a key requirement for low comple...

Noisy Density Evolution With Asymmetric Deviation Models

This paper considers low-density parity-check (LDPC) decoders affected b...

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

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