LDPC Decoder Bit-Word Correction for Quantized Message Passing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Practical implementations of LDPC decoders face challenges in efficiently utilizing the available bit-words due to limited size representations, leading to suboptimal performance in decoding processes.

Innovation Solution

The method and apparatus enhance LDPC decoding by applying corrections to bit-words, mapping them to shorter bit-words, and determining messages based on these corrected values, allowing for better utilization of available bit-word levels.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If LDPC decoders use limited-size bit-words to represent messages, then device complexity is reduced, but decoding performance deteriorates due to suboptimal utilization of available bit-word levels

Engineering Contradiction:
Improvebit-word sizeVSAvoiddecoding performance
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent applies parameter changes by transforming the representation of log-likelihood ratio values through correction operations. Specifically, it adjusts the scaling factor and offset parameters when mapping full-precision LLRs to quantized bit-words, enabling better utilization of the limited bit-word levels while maintaining decoding accuracy. This resolves the contradiction by changing the numerical parameters of the message representation rather than increasing bit-word size.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent implements preliminary action by pre-calculating and storing correction values in lookup tables before the actual decoding process. These correction values compensate for the quantization effects of limited-bit representations. By performing this correction preparation in advance, the system achieves high decoding performance using compact bit-words without requiring complex real-time calculations during decoding.

Inventive Principle:
Principle #10Preliminary action

2Quantity of substance

If LDPC decoders use shorter bit-words for messages, then resource requirements are reduced, but the range of representable values is limited

Engineering Contradiction:
Improveresource requirementsVSAvoidvalue range
Core Design Contradiction:
Quantity of substanceVSLoss of information

Solution Approach 1:

The patent changes the parameter representation by introducing correction terms that expand the effective value range of shorter bit-words. Instead of directly using the limited-bit values, the system applies parameter transformations that recover the lost precision, effectively increasing the representable value range while maintaining compact bit-word formats for resource efficiency.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent introduces correction lookup tables as intermediary structures that bridge the gap between limited-bit representations and full-precision requirements. These tables serve as mediators that translate compact bit-words into accurate log-likelihood ratio values, preventing information loss while maintaining resource efficiency. The intermediary correction mechanism allows shorter bit-words to convey more information than their raw bit length would suggest.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS12531654B2Apparatus and method for low density parity check code decoding
Publication Date: 2026.01.20 NOKIA SOLUTIONS & NETWORKS OY
  • US12531654B2 patent drawing
  • US12531654B2 patent drawing
  • US12531654B2 patent drawing

AI summary

Apparatus and method for low density parity check code decoding in a first processing device, wherein the method includes receiving a first bit-word of a first length related to a log-likelihood ratio of a bit of a signal; obtaining a second bit-word of a second length that is shorter than the first length, wherein obtaining the second bit-word comprises applying a correction to the first bit-word; and determining a message depending on a set of second bit-words, wherein the set of second bit-words includes the second bit-word.