Reed-Solomon ELP Maintenance for Faster Frame-by-Frame Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing error correction coding schemes, such as SPolar generalized concatenated code (GCC) using Reed Solomon (RS) decoding, face inefficiencies in recalculating the error locator polynomial (ELP) after every decoded frame, leading to resource-intensive operations and latency in the decoding process.
Innovation Solution
The method involves calculating an initial ELP considering all to-be-decoded frames as erasures and then maintaining this ELP throughout the decoding process by updating it after each successfully decoded frame, while simultaneously calculating multiple updated coefficients to accelerate the division calculation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the ELP is recalculated after every decoded frame, then the accuracy of error location determination is maintained, but the computational resource consumption and latency increase significantly
Solution Approach 1:
The patent applies preliminary action by calculating the initial ELP considering all to-be-decoded frames as erasures before the decoding process begins. This pre-calculated ELP is then maintained and updated incrementally throughout decoding, avoiding the need to recalculate from scratch after each frame, thus reducing computational overhead while maintaining accuracy
Solution Approach 2:
The patent implements dynamics by transitioning from a static recalculation approach to a dynamic maintenance approach. The ELP is initially calculated comprehensively and then dynamically updated by dividing by monomials corresponding to successfully decoded frames, allowing the system to adapt efficiently as decoding progresses
2Reliability
If the ELP is updated after every decoded frame, then the error correction accuracy is maintained, but the computational complexity and time consumption increase
Solution Approach 1:
The initial ELP is calculated in advance considering all frames as potential erasures, establishing a comprehensive error location polynomial before decoding begins. This preliminary calculation eliminates the need for time-consuming recalculations during the decoding process
Solution Approach 2:
The patent changes the parameter representation by maintaining the ELP in polynomial form and updating it through division by monomials rather than full recalculation. This parameter update approach significantly reduces computational time while maintaining the accuracy of error location determination
3Productivity
If multiple coefficients are calculated simultaneously, then the division calculation speed is accelerated, but the device complexity increases
Solution Approach 1:
The patent segments the coefficient calculation process into multiple parallel operations. Instead of calculating coefficients sequentially, the system divides the polynomial division into independent calculation paths that can compute multiple coefficients simultaneously, effectively parallelizing the computational workload
Solution Approach 2:
The patent transitions from sequential one-dimensional calculation to parallel multi-dimensional computation. By organizing the calculation of multiple coefficients in parallel across different computational units, the system adds a temporal parallelism dimension that accelerates the overall division calculation process
Data Source
AI summary
Systems, devices, and methods for decoding information bits obtained from storage, including obtaining a codeword from among a plurality of codewords stored in a storage device, wherein the codeword includes a plurality of frames; obtaining an initial error locator polynomial (ELP) corresponding to the codeword; decoding a frame of the plurality of frames; based on determining that the frame is successfully decoded, determine an updated ELP based on the initial ELP and information about the frame; and obtaining information bits corresponding to the codeword based on the updated ELP, wherein the updated ELP includes a plurality of updated coefficients, and wherein the updated ELP is determined by simultaneously calculating at least two updated coefficients from among the plurality of updated coefficients.