Integer Sequence Encoding with Difference-Based Compression

Resolve Bottlenecks,
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 compression.

Engineering Contradictions & Design Principles

VSEngineering 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

Engineering Contradiction:

Improveencoding process complexityVSAvoidbitstream bandwidth

Core Design Contradiction:

Device complexityVSQuantity of substance

Solution Approach 1:

The sequence of integer values is divided into two portions: a first portion containing integer values up to a threshold value, and a second portion containing integer values exceeding the threshold. This segmentation allows different encoding strategies to be applied to each portion, optimizing the overall bitstream efficiency while maintaining manageable encoding complexity.

Inventive Principle:

Principle #1Segmentation

2Device complexity

If conventional encoding methods are used for sequences with many different values, then the encoding process remains straightforward, but coding efficiency deteriorates

Engineering Contradiction:

Improveencoding process complexityVSAvoidcoding efficiency

Core Design Contradiction:

Device complexityVSProductivity

Solution Approach 1:

Different encoding approaches are applied to different portions of the sequence based on local characteristics. The first portion (values ≤ threshold) uses one encoding method, while the second portion (values > threshold) uses another method. This local differentiation optimizes coding efficiency for each segment while keeping the overall encoding process relatively simple.

Inventive Principle:

Principle #3Local quality

Solution Approach 2:

The encoding process utilizes parameter changes by applying different coding strategies based on the threshold parameter. By changing the encoding approach at the threshold boundary, the system adapts to handle both small and large integer values efficiently, improving overall coding efficiency without significantly increasing process complexity.

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS20260012192A1Apparatuses for encoding and decoding a sequence of integer values, methods for encoding and decoding a sequence of integer values and computer program for implementing these methods

Publication Date: 2026.01.08 FRAUNHOFER GESELLSCHAFT ZUR FORDERUNG DER ANGEWANDTEN FORSCHUNG EV

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.