LDPC Graph Adaptation for Lower-Power Wireless Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current wireless communication systems face challenges in reducing power consumption, particularly in LDPC decoders, which are major power consumers, especially as bandwidth increases in higher frequency ranges, and conventional LDPC graph selection is often suboptimal for power consumption and channel conditions.

Innovation Solution

The method allows for LDPC graph adaptation based on various criteria such as power consumption, channel conditions, and coding rates, enabling the selection of optimal graphs for different scenarios, which can be signaled between user equipment and network entities for improved performance and reduced power usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Use of energy by moving object

If conventional LDPC graph selection is used, then device complexity is reduced, but power consumption increases

Engineering Contradiction:
Improvepower consumptionVSAvoiddevice complexity
Core Design Contradiction:
Use of energy by moving objectVSDevice complexity

Solution Approach 1:

The patent implements dynamic LDPC graph selection where the decoder can switch between different LDPC graph configurations (base graphs) based on operational conditions such as bandwidth, frequency range, and traffic type. This dynamic adaptation allows the system to optimize power consumption by selecting appropriate graph complexity levels for different operating scenarios without requiring a completely new decoder design.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes key parameters of the LDPC decoder including the base graph selection (BG1 or BG2), lifting size, and code rate based on system conditions. By varying these parameters dynamically, the system achieves power optimization - for example, using simpler base graphs for low-bandwidth operations and more complex graphs for high-bandwidth scenarios - while maintaining adaptability across different operating conditions.

Inventive Principle:
Principle #35Parameter changes

2Use of energy by moving object

If LDPC graph adaptation is implemented, then power consumption is reduced, but device complexity increases

Engineering Contradiction:
Improvepower consumptionVSAvoiddevice complexity
Core Design Contradiction:
Use of energy by moving objectVSDevice complexity

Solution Approach 1:

The patent pre-configures multiple LDPC base graphs and their corresponding parameters before operation. The decoder is designed with pre-computed lookup tables and configuration data for different base graphs, allowing rapid switching without real-time computation. This preliminary preparation reduces the complexity of dynamic selection during actual operation.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements feedback mechanisms where the system monitors operating conditions (bandwidth, frequency range, channel conditions) and automatically adjusts LDPC graph selection accordingly. This closed-loop control enables the decoder to adapt to changing conditions optimally, reducing power consumption while maintaining reliable operation through condition-based graph selection.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS20240097819A1Signaling and reports for low density parity check graph adaptation
Publication Date: 2024.03.21 QUALCOMM INC
  • US20240097819A1 patent drawing
  • US20240097819A1 patent drawing
  • US20240097819A1 patent drawing

AI summary

Certain aspects of the present disclosure provide techniques for wireless communications by a user equipment (UE). In one example embodiment, a method for wireless communication includes receiving, from a network entity, an indication of a first Low Density Parity Check (LDPC) graph to be applied for data transmissions to or from the network entity; and processing data transmissions to or from the network entity in accordance with the first LDPC graph.