Integer Sequence Encoding via Bijective Transformation and Golomb-Rice
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing techniques for encoding and decoding integer sequences, such as those following a denser or sparser distribution than the Laplacian distribution, face challenges with memory size and calculation processing requirements, particularly when using mapping tables or predetermined rules, leading to inefficient compression and decoding performance.
Innovation Solution
The implementation of an encoder and decoder that utilize algebraically-representable bijective transformations to transform integer sets into single or multiple values, followed by Golomb-Rice encoding, allowing for efficient bit allocation and reduced memory and calculation processing, similar to the Golomb-Rice code's simplicity but adaptable to various distributions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If mapping tables or predetermined rules are used to encode integer sequences with non-Laplacian distributions, then compression performance improves, but memory size and calculation processing requirements increase
Solution Approach 1:
The patent transforms the distribution parameters of integer sequences by applying algebraic transformations (such as squaring or taking absolute values) before Golomb-Rice encoding. This allows the same simple encoder to adapt to different distribution characteristics without requiring complex mapping tables, thus improving compression performance while avoiding increased device complexity
Solution Approach 2:
The patent introduces an intermediate transformation step that converts integer sequences with various distributions into a form suitable for Golomb-Rice encoding. This intermediary transformation acts as a bridge between the input data and the simple Golomb-Rice encoder, achieving good compression performance without requiring the encoder itself to be complex
2Device complexity
If Golomb-Rice code is used for encoding, then device complexity is minimized, but compression performance deteriorates for non-Laplacian distributions
Solution Approach 1:
The patent performs preliminary algebraic transformations on the integer sequence before applying Golomb-Rice encoding. By preparing the data in advance through transformations like squaring or absolute value operations, the simple Golomb-Rice encoder can achieve better compression performance on non-Laplacian distributions without increasing its own complexity
Data Source
Figure 1
Figure 2~3
Figure 4~5
AI summary
A sequence of integer values is encoded and decoded with a number of bits of a decimal value substantially assigned per sample or/and with a smaller memory amount or calculation processing amount than in the prior art. The encoder receives the sequence of integer values as input and outputs an integer code corresponding to the sequence of integer values. An integer transformer (11) obtains one integer value (transformed integer) through algebraically-representable bijective transformation for each of a plurality of sets of integer values included in the inputted sequence of integer values. An integer encoder (12) encodes the transformed integer to thereby obtain an integer code.