Low-Resolution Horizontal and Vertical Layered Mutual Information Maximizing LDPC Decoding

  title={Low-Resolution Horizontal and Vertical Layered Mutual Information Maximizing LDPC Decoding},
  author={Philipp H. Mohr and Gerhard Bauch},
  journal={2022 56th Asilomar Conference on Signals, Systems, and Computers},
  • Philipp H. MohrG. Bauch
  • Published 31 October 2022
  • Computer Science
  • 2022 56th Asilomar Conference on Signals, Systems, and Computers
We investigate iterative low-resolution message-passing algorithms for quasi-cyclic LDPC codes with horizontal and vertical layered schedules. Coarse quantization and layered scheduling are highly relevant for hardware implementations to reduce the bit width of messages and the number of decoding iterations. As a novelty, this paper compares the two scheduling variants in combination with mutual information maximizing compression operations in variable and check nodes. We evaluate the… 

Figures and Tables from this paper



Coarsely Quantized Layered Decoding Using the Information Bottleneck Method

This paper presents innovative layered decoding approaches, where the information bottleneck method is used for the design of different coarsely quantized decoder architectures for regular quasi-cyclic codes.

Reduced-complexity column-layered decoding and implementation for LDPC codes

This work addresses low-complexity column-layered decoding schemes and very-large-scale integration (VLSI) architectures for multi-Gb/s applications and can reduce the computation complexity in check node processing for high-rate LDPC codes by up to 90% while maintaining the fast convergence speed of layered decoding.

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

The analysis shows that the loss of preserved mutual information resulting from restriction to uniform quantization is very small, and the proposed 3-bit decoder is a promising candidate to replace 4-bit conventional decoders.

A reduced complexity decoder architecture via layered decoding of LDPC codes

  • D. Hocevar
  • Computer Science
    IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004.
  • 2004
The previously devised irregular partitioned permutation LDPC codes have a construction that easily accommodates a layered decoding and it is shown that the decoding performance is improved by a factor of two in the number of iterations required.

Quantized message passing for LDPC codes

We propose a quantized decoding algorithm for low- density parity-check codes where the variable node update rule of the standard min-sum algorithm is replaced with a look-up table (LUT) that is

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

Numerical results show that the proposed rate-compatible MIM-QMS decoder can reduce the memory requirement for decoding by up to 94.92 % compared to the benchmark rate- compatible LUT-based decoder with generally faster convergence speed.

Finite-Alphabet Message Passing using only Integer Operations for Highly Parallel LDPC Decoders

This paper presents a new design of Finite Alphabet (FA) Message Passing (MP) decoders using only integer operations, and derives a minimum-integer computation (MIC) decoder that allows for different bit-widths for node operations and message exchanges between nodes.

On Mutual Information-Maximizing Quantized Belief Propagation Decoding of LDPC Codes

  • Xuan HeK. CaiZ. Mei
  • Computer Science
    2019 IEEE Global Communications Conference (GLOBECOM)
  • 2019
The proposed MIM-QBP decoder with only 3 bits per message can outperform the floating-point belief propagation (BP) decoder at high signal-to-noise ratio (SNR) regions with a maximum of 10 iterations.

A Variable Node Design with Check Node Aware Quantization Leveraging 2-Bit LDPC Decoding

Simulation results for regular LDPC codes confirm that the check node aware design, especially for very coarse quantization with 2- or 3-bit messages, achieves performance gains of up to 0.2 dB - without additional hardware costs.

Information-Optimum LDPC Decoders Based on the Information Bottleneck Method

This paper explains in detail, how the Information Bottleneck method can be applied to construct discrete message passing decoders for regular low-density parity-check codes using only unsigned integers and using only simple lookup tables as node operations.