Forward Chien Search Reed-Solomon Decoder for CRC-Aligned Error Correction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional Reed-Solomon decoder circuits require additional storage and reverse ordering of error locations and patterns for CRC operations, increasing the time and complexity of error check and correction processes.
Innovation Solution
A Reed-Solomon decoder circuit that performs Chien search and Forney algorithm operations in the same computational direction as the input data order, using a seed generator circuit to provide seed values and polynomial coefficients for Galois Field multiplication, allowing simultaneous CRC operations with reduced storage needs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional Reed-Solomon decoder circuits perform Chien search and CRC operations in reverse order of input data, then error locations and patterns can be found, but additional storage is required and processing time increases
Solution Approach 1:
The patent inverts the conventional approach by performing Chien search in the forward direction (same order as input data) rather than reverse order. This is achieved by modifying the seed generator circuit to provide seed values in forward order and adjusting the computational direction of the Chien search circuit, thereby eliminating the need for reverse ordering and additional storage while maintaining error detection accuracy
Solution Approach 2:
The patent performs preliminary action by generating all necessary seed values and polynomial coefficients in advance using the seed generator circuit before the Chien search begins. This allows the Chien search to proceed in forward order without requiring additional storage for intermediate results, as all computational elements are prepared beforehand in the correct sequence
2Measurement precision
If conventional Reed-Solomon decoder circuits use reverse ordering for Chien search, then error locations can be identified, but device complexity increases due to additional storage requirements
Solution Approach 1:
The patent inverts the conventional reverse-order approach by implementing forward-order Chien search. The seed generator circuit generates seed values in forward order (α^0, α^1, α^2, ...) and the Chien search circuit processes data in the same forward direction, eliminating the need for additional storage buffers and complex reordering logic while maintaining accurate error location identification
Solution Approach 2:
The patent changes the parameter of computational direction from reverse order to forward order. By modifying the seed generator to output values in forward sequence and adjusting the Chien search circuit to process in forward direction, the patent transforms the operational parameters to eliminate additional storage requirements while preserving error location accuracy
3Productivity
If Reed-Solomon decoder aligns Chien search with input data order, then processing efficiency increases, but computational direction must be changed from conventional reverse order
Solution Approach 1:
The seed generator circuit is designed to be universal by generating both the seed values and the polynomial coefficients (x^i terms) that are needed for both Chien search and CRC operations. This multi-functional design allows both operations to proceed in forward order using the same generated values, improving processing efficiency without significantly increasing computational complexity
Solution Approach 2:
The patent merges the seed generation function with the polynomial coefficient generation function into a single seed generator circuit. This combined circuit produces all necessary values for both Chien search and CRC operations in forward order, allowing the two operations to be synchronized and eliminating the need for separate reverse-order processing paths
Data Source
AI summary
A Reed-Solomon decoder includes a Chien search circuit to receive an error location polynomial function, performs Chien search, and finds an error location; a Forney algorithm circuit to receives an error pattern polynomial function and find an error pattern; and, a seed generator circuit to indicates a seed value corresponding to a codeword length for the input data. A Chien search is performed to obtain and outputs exponential terms related to variables for the polynomials, wherein the Chien search is performed in the same computational direction as an order for the input data.