Symbol-String Error Correction Using Transformed Symbol Groups

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing error correction methods are inefficient in correcting bit errors in binary data, particularly when errors change a codeword to another codeword, requiring excessive check bytes and resources.

Innovation Solution

A method involving transformation of symbols into two groups, using a first error code to correct errors within one group and a second error code to handle errors that change codewords, reducing the need for strong error codes by dividing errors between groups.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a strong error code is used to correct multiple errors in binary data, then the error correction capability is improved, but the number of check bytes and resources required increases

Engineering Contradiction:
Improveerror correction capabilityVSAvoidnumber of check bytes
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent divides the binary data into multiple groups of symbols (e.g., bytes or words) and applies error correction to each group independently using weaker error codes, rather than using a single strong error code for the entire data set. This segmentation allows the system to correct multiple errors across the data while using fewer total check bytes, as each group requires fewer check bytes for correction compared to protecting the entire data set with one strong code.

Inventive Principle:
Principle #1Segmentation

2Reliability

If error correction is performed on the entire string of symbols, then all errors can be addressed, but the complexity of the error code increases

Engineering Contradiction:
Improveerror correction coverageVSAvoiderror code complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the error correction task into multiple independent sub-tasks, each handling a smaller group of symbols. This reduces the complexity of the error code required for each segment, as simpler error codes suffice for smaller data units. The overall error correction coverage is maintained by applying these simpler codes across multiple segments rather than using one complex code for the entire data set.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent combines multiple applications of simple error codes across different symbol groups to achieve the effect of a more powerful error correction system. By merging the results of multiple independent error correction operations, the system attains comprehensive error correction coverage without requiring any single error code to be overly complex.

Inventive Principle:
Principle #5Merging (Combining)

3Quantity of substance

If fewer check bytes are used, then resource usage is reduced, but the error correction capability deteriorates

Engineering Contradiction:
Improvenumber of check bytesVSAvoiderror correction capability
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The patent uses segmentation to distribute the error correction task across multiple symbol groups, each protected by its own set of check bytes. The total number of check bytes required is less than what would be needed for a single strong error code protecting the entire data set, yet the overall error correction capability is maintained or improved because errors in different groups can be corrected independently.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS12413250B2Error correction with error code for a string of symbols
Publication Date: 2025.09.09 INFINEON TECHNOLOGIES AG
  • US12413250B2 patent drawing
  • US12413250B2 patent drawing
  • US12413250B2 patent drawing

AI summary

An approach to correcting errors in a string of symbols is proposed, in which the string of symbols is transformed by a transformation τ into a first group of symbols and into a second group of symbols, and in which the group of symbols that has fewer erroneous symbols than the other group is corrected using a first error code.