AVM Coefficient Encoding Through Adaptive Bypass Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing audiovisual content encoding techniques rely heavily on entropy coding, which is computationally intensive and difficult to parallelize, leading to delays in streaming and decoding processes, especially for time-sensitive content.
Innovation Solution
Implement an adaptive bypass coder that identifies low and high value ranges in quantized coefficients, using entropy coding for low ranges and adaptive bypass coding for high ranges, with context-based adaptive bypass coding schemes to enhance encoding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If entropy coding is used for quantized coefficient encoding, then compression ratio is improved, but computational complexity and encoding time increase
Solution Approach 1:
The patent segments the quantized coefficient encoding process into two distinct parts: entropy coding for the base range (BR) and low range (LR) components, and bypass coding for the high range (HR) components. This segmentation allows each method to be applied where it is most effective, reducing overall computational complexity while maintaining compression efficiency.
Solution Approach 2:
The patent applies different encoding methods to different parts of the quantized coefficient based on their local characteristics. Specifically, entropy coding is applied to BR and LR symbols where it provides good compression, while bypass coding is applied to HR symbols where it provides faster processing. This local differentiation resolves the contradiction by optimizing each region according to its specific needs.
2Loss of information
If entropy coding is used for quantized coefficient encoding, then compression ratio is improved, but encoding speed decreases
Solution Approach 1:
The patent divides the encoding process into two segments: entropy coding for BR and LR components (which contribute most to compression ratio) and bypass coding for HR components (which can be encoded faster). This segmentation improves encoding speed by applying the faster bypass method to a portion of the data while maintaining good compression through entropy coding on the critical portions.
Solution Approach 2:
The patent changes the encoding parameter (method selection) based on the value range of the quantized coefficient. By switching between entropy coding and bypass coding depending on whether the coefficient falls in BR/LR or HR, the system optimizes the trade-off between compression ratio and encoding speed dynamically.
3Loss of information
If entropy coding is used for quantized coefficient encoding, then compression efficiency is improved, but parallelization difficulty increases
Solution Approach 1:
The patent segments the coefficient encoding into BR/LR portions (entropy coded) and HR portions (bypass coded). The bypass coding segment can be parallelized more easily than entropy coding, and by increasing the proportion of bypass-coded coefficients through adaptive threshold adjustment, the system improves parallelization capability while maintaining compression efficiency.
Solution Approach 2:
The patent applies bypass coding to HR symbols where parallelization is more feasible, while keeping entropy coding for BR/LR symbols where compression efficiency is more critical. This local differentiation allows the system to exploit parallel processing capabilities in regions where it is most beneficial.
Data Source
AI summary
In various embodiments, a computer-implemented method for coding audiovisual content includes identifying a first coefficient included in a block of coefficients, identifying a first portion of the first coefficient based on a threshold value, identifying a second portion of the first coefficient based on the threshold value, where the first portion of the first coefficient represents a lower value range than the second portion of the first coefficient, performing one or more entropy coding operations on the first portion of the first coefficient to generate a coded version of the first portion of the first coefficient, and performing one or more bypass coding operations on the second portion of the first coefficient to generate a coded version of the second portion of the first coefficient.