Repetitive Bit Value Pattern Determination via Polynomial Sequence Length
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for determining repetitive bit value patterns in data words generated by program expressions are time-consuming and resource-intensive, as they require evaluating all program expressions and considering arbitrary bit pattern lengths, making real-time processing infeasible.
Innovation Solution
A method that calculates a sequence length value associated with a predetermined bit position using a polynomial expression, allowing for the evaluation of program expressions only for the indicated number of loop iterations to determine the repetitive bit value pattern, thereby reducing computational power and storage requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If all program expressions are evaluated to search for repetitive bit sequences, then complete bitstream analysis is achieved, but computation time and resource consumption increase significantly
Solution Approach 1:
The patent segments the bitstream analysis by focusing on specific bit positions rather than evaluating the complete bitstream. By dividing the analysis into individual bit position evaluations, the method reduces computational complexity while maintaining detection accuracy for repetitive patterns at each position.
Solution Approach 2:
The patent extracts only the necessary information by directly calculating repetitive bit sequences at predetermined bit positions using polynomial expressions, rather than extracting patterns from the entire evaluated bitstream. This extraction approach eliminates unnecessary computation of irrelevant bit sequences.
2Adaptability or versatility
If arbitrary bit pattern lengths are considered in the search, then comprehensive pattern detection is achieved, but the search process becomes extremely time-consuming
Solution Approach 1:
The patent changes the parameter of pattern length from an arbitrary search variable to a predetermined value based on the specific bit position. By using polynomial expressions that directly calculate the repetitive sequence length for each bit position, the method eliminates the need to search through all possible lengths, significantly improving detection speed while maintaining adaptability to different pattern lengths through the mathematical model.
3Measurement precision
If symmetry operations are performed on specialized data structures to determine repetitive patterns, then pattern recognition is achieved, but resource consumption increases and real-time processing becomes infeasible
Solution Approach 1:
The patent replaces the mechanical approach of performing symmetry operations on data structures with a mathematical substitution method using polynomial expressions. Instead of mechanically processing data structures to recognize patterns, the invention uses algebraic calculations to directly determine repetitive bit sequences, dramatically reducing resource consumption and enabling real-time processing.
Data Source
AI summary
A repetitive bit value pattern associated to a predetermined bit position of a sequence of data words, the data words having two or more bits in a bit order, a bit position describing a position within the bit order being indicative of a value represented by the bit at the bit position, can be determined from program loop information, the program loop information having a program expression for determining an updated data word of the sequence of data words. Using the predetermined bit position, a sequence length value associated to the predetermined bit position is determined. The program expression is evaluated for a number of loop iterations indicated by the sequence length value, to obtain updated bit values associated to the predetermined bit position. The repetitive bit value pattern is determined using the updated bit values of the number of loop iterations.