LDPC Decoder Message Scaling for Saturation-Limited Precision

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing LDPC decoding technologies face challenges in achieving an optimal tradeoff between decoding performance, data rate, implementation complexity, and energy consumption, particularly in spatial communications where high data rates and noise sources necessitate improved error correction and reduced latency.

Innovation Solution

A method and decoder for LDPC codes that includes on-the-fly scaling of parity check messages and a posteriori estimation variables when saturation thresholds are met, using a layered architecture to reduce error floors and memory footprint.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If fixed-point representation is used to reduce hardware complexity, then device complexity is reduced, but manufacturing precision deteriorates due to quantization floor effects

Engineering Contradiction:
Improvehardware complexityVSAvoiddecoding precision
Core Design Contradiction:
Device complexityVSManufacturing precision

Solution Approach 1:

The patent implements dynamic scaling of parity check messages based on the number of iterations performed. The scaling factor is adjusted adaptively during the decoding process, transitioning from no scaling in early iterations to active scaling when saturation is detected. This dynamic approach allows the system to maintain high decoding precision when needed while avoiding the overhead of continuous scaling operations, thus resolving the contradiction between hardware complexity and decoding precision.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of message scaling dynamically based on iteration count and saturation detection. Instead of using a fixed scaling factor or always applying scaling, the system adjusts the scaling parameter adaptively - using identity scaling (no operation) when not needed and applying appropriate scaling factors when saturation occurs. This parameter change strategy maintains precision while minimizing hardware complexity.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If message scaling is applied continuously to reduce error floors, then reliability is improved, but device complexity increases due to additional processing operations

Engineering Contradiction:
Improveerror rateVSAvoidprocessing complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies message scaling partially rather than continuously. Scaling is triggered only when saturation conditions are detected (when the number of saturated messages exceeds a threshold), and only for specific iterations (typically after a certain number of iterations have passed). This partial application of scaling reduces the processing complexity and computational overhead while still achieving the reliability benefits of error floor reduction when actually needed.

Inventive Principle:
Principle #16Partial or excessive action

Solution Approach 2:

The system monitors its own state (saturation of messages) and automatically activates scaling when needed without external control. The saturation counter and iteration tracker enable the decoder to self-regulate the application of scaling operations, applying them only when the system detects that saturation is occurring and precision is degrading. This self-service mechanism improves reliability while avoiding unnecessary processing complexity.

Inventive Principle:
Principle #25Self-service

3Reliability

If high precision quantization is used to reduce error floors, then reliability is improved, but device complexity increases due to larger memory footprint

Engineering Contradiction:
Improveerror rate floorVSAvoidmemory footprint
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent implements dynamic precision adjustment through message scaling. Instead of using high-precision quantization throughout the entire decoding process, the system maintains the original quantization precision for most iterations and only applies scaling operations when saturation is detected. This dynamic precision management allows the system to achieve low error floors when needed while maintaining a compact memory footprint by avoiding permanently stored high-precision data structures.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS12413246B2Adaptive scaling of parity check messages for LDPC decoding
Publication Date: 2025.09.09 AIRBUS DEFENCE & SPACE SAS
  • US12413246B2 patent drawing
  • US12413246B2 patent drawing
  • US12413246B2 patent drawing

AI summary

The disclosure relates to an LDPC decoding method which involves performing iterations until a stop criterion is satisfied. Each iteration involves calculating variable messages (αn,m), calculating parity check messages (βm,n), and calculating a posteriori estimation variables. The parity check messages (βm,n) and the posteriori estimation variables (γn) being saturated at a predetermined maximum value. At the end of an iteration, when the number of saturations reaches a specified threshold, the method involves at least a first scaling of the parity check messages (βm,n) and the a posteriori estimation variables (γn). Scaling corresponds to assigning, to a value, an integer which has the same sign and whose absolute value is the nearest integer greater than the absolute value of the value divided by two.