Integer Sequence Coding with Split Differential Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encoding and decoding methods for sequences of integer values require significant bitstream bandwidth due to lengthy codes, and are inefficient when a large number of different values occur in the sequence.
Innovation Solution
An encoding and decoding apparatus/method that separates a sequence of integer values into two portions, encoding a predetermined value and then encoding differences between neighboring values, using exponential Golomb codes and context-adaptive binary arithmetic coding to optimize bitstream efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If conventional encoding methods are used for sequences of integer values, then the encoding process is simple, but the bitstream bandwidth requirement is large due to lengthy codes
Solution Approach 1:
The patent segments the sequence of integer values into two portions: a first portion containing integer values up to and including a predetermined value, and a second portion containing remaining integer values. This segmentation allows different encoding strategies to be applied to different portions, optimizing the overall bitstream efficiency while maintaining manageable encoding complexity.
Solution Approach 2:
The patent changes the encoding parameter by using differential encoding for the second portion, where instead of encoding each integer value directly, it encodes the difference between consecutive values. This parameter transformation significantly reduces the bitstream bandwidth requirement when the sequence has local correlations, while the encoding process remains computationally simple.
2Device complexity
If conventional encoding methods are used, then the encoding approach is straightforward, but coding efficiency is poor when a large number of different values occur in the sequence
Solution Approach 1:
By dividing the sequence into two portions based on a predetermined threshold value, the patent enables more efficient coding when many different values are present. The first portion is encoded directly while the second portion uses differential encoding, which exploits local correlations to achieve better compression ratios and coding efficiency.
Solution Approach 2:
The patent transforms the encoding parameter from direct value encoding to differential encoding for the second portion. This transformation improves coding efficiency by capturing the local structure and correlations in the data, reducing the average code length even when many different values occur in the sequence.
3Quantity of substance
If differential encoding is applied to all values, then bitstream bandwidth is reduced, but the encoding complexity increases
Solution Approach 1:
The patent applies differential encoding only to the second portion of the sequence (values exceeding the predetermined threshold) rather than to all values. This selective application reduces bitstream bandwidth for sequences with many different values while avoiding the increased complexity that would result from applying differential encoding uniformly across the entire sequence.
Data Source
AI summary
The invention describes an encoding scheme for encoding a sequence of integer values, particularly by first using encoding a value at a predetermined position and then consecutively calculating and encoding differences between neighboring values. A respective decoding scheme is also provided. These encoding and decoding schemes provide a more efficient encoding concept.