Coefficient Coding With Reversed Last-Coefficient Position Parsing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face inefficiencies and increased overhead when handling high bit depth, high quality, and high bitrate video content, leading to reduced coding speed and throughput.
Innovation Solution
A method for coefficient coding that involves parsing a bitstream to determine the position of the last significant coefficient, using flags and prefix/suffix information to decode/encode coefficients efficiently, and employing a scanning order to minimize redundant operations, particularly for high bit depth and high bitrate video.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If existing video coding solutions are used for triple-high video (high bit depth, high quality, high bitrate), then the video quality and bit depth are improved, but the overhead increases and coding speed and throughput are reduced
Solution Approach 1:
The patent segments the coefficient coding process by introducing a flag to identify whether the last significant coefficient position needs to be reversed. This segmentation allows the decoder to selectively apply reversal operations only when necessary, rather than processing all coefficients uniformly, thereby reducing unnecessary computational overhead and improving coding speed for triple-high video
Solution Approach 2:
The patent applies coordinate reversal (inversion) of the last significant coefficient position under specific conditions indicated by a flag. By reversing the coordinate calculation method when the flag is set, the patent optimizes the handling of high-bit-depth coefficients, reducing the computational complexity and overhead associated with encoding and decoding large coefficient values in triple-high video
2Manufacturing precision
If existing video coding solutions are used for triple-high video, then the video quality is improved, but the overhead increases
Solution Approach 1:
The patent extracts the reversal operation from the general coefficient coding process by introducing a dedicated flag. This flag indicates whether the last significant coefficient position should be reversed, allowing the system to take out and selectively apply only the necessary operations. This reduces coding overhead by avoiding unnecessary reversal operations while maintaining high video quality for triple-high content
Solution Approach 2:
The patent changes the parameter representation by using a flag-based approach to control coordinate reversal. Instead of always reversing coordinates or using complex data structures, the patent uses a simple binary flag to indicate whether reversal is needed, thereby reducing the information overhead while maintaining the ability to handle high-bit-depth coefficients effectively
3Manufacturing precision
If existing video coding solutions are used for triple-high video, then the video quality is improved, but the throughput is reduced
Solution Approach 1:
The patent performs preliminary action by setting a flag during encoding that indicates whether the last significant coefficient position needs to be reversed. This pre-computed flag allows the decoder to quickly determine whether reversal operations are necessary without performing complex analysis during decoding, thereby improving throughput by reducing the computational burden during the decoding phase while maintaining high video quality
Data Source
AI summary
Embodiments of the present disclosure provide a coefficient coding method and a storage medium. The method includes the following. A bitstream is parsed to obtain a video flag. When the video flag indicates that a video satisfies a preset condition, the bitstream is parsed to obtain a last-significant-coefficient position-reverse flag and coordinate information of a last significant coefficient. When the last-significant-coefficient position-reverse flag indicates that a position of the last significant coefficient is reversed for a current block, the position of the last significant coefficient is determined by calculation with the coordinate information of the last significant coefficient. According to a preset scanning order, all coefficients before the position of the last significant coefficient are decoded to determine coefficients of the current block.


