Escape Code Structure for Lower-Complexity Data Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video data compression and decompression systems face inefficiencies in entropy encoding, particularly with the CABAC technique, which results in suboptimal bit usage and increased decoding complexity due to excessive escape code lengths.
Innovation Solution
A data decoding apparatus is developed with a decoder that encodes input data values using a prefix portion and a non-unary coded suffix portion, where the suffix length is dependent on the value encoded by the prefix portion, ensuring that for certain values, the suffix length exceeds the prefix length, and the prefix length is capped at a maximum value based on the bit depth of the data values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If CABAC technique is used for entropy encoding, then encoding flexibility is improved, but decoding complexity increases due to excessive escape code lengths
Solution Approach 1:
The escape code is segmented into two distinct parts: a prefix portion and a suffix portion. The prefix portion has its length capped at a maximum value, while the suffix portion contains the remaining encoded information. This segmentation allows the decoder to process the bounded prefix portion with limited complexity while handling the variable-length suffix portion separately, thereby reducing overall decoding complexity while preserving encoding flexibility.
2Adaptability or versatility
If escape code length is increased to represent more values, then data representation capability is improved, but decoding burden increases
Solution Approach 1:
The escape code structure employs dynamic length allocation where the prefix portion has a capped maximum length but the suffix portion's length varies based on the encoded value requirements. This dynamic structure allows the code to adapt to different data representation needs while the capped prefix portion ensures that the decoding burden remains bounded and manageable.
3Device complexity
If prefix length is capped at maximum value, then decoding complexity is reduced, but encoding efficiency may be compromised
Solution Approach 1:
The solution moves from a single-dimensional escape code structure to a two-dimensional structure with prefix and suffix portions. The prefix portion operates in one dimension with capped length to reduce decoding complexity, while the suffix portion extends in another dimension to preserve encoding efficiency. This dimensional separation allows both contradictory requirements to be satisfied simultaneously.
Data Source
AI summary
A data encoding method includes encoding an array of data values as data sets and escape codes for values not encoded by the data sets, an escape code including a prefix portion and a non-unary coded suffix portion having a length, in bits, dependent upon a value encoded by the prefix portion according to a relationship such that, for at least some values encoded by the prefix portion, the length of the non-unary coded suffix portion is greater than the length, in bits, of the prefix portion.