Exp-Golomb Video Encoding Without Large Lookup Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data compression techniques using Exp-Golomb codes require large look-up tables for decoding, leading to significant memory and processing delays, and are inefficient for handling both unsigned and signed inputs, necessitating additional conversion steps.
Innovation Solution
A method for encoding unsigned and signed data into Exp-Golomb codes using a combination of arithmetic operations and a small look-up table, eliminating the need for large tables and enabling direct encoding without initial conversion, utilizing components like incrementers, adders, and barrel shifters.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If large look-up tables are used for Exp-Golomb code decoding, then decoding accuracy is improved, but memory size and processing delays increase significantly
Solution Approach 1:
The patent divides the decoding process into multiple stages: first determining the length of the input code word, then using that length information to select an appropriate smaller look-up table subset, and finally decoding using the selected subset. This segmentation allows accurate decoding while using only a fraction of the memory required for a complete look-up table.
Solution Approach 2:
The patent performs preliminary determination of the code word length before accessing the look-up table. By calculating the length first (using the relationship between code word length and value bits), the system can prepare and select the appropriate table subset in advance, avoiding the need to traverse or store the entire large look-up table.
2Measurement precision
If large look-up tables are used for Exp-Golomb code decoding, then decoding accuracy is improved, but processing speed decreases due to traversal time
Solution Approach 1:
The patent segments the look-up table into multiple smaller subsets indexed by code word length. This allows the decoder to access only the relevant subset rather than traversing the entire large table, significantly reducing access time while maintaining decoding accuracy.
Solution Approach 2:
The system performs preliminary calculation of the code word length and uses this information to directly index into the appropriate look-up table subset. This preliminary action eliminates the need for sequential traversal of large tables, improving processing speed while preserving accurate decoding.
3Adaptability or versatility
If conversion from signed input to unsigned input is performed before Exp-Golomb encoding, then encoding compatibility is improved, but device complexity and processing time increase
Solution Approach 1:
The patent creates a universal Exp-Golomb encoding system that can directly handle both signed and unsigned inputs without requiring separate conversion pathways. The encoding logic is designed to interpret the input format and apply appropriate encoding rules internally, eliminating the need for external conversion components.
Solution Approach 2:
The encoding system performs self-detection of input format (signed or unsigned) and automatically applies the correct encoding procedure. This self-service capability eliminates the need for external conversion circuits or manual format transformation, reducing device complexity while maintaining compatibility with both input types.
Data Source
AI summary
Embodiments of the claimed subject matter provide a method and system for performing data compression by encoding input into Exp-Golomb code. In one embodiment, data compression of data input is achieved via encoding as unsigned Exp-Golomb code. The method is achieved by converting the input, determining the position of the most significant bit in the converted input having a non-zero value (MSB), deriving information from the position of the MSB and arithmetically encoding the information to derive a compressed output.