Adaptive Message Scaling in Decoder Circuits for Stalled Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Data decoding algorithms often stall, preventing the recovery of the original data set, leading to an inability to recover the original data in data transfer processes.

Innovation Solution

A data decoder circuit that applies a variable node algorithm to yield variable node to check node messages, calculates errors, and multiplies check node to variable node messages by scalar values based on error differences to facilitate iterative decoding and error correction.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a standard decoding algorithm is applied to decode encoded data, then the decoding process can be completed under normal conditions, but the algorithm stalls when errors are present, preventing recovery of the original data

Engineering Contradiction:
Improvedata recovery capabilityVSAvoidadaptability to error conditions
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent applies dynamics by making the message passing process adaptive rather than static. The algorithm dynamically adjusts message scaling based on error detection, transitioning between different operational modes (standard decoding vs. scaled message decoding) depending on the detected error condition. This allows the system to adapt its behavior to match the actual channel conditions and error patterns.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of message scaling factor based on detected error conditions. When errors are detected in the received encoded data, the system modifies the scaling parameters of the messages passed between variable nodes and check nodes in the graphical model. This parameter adjustment enables the decoding algorithm to handle erroneous data effectively by emphasizing or de-emphasizing certain message components based on their reliability.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If message scaling is applied to handle error conditions, then data recovery is improved, but the decoding process complexity increases

Engineering Contradiction:
Improvedata recovery capabilityVSAvoiddecoding circuit complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the decoding process into distinct functional blocks: error detection module, message scaling module, and iterative decoding module. Each block performs a specific function, allowing for modular implementation and independent optimization. The error detection module identifies problematic received data, the scaling module adjusts message parameters, and the decoding module executes the iterative algorithm, creating a structured approach that manages complexity through functional decomposition.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces an intermediary message scaling mechanism between the error detection stage and the decoding stage. This intermediary component translates error detection information into appropriate message scaling factors, which then guide the decoding process. By inserting this intermediary layer, the system can handle error conditions without requiring complete redesign of the entire decoding architecture, thus managing complexity while improving reliability.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS9378765B2Systems and methods for differential message scaling in a decoding process
Publication Date: 2016.06.28 AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE LTD
  • US9378765B2 patent drawing
  • US9378765B2 patent drawing
  • US9378765B2 patent drawing

AI summary

Systems and method relating generally to data processing, and more particularly to systems and methods for scaling messages in a data decoding circuit. In one embodiment, the systems and methods include applying a variable node algorithm, applying a check node algorithm, calculating a first number of errors, calculating a second number of errors, calculating a difference between the first and second number of errors, multiplying by scalar values to yield a scaled set of messages, and re-applying the variable node algorithm to the scaled set of messages.