US 9054728B2

US Patent 9054728B2, titled "Data compression systems and methods," was issued to Realtime Data LLC. The inventor is James J. Fallon. The filing date for this patent was September 24, 2014, and it was issued on June 9, 2015. [cite: The patent text itself provides this information under "Filing date" and "Publication date" for US9054728B2, which for a granted patent is the issue date]

The abstract of the patent states that it describes systems and methods for data compression and decompression using both content-independent and content-dependent data compression. [cite: The patent text itself provides this information under "Abstract"]

Here is a plain-language overview of each independent claim:

Independent Claim 1:
This claim describes a method for compressing data that starts by receiving a data block. The system then analyzes this data block to identify a characteristic such as its data type, structure, or format.

• If a characteristic is recognized, the system performs "content dependent" compression using a first set of encoders, generating several first encoded data blocks.
• If no characteristic is recognized, it performs "content independent" compression using a second set of encoders, generating several second encoded data blocks.
  The method then determines the compression ratio for all generated encoded data blocks (both first and second sets). Finally, it selects the encoded data block with the best compression ratio and outputs it along with a descriptor indicating the type of compression used.

Independent Claim 13:
This claim describes a data compression system designed to perform the method outlined in Claim 1. It includes:

• An input buffer to receive and store a data block.
• A data recognition module that analyzes the data block for characteristics like data type or format and generates a recognition signal.
• A first encoder module (content-dependent) with a first set of encoders, which is activated if a characteristic is recognized.
• A second encoder module (content-independent) with a second set of encoders, which is activated if no characteristic is recognized.
• A compression ratio module that calculates the compression ratio for the output of both encoder modules.
• A selection module that chooses the encoded data block with the highest compression ratio.
• A description module that appends a compression type descriptor to the selected encoded data block.

Independent Claim 14:
Claim 14 is similar to Claim 1, detailing a method for data compression. The key difference is that instead of the "recognition signal" determining whether to use content-dependent or content-independent compression directly, it focuses on analyzing the data block to estimate the desirability of using one or more encoder types based on the data block's characteristics.

• It performs content-dependent compression if content characteristics are recognized and desirable encoders are estimated.
• It performs content-independent compression if no content characteristics are recognized or if content-independent encoders are estimated to be more desirable.
• Similar to Claim 1, it determines compression ratios, selects the best encoded block, and outputs it with a descriptor.

Independent Claim 22:
Claim 22 describes a data compression system corresponding to the method of Claim 14. It includes:

• An input buffer for receiving a data block.
• A data recognition module that analyzes the data block and estimates the desirability of different encoder types.
• A content-dependent encoder module with a first set of encoders, activated based on recognized content and estimated desirability.
• A content-independent encoder module with a second set of encoders, activated based on unrecognized content or estimated desirability.
• A compression ratio module to determine compression ratios.
• A selection module to choose the optimal encoded data block.
• A description module to append the compression type descriptor.

Independent Claim 23:
This claim outlines a method for compressing data that involves:

• Receiving a data block.
• Encoding the data block with multiple encoders to create several encoded data blocks.
• For each encoded data block, calculating a "figure of merit," which is a weighted average of its compression ratio and a user-selected "encoder desirability factor."
• Selecting the encoded data block with the highest figure of merit.
• Outputting the selected encoded data block with a compression type descriptor.

Independent Claim 24:
This claim describes a system for compressing data based on the method of Claim 23. It includes:

• An input buffer.
• An encoder module with multiple encoders.
• A buffer/counter module for the encoded data blocks.
• A compression ratio module.
• A desirability factor module that assigns user-selected desirability factors to encoders.
• A figure of merit module that calculates the figure of merit for each encoded data block.
• A selection module to choose the encoded data block with the highest figure of merit.
• A description module to append the compression type descriptor.

Independent Claim 25:
Claim 25 details another method for compressing data. This method focuses on ensuring real-time or pseudo real-time output by incorporating a timer.

• It receives a data block and initializes an interval timer.
• It then compresses the data block using multiple encoders.
• If the timer expires before all encoders complete their process, only the results from the completed encoders are considered.
• It calculates the compression ratio for the completed encoded data blocks.
• It selects the best-compressed data block (or the original if no compression meets a threshold) and outputs it with a descriptor.

Independent Claim 26:
Claim 26 describes a data compression system for the method of Claim 25, incorporating a timer. It includes:

• An input buffer.
• An encoder module with multiple encoders.
• An interval timer to limit processing time.
• A buffer/counter module for encoded data blocks that completed processing before the timer expired.
• A compression ratio module.
• A selection module to pick the optimal encoded data block.
• A description module to add the compression type descriptor.

Independent Claim 27:
This claim describes a method for compressing data using serially cascaded encoders and an interval timer.

• It receives a data block and initializes an interval timer.
• The data block is applied to multiple sets of serially cascaded encoders (meaning the output of one encoder becomes the input for the next in a sequence).
• The process continues through stages until the timer expires or all stages are complete.
• If the timer expires, the buffered output from the last completed encoder stage in each path is considered.
• It calculates a figure of merit for each output (based on compression ratio and desirability factor).
• The encoded data block with the highest figure of merit is selected and output with a descriptor that indicates the encoding path (single, sequential, or random types).

Independent Claim 28:
Claim 28 describes a system that implements the method of Claim 27. It comprises:

• An input buffer.
• A cascaded encoder module with multiple sets of serially cascaded encoders.
• An interval timer.
• An output buffer module for the encoded data blocks.
• A compression ratio module.
• A desirability factor module.
• A figure of merit module.
• A selection module to choose the encoded data block with the highest figure of merit.
• A description module to append the compression type descriptor.

Regarding CAFC 2026 dockets for US9054728B2, no specific entries for patent number 9054728B2 were found in a direct search of "CAFC 2026 dockets 9054728B2". However, the Google Patents page for US9054728B2 indicates a history of litigation, including several cases filed in the Court of Appeals for the Federal Circuit, with case numbers such as 19-2202, 18-2200, 18-2201, 19-2198, 19-2201, 19-2204, 21-2251, 21-2291, and 23-1232. [cite: The patent text itself provides this information under the "Family has litigation" section of US9054728B2] These cases span from 2018 to 2023. No cases specifically in 2026 were directly identified through the search. The USPTO provides tools for searching patents and patent applications but does not directly host court dockets.