Cyclic Code Block Synchronization Using Iterative Parity Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current descrambling techniques for bit streams are computationally inefficient due to the need for independent analysis of each bit stream window, leading to excessive computational intensity.
Innovation Solution
An iterative method is introduced to identify bit stream boundaries by calculating and updating parity values, comparing them to a target parity, and adjusting the parity calculation based on additive cyclic codes, allowing for efficient identification of proper bit stream windows without unnecessary descrambling.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If brute force methods are used to independently analyze each bit stream window to determine proper boundaries, then measurement precision of bit stream boundaries is improved, but computational complexity increases excessively
Solution Approach 1:
The patent applies preliminary action by performing parity calculations on a subset of bit stream windows before complete descrambling to identify proper boundaries in advance. The system calculates parity values for candidate windows, compares them against expected parity based on the scrambling polynomial, and identifies valid boundaries before committing to full descrambling operations, thereby avoiding computational waste on invalid windows
Solution Approach 2:
The patent segments the bit stream analysis process into distinct phases: parity calculation phase, boundary identification phase, and descrambling phase. By dividing the continuous bit stream into candidate windows and evaluating them independently through parity checks, the system can efficiently identify valid boundaries without processing the entire stream uniformly, reducing overall computational complexity
2Reliability
If independent analysis of each bit stream window is performed to ensure accurate boundary identification, then reliability of boundary detection is improved, but processing time increases
Solution Approach 1:
The patent applies partial action by performing parity checks on only the necessary subset of bit stream windows rather than exhaustive analysis of all possible windows. The system calculates parity for candidate windows and stops when valid boundaries are identified, performing just enough analysis to ensure reliable detection without unnecessary processing of additional windows
Solution Approach 2:
The patent implements feedback mechanisms where parity calculation results from candidate windows feed back into boundary identification decisions. The system uses the calculated parity values and their comparison with expected parity to feedback-determine whether a window represents a valid boundary, enabling reliable detection while avoiding processing of invalid windows
Data Source
AI summary
An improved approach is provided to identifying the boundary of data encoded using additive cyclic codes. In some embodiment, the process includes determining a first calculated parity of a first bit stream window, and, second, one or more updates to the calculated parity of the bit stream window to determine the parity of the next bit stream window, where after each update to the calculated parity, the calculated parity is compared with the target parity, and matching the calculated parity to the target parity indicates a proper boundary of a bit stream window. In some embodiments, the process supports shortened cyclic codes. In some embodiments, the bit stream boundary can be identified prior to descrambling the bit stream inputs for a given bit stream window. In this way, the process can avoid unnecessarily descrambling of the bit stream windows that are not properly aligned to a bit stream boundary.