Integer Sequence Encoding Using Neighbor Differences for Lower Bitstream Load

Resolve Bottlenecks,
Find Innovative Solutions
Generate 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

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 segments 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 method is straightforward, but the coding efficiency is poor

Engineering Contradiction:
Improveencoding method simplicityVSAvoidcoding efficiency
Core Design Contradiction:
Device complexityVSProductivity

Solution Approach 1:

The patent applies different encoding qualities to different portions of the sequence. The first portion is encoded with a first encoding method suited for values up to the predetermined position, while the second portion is encoded with a second encoding method suited for values after the predetermined position. This local differentiation of encoding quality improves overall coding efficiency without requiring a completely complex encoding framework.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS12431916B2Apparatuses 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.09.30 FRAUNHOFER GESELLSCHAFT ZUR FORDERUNG DER ANGEWANDTEN FORSCHUNG EV
  • US12431916B2 patent drawing
  • US12431916B2 patent drawing
  • US12431916B2 patent drawing

AI summary

An encoding scheme for encoding a sequence of integer values comprises 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.