Integer Sequence Encoding Using Predetermined-Position Differencing
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 increases due to lengthy codes
Solution Approach 1:
The sequence of integer values is divided 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 the overall bitstream efficiency while maintaining manageable encoding complexity.
Solution Approach 2:
The patent changes the encoding parameter by using differential encoding (encoding differences between neighboring values rather than absolute values) and applies exponential Golomb codes with context-adaptive binary arithmetic coding. This parameter transformation significantly reduces the bitstream bandwidth requirement while the encoding process remains systematically manageable.
2Device complexity
If conventional encoding methods are used, then the encoding approach is straightforward, but coding efficiency deteriorates when a large number of different values occur in the sequence
Solution Approach 1:
The patent performs preliminary action by first encoding the integer value at the predetermined position before encoding the differences between neighboring values. This preliminary encoding of a reference value enables subsequent differential encoding to be more efficient, especially when values are centered around a certain integer, as the differences tend to be smaller and more compressible.
Solution Approach 2:
By transforming the encoding from absolute values to differential values (differences between neighboring values), the patent changes the parameter representation. This transformation is particularly effective when a large number of different values occur in the sequence, as the differences are typically smaller and exhibit better statistical properties for compression, thereby improving coding efficiency.
3Quantity of substance
If differential encoding is applied to all positions, then bitstream efficiency improves, but the encoding method becomes less adaptable when values are centered around a certain integer
Solution Approach 1:
The patent applies local quality by treating the predetermined position (where values are centered) differently from other positions. The first portion of the sequence (up to and including the predetermined position) is encoded with special consideration for the centered values, while the second portion uses standard differential encoding. This localized approach optimizes bitstream efficiency while adapting to the specific value distribution characteristics.
Solution Approach 2:
The patent adapts the encoding parameter strategy based on the local value distribution. When values are centered around a certain integer at the predetermined position, the encoding method changes to exploit this property by first encoding the centered value and then encoding differences, which improves both bitstream efficiency and adaptability to the specific data 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.