Parallel Entropy Coding with Uniform Substreams and Low Buffering

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing video coding technologies face challenges in achieving efficient bitrate reduction without sacrificing picture quality, particularly in the encoding and decoding processes, especially with the increasing demands for higher video quality and limited network resources.

Innovation Solution

The method involves multiplexing and encoding data from multiple channels into separate substreams of equal size, allowing for parallel entropy encoding and decoding, with length indications and trailing bits signaling to facilitate efficient extraction and decoding without buffering, and aligning bitstreams for further processing.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If sequential entropy encoding of multiple channels is performed, then encoding completeness is ensured, but encoding speed is reduced

Engineering Contradiction:
Improveencoding speedVSAvoidbuffering requirement
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent divides the entropy encoding process into multiple independent substreams, each handling a portion of the input channels. By segmenting the encoding task, multiple substreams can be encoded in parallel, significantly improving encoding throughput without requiring complex inter-substream dependencies

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces length indication fields that are generated in advance during the encoding process. These length indications allow the decoder to pre-allocate buffers and prepare for parallel decoding operations before the actual data arrives, enabling faster processing without sacrificing decoding accuracy

Inventive Principle:
Principle #10Preliminary action

2Productivity

If parallel entropy encoding is implemented, then encoding speed is improved, but control over substream lengths becomes difficult

Engineering Contradiction:
Improveencoding speedVSAvoidsubstream length uniformity
Core Design Contradiction:
ProductivityVSManufacturing precision

Solution Approach 1:

The patent employs dynamic length indication fields that are adjusted based on the actual content of each substream. These dynamic length indicators allow each parallel substream to have its own optimized length, accommodating varying data characteristics while maintaining overall system efficiency and enabling precise control over substream dimensions

Inventive Principle:
Principle #15Dynamics

3Reliability

If buffering is used for decoding, then decoding accuracy is maintained, but decoding latency increases

Engineering Contradiction:
Improvedecoding accuracyVSAvoiddecoding latency
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent generates length indication fields during the encoding phase, allowing the decoder to know the exact size of incoming data before processing begins. This preliminary information enables the decoder to allocate precise buffer sizes and start processing immediately without waiting for complete data arrival or performing excessive buffering, thereby reducing latency while maintaining accuracy

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

Each substream is designed to be independently decodable with its own length indication, allowing the decoding process to serve itself without requiring centralized buffer management or coordination between substreams. This self-service approach eliminates the need for large centralized buffers and reduces decoding latency

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS12542566B2Parallel entropy coding
Publication Date: 2026.02.03 HUAWEI TECH CO LTD
  • US12542566B2 patent drawing
  • US12542566B2 patent drawing
  • US12542566B2 patent drawing

AI summary

Methods and apparatuses are described to encoded data into a bitstream and to decode data from a bitstream. The method is able to perform parallel encoding and decoding efficiently and avoids padding of substreams thus reducing the amount of bits within the bitstream. Portions of input data channels are multiplexed and encoded into substreams. During the multiplexing shuffling methods are applied in order to obtain substreams of more uniform lengths. The amount of bits within the substream may be further reduced by including only the relevant significant bits within the trailing bits of the encoding process.