Adaptive LDPC Graph Selection for Wireless Power-Performance Balance

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing wireless communication systems face challenges in efficiently adapting low density parity check (LDPC) graphs to changing communication conditions, leading to increased power consumption and reduced performance.

Innovation Solution

The implementation of a method where user equipment (UE) and network nodes can generate and adapt LDPC graphs based on adaptation metrics such as channel conditions, power constraints, and performance metrics, enabling proactive adjustment of LDPC coding to optimize power consumption and performance.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If LDPC graphs are adapted to changing communication conditions, then performance is improved, but power consumption increases

Engineering Contradiction:
Improvecommunication performanceVSAvoidpower consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent implements dynamic adaptation of LDPC graphs by allowing the UE to determine adaptation metrics based on channel conditions and selectively indicate which graphs to adapt. The network node then performs adaptation only when beneficial, creating a dynamic system that adjusts to changing communication conditions rather than continuously adapting, thus balancing performance improvement with power consumption reduction.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameters of the LDPC graph (such as connectivity patterns, node degrees, or graph topology) based on determined adaptation metrics. By modifying these parameters selectively rather than continuously, the system achieves improved communication performance while avoiding unnecessary power consumption from constant parameter reconfiguration.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If LDPC graphs are adapted continuously, then performance is improved, but system complexity increases

Engineering Contradiction:
Improvecommunication performanceVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent implements a feedback mechanism where the UE determines adaptation metrics based on channel conditions and sends indications to the network node about which LDPC graphs should be adapted. This feedback loop allows the system to adapt only when and where it is beneficial, reducing unnecessary complexity while maintaining performance improvements.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent segments the LDPC graph adaptation process into discrete, selectable graphs rather than continuous adaptation. The UE can indicate specific graphs for adaptation based on channel conditions, allowing the system to manage complexity by handling individual graph adaptations separately rather than as a monolithic complex process.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS12289163B2Low density parity check graph adaptation
Publication Date: 2025.04.29 QUALCOMM INC
  • US12289163B2 patent drawing
  • US12289163B2 patent drawing
  • US12289163B2 patent drawing

AI summary

Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may receive a reference signal for estimation of at least one parameter associated with generation of an adapted low density parity check (LDPC) graph. The UE may transmit an indication of an adapted LDPC graph that is based on at least one adaptation metric associated with the at least one parameter. The UE may receive, based on the adapted LDPC graph, a downlink shared channel communication. Numerous other aspects are described.