CABAC Golomb-Rice/EG Coding for High Bit-Rate Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
High bit-rate encoding and decoding in video coding standards like HEVC using CABAC face significant throughput performance issues due to computational complexity and time consumption, especially with high bit-rate cases and large Absolute-3 values, which impact processing resources and efficiency.
Innovation Solution
Implementing a method that involves arithmetic decoding and encoding using k-th order Exp-Golomb coding to derive rice parameters and convert binary data for transform coefficients, along with adaptive coding techniques such as Golomb-Rice and Exponential-Golomb coding, to optimize bitstream processing and reduce computational overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If CABAC encoding is used for high bit-rate cases, then compression efficiency is improved, but processing time and computational complexity increase significantly
Solution Approach 1:
The patent changes the coding parameter from standard CABAC arithmetic coding to Golomb-Rice/Exponential-Golomb coding, which uses different mathematical parameters (rice_parameter, k-th order EG coding) to achieve efficient encoding. This parameter change reduces computational complexity while maintaining compression efficiency for high bit-rate cases by avoiding the complex probability model updates required in CABAC.
Solution Approach 2:
The patent replaces the complex, resource-intensive CABAC arithmetic decoding process with simpler Golomb-Rice/Exponential-Golomb coding that requires fewer processing resources. The simpler coding scheme acts as a 'cheaper' alternative that consumes less computational power and time, particularly for high bit-rate scenarios where CABAC becomes prohibitively expensive.
2Measurement precision
If CABAC decoding is used for large Absolute-3 values, then accurate reconstruction is improved, but processing resources and computational overhead increase
Solution Approach 1:
The patent introduces a rice_parameter derivation mechanism and k-th order Exponential-Golomb coding that adapts to large Absolute-3 values. By changing the coding parameter from fixed CABAC probability models to adaptive Golomb-Rice/EG coding with variable order k, the system maintains reconstruction accuracy for large values while reducing computational complexity through a more efficient encoding scheme.
Solution Approach 2:
The patent makes the coding approach dynamic by deriving the rice_parameter adaptively and using k-th order EG coding where the order can be adjusted based on the data characteristics. This dynamic adaptation allows the system to handle large Absolute-3 values efficiently without the rigid, resource-intensive CABAC framework, reducing device complexity while preserving accuracy.
3Ease of manufacture
If standard Golomb-Rice coding is used, then encoding simplicity is improved, but performance for high bit-rate cases deteriorates
Solution Approach 1:
The patent enhances standard Golomb-Rice coding by making it dynamic through the derivation of rice_parameter and the introduction of k-th order Exponential-Golomb coding. This dynamic version adapts to high bit-rate cases by adjusting the coding order k based on the data characteristics, thereby improving throughput performance while retaining the relative simplicity of Golomb-based coding compared to full CABAC.
Solution Approach 2:
The patent creates a composite coding approach by combining Golomb-Rice coding with Exponential-Golomb coding elements. This hybrid composite scheme leverages the simplicity of Golomb-Rice while incorporating the adaptive capabilities of EG coding, achieving both encoding simplicity and high throughput performance for high bit-rate cases that standard Golomb-Rice alone cannot deliver.
Data Source
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.