DCT

1:25-cv-01337

Nokia Tech Oy v. Warner Bros Entertainment Inc

Key Events
Complaint
complaint

I. Executive Summary and Procedural Information

  • Parties & Counsel:
  • Case Identification: 1:25-cv-01337, D. Del., 11/01/2025
  • Venue Allegations: Venue is alleged to be proper in the District of Delaware because Defendants are incorporated in Delaware, conduct regular business in the district, and have committed acts of patent infringement within the district by offering services and placing encoded video bitstreams into the stream of commerce over the internet.
  • Core Dispute: Plaintiff alleges that Defendants’ backend video services, including transcoding and encoding for platforms such as Discovery+ and HBO Max, infringe thirteen patents related to video coding technology.
  • Technical Context: The lawsuit concerns foundational video compression and encoding technologies that are critical for efficiently storing and transmitting high-quality video over networks, a cornerstone of the modern video streaming market.
  • Key Procedural History: The complaint notes that prior to filing suit, Plaintiff and Defendants engaged in licensing negotiations beginning on October 31, 2022. A central point of disagreement appears to be whether Plaintiff’s patents covering encoding processes are essential to the H.264 and/or H.265 video standards and therefore subject to Reasonable and Non-Discriminatory (RAND) licensing obligations. Plaintiff has included a count for declaratory judgment that its encoding patent claims are not RAND-encumbered.

Case Timeline

Date Event
2000-01-20 Priority Date for ’891 Patent
2000-05-15 Priority Date for ’005 Patent
2000-08-11 Priority Date for ’145 Patent
2001-09-17 Priority Date for ’469 Patent
2001-09-14 Priority Date for ’701 Patent
2002-01-23 Priority Date for ’321 Patent
2002-03-15 Priority Date for ’808 Patent
2002-04-23 Priority Date for ’148 Patent
2002-06-11 Priority Date for ’674 Patent
2002-11-06 Priority Date for ’744 Patent
2004-03-23 Issue Date for U.S. Patent No. 6,711,211
2005-02-15 Issue Date for U.S. Patent No. 6,856,701
2005-09-27 Issue Date for U.S. Patent No. 6,950,469
2005-11-22 Issue Date for U.S. Patent No. 6,968,005
2007-10-30 Issue Date for U.S. Patent No. 7,289,674
2009-05-12 Issue Date for U.S. Patent No. 7,532,808
2011-08-23 Issue Date for U.S. Patent No. 8,005,145
2011-11-01 Issue Date for U.S. Patent No. 8,050,321
2011-11-04 Priority Date for ’833 Patent
2012-01-31 Issue Date for U.S. Patent No. 8,107,744
2012-05-08 Issue Date for U.S. Patent No. 8,175,148
2011-01-07 Priority Date for ’960 Patent
2017-02-14 Issue Date for U.S. Patent No. 9,571,833
2017-10-24 Issue Date for U.S. Patent No. 9,800,891
2019-12-31 Issue Date for U.S. Patent No. 10,523,960
2022-10-31 Nokia first informed Warner Bros. of its patent portfolio
2023-02-17 Nokia gave Warner Bros. notice of infringement of asserted patents
2025-11-01 Complaint Filing Date

II. Technology and Patent(s)-in-Suit Analysis

U.S. Patent No. 7,532,808 - “Method for Coding Motion in a Video Sequence”

(Issued May 12, 2009; the “’808 Patent”)

The Invention Explained

  • Problem Addressed: Prior to the ’808 Patent, a common video compression technique known as "SKIP" mode was inefficient at handling certain types of motion, such as global or regional motion that occurs during camera pans or zooms Compl. ¶ 56 Addressing this with prior techniques was computationally intensive and inefficient Compl. ¶ 56 ’808 Patent, col. 12:48-13:30
  • The Patented Solution: The invention is an improved skip coding mode that can adapt to motion in the surrounding region of a video frame. The encoder analyzes the motion of neighboring image segments (“macroblocks”) to determine whether the current macroblock being coded should be associated with a zero motion vector (for stationary scenes) or a non-zero motion vector that represents the surrounding global or regional motion Compl. ¶ 57 This allows the encoder to efficiently represent motion without needing to encode and transmit additional motion data for the skipped block Compl. ¶¶ 57-58 ’808 Patent, col. 14:23-32
  • Technical Importance: This approach improves coding efficiency by allowing the "SKIP" mode to handle a wider range of motion types, which in turn reduces the amount of information needed to encode video sequences with global or regional motion Compl. ¶ 60

