Method and apparatus for providing complexity balanced entropy coding

Patent No. US9036701 (titled "Method and apparatus for providing complexity balanced entropy coding") on Jul 27, 2011. The application was issued on May 19, 2015.

What is this patent about?

’701 is related to the field of video coding and decoding, specifically addressing the computational bottlenecks associated with entropy coding in high-bitrate environments. In modern video standards like H.264/AVC, advanced entropy coding techniques provide high compression efficiency but demand significant processing power, which can drain battery life and overwhelm the hardware of mobile devices. The invention seeks to balance this trade-off by optimizing how different types of data within a video stream are processed.

The underlying idea behind ’701 is that not all video data requires the same level of complex processing to achieve efficient compression. By identifying which data elements appear most frequently—such as residual transform coefficients—the system can apply a simplified coding path for the high-volume data while reserving computationally intensive context adaptive updates for less frequent elements. This selective approach prevents the processing load from scaling linearly with the bitrate, effectively capping the complexity without sacrificing overall performance.

The claims of ’701 focus on a method and apparatus that categorize syntax elements into two distinct groups based on a frequency of occurrence threshold. The first category consists of elements that appear relatively infrequently and are processed using entropy coding that includes a context update stage to maximize efficiency. The second category includes high-frequency elements that bypass the context update stage entirely, instead using a simplified entropy coding process with fixed or targeted probabilities.

In practice, the invention works by binarizing high-frequency symbols, such as DCT coefficients, to target a fifty-percent probability for each bin. By treating these bins as having equal likelihood, the encoder can utilize a bypass coding mode within an arithmetic coding engine, skipping the most taxing part of the process: the constant recalculation of probability models. This ensures that even as the video quality and bitrate increase, the number of complex context updates remains manageable for the hardware.

This approach differs from prior solutions by moving away from a rigid, profile-based choice between low-complexity and high-efficiency coding. Instead of forcing a device to choose between a simple but inefficient coder and a powerful but demanding one, ’701 implements a unified entropy coding design. By signaling the categorization at the slice or picture level, the invention allows a single codec to dynamically adapt its workload, maintaining a complexity-balanced output that is optimized for the specific constraints of mobile hardware.

How does this patent fit in bigger picture?

Technical Landscape

In the early 2010s when ’701 was filed, video compression and decompression were typically implemented using entropy coding techniques that required significant computational overhead to achieve high compression efficiency. At a time when mobile electronic devices commonly relied on hardware with limited processing cycles and restricted battery capacities, the high throughput requirements of real-time video decoding made the implementation of complex arithmetic coding non-trivial. Systems of this era often faced a direct trade-off between coding efficiency and the power consumption required to process bitstreams, particularly as resolutions increased while hardware resources remained constrained.

Prosecution Position

The disclosed invention represents a technical advancement through the implementation of complexity-balanced entropy coding that optimizes the relationship between processing load and compression performance. By utilizing an architectural shift that selectively manages coding complexity, the system enables high-capability video rendering while reducing the computational burden on the underlying hardware. This integration allows for the maintenance of high-quality media delivery under strict power and resource constraints, overcoming the technical limitation of excessive battery drain and processor saturation during the decoding of high-bitrate content.

Claims

The patent contains a total of 20 claims, with claims 1, 8, and 15 serving as the independent claims. These independent claims focus on a method, apparatus, and computer program product for video entropy coding that involves establishing a frequency threshold to categorize syntax elements into two groups, where high-frequency elements undergo context updates while low-frequency elements bypass the context updating process. The dependent claims serve to provide additional technical specificity regarding binarization techniques, the signaling of categorization data at various video levels, and the use of predefined thresholds for sorting syntax elements.

Key Claim Terms New

Definitions of key terms used in the patent claims.

Term (Source)Support for SpecificationInterpretation
Bypassed context updating
(Claim 1, Claim 8, Claim 15)
Symbols that correspond to the second category of syntax elements may bypass context updating. Bypassing context updating may involve entropy coding symbols without updating a context or probability model, which may reduce the complexity and processing resources required for entropy coding.A simplified entropy coding mode where symbols are processed using fixed probability models or a bypass engine, skipping the adaptive modification of context models to reduce computational complexity.
Context update
(Claim 1, Claim 8, Claim 15)
Context updating may involve updating a context or probability model associated with a particular syntax element or symbol. This process may be relatively complex and may require significant processing resources.An adaptive process in entropy coding where the probability models (contexts) used for encoding or decoding symbols are modified based on the actual statistics of previously processed data.
Entropy coding symbols
(Claim 1, Claim 8, Claim 15)
Entropy coding may involve encoding or decoding symbols using an entropy coder, such as a context-adaptive binary arithmetic coder (CABAC). The entropy coding may be performed differently for different categories of syntax elements to balance complexity.The process of converting syntax elements into a compressed binary representation (symbols) using statistical properties to achieve data compression.
Frequency of occurrence threshold
(Claim 1, Claim 8, Claim 15)
The frequency of occurrence threshold may be used to categorize syntax elements into a first category and a second category. Syntax elements that occur more frequently than the frequency of occurrence threshold may be categorized into the first category, while syntax elements that occur less frequently than the frequency of occurrence threshold may be categorized into the second category.A quantitative limit or value used to partition syntax elements into different processing groups based on how often they are expected to appear within a video bit stream.
Syntax elements
(Claim 1, Claim 8, Claim 15)
Syntax elements may include any of various types of data that may be included in a bit stream, such as transform coefficients, motion vector differences, and/or the like. The syntax elements may be categorized based on their expected frequency of occurrence in the bit stream.Data elements in a video bit stream that represent specific parameters or structural information of the video content, such as motion vectors, coefficients, or headers.

Litigation Cases New

US Latest litigation cases involving this patent.

Case NumberFiling DateTitle
1:25-cv-00523Apr 7, 2025Nokia Technologies Oy V. Acer Inc.

Patent Family

Patent Family

File Wrapper

The dossier documents provide a comprehensive record of the patent's prosecution history - including filings, correspondence, and decisions made by patent offices - and are crucial for understanding the patent's legal journey and any challenges it may have faced during examination.

  • Get instant alerts for new documents

US9036701

SEP
Application Number
US13192111A
Filing Date
Jul 27, 2011
Status
Granted
Publication Date
May 19, 2015
External Links
Slate, USPTO , Google Patents