Invalidity dossier
US 7707214
Added 5/25/2026, 6:00:53 PM
Got a demand letter citing US 7707214?
Paste the full letter into the analyzer. We extract every asserted patent (this one and any others), characterize the asserter, flag validity vulnerabilities, and draft a sample response letter your attorney can adapt.
Generic sample response letter (PDF)
Generates a draft reply letter to a generic infringement claim citing this patent, using the analysis below. For a response tailored to a specific letter you received, use the demand letter analyzer instead. Sample only — not legal advice. Do not send without review by a licensed patent attorney.
Watchlist
Get alerted when this patent moves.
Email-only, free, anonymous. We'll notify you when US 7707214 gets a new lawsuit, a new PTAB proceeding, or a new dossier section. One-click unsubscribe from any alert.
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.
Here's a concise summary of US Patent 7,707,214, along with a plain-language overview of its independent claims:
US Patent 7,707,214 Summary
- Title: Hierarchical update scheme for extremum location with indirect addressing
- Assignee: Integral Wireless Technologies LLC
- Inventor: Donald Martin Monro
- Filing Date: February 21, 2007
- Issue Date: April 27, 2010
- Abstract: A system and method for determining an extreme value of data in various applications including audio, video, and image encoding schemes. The system and method are used to generate a hierarchical data structure by partitioning the data values and then generating a hierarchy using indices of these data values, with the apex containing the index of the extreme value. The system and method allow for changes in the data values in the base level of the hierarchy to result in the ripple through of the indices to the apex in an efficient manner.
Plain-Language Overview of Independent Claims
Claim 1 (Method for generating data): This claim describes a method where a computer processor organizes a large set of data values (the "base level") into a multi-level structure. First, the base data is divided into smaller groups. Then, a "first level" is created, where each entry points to the most extreme value (either the maximum or minimum) found in each of the smaller groups from the base level. A "top level" or "apex" is then created, which points to the single most extreme value across the entire base level. If any data value in the original base level changes, the system efficiently updates only the affected parts of the hierarchical structure, propagating the update to the apex if the change leads to a new overall extreme value.
Claim 13 (System for generating data): This claim outlines a system, including a processor and memory, designed to perform the method of Claim 1. It specifies the components: memory for storing data, and a hierarchical data structure with a base level (partitioned data values), a first level (indices to extreme values of base level partitions), and an apex (an index to the overall extreme base level value). The system is configured to update these levels efficiently when data changes, similar to the method in Claim 1.
Claim 26 (Computer-readable storage medium for data generation): This claim covers a computer-readable storage medium (like a hard drive or flash memory) that holds instructions. When a processor executes these instructions, it performs the data generation method detailed in Claim 1, including partitioning, generating hierarchical levels with extreme indices, and efficiently updating those levels upon data changes.
Claim 37 (Video encoding method): This claim describes a method for encoding video data that uses the hierarchical data structure. It involves providing a base set of video data values, building the multi-level structure (base level, first level, apex) over these values, with the apex holding an index to an extreme video data value. The method then efficiently updates this structure if any base video data value changes, with updates propagating up the hierarchy as needed to reflect new extreme values.
Claim 49 (Video encoding system): This claim describes a video encoding system comprising a processor, memory, and a hierarchical data structure for video data. The structure includes a base level of partitioned video data values, a first level with indices to extreme values from base partitions, and an apex holding an index to the overall extreme video data value. The system is configured to perform the efficient updating process described in Claim 37 when video data values change.
Claim 61 (Computer-readable storage medium for video encoding): This claim pertains to a computer-readable storage medium containing instructions that, when executed by a processor, enable it to carry out the video encoding method described in Claim 37. This includes managing the hierarchical data structure for video data and updating it efficiently when base-level video data changes to find new extreme values.
USPTO and CAFC 2026 Dockets Search:
As of April 26, 2026:
- USPTO Database: US Patent 7,707,214 is listed as "Active" and "expires 2027-11-20".
- CAFC 2026 Dockets: The Google Patents entry for US7707214B2 indicates that there has been litigation filed in the Texas Eastern District Court and Florida Southern District Court, with cases filed in 2025 and 2026. Specifically, there are critical litigations in the Texas Eastern District Court (case 2:26-cv-00198) and other cases in Texas Eastern District Court (2:25-cv-00945, 2:25-cv-00388) and Florida Southern District Court (0:25-cv-62665). There is also a mention of the "First worldwide family litigation filed".
Generated 5/25/2026, 6:03:02 PM