Reed-Solomon Soft Decoding with Combined Chase-GMD Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing Reed-Solomon code decoding methods face inefficiencies in handling errors and erasures, particularly in high-rate codes with large finite fields, leading to exponential complexity and suboptimal performance in decoding accuracy.
Innovation Solution
A method for soft decoding of generalized Reed-Solomon codes using a combined Chase and Generalized Minimum Distance (GMD) decoding algorithm, which employs a Groebner basis and channel reliability information to traverse a decoding tree, updating polynomials with edge flipping and erasure rules, and utilizing Forney's formula for error calculation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If hard decision error-and-erasures decoding is performed with a fixed set of erasures, then decoding speed is improved, but decoding accuracy deteriorates due to exponential complexity and suboptimal performance
Solution Approach 1:
The patent segments the decoding process into multiple phases: initial hard decision decoding with fixed erasures, followed by soft decoding for remaining uncertainties. This segmentation allows the system to quickly handle obvious errors while dedicating more computational resources to ambiguous cases, thus improving both speed and accuracy
Solution Approach 2:
The patent dynamically adjusts the decoding strategy based on channel reliability information. Coordinates are classified into Chase coordinates (lower reliability) and GMD coordinates (higher reliability), and the decoding process adapts by applying different algorithms to different coordinate types, optimizing the trade-off between speed and accuracy
2Reliability
If soft decoding with full probabilistic information is used, then decoding accuracy is improved, but computational complexity increases exponentially
Solution Approach 1:
The patent applies different decoding qualities to different parts of the codeword. Chase coordinates (with lower reliability) undergo more intensive soft decoding with polynomial updates and Groebner basis calculations, while GMD coordinates (with higher reliability) are handled more efficiently. This local differentiation reduces overall complexity while maintaining accuracy where it matters most
Solution Approach 2:
The patent performs partial soft decoding by focusing computational efforts only on Chase coordinates rather than all coordinates. The Groebner basis calculations and polynomial updates are applied selectively to a subset of coordinates, providing sufficient decoding accuracy without the full exponential complexity of complete soft decoding
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method for soft decoding of generalized Reed-Solomon (RS) error correction codes, includes receiving a codeword through a digital electronic communication channel; verifying that an HD error-and-erasures decoding has failed; finding a Groebner basis that accounts for a fixed set of erasures; constructing a Chase and GMD decoding tree on the set of Chase coordinates and the set of GMD coordinates; traversing the decoding tree using polynomials of the Groebner basis as a basis that represents updated coefficient polynomials on the Chase and GMD decoding tree; updating polynomials on the decoding tree using root and derivate steps that flip an edge, or a root step for an erasure edge; calculating error locations by polynomial evaluation of candidate polynomials from the decoding tree, and calculating error values by using Forney's formula; and correcting the received codeword according to the calculated error locations and calculated error values.