Error Decoder Detection of Uncorrectable Codewords Before Chien Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional error correction methods in memory devices are computationally intensive, leading to increased data read latency due to the need for a Chien Search to determine error locations, even when a codeword is uncorrectable.
Innovation Solution
Implementing a method to detect uncorrectable codewords from the error locator polynomial before performing a Chien Search, thereby skipping unnecessary computations and reducing latency by avoiding the determination of error locations in such cases.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional error correction methods are used to determine error locations via Chien Search, then accurate error detection and correction is achieved, but processing latency increases
Solution Approach 1:
The patent applies preliminary action by checking the error locator polynomial properties (specifically whether it is a multiple of the generator polynomial) before performing the full Chien Search. This preliminary check identifies uncorrectable codewords early, allowing the system to skip the computationally intensive error location determination step while maintaining accurate error detection. The syndrome calculation is performed first, and if the polynomial check indicates uncorrectability, the Chien Search is avoided entirely.
2Reliability
If full Chien Search is performed to determine error locations, then complete error correction capability is maintained, but computational complexity increases
Solution Approach 1:
The patent extracts and evaluates specific properties of the error locator polynomial (whether it is a multiple of the generator polynomial) separately from the full Chien Search process. By taking out this preliminary check, the system can identify and handle uncorrectable cases without performing the complete computationally intensive search, thus reducing overall computational complexity while maintaining the ability to correct errors when they are detectable.
3Reliability
If error locations are determined for all codewords, then thorough error correction is achieved, but processing speed decreases
Solution Approach 1:
The patent implements skipping by allowing the system to bypass the error location determination step (Chien Search) when the preliminary polynomial check indicates that the codeword is uncorrectable. This selective skipping maintains thorough error correction for correctable cases while significantly improving processing speed for uncorrectable cases, where full error location analysis would be wasteful.
Data Source
AI summary
Devices, systems, and methods that reduce the latency of detecting that a codeword is uncorrectable are disclosed and described. Such devices, systems, and methods allow the determination that a codeword is uncorrectable prior to determining error locations in the codeword, thus eliminating the need for such an error location search.