Video Residual Decoding Neighbor Storage Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional video decoders require a large neighbor storage device for residual decoding, leading to high hardware costs and inefficient use of resources.
Innovation Solution
A video residual decoding apparatus with a neighbor storage device that stores neighbor data for context selection, utilizing a diagonal scan order and configuring the storage size to be smaller than the maximum data amount from residual decoding results of N sub-blocks, where N is a positive integer smaller than the total number of sub-blocks, allowing for efficient data buffering without the need for a large storage size.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a conventional neighbor storage device with large size is implemented to buffer neighbor data from all coefficients, then complete neighbor data buffering is achieved, but hardware cost and device complexity increase significantly
Solution Approach 1:
The transform block is divided into multiple sub-blocks, and the neighbor storage device is configured to store neighbor data only for a limited number of sub-blocks (N sub-blocks) rather than all sub-blocks. This segmentation approach reduces the storage size while maintaining sufficient neighbor data for context selection in the most critical regions.
Solution Approach 2:
The patent applies different storage strategies to different regions of the transform block. By storing neighbor data for only N sub-blocks (where N < M) rather than uniformly across all sub-blocks, the system allocates storage resources to the most important local regions, achieving effective context selection with reduced hardware cost.
2Measurement precision
If a large neighbor storage device is used to store neighbor data for all sub-blocks, then decoding accuracy is maintained, but storage space requirements increase
Solution Approach 1:
The patent implements partial action by storing neighbor data for only N sub-blocks (where N < M) rather than all M sub-blocks. This partial storage approach maintains sufficient decoding accuracy for the most critical sub-blocks while avoiding the excessive storage requirements of buffering all neighbor data.
Solution Approach 2:
The patent changes the storage parameter from buffering all neighbor data (M sub-blocks) to buffering only a subset (N sub-blocks, where N < M). This parameter change reduces the storage volume while maintaining acceptable decoding accuracy by focusing on the most important sub-blocks for context selection.
Data Source
AI summary
A video residual decoding apparatus includes a residual decoding circuit and a neighbor storage device. The residual decoding circuit applies residual decoding to a transform block, wherein the transform block is divided into M sub-blocks, M is a positive integer, and the M sub-blocks are processed by the residual decoding in a diagonal scan order. The neighbor storage device stores neighbor data that belong to neighboring sub-blocks and are referenced by the residual decoding of a current sub-block, wherein neighbor data belonging to a sub-block is derived from a residual decoding result of the sub-block, and a storage size of the neighbor storage device is not larger than a maximum data amount of neighbor data derived from residual decoding results of N sub-blocks, where N is a positive integer, and N is smaller than M.