Buffer-Based Interleaved Encoding for Low-Complexity Entropy Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data compression technologies, such as H.264/AVC, face challenges in achieving efficient entropy coding while balancing compression efficiency and computational demands, particularly for devices with limited processing power, where CABAC is too computationally demanding.
Innovation Solution
The proposed solution involves using encoding trees with primary and secondary codewords, where the encoder selects an encoding tree based on estimated probabilities and outputs primary or secondary codewords depending on the context, and the decoder uses context models to decode the bitstream, ensuring efficient encoding and decoding processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of substance
If CABAC (Context Adaptive Binary Arithmetic Coding) is used for entropy coding, then compression efficiency is improved, but computational complexity increases significantly
Solution Approach 1:
The encoding process is segmented into multiple independent parallel encoders, each handling a portion of the input data. This allows the system to achieve high compression efficiency through specialized encoding paths while distributing computational load across multiple simpler encoder units rather than requiring one complex sequential processor.
Solution Approach 2:
The system dynamically selects between different encoding modes (bypass mode and encoded mode) for different data segments based on local characteristics. This dynamic adaptation allows the encoder to achieve high compression where needed while using simpler bypass encoding elsewhere, optimizing the balance between compression efficiency and computational complexity.
2Loss of substance
If CABAC is used for entropy coding, then compression efficiency is improved, but processing speed decreases due to higher computational demands
Solution Approach 1:
The input data stream is divided into multiple segments processed by parallel encoder units simultaneously. This segmentation enables the system to maintain high compression efficiency through sophisticated encoding while achieving faster overall processing by eliminating sequential bottlenecks.
Solution Approach 2:
The system performs preliminary classification of data segments to identify which segments require full CABAC encoding and which can use simpler bypass encoding. This preliminary action allows the system to prepare encoding strategies in advance, reducing real-time computational overhead and improving processing speed.
3Loss of substance
If sophisticated entropy coding is used, then compression efficiency is improved, but device resource requirements increase
Solution Approach 1:
The system segments the encoding task across multiple lightweight parallel encoder units rather than using one resource-intensive sequential encoder. This segmentation allows sophisticated compression to be achieved while distributing resource consumption across multiple low-power units, suitable for mobile and embedded devices.
Solution Approach 2:
Different encoding strategies are applied to different data segments based on local characteristics. High-compression CABAC encoding is applied only where necessary, while simpler bypass encoding is used elsewhere. This local quality approach optimizes compression efficiency while minimizing overall device resource consumption.
Data Source
AI summary
A method for encoding an input sequence of symbols. The method includes, sequentially, for each symbol in the input sequence, determining an estimated probability for that symbol based on a context model, identifying a codeword associated with a sequence of symbols resulting from appending that symbol to a previous sequence of symbols associated with that estimated probability, using an encoding tree associated with that estimated probability, and storing the codeword in a buffer element of a first-in-first-out buffer, wherein the buffer element is associated with the estimated probability. Stored codewords are output from the buffer in a first-in-first-out order.