Invalidity dossier

US 9036701

Method and apparatus for providing complexity balanced entropy coding

Current assignee: Nokia Technologies Oy

Added 5/14/2026, 6:00:36 AM

Active provider: Google · gemini-2.5-flash

Auto-generating section 1 of 2: Extensions

Each section takes ~30-60s with web-search grounding. Keep this tab open — sections will fill in below as they complete.

Patent summary

Title, assignee, inventors, filing/issue dates, abstract, and a plain-language overview of the claims.

✓ Generated

US Patent 9036701: Summary and Claim Analysis

Title: Method and apparatus for providing complexity balanced entropy coding

Assignee:

  • Current: Nokia Technologies Oy
  • Original: Nokia Inc

Inventors: Jani Lainema, Kemal Ugur, Antti Olli Hallapuro

Filing Date: July 27, 2011

Issue Date: May 19, 2015

Abstract:
The patent describes a method, apparatus, and computer program product designed for efficient video coding and decoding through complexity-balanced entropy coding. This approach aims to achieve high video coding and decoding capability while minimizing complexity costs. The method involves categorizing video content's syntax elements into two groups based on their frequency of occurrence. Symbols in the first category (less frequent) undergo entropy coding with context updating. In contrast, symbols in the second category (more frequent) bypass context updating during their entropy coding.

Plain-Language Overview of Independent Claims:

  • Independent Claim 1 (Method):
    This claim describes a process for coding video data. It involves setting a threshold for how often specific video data parts (syntax elements) are expected to appear. Based on this threshold, these elements are sorted into two groups: a first category for elements that occur more frequently than the threshold, and a second category for those that occur less frequently. The method then uses two different approaches for compressing these elements (entropy coding): the more frequent elements in the first category are coded with "context updating" (an adaptive method that adjusts based on recent data), while the less frequent elements in the second category are coded without this context updating, simplifying the process.
    (Note: The claim text states "syntax elements which occur greater than the frequency of occurrence threshold are categorized into the first category and syntax elements which occur less than the frequency of occurrence are categorized into the second category". However, the detailed description states, "the first category includes symbols that occur relatively infrequently and the second category includes symbols that occur relatively frequently." And also, "those symbols that are expected to occur more frequently than the threshold frequency may be determined to be in the second category while those symbols that are expected to occur less frequently than the threshold frequency may be determined to be in the first category." For the claim summary, the claim wording is strictly followed, noting this potential inconsistency in categorization definition between the claim and the detailed description.)

  • Independent Claim 8 (Apparatus):
    This claim defines an electronic device (apparatus) equipped with at least one processor and memory containing computer program code. This apparatus is designed to perform the method described in Claim 1. Specifically, it determines a frequency threshold for video syntax elements, categorizes these elements into two groups based on that threshold (more frequent elements into the first category, less frequent into the second), and then entropy codes them differently: with context updates for the first category and bypassing context updates for the second category.

  • Independent Claim 15 (Computer Program Product):
    This claim covers a non-transitory computer-readable storage medium (like a hard drive or flash memory) that stores computer instructions. When a computer runs these instructions, it performs the method outlined in Claim 1. This includes determining a frequency threshold for video syntax elements, categorizing them into two groups (more frequent elements into the first category, less frequent into the second), and then applying entropy coding with context updates for the first category and without context updates for the second category.

Litigation and Legal Status:
As of April 26, 2026, US Patent 9036701 is Active and is set to expire on April 28, 2032.

The patent family is currently involved in litigation, with multiple cases filed:

  • US case filed in Texas Western District Court.
  • US case filed in the International Trade Commission (Case 337-TA-1448).
  • A PTAB case, IPR2025-01345, was filed (marked as Settlement).
  • Another US case filed in the International Trade Commission (Case 337-TA-3821).
  • First worldwide family litigation has been filed.
  • US case filed in California Central District Court (Case 2:25-cv-03053).
  • US case filed in Georgia Northern District Court (Case 1:25-cv-01871).

A search for "US9036701 CAFC 2026 dockets" and "CAFC docket 9036701" did not return any specific docket entries for the Federal Circuit (CAFC) in 2026 directly related to US9036701 at this time. While an Inter Partes Review (IPR2025-01345) was filed in 2025, which could lead to a CAFC appeal in 2026, no such appeal is explicitly listed in the provided information or found in the targeted search.

Generated 5/22/2026, 12:45:41 PM