LDPC Base Graph Selection Across Overlapping 5G NR Code Ranges

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In the context of 5G New Radio (NR) communication, the existing methods for selecting a base graph of low-density parity-check (LDPC) codes face challenges in explicitly identifying the required base graph for encoding and decoding due to limitations in information length and code rate ranges supported by different base graphs, leading to uncovered or repeatedly covered combinations of data information lengths and channel coding rates.

Innovation Solution

A method and device are developed to select a base graph of LDPC codes by acquiring data information length and channel coding rate, determining a target base graph selection strategy based on the information length range, and choosing the appropriate base graph according to the strategy and channel coding rate, ensuring efficient selection even for combinations not covered by existing base graphs.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If two base graphs are used to cover all code lengths and code rates, then the coverage of information length and code rate ranges is improved, but the problem of uncovered or repeatedly covered combinations arises, making base graph selection ambiguous

Engineering Contradiction:
Improvecoverage of code lengths and code ratesVSAvoidbase graph selection clarity
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The patent segments the information length range into multiple sub-ranges, with each sub-range associated with a specific base graph selection strategy. This segmentation resolves the ambiguity by providing clear boundaries and deterministic selection rules for different data sizes, eliminating the uncovered or repeatedly covered combinations problem while maintaining comprehensive coverage.

Inventive Principle:
Principle #1Segmentation

2Device complexity

If base graphs are designed with fixed information length and code rate ranges, then the structure is simplified, but the ability to handle arbitrary data lengths and coding rates is limited

Engineering Contradiction:
Improvebase graph structureVSAvoidsupport for arbitrary data lengths and coding rates
Core Design Contradiction:
Device complexityVSAdaptability or versatility

Solution Approach 1:

The patent introduces dynamic base graph selection strategies that adapt to different information lengths and code rates. Instead of using fixed base graphs for all scenarios, the system dynamically selects appropriate base graphs and selection strategies based on the actual data characteristics, thereby maintaining simple base graph structures while achieving high adaptability to arbitrary data lengths and coding rates.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS11190211B2Method and device of selecting base graph of low-density parity-check code
Publication Date: 2021.11.30 DATANG MOBILE COMM EQUIP CO LTD
  • US11190211B2 patent drawing
  • US11190211B2 patent drawing
  • US11190211B2 patent drawing

AI summary

A method and a device of selecting a base graph of a low-density parity-check code are provided. The method includes: acquiring a data information length and a channel coding rate of to-be-encoded data; determining a target base graph selection strategy according to the data information length and an information length range of a base graph; determining a target base graph for the to-be-encoded data according to the target base graph selection strategy and the channel coding rate.