Syndrome Decoding with Tracking Sums for Early Abort

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current syndrome decoding systems in memory sub-systems require extensive computing resources and time due to iterative processing of all bit strings and syndromes, even after successful decoding, and lack efficient mechanisms to abort decoding operations for uncorrectable errors or excessive time consumption.

Innovation Solution

Implementing a tracking sum mechanism to identify and store successfully decoded bit strings and syndromes, allowing for early termination of decoding operations and reducing unnecessary processing by deselecting fully decoded syndromes from further iterations, and aborting operations when a threshold error level is exceeded.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If iterative processing is performed on all bit strings and syndromes, then decoding accuracy is improved, but decoding time and power consumption increase

Engineering Contradiction:
Improvedecoding accuracyVSAvoiddecoding time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent extracts successfully decoded syndromes from the processing queue using a tracking sum mechanism. When a syndrome's tracking sum reaches zero (indicating successful decoding), it is removed from further iterative processing. This selective extraction prevents wasted processing cycles on already-decoded data while maintaining decoding accuracy for remaining syndromes.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent implements early termination of iterative processing for syndromes that have been successfully decoded. Instead of performing the full predetermined number of iterations on all syndromes, the system performs partial processing on already-decoded syndromes (zero iterations) and full processing only on undecoded syndromes. This reduces total processing time while ensuring all necessary syndromes receive adequate processing.

Inventive Principle:
Principle #16Partial or excessive action

2Reliability

If iterative processing is performed on all bit strings and syndromes, then decoding completeness is improved, but power consumption increases

Engineering Contradiction:
Improvedecoding completenessVSAvoidpower consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent removes successfully decoded syndromes from the processing set using tracking sum monitoring. When tracking sum equals zero, the syndrome is extracted from further processing, preventing unnecessary power consumption. This maintains decoding completeness for all syndromes while eliminating wasteful energy expenditure on already-solved cases.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent discards (stops processing) syndromes that have reached successful decoding state, identified by tracking sum zero. The computational resources previously allocated to these syndromes are recovered and reallocated to undecoded syndromes, improving overall system efficiency and reducing total power consumption while maintaining complete decoding coverage.

Inventive Principle:
Principle #34Discarding and recovering

3Reliability

If decoding operations continue for all bit strings, then thorough error correction is improved, but system efficiency deteriorates

Engineering Contradiction:
Improveerror correction thoroughnessVSAvoidsystem efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent extracts successfully decoded bit strings from the processing queue based on tracking sum values. When a bit string's tracking sum reaches zero, it is removed from further iterative decoding operations. This maintains thorough error correction for all bit strings while significantly improving system efficiency by eliminating redundant processing of already-corrected data.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent applies partial iterative processing to bit strings based on their decoding status. Successfully decoded bit strings receive zero additional iterations, while undecoded bit strings receive full iterative processing. This optimized approach ensures thorough error correction where needed while maximizing system productivity by avoiding excessive processing of already-corrected data.

Inventive Principle:
Principle #16Partial or excessive action

4Reliability

If no abort mechanism is implemented, then decoding thoroughness is improved, but time consumption for uncorrectable errors increases

Engineering Contradiction:
Improvedecoding thoroughnessVSAvoidtime for uncorrectable errors
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent implements preliminary abort criteria based on tracking sum behavior. When a syndrome's tracking sum exceeds a threshold or fails to converge within a predetermined number of iterations, the system proactively aborts processing for that syndrome. This preliminary action prevents wasteful continuation of unproductive decoding operations while maintaining thoroughness for syndromes that are converging successfully.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS12164375B2Syndrome decoding system
Publication Date: 2024.12.10 MICRON TECHNOLOGY INC
  • US12164375B2 patent drawing
  • US12164375B2 patent drawing
  • US12164375B2 patent drawing

AI summary

A method includes determining a quantity of errors for a bit string based on a quantity of bits having a logical value of one within the bit string and writing an indication corresponding to the quantity of errors for the bit string to an array of memory cells. The method can further include determining that the quantity of errors for the bit string has reached a threshold quantity of errors and refraining from performing a subsequent operation to determine the quantity of errors for the bit string in response to determining that the quantity of errors for the bit string has reached the threshold quantity of errors.