Scrambled Reed-Solomon Codeword Boundary Detection With Incremental Parity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Detecting codeword boundaries in scrambled Reed-Solomon codewords is challenging and time-consuming, especially due to the need for frequent parity recalculations and exhaustive error correction processes, which are resource-intensive and costly in processing resources.
Innovation Solution
The method involves using parity and symbols from a previous window to detect codeword boundaries efficiently, updating parity symbols bitwise, and optionally bypassing or partially performing error correction, reducing the need for descrambling and exhaustive root searches, and pre-computing necessary data to speed up parity matching and error location computations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional codeword boundary detection methods are used on scrambled Reed-Solomon codewords, then error correction can be performed, but processing latency and resource usage increase significantly
Solution Approach 1:
The patent pre-computes and stores syndrome values for all possible 10-bit symbol values before codeword boundary detection begins. When detecting boundaries, the system directly retrieves pre-computed syndrome values instead of performing exhaustive error correction calculations, dramatically reducing processing latency while maintaining error correction capability
Solution Approach 2:
The patent performs partial error correction by computing syndromes to detect potential codeword boundaries without completing full error correction for every candidate boundary. Full error correction is only performed when a boundary is confirmed, reducing overall processing resources while maintaining reliability
2Measurement precision
If exhaustive error correction processes are performed for each candidate boundary, then accurate codeword boundary detection is achieved, but processing resources are excessively consumed
Solution Approach 1:
The patent segments the error correction process into two distinct phases: (1) a fast syndrome computation phase that screens candidate boundaries using minimal resources, and (2) a complete error correction phase that is only executed when a boundary is confirmed. This segmentation allows accurate detection while reducing overall processing resource usage
Solution Approach 2:
The patent pre-computes syndrome values for all possible symbol values and stores them in lookup tables. During boundary detection, these pre-computed values are retrieved directly rather than calculating syndromes in real-time, maintaining detection accuracy while minimizing processing resource consumption
3Reliability
If parity recalculations are performed frequently for each input bit, then codeword boundary detection is thorough, but processing speed decreases
Solution Approach 1:
The patent maintains continuous parity state as bits are received, updating the parity incrementally rather than recalculating from scratch for each candidate boundary. This continuous update approach preserves detection thoroughness while enabling faster processing by avoiding redundant calculations
Solution Approach 2:
The patent pre-computes and stores parity values for all possible symbol combinations before boundary detection begins. During detection, these pre-computed parity values are used directly, eliminating the need for frequent recalculations and maintaining both thoroughness and speed
Data Source
AI summary
The present embodiments relate to methods and apparatuses for detecting a codeword boundary and/or performing codeword error correction for a bitstream comprising scrambled Reed Solomon codewords. In accordance with some aspects, detecting a codeword boundary involves the use of the parity and symbols from a previous window to help in detecting a codeword boundary when the next input bit is received. In accordance with other aspects, parity symbols are more efficiently updated for each successive candidate input bit. In accordance with still further aspects, error correction during codeword boundary detection can be either partially performed or completely bypassed.