HEVC CABAC Coefficient Coding Using Golomb-Rice and Exp-Golomb

Solution Overview

Problem

High bit-rate encoding and decoding in video coding standards like HEVC using CABAC are inefficient due to low throughput and significant processing resource consumption, especially for high bit-rate cases with low Quantization Parameter values.

Innovation Solution

Implementing a method that involves arithmetic decoding and encoding of transform coefficients using k-th order Exp-Golomb coding, and adapting coding techniques such as Golomb-Rice and Exponential-Golomb coding to optimize the encoding and decoding process, including determining Rice parameters and converting binary data to magnitude parameters, which allows for improved throughput by switching between different coding modes based on block size and context models.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of substance

If CABAC is used for lossless compression of transform coefficients, then compression efficiency is improved, but processing resource consumption and time increase significantly

Engineering Contradiction:

Improvecompression efficiencyVSAvoidthroughput

Core Design Contradiction:

Loss of substanceVSProductivity

Solution Approach 1:

The patent changes the coding parameter from traditional CABAC to Golomb-Rice and Exponential-Golomb coding, which are simpler arithmetic coding methods that maintain compression efficiency while reducing computational complexity and processing time

Inventive Principle:

Principle #35Parameter changes

Solution Approach 2:

The patent extracts and removes the complex context-adaptive probability modeling component from CABAC, retaining only the essential arithmetic coding functionality through Golomb-Rice and Exponential-Golomb methods, thereby simplifying processing while preserving compression performance

Inventive Principle:

Principle #2Taking out (Extraction)

2Loss of substance

If CABAC is used for high bit-rate encoding with low Quantization Parameter values, then compression efficiency is improved, but processing resource consumption increases significantly

Engineering Contradiction:

Improvecompression efficiencyVSAvoidprocessing resource consumption

Core Design Contradiction:

Loss of substanceVSUse of energy by moving object

Solution Approach 1:

The patent changes the coding parameter from traditional CABAC to Golomb-Rice and Exponential-Golomb coding, which are simpler arithmetic coding methods that maintain compression efficiency while reducing computational complexity and processing time

Inventive Principle:

Principle #35Parameter changes

Solution Approach 2:

The patent uses computationally lighter coding methods (Golomb-Rice and Exponential-Golomb) that consume fewer processing resources, effectively replacing the resource-intensive CABAC while maintaining adequate compression performance for high bit-rate scenarios

Inventive Principle:

Principle #27Cheap short-living objects (Disposable)

3Loss of substance

If context adaptive coding is used based on neighboring block symbols, then compression efficiency is improved, but device complexity increases

Engineering Contradiction:

Improvecompression efficiencyVSAvoidcoding complexity

Core Design Contradiction:

Loss of substanceVSDevice complexity

Solution Approach 1:

The patent extracts and removes the complex context-adaptive probability modeling component from CABAC, retaining only the essential arithmetic coding functionality through Golomb-Rice and Exponential-Golomb methods, thereby simplifying processing while preserving compression performance

Inventive Principle:

Principle #2Taking out (Extraction)

Data Source

PatentUS12108083B2GOLOMB-RICE/EG coding technique for CABAC in HEVC

Publication Date: 2024.10.01 DOLBY INTERNATIONAL AB

AI summary

A system utilizing a high throughput coding mode for CABAC in HEVC is described. The system may include an electronic device configured to obtain a block of data to be encoded using an arithmetic based encoder; to generate a sequence of syntax elements using the obtained block; to compare an Absolute-3 value of the sequence or a parameter associated with the Absolute-3 value to a preset value; and to convert the Absolute-3 value to a codeword using a first code or a second code that is different than the first code, according to a result of the comparison.