Integer Sequence Encoding with Reference-Position Difference Coding

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 at a specific position 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

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 is large due to lengthy codes

Engineering Contradiction:

Improveencoding process simplicityVSAvoidbitstream bandwidth

Core Design Contradiction:

Device complexityVSQuantity of substance

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 maintaining manageable complexity in the encoding process.

Inventive Principle:

Principle #1Segmentation

2Device complexity

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

Engineering Contradiction:

Improveencoding process simplicityVSAvoidcoding efficiency

Core Design Contradiction:

Device complexityVSProductivity

Solution Approach 1:

The patent applies different encoding characteristics to different portions of the sequence based on local properties. The first portion uses encoding based on the integer values themselves, while the second portion uses encoding based on differences from the predetermined position value. This local differentiation optimizes coding efficiency for sequences with many different values while keeping the overall process systematic and manageable.

Inventive Principle:

Principle #3Local quality

3Productivity

If differences between neighboring values are encoded consecutively, then coding efficiency improves for monotonic sequences, but the encoding process becomes more complex

Engineering Contradiction:

Improvecoding efficiencyVSAvoidencoding process complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent performs preliminary encoding of the integer value at the predetermined position before encoding the differences for the second portion. This preliminary action establishes a reference point that simplifies the subsequent difference encoding process, improving coding efficiency while maintaining a systematic and structured encoding流程 that doesn't excessively increase complexity.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS20250385690A1Apparatuses 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: 2025.12.18 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.