Counter-Based Variable Length Coding for Adaptive Codeword Remapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional video coding and decoding techniques are computationally inefficient, especially when dealing with high-quality digital video compression and decompression, leading to increased demand for more efficient encoding and decoding methods that reduce the number of bits used during these processes.
Innovation Solution
The use of counters in variable length coding and decoding strategies, where counters are employed to increment occurrences of digital media data values and adjust codeword mappings dynamically, allowing more recently encoded or decoded codewords to have a greater influence on remapping, thereby optimizing bit usage and reducing computational burden.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional video coding and decoding techniques are used, then video compression and decompression can be performed, but computational efficiency is poor and the number of bits used is excessive
Solution Approach 1:
The patent implements dynamic codeword remapping using counters that track symbol occurrence frequencies. The codeword table is dynamically updated based on counter values, allowing the encoding scheme to adapt to the actual data distribution. This dynamic approach improves computational efficiency by prioritizing recently encountered symbols while reducing the total number of bits required for compression.
2Quantity of substance
If codeword tables are dynamically updated to improve compression efficiency, then more bits can be reduced, but the complexity of the encoding/decoding process increases
Solution Approach 1:
The patent segments the codeword table into multiple entries, each associated with a counter. This segmentation allows the system to track and update individual symbol frequencies independently. The modular structure enables efficient updates where only affected portions of the codeword table need modification, rather than regenerating the entire table, thus reducing overall complexity.
Solution Approach 2:
The patent employs feedback mechanisms where counters continuously monitor symbol occurrence frequencies and feed this information back to the codeword table. This feedback loop enables automatic adaptation of the encoding scheme based on actual data patterns, improving compression efficiency without requiring complex manual intervention or analysis.
3Quantity of substance
If more codeword remapping operations are performed to optimize bit usage, then compression efficiency improves, but processing time increases
Solution Approach 1:
The patent implements periodic remapping operations triggered by counter thresholds or fixed intervals rather than continuous updates. This periodic approach allows the system to accumulate sufficient frequency information before performing remapping, reducing the frequency of expensive table update operations while maintaining compression efficiency. The periodic action balances optimization needs with processing time constraints.
Data Source
AI summary
Disclosed herein are representative embodiments for performing entropy coding or decoding using a counter-based scheme. In one exemplary embodiment disclosed herein, a first codeword is received from compressed digital media data. The first codeword is decoded into a first digital media data value by referencing a codeword table that associates the first codeword with the first digital media data value and a second codeword with a second digital media data value. A counter for counting occurrences of the first digital media data value is incremented. The value of the first counter is compared with the value of a second counter that counts occurrences of a second digital media data value. If the value of the first counter and the value of the second counter are equal (or greater than or equal), the codeword table is updated to swap codewords between the first and second digital media values.