Integer Sequence Encoding Using Differential Values and Golomb Codes
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 at a specific position and then encoding differences between neighboring values, using exponential Golomb codes 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 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 the predetermined position, and a second portion containing remaining integer values. This segmentation allows different encoding strategies to be applied to each portion, optimizing bitstream efficiency while maintaining manageable encoding 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 reduces the average code length and thereby reduces bitstream bandwidth requirements.
2Device complexity
If conventional encoding methods are used, then the encoding process is straightforward, but coding efficiency is poor when many different values occur in the sequence
Solution Approach 1:
The patent performs a preliminary action by identifying and encoding the integer value at the predetermined position before encoding the remaining values. This preliminary encoding of a reference value enables subsequent differential encoding, which significantly improves coding efficiency when many different values occur in the sequence.
Solution Approach 2:
The patent changes the encoding approach from uniform direct encoding to a hybrid approach using differential encoding for the first portion and direct encoding for the second portion. This parameter change in encoding strategy improves coding efficiency by adapting to the statistical properties of the sequence values.
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 segments the sequence at a predetermined position, applying differential encoding only to the first portion up to that position. This selective segmentation reduces encoding complexity compared to applying differential encoding to the entire sequence, while still achieving bitstream bandwidth reduction.
Solution Approach 2:
The patent applies different encoding qualities to different portions of the sequence: differential encoding (higher compression) for the first portion and direct encoding (simpler processing) for the second portion. This local differentiation optimizes the balance between bitstream bandwidth reduction and encoding complexity.
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.