5G LDPC Codes as Root LDPC Codes via Diversity Alignment

Hyuntae Ahn, Inki Kim, Hee-Youl Kwak, Yongjune Kim, Chanki Kim, Sang-Hyo KimarXiv 2026 · arXiv

TL;DR

Standard 5G-NR LDPC codes are highly optimized for static noise channels but suffer severe performance drops in unpredictable, nonergodic block-fading environments. This paper introduces Diversity Evolution (DivE), a Boolean framework that tracks how diversity propagates during iterative decoding, allowing researchers to find optimal bit-to-block mappings. By simply optimizing how bits are distributed across fading blocks, standard 5G codes can achieve full diversity without altering their underlying structure.

What Problem Does This Paper Address?

In wireless communications, signals often encounter nonergodic block-fading channels (BFCs), where entire blocks of data experience independent, random attenuation. In these scenarios, a system's reliability is dictated by its diversity order (how many independent fading blocks carry the information) rather than traditional noise thresholds.

While Low-Density Parity-Check (LDPC) codes are a staple of 5G New Radio (5G-NR) due to their excellent performance in Additive White Gaussian Noise (AWGN) channels, they lack inherent diversity protection when subjected to block fading. Historically, engineers designed specialized "Root-LDPC" codes with rigid algebraic structures to guarantee full diversity. However, these structures compromise performance in standard AWGN channels. The authors tackle a compelling question: Can we make standard, AWGN-optimized 5G LDPC codes achieve full diversity under block fading without changing their original structure?

Methods

The authors bridge this gap by focusing entirely on block mapping—the way protograph variable nodes (VNs) are assigned to different fading blocks—rather than redesigning the code itself. They introduce two key concepts:

  1. Diversity Evolution (DivE): This is an analytical framework that simplifies complex fading channels into a Boolean approximation (1 for a non-fading/reliable state, 0 for a fading/unreliable state). As the min-sum belief-propagation (BP) decoder runs, DivE tracks how these binary states propagate through the graph. Check nodes (CNs) combine incoming messages using Boolean AND logic, while variable nodes (VNs) combine them using Boolean OR logic.
  2. Generalized Rootchecks: Through DivE, the authors discovered that full diversity doesn't need to be hardcoded into the matrix. Instead, "generalized rootchecks"—dynamic, message-passing structures—spontaneously emerge over decoding iterations if the block mapping is properly aligned.
Fig. 2: CN/VN processing of DivE (update of algebraic expression): (a) CN update, (b) VN update.

Using DivE as an evaluation tool, they developed a Greedy Block-Mapping Search Algorithm. The algorithm uses smart pre-assignment rules (to prevent structural bottlenecks like stopping sets and properly handle 5G's punctured information bits) and incrementally assigns remaining nodes to fading blocks to maximize the number of information bits achieving full diversity.

Datasets

Because this is a channel coding theory paper, traditional machine learning datasets were not used. Instead, the authors evaluated their approach using the standardized 5G New Radio (5G-NR) LDPC base graphs:

  • BG1: Designed for larger block lengths and higher data rates.
  • BG2: Tailored for smaller block lengths and lower rates.

Key Insights and Ideas

  • Structure vs. Mapping: Full diversity in block fading does not require structurally rigid code designs. A standard code can inherit "Root-LDPC" properties purely through intelligent bit placement (mapping).
  • Dynamic Diversity: Diversity is an iterative, evolving property. An information bit might not have full diversity in the first decoding iteration, but as independent information propagates from neighboring nodes, it can achieve full diversity a few iterations later.
  • The Power of Boolean Approximations: Tracking exact continuous probability densities through a graph under fading is mathematically intractable. Approximating the channel as a Boolean truth table provides a highly accurate, computationally efficient proxy for finding optimal mappings.

Key Results

The greedy search successfully found block mappings for a two-block fading channel ($M=2$) that guarantee full diversity for all information bits:

  • For BG1: Full diversity for all 22 information VNs was achieved at a code rate of $R \approx 0.478$ by the 8th decoding iteration.
  • For BG2: Full diversity for all 10 information VNs was achieved at a code rate of $R \approx 0.417$ by the 7th decoding iteration.

When simulated, the proposed block mappings yielded a significantly steeper Block Error Rate (BLER) slope at high Signal-to-Noise Ratios (SNR) compared to random mappings, proving that the codes successfully avoided being diversity-limited.

Limitations and Future Work

The primary limitation noted is that the achieved code rates ($22/46$ for BG1 and $10/24$ for BG2) fall slightly short of the theoretical Singleton-like bound limit of $R = 1/2$ for a two-block system. The authors attribute this penalty to the rigid, high-rate precoding structure inherently built into the 5G-NR base graphs.

For future work, the authors plan to extend the DivE framework and greedy search algorithms to more complex scenarios involving more than two fading blocks ($M > 2$).

Summary updated

Abstract

This paper studies the diversity of protographbased quasi-cyclic low-density parity-check (QC-LDPC) codes over nonergodic block-fading channels under iterative beliefpropagation decoding. We introduce diversity evolution (DivE), a Boolean-function-based analysis method that tracks how the fading dependence of belief-propagation messages evolves across decoding iterations. Under a Boolean approximation of block fading, DivE derives a Boolean fading function for each variable node (VN) output (i.e., the a-posteriori reliability after iterative decoding), from which the VN diversity order can be directly determined. Building on this insight, we develop a greedy blockmapping search that assigns protograph VNs to fading blocks so that all information VNs achieve full diversity, while including the minimum additional parity VNs when full diversity is infeasible at the nominal rate. Numerical results on the 5G New Radio LDPC codes show that the proposed search finds block mappings that guarantee full diversity for all information bits without modifying the base-graph structure, yielding a markedly steeper high-SNR slope and lower BLER than random mappings.
BibTeX
@misc{ahn2026g,
  author = {Hyuntae Ahn and Inki Kim and Hee-Youl Kwak and Yongjune Kim and Chanki Kim and Sang-Hyo Kim},
  title = {{5G LDPC Codes as Root LDPC Codes via Diversity Alignment}},
  year = {2026},
  eprint = {2601.22470},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2601.22470},
}
Figure