Key Claims at a Glance

  • The complaint indicates an intent to assert at least claim 1 of the ’808 Patent Compl. ¶ 192
  • Claim 1 of the ’808 Patent includes the following essential elements:
    • Assigning a skip coding mode to a segment of an image.
    • Analyzing motion of at least one other image segment in a region surrounding the segment to be coded.
    • Associating a zero motion vector with the skip coding mode if the analysis indicates an insignificant level of motion.
    • Associating a non-zero motion vector with the skip coding mode if the analysis indicates a certain type of motion.
    • Forming a prediction for the image segment with the associated motion vector.
  • The complaint does not explicitly reserve the right to assert dependent claims.

U.S. Patent No. 6,950,469 - “Method for Sub-Pixel Value Interpolation”

(Issued September 27, 2005; the “’469 Patent”)

The Invention Explained

  • Problem Addressed: In video compression, motion is often measured at a "sub-pixel" resolution to be more accurate. This requires creating, or "interpolating," pixel values that lie between the actual pixels of a reference image. Prior methods for sub-pixel interpolation struggled to balance prediction accuracy with computational complexity and memory usage, often requiring unnecessary calculations and storage of intermediate values, which could also reduce precision Compl. ¶¶ 66-67 ’469 Patent, col. 11:15-21
  • The Patented Solution: The patent describes a more flexible method for sub-pixel interpolation that provides a "choice of which pixels and sub-pixels to use in the interpolation of other sub-pixels" Compl. ¶ 68 ’469 Patent, col. 38:47-51 For example, it allows for interpolating certain quarter-resolution sub-pixels directly from diagonally located pixels or sub-pixels, reducing the dependency on previously interpolated values Compl. ¶ 68 This approach reduces the number of required calculations, increases precision by avoiding intermediate steps that cause data truncation, and allows for the selective use of lower-precision arithmetic to further decrease complexity Compl. ¶¶ 68-69
  • Technical Importance: The patented solution provided a technological improvement that increased the efficiency of video coding while reducing its computational complexity and memory requirements Compl. ¶ 70

Key Claims at a Glance

  • The complaint indicates an intent to assert at least claim 1 of the ’469 Patent Compl. ¶ 198
  • Claim 1 of the ’469 Patent includes the following essential elements:
    • A method for interpolation in video coding where an image with pixels at unit horizontal and vertical locations is interpolated to generate sub-pixel values.
    • When values for sub-pixels at certain fractional locations are required, interpolating them using a choice of either a first weighted sum of values or a second weighted sum of values, where the first sum is based on sub-pixels at horizontal fractional locations and the second is based on sub-pixels at vertical fractional locations.
    • When a value for a different fractional sub-pixel is required, interpolating it by taking a weighted average of two other sub-pixels or pixels located diagonally with respect to it.
  • The complaint does not explicitly reserve the right to assert dependent claims.

U.S. Patent No. 8,175,148 - “Method and Device for Indicating Quantizer Parameters in a Video Coding System”

(Issued May 8, 2012; the “’148 Patent”)

Technology Synopsis

The patent addresses the problem that transmitting quantization parameter (QP) values for each part of a video stream consumes significant bandwidth Compl. ¶ 79 The solution is to use a default or reference QP level that can be applied to multiple pictures, which only needs to be transmitted once for a sequence of frames, thereby reducing the transmission bit-rate Compl. ¶ 80

Asserted Claims

Claim 1 is asserted Compl. ¶ 204

Accused Features

The accused backend encoding services are alleged to use the patented method of defining and indicating a default quantization level to reduce bandwidth (Compl. ¶¶ 83, 201).

U.S. Patent No. 8,050,321 - “Grouping of Image Frames in Video Coding”

(Issued November 1, 2011; the “’321 Patent”)

Technology Synopsis

The patent addresses a problem in video streaming where starting playback from the middle of a video could cause decoders to misinterpret the stream and attempt to reconstruct lost frames unnecessarily Compl. ¶ 90 The invention provides for encoding an indication of the first picture in an independently decodable group of pictures, allowing a decoder to begin decoding from a random point in a video stream without prediction from prior pictures, which increases resiliency and improves playback Compl. ¶¶ 91-92

Asserted Claims

Claim 1 is asserted Compl. ¶ 210

Accused Features

