Bitstream Extraction and Packing Across 64-Bit Boundaries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing bitstream handling technologies, such as those used in multimedia and network streaming, inefficiently manage boundary conditions during bitstream extraction and packing, leading to reduced system efficiency due to inadequate handling of cases where extracted or packed bits cross the 64-bit boundary or require buffer lengths greater than memory address boundaries.
Innovation Solution
The method involves a bitstream extraction and packing apparatus that uses flags (empty, underflow, full, overflow) and arithmetic logic units to manage bit extraction and packing by adjusting starting positions and widths, appending or separating bits as needed to maintain efficient operation across different boundary conditions, ensuring optimal handling of cases where bits span or exceed register widths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional bitstream extraction methods are used, then extraction operations can be performed, but system efficiency is reduced due to inadequate handling of boundary conditions
Solution Approach 1:
The patent segments the bitstream extraction process into distinct cases based on boundary conditions (SP>LE, SP==LE, SP<LE). Each case is handled by a specific instruction sequence that optimizes for that condition, avoiding inefficient general-purpose handling for all cases. This segmentation allows the system to achieve high efficiency by matching the extraction method to the specific boundary condition.
Solution Approach 2:
The patent changes operational parameters (shift amounts, extraction sequences, flag settings) based on the specific boundary condition detected. For example, when SP>LE, the BSR is shifted left by 32-SP bits and then the intermediate result is shifted right by 32-LE bits. When SP<LE, different shift operations are performed. This parameter adaptation to boundary conditions resolves the contradiction between efficiency and ease of operation.
2Reliability
If bitstream extraction handles all boundary conditions, then completeness is improved, but device complexity increases due to multiple instruction sequences
Solution Approach 1:
The patent implements dynamic selection of extraction instructions based on the current boundary condition state. The system automatically determines which instruction sequence to execute (first, second, or third sequence) based on comparing SP and LE values. This dynamic approach ensures complete handling of all boundary conditions while managing complexity through conditional execution rather than maintaining all sequences simultaneously.
Solution Approach 2:
The extraction system performs self-service by automatically detecting the boundary condition type and selecting the appropriate instruction sequence without external intervention. The position register and length register values themselves drive the selection process, with the system self-adjusting its behavior based on the current state, thereby ensuring completeness while minimizing the need for complex external control logic.
3Productivity
If conventional packing methods are used, then packing operations can be performed, but system efficiency is reduced due to inadequate handling of boundary conditions
Solution Approach 1:
The patent segments the bitstream packing process into distinct cases based on boundary conditions (SP>LP, SP==LP, SP<LP). Each case has a dedicated packing instruction sequence that optimizes for that specific condition. This segmentation enables efficient packing by avoiding generic handling and instead applying the most appropriate method for each boundary scenario.
Solution Approach 2:
The patent adapts packing parameters (shift amounts, OR operation sequences, flag settings) based on the detected boundary condition. For example, when SP>LP, the SR is shifted left by SP-LP bits before packing. When SP<LP, different shift and OR operations are applied. This parameter adaptation to boundary conditions resolves the contradiction between efficiency and ease of operation for packing operations.
Data Source
AI summary
To handle boundary conditions efficiently during bitstream extraction, a predetermined number of bits are extracted from the bitstream register starting from a most significant bit of the bitstream register when an underflow flag is set. The predetermined number equals a predetermined extraction width minus a previous starting position. The bits are stored in a lowest part of a destination register, and the underflow flag is cleared.