Segmented Error Correction Coding for Faster Decoder Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional error correction code decoding methods are inefficient due to the time-consuming calculation of error location polynomial coefficients and Chien search, leading to delays and performance degradation in communication and data storage systems.
Innovation Solution
A method that divides raw data into segments, generates short parities, and appends them to form short codewords, which are then concatenated with a long parity to create a long codeword, allowing for efficient decoding by calculating short syndromes and correcting errors without computing error location polynomial roots, thereby reducing decoding time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional decoding methods are used to calculate error location polynomial coefficients and perform Chien search, then error correction accuracy is maintained, but decoding time increases significantly
Solution Approach 1:
The patent segments the error correction code into multiple sub-codewords, each processed independently to calculate sub-syndromes. This segmentation allows parallel processing of multiple segments simultaneously, significantly reducing the overall decoding time while maintaining error correction accuracy through subsequent synthesis of sub-syndromes into a complete syndrome for accurate error location determination
Solution Approach 2:
The patent performs preliminary calculation of error location polynomial coefficients using the synthesized syndrome before performing the Chien search. By preparing the coefficients in advance through efficient syndrome calculation from segmented sub-codewords, the system reduces the time required for the actual error location search while ensuring accurate error correction
2Reliability
If error location polynomial coefficients and Chien search are calculated for every non-zero syndrome, then all errors are corrected, but system performance degrades due to processing delay
Solution Approach 1:
The patent applies partial action by segmenting the error correction code into multiple sub-codewords and calculating syndromes for each segment separately. This partial processing approach allows the system to handle multiple segments in parallel, reducing overall processing time while still achieving complete error correction through the synthesis of all sub-syndromes to form the complete syndrome for final error location determination
Data Source
AI summary
The invention provides a method for encoding and decoding an error correction code. First, raw data is received and then divided into a plurality of data segments. A plurality of short parities corresponding to the data segments is then generated according to a first generator polynomial. The short parities are then appended to the data segments to obtain a plurality of short codewords. The short codewords are then concatenated to obtain a code data. A long parity corresponding to the code data is then generated according to a second generator polynomial, wherein the first generator polynomial is a function of at least one minimum polynomial of the second generator polynomial. Finally, the long parity is then appended to the code data to obtain a long codeword as an error correction code corresponding to the raw data.