Inter-Prediction Candidate Index Coding for Faster Video Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing video coding standards, such as HEVC, face challenges in achieving efficient decoding throughput due to the dependency between the construction of inter-prediction candidate lists and the decoding of candidate indices, leading to robustness issues and cycle time overhead, which can hinder real-time decoding.
Innovation Solution
Decoupling the encoding of inter-prediction candidate indices from the construction of inter-prediction candidate lists by using a predetermined maximum size for the lists, allowing independent decoding and modifying lists with native or virtual candidates to achieve efficient decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If inter-prediction candidate lists are constructed dynamically based on actual video content, then coding precision is improved, but decoding complexity and cycle time increase
Solution Approach 1:
The patent applies preliminary action by pre-defining a maximum size for inter-prediction candidate lists before decoding begins. This allows the decoder to allocate fixed buffer spaces and prepare data structures in advance, eliminating the need for dynamic memory allocation and list construction during the decoding process. The candidate list size is predetermined based on video content characteristics, enabling the decoder to simply fill pre-allocated structures rather than constructing them dynamically, thus reducing decoding complexity while maintaining coding precision.
2Measurement precision
If inter-prediction candidate lists are constructed dynamically, then measurement precision is improved, but loss of time increases
Solution Approach 1:
The patent applies preliminary action by pre-defining a maximum size for inter-prediction candidate lists before decoding begins. This allows the decoder to allocate fixed buffer spaces and prepare data structures in advance, eliminating the need for dynamic memory allocation and list construction during the decoding process. The candidate list size is predetermined based on video content characteristics, enabling the decoder to simply fill pre-allocated structures rather than constructing them dynamically, thus reducing decoding complexity while maintaining coding precision.
3Reliability
If candidate index decoding depends on candidate list construction, then reliability is improved, but productivity decreases
Solution Approach 1:
The patent applies preliminary action by pre-defining a maximum size for inter-prediction candidate lists before decoding begins. This allows the decoder to allocate fixed buffer spaces and prepare data structures in advance, eliminating the need for dynamic memory allocation and list construction during the decoding process. The candidate list size is predetermined based on video content characteristics, enabling the decoder to simply fill pre-allocated structures rather than constructing them dynamically, thus reducing decoding complexity while maintaining coding precision.
Solution Approach 2:
The patent applies segmentation by separating the candidate list construction process into two independent stages: (1) pre-allocation of fixed-size buffers based on maximum expected list size, and (2) population of these buffers with actual candidate data during decoding. This segmentation allows the index decoding to proceed independently without waiting for dynamic list construction, as the buffer spaces are already prepared. The decoder can directly map candidate indices to pre-allocated buffer positions, eliminating sequential dependencies and improving decoding throughput while maintaining reliability through fixed-size allocation.
4Ease of operation
If fixed maximum size is used for candidate lists, then ease of operation is improved, but loss of information increases
Solution Approach 1:
The patent applies preliminary action by pre-defining a maximum size for inter-prediction candidate lists before decoding begins. This allows the decoder to allocate fixed buffer spaces and prepare data structures in advance, eliminating the need for dynamic memory allocation and list construction during the decoding process. The candidate list size is predetermined based on video content characteristics, enabling the decoder to simply fill pre-allocated structures rather than constructing them dynamically, thus reducing decoding complexity while maintaining coding precision.
Data Source
AI summary
Methods are provided for inter-prediction candidate index coding independent of the construction of the corresponding inter-prediction candidate list, i.e., a merging candidate list or an advanced motion vector predictor list. A maximum allowed number of inter-prediction candidates for an inter-prediction candidate list is used for encoding the inter-prediction candidate index in an encoded bit stream. The maximum allowed number may be pre-determined or may be selected by the encoder and encoded in the bit stream. A decoder may then decode the index using the maximum allowed number of inter-prediction candidates independent of the construction of the corresponding inter-prediction candidate list.