Integer Sequence Coding with Predetermined-Position 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 and 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 divides the sequence of integer values into two portions: a first portion containing integer values up to a predetermined position, and a second portion containing integer values after the predetermined position. This segmentation allows different encoding strategies to be applied to each portion, optimizing the overall bitstream efficiency while managing complexity.
Solution Approach 2:
The patent changes the encoding parameter by using differential encoding for the first portion (encoding differences between consecutive values) and direct encoding for the second portion. This parameter change adapts the encoding method to the characteristics of each sequence portion, reducing the average code length and bitstream bandwidth requirement.
2Device complexity
If conventional encoding methods are used, then the coding method is straightforward, but coding efficiency is poor when a large number of different values occur in the sequence
Solution Approach 1:
By segmenting the sequence at a predetermined position, the patent can apply differential encoding to the first portion where values change gradually, and direct encoding to the second portion. This segmentation enables the coding method to handle sequences with many different values efficiently, improving coding productivity without excessive complexity.
Solution Approach 2:
The patent changes the encoding approach from uniform direct encoding to a hybrid method using differential encoding for the first portion. This parameter change in the encoding strategy significantly improves coding efficiency for sequences with many different values, as differential encoding exploits the redundancy in consecutive values.
3Quantity of substance
If differential encoding is applied to all values, then bitstream bandwidth is reduced, but the method becomes inefficient when values are not sequentially related
Solution Approach 1:
The patent segments the sequence into two portions, applying differential encoding only to the first portion where values are sequentially related, and direct encoding to the second portion. This selective segmentation maintains bitstream bandwidth efficiency while avoiding the inefficiency of applying differential encoding inappropriately throughout the entire sequence.
Solution Approach 2:
The patent applies different encoding qualities to different portions of the sequence: differential encoding (higher compression) for the first portion with sequentially related values, and direct encoding (lower compression but more reliable) for the second portion. This local quality adaptation optimizes both bitstream bandwidth and coding efficiency for each portion's characteristics.
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.