Patent 9054728B2

Prior art

Earlier patents, publications, and products that may anticipate or render the claims unpatentable.

Active provider: Google · gemini-2.5-flash

Prior art

Earlier patents, publications, and products that may anticipate or render the claims unpatentable.

✓ Generated

The most relevant prior art for US patent 9054728B2, as indicated by the patent itself, is US6195024B1. This is derived from the "Priority claimed from US09/210,491" entry on the Google Patents page for US9054728B2, which links to US6195024B1.

Here is an analysis of US6195024B1 as potential prior art:

1. Full Citation:
US6195024B1, "Content dependent data compression and decompression system and method"

2. Publication/Filing Date:

  • Filing Date: May 19, 1999
  • Publication Date: February 27, 2001

3. Brief Description:
US6195024B1 describes a data compression and decompression system that identifies the data type of an input stream and selects a compression method from a preselected set of methods to achieve the best available compression ratio for that particular data type. This system is characterized as a "content dependent high-speed lossless data compression and decompression system/method" in the context of the prior art section of US9054728B2.

4. Potentially Anticipated Claim(s) under 35 U.S.C. § 102:
The US9054728B2 patent (the present invention) distinguishes itself by providing systems and methods for data compression and decompression using both content-independent and content-dependent data compression and decompression. The prior art (US6195024B1, as described in FIG. 1 of US9054728B2) focuses solely on content-dependent compression.

Specifically, the following elements, when considered in isolation from the content-independent aspects or the intelligent switching/fallback logic of US9054728B2, could potentially be anticipated by US6195024B1:

  • The core steps of content-dependent data compression:
    • Identifying the data type of an input data block.
    • Selecting one or more encoders associated with the identified data type.
    • Encoding the data block with the selected encoders.
    • Determining a compression ratio obtained for each of the selected encoders.
    • Selecting the encoded data block having the highest compression ratio for output, with the intention of achieving the best available compression ratio for that particular data type.

While US9054728B2's description of content-dependent compression includes specific steps such as "comparing each of the determined compression ratios with a second compression threshold" and "appending a null compression descriptor... if all of the encoder compression do not meet the second compression threshold," the fundamental concept of identifying data type, applying suitable encoders, and selecting the most effective compression for that type, as described within the "content dependent compression" method of US9054728B2, is strongly implied as being present in the prior art of US6195024B1. For example, a hypothetical claim from US9054728B2 stating: "A method for compressing data, comprising: selecting one or more encoders associated with an identified data type; encoding a data block with the selected encoders to provide a plurality of encoded data blocks; determining a compression ratio obtained for each of the selected encoders; and selecting for output the encoded data block having the highest compression ratio" would likely be anticipated.

The novelty of US9054728B2, in relation to US6195024B1, largely resides in the introduction of content-independent compression, the dynamic decision-making between content-dependent and content-independent approaches (e.g., when content is unrecognized or content-dependent compression is inefficient), and the use of additional metrics like "encoder desirability factors" and "figures of merit" (as described in later embodiments of US9054728B2).

Citations:
US6195024B1, "Content dependent data compression and decompression system and method" (https://patents.google.com/patent/[US6195024B1](/patent/US6195024B1)/en, accessed 2026-04-26)

Generated 5/29/2026, 8:59:26 PM