Message-Passing Decoder Check-Node Storage for Faster Convergence

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional message-passing decoders in data storage and transmission systems require significant memory storage, which leads to slower convergence rates due to the need to store large amounts of data at each node.

Innovation Solution

Implementing a reduced-storage approach at check nodes by storing only the minimum and next-to-minimum values among incoming message magnitudes, their locations, and the results of exclusive-OR operations, allowing for faster convergence while minimizing memory usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a relatively large amount of data is stored at each node to improve decoding accuracy, then the decoding reliability is improved, but the convergence speed deteriorates

Engineering Contradiction:
Improvedecoding accuracyVSAvoidconvergence speed
Core Design Contradiction:
ReliabilityVSSpeed

Solution Approach 1:

The patent extracts only the essential information needed for decoding by storing only the minimum and next-to-minimum values among incoming message magnitudes, along with their locations and XOR results. This selective extraction maintains decoding reliability while reducing storage burden and improving convergence speed.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the parameter representation by transforming the full message data into a compact form using minimum and next-to-minimum values. This parameter transformation enables the system to maintain accuracy while reducing storage requirements and improving processing speed.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If a relatively large amount of data is stored at each node to improve decoding accuracy, then the decoding reliability is improved, but the memory storage requirement increases

Engineering Contradiction:
Improvedecoding accuracyVSAvoidmemory storage requirement
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent extracts only the essential information needed for decoding by storing only the minimum and next-to-minimum values among incoming message magnitudes, along with their locations and XOR results. This selective extraction maintains decoding reliability while reducing storage burden and improving convergence speed.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the parameter representation by transforming the full message data into a compact form using minimum and next-to-minimum values. This parameter transformation enables the system to maintain accuracy while reducing storage requirements and improving processing speed.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If all incoming message magnitudes are stored to improve decoding accuracy, then the decoding reliability is improved, but the device complexity increases

Engineering Contradiction:
Improvedecoding accuracyVSAvoiddata processing complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent extracts only the essential information needed for decoding by storing only the minimum and next-to-minimum values among incoming message magnitudes, along with their locations and XOR results. This selective extraction maintains decoding reliability while reducing storage burden and improving convergence speed.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS10523366B1Message-passing decoder with fast convergence and reduced storage
Publication Date: 2019.12.31 MARVELL ASIA PTE LTD
  • US10523366B1 patent drawing
  • US10523366B1 patent drawing
  • US10523366B1 patent drawing

AI summary

A message-passing decoder operates by storing, at a check node, a minimum value, a next-to-minimum value, an edge location of the minimum value, and information regarding the signs of incoming messages. For an edge which is not the location of a previous minimum value, the minimum value and the next-to-minimum value, and the location of the minimum value, are set based on the magnitude of an incoming message. For an edge which is the location of the previous minimum value, the minimum value and the next-to-minimum value are set based on the magnitude of an incoming message, and when the magnitude of the incoming message is at most equal to the previous next-to-minimum value, the location of the minimum value is set to the respective edge, and when the magnitude of the incoming message is greater than the previous next-to-minimum value, the location of the minimum value is approximated.