The accused backend encoding services are alleged to use the patented method for grouping image frames to enable resilient video streaming (Compl. ¶¶ 94, 207).

U.S. Patent No. 7,289,674 - “Spatial Prediction Based Intra Coding”

(Issued October 30, 2007; the “’674 Patent”)

Technology Synopsis

The patent addresses the high memory and bitrate requirements of prior art methods for "intra-mode" block prediction, which relied on large tables to determine the prediction mode for a current block based on adjacent blocks Compl. ¶¶ 100-101 The complaint includes a diagram from the patent illustrating the spatial relationship between a current block (C) and its upper (U) and left (L) neighbors Compl. ¶ 99, FIG. 3 The patented solution divides possible prediction modes into two groups—a small group of most probable modes and a second group of remaining modes—which reduces the amount of information that needs to be stored and transmitted, thereby lowering memory requirements Compl. ¶ 102

Asserted Claims

Claim 1 is asserted Compl. ¶ 216

Accused Features

The accused backend encoding services are alleged to use the patented method for spatial prediction to reduce memory and bitrate requirements (Compl. ¶¶ 103, 213).

U.S. Patent No. 6,968,005 - “Video Coding”

(Issued November 22, 2005; the “’005 Patent”)

Technology Synopsis

The patent addresses the problem that prior art bit-streams did not include information to identify "reference pictures," making it impossible for a decoder to detect if a lost picture was critical for decoding future pictures (a reference picture) or could be ignored (a non-reference picture) Compl. ¶ 110 The invention is a sequence indicator with an independent numbering scheme that is incremented each time a reference picture is encoded, allowing a decoder to differentiate between the loss of a reference versus a non-reference picture and take appropriate action Compl. ¶¶ 111, 114

Asserted Claims

Claim 1 is asserted Compl. ¶ 223

Accused Features

The accused backend encoding services are alleged to use the patented sequence indicator method to improve error resiliency in video streaming (Compl. ¶¶ 112, 219).

U.S. Patent No. 6,711,211 - “Method for Encoding and Decoding Video Information”

(Issued March 23, 2004; the “’211 Patent”)

Technology Synopsis

The patent addresses the computational complexity of prior art video coding systems that required exhaustive calculations to evaluate all possible prediction candidates for a block of video Compl. ¶ 121 The invention overcomes this by restricting the number of possible prediction methods per macroblock segmentation, which allows the decoder to infer the prediction method from the segmentation information alone, reducing computational complexity and transmission bandwidth Compl. ¶ 122

Asserted Claims

Claim 1 is asserted Compl. ¶ 229

Accused Features

The accused backend encoding services are alleged to use the patented method of associating prediction methods with macroblock segmentations to improve coding efficiency (Compl. ¶¶ 123, 226).

U.S. Patent No. 8,005,145 - “Method and Apparatus for Transferring Video Frame in Telecommunication System”

(Issued August 23, 2011; the “’145 Patent”)

Technology Synopsis

The patent addresses inefficiencies in motion vector prediction when multiple reference frames are used Compl. ¶ 130 The invention provides a method where, if a block being coded uses a different reference frame than at least one of its neighbors, its motion data is predicted using only the motion data from neighboring blocks that use the same reference frame Compl. ¶ 131 This saves calculation time and capacity Compl. ¶ 133

Asserted Claims

Claim 1 is asserted Compl. ¶ 235

Accused Features

The accused backend encoding services are alleged to use the patented method for motion vector prediction across multiple reference frames (Compl. ¶¶ 132, 232).

U.S. Patent No. 9,800,891 - “Method and Associated Device for Filtering Digital Video Images”

(Issued October 24, 2017; the “’891 Patent”)

Technology Synopsis

The patent addresses "blocking artefacts," which are visible discontinuities between blocks in a compressed video image Compl. ¶ 141 Prior filtering methods to reduce these artefacts were problematic because they tended to remove real features of the image Compl. ¶ 142 The invention is a filtering arrangement that adjusts filtering parameters according to the coding type of the blocks on either side of the boundary, allowing for more targeted filtering that removes artefacts without weakening real image edges Compl. ¶¶ 143-144

Asserted Claims

Claim 23 is asserted Compl. ¶ 241

Accused Features

The accused backend encoding services are alleged to use the patented adaptive filtering method to improve video quality (Compl. ¶¶ 144, 238).

U.S. Patent No. 6,856,701 - “Method and System for Context-Based Adaptive Binary Arithmetic Coding”

(Issued February 15, 2005; the “’701 Patent”)

Technology Synopsis

The patent is directed to improving the efficiency of Context-based Adaptive Binary Arithmetic Coding (CABAC), a type of entropy coding Compl. ¶ 153 The inventors determined that relationships exist between the "run" and "level" values used to represent transform coefficients, which were not exploited by prior CABAC methods Compl. ¶ 154 The invention is a new context model that considers these relationships, such as by assigning a context to a current level value based on the context of a previously coded value, resulting in a reduction in bitrate Compl. ¶¶ 155, 156

Asserted Claims

Claim 1 is asserted Compl. ¶ 247

Accused Features

The accused backend encoding services are alleged to use the patented context modeling to improve coding efficiency (Compl. ¶¶ 156, 244).

U.S. Patent No. 8,107,744 - “Picture Buffering for Prediction References and Display”

(Issued January 31, 2012; the “’744 Patent”)

Technology Synopsis

The patent addresses buffering issues that arose from efforts to decouple the decoding order of pictures from their display order Compl. ¶¶ 164-165 Prior solutions that used two separate buffers—one for reference pictures and one for display reordering—were inefficient Compl. ¶ 166 The invention provides for a unified buffer that handles both functions, with the encoder signaling the number of pictures that need to be buffered to recover the output order, thus minimizing memory usage Compl. ¶ 167

Asserted Claims

Claim 12 is asserted Compl. ¶ 253

Accused Features

The accused backend encoding services are alleged to use the patented unified buffering method to reduce memory requirements (Compl. ¶¶ 168, 250).

U.S. Patent No. 9,571,833 - “Method for Coding and an Apparatus”

(Issued February 14, 2017; the “’833 Patent”)

Technology Synopsis

The patent addresses the problem of redundant candidates in "merge lists" used for motion vector prediction Compl. ¶ 177 Prior solutions either left redundant candidates in the list or performed exhaustive comparisons. The invention provides a more efficient merge mode that reduces redundancy and complexity by performing a limited set of comparisons to a subset of other candidates in a parallelizable manner Compl. ¶¶ 177-178

Asserted Claims

Claim 1 is asserted Compl. ¶ 258

Accused Features

The accused backend encoding services are alleged to use the patented efficient merge mode for motion vector prediction (Compl. ¶¶ 178, 255).

U.S. Patent No. 10,523,960 - “Motion Prediction in Video Coding”

(Issued December 31, 2019; the “’960 Patent”)

Technology Synopsis

The patent addresses the problem of rounding errors that accumulate during bi-prediction (where a prediction is formed by averaging two other predictions), which degrades coding efficiency Compl. ¶ 183 The invention is a method that maintains prediction signals at a higher precision during calculation and only reduces the precision after the predictions have been combined. This avoids the complexity of prior art solutions that required multiple code paths or explicit signaling of rounding direction Compl. ¶ 184

Asserted Claims

Claim 1 is asserted Compl. ¶ 263

Accused Features

The accused backend encoding services are alleged to use the patented bi-prediction method to reduce complexity and increase efficiency (Compl. ¶¶ 185, 260).

III. The Accused Instrumentality

Product Identification

The accused instrumentalities are backend video services operated by Defendants, including processes for transcoding and encoding video for streaming services such as Discovery+ and HBO Max (Compl. ¶¶ 3-4).

Functionality and Market Context

The complaint alleges that these backend services are used to encode and deliver high-quality video efficiently and effectively to users Compl. ¶ 4 The patented technologies are described as important to Defendants' business, benefiting both ad-supported and subscription offerings Compl. ¶ 4 The complaint frames video as the main form of internet traffic, estimated at 82% of global consumer internet traffic in 2022, underscoring the commercial importance of efficient video coding technology Compl. ¶ 26

IV. Analysis of Infringement Allegations

The complaint states that claim charts for the asserted patents are attached as exhibits (Compl. ¶¶ 192, 198, 204, etc.). As these exhibits were not provided, a summary of the narrative infringement theory is presented in prose.

Plaintiff alleges that Defendants' "Accused Services" directly infringe the asserted patents by using the patented methods in their backend video encoding and transcoding processes in the United States (Compl. ¶¶ 189, 195). For each asserted patent, the complaint alleges that Defendants' use of the claimed methods is a direct infringement, either literally or under the doctrine of equivalents (e.g., Compl. ¶ 189). The infringement allegations are directed at the technical operations of Defendants' video processing systems.

  • Identified Points of Contention:
    • ’808 Patent (Skip Coding Mode): A central question may be one of functional implementation. The complaint alleges the use of an improved skip coding mode where the motion vector is derived from surrounding blocks. A point of contention will likely be whether Defendants’ encoders actually perform this specific analysis for their skip mode, or if they use a different, non-infringing method to handle global or regional motion.
    • ’469 Patent (Sub-Pixel Interpolation): The dispute here may turn on technical equivalence. The asserted claim recites a highly specific, multi-part mathematical process for interpolation, including offering a "choice" of weighted sums. A likely point of contention will be whether the specific mathematical operations and dependencies in Defendants' interpolation algorithms are the same as or equivalent to those recited in the claim.

V. Key Claim Terms for Construction

’808 Patent

The Term

"skip coding mode"

Context and Importance

The patent is not about any "skip" mode, but an improved one that can be associated with a non-zero motion vector derived from surrounding blocks. The construction of this term will be critical to determine if the functionality of Defendants' encoders falls within the specific scope of the invention or aligns with conventional skip modes that the patent sought to improve upon.

Intrinsic Evidence for Interpretation

  • Evidence for a Broader Interpretation: The patent specification describes the invention in the general context of enabling "global or regional motion to [be] taken account of in an efficient manner" ’808 Patent, col. 14:48-51 This language could support a construction that covers various methods of adapting skip modes to regional motion.
  • Evidence for a Narrower Interpretation: The patent teaches that the decision for the motion vector "is made by analyzing the motion of other macroblocks or sub-blocks in a region surrounding the macroblock to be coded" ’808 Patent, col. 14:26-30 This could support a narrower construction requiring a specific analysis of particular neighboring blocks, as opposed to a more general derivation of regional motion.

’469 Patent

The Term

"a choice of a first weighted sum... and a second weighted sum"

Context and Importance

This "choice" is presented as a key unconventional aspect of the invention that provides flexibility and efficiency (Compl. ¶¶ 68, 71). Practitioners may focus on this term because the infringement analysis will likely depend on whether Defendants' system actually implements a selectable choice between different interpolation pathways (e.g., horizontal vs. vertical dependencies) as required by the claim, or if it uses a single, predetermined interpolation method.

Intrinsic Evidence for Interpretation

  • Evidence for a Broader Interpretation: The specification states that the patent "employs the unconventional solution of providing flexibility and a choice of which pixels and sub-pixels to use" ’469 Patent, col. 38:47-51 This could suggest a broader meaning encompassing any system that offers more than one path for interpolation.
  • Evidence for a Narrower Interpretation: Claim 1 recites a specific structure for this choice: "a first weighted sum of values for sub-pixels residing at 1/2N-1 unit horizontal and unit vertical locations and a second weighted sum of values for subpixels residing at unit horizontal and 1/2N-1 unit vertical locations". This specific language may limit the term's scope to systems that implement this exact alternative between horizontally-derived and vertically-derived sub-pixels.

VI. Other Allegations

  • Indirect Infringement: The complaint makes general allegations that Defendants derive revenue "directly and indirectly" from infringing activities Compl. ¶ 190 However, it does not plead specific facts to support claims of induced or contributory infringement, such as instructing others to infringe.
  • Willful Infringement: The complaint alleges that Defendants had knowledge and notice of the asserted patents "no later than February 17, 2023," which is the date of a specific notice letter from Plaintiff (Compl. ¶¶ 43, 188, 194). This allegation of pre-suit knowledge forms the basis for the claim of willful infringement Prayer for Relief, B

VII. Analyst’s Conclusion: Key Questions for the Case

  • A principal legal issue will be one of contractual obligation vs. patent right: does Nokia's commitment to license standard-essential patents on RAND terms extend to these patents covering encoding processes, which Nokia alleges are not "essential" to the H.264/H.265 standards (Compl. ¶¶ 40, 269-270)? The resolution of Plaintiff's declaratory judgment count on this issue may significantly influence the strategic direction and potential damages in the case.
  • A core technical issue will be one of evidentiary proof and functional implementation: can Plaintiff demonstrate, through reverse engineering or discovery of proprietary source code, that Defendants' backend video encoding services perform the highly specific, multi-step methods recited in the asserted claims? The dispute may focus on whether the accused systems operate in a manner that is functionally identical or equivalent to the patented inventions, or if they use alternative, non-infringing techniques to achieve similar efficiencies in video compression.