Data compression systems and methods
CAFCFirst Claim
1. A method of compressing a plurality of data blocks, comprising:
- analyzing the plurality of data blocks to recognize when an appropriate content independent compression algorithm is to be applied to the plurality of data blocks;
applying the appropriate content independent data compression algorithm to a portion of the plurality of data blocks to provide a compressed data portion;
analyzing a data block from another portion of the plurality of data blocks for recognition of any characteristic, attribute, or parameter that is indicative of an appropriate content dependent algorithm to apply to the data block; and
applying the appropriate content dependent data compression algorithm to the data block to provide a compressed data block when the characteristic, attribute, or parameter is identified,wherein the analyzing the plurality of data blocks to recognize when the appropriate content independent compression algorithm is to be applied excludes analyzing based only on a descriptor indicative of the any characteristic, attribute, or parameter, andwherein the analyzing the data block to recognize the any characteristic, attribute, or parameter excludes analyzing based only on the descriptor.
1 Assignment
Litigations
4 Petitions

Accused Products

Abstract
Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified.
601 Citations
Multiple Technique Entropy Coding System and Method | ||
Patent #
US 20110234431A1
Filed 06/07/2011
|
Current Assignee
Straight Path IP Group Inc.
|
Original Assignee
Droplet Technology Incorporated
|
TESTING METHOD FOR SEMICONDUCTOR INTEGRATED ELECTRONIC DEVICES AND CORRESPONDING TEST ARCHITECTURE | ||
Patent #
US 20120081137A1
Filed 10/04/2011
|
Current Assignee
STMicroelectronics SRL
|
Original Assignee
Stmicroelectronics SAS, STMicroelectronics SRL
|
COMMUNICATION TERMINAL, COMMUNICATION SYSTEM AND COMMUNICATION METHOD | ||
Patent #
US 20120320744A1
Filed 02/07/2011
|
Current Assignee
Lenovo Innovation Company Limited Hong Kong
|
Original Assignee
NEC Corporation
|
Testing method for semiconductor integrated electronic devices and corresponding test architecture | ||
Patent #
US 8,829,931 B2
Filed 10/04/2011
|
Current Assignee
STMicroelectronics SRL
|
Original Assignee
Stmicroelectronics SAS, STMicroelectronics SRL
|
Multiple technique entropy coding system and method | ||
Patent #
US 8,947,271 B2
Filed 06/07/2011
|
Current Assignee
Straight Path IP Group Inc.
|
Original Assignee
Soryn Technologies LLC
|
Data compression systems and methods | ||
Patent #
US 9,054,728 B2
Filed 09/24/2014
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 9,116,908 B2
Filed 06/12/2014
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and method for data feed acceleration and encryption | ||
Patent #
US 9,143,546 B2
Filed 10/03/2001
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data feed acceleration | ||
Patent #
US 9,141,992 B2
Filed 02/23/2012
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Communication terminal, communication system and communication method | ||
Patent #
US 9,313,728 B2
Filed 02/07/2011
|
Current Assignee
Lenovo Innovation Company Limited Hong Kong
|
Original Assignee
Lenovo Innovation Company Limited Hong Kong
|
Data deduplication with adaptive erasure code redundancy | ||
Patent #
US 9,503,127 B2
Filed 07/09/2014
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Sequential access storage and data de-duplication | ||
Patent #
US 9,569,134 B2
Filed 08/23/2010
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Data feed acceleration | ||
Patent #
US 9,667,751 B2
Filed 09/14/2015
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data deduplication with adaptive erasure code redundancy | ||
Patent #
US 9,692,452 B2
Filed 08/03/2016
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
System and methods for video and audio data distribution | ||
Patent #
US 9,762,907 B2
Filed 06/08/2015
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Adaptive Streaming LLC
|
Video data compression systems | ||
Patent #
US 9,769,477 B2
Filed 10/06/2015
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Adaptive Streaming LLC
|
System and method for electrical boot-device-reset signals | ||
Patent #
US 9,792,128 B2
Filed 11/03/2014
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and method for data compression | ||
Patent #
US 9,859,919 B2
Filed 05/02/2017
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Messaging policy controlled email de-duplication | ||
Patent #
US 9,876,746 B2
Filed 10/16/2014
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Systems and methods for data block decompression | ||
Patent #
US 9,967,368 B2
Filed 09/03/2015
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Mobile device agent for personal deduplication | ||
Patent #
US 10,013,448 B2
Filed 08/13/2015
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 10,019,458 B2
Filed 07/08/2015
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data compression systems and method | ||
Patent #
US 10,033,405 B2
Filed 11/09/2015
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Dynamic data compression selection | ||
Patent #
US 10,116,330 B2
Filed 07/20/2017
|
Current Assignee
Oracle International Corporation
|
Original Assignee
Oracle International Corporation
|
Asymmetric data decompression systems | ||
Patent #
US 10,212,417 B2
Filed 12/16/2016
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Adaptive Streaming LLC
|
Systems and methods for data compression | ||
Patent #
US 10,284,225 B2
Filed 12/11/2017
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Joint de-duplication-erasure coded distributed storage | ||
Patent #
US 10,318,389 B2
Filed 07/15/2016
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Dynamic data compression selection | ||
Patent #
US 10,320,415 B2
Filed 09/27/2018
|
Current Assignee
Oracle International Corporation
|
Original Assignee
Oracle International Corporation
|
Adaptive computing for data compression | ||
Patent #
US 10,346,043 B2
Filed 12/28/2015
|
Current Assignee
Pure Storage Inc.
|
Original Assignee
Pure Storage Inc.
|
File system with multi-class in situ tiered archiving | ||
Patent #
US 10,380,066 B2
Filed 07/09/2015
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Systems and methods of data compression | ||
Patent #
US 10,419,021 B2
Filed 08/22/2018
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data deduplication with adaptive erasure code redundancy | ||
Patent #
US 10,484,016 B2
Filed 05/23/2017
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Sequential access storage and data de-duplication | ||
Patent #
US 10,496,523 B2
Filed 12/20/2016
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Dynamic data compression selection | ||
Patent #
US 10,511,325 B2
Filed 04/18/2019
|
Current Assignee
Oracle International Corporation
|
Original Assignee
Oracle International Corporation
|
Efficient use of computing resources through transformation and comparison of trade data to musical piece representation and metrical tree | ||
Patent #
US 10,672,075 B1
Filed 04/02/2019
|
Current Assignee
Data Boiler Technologies LLC
|
Original Assignee
Data Boiler Technologies LLC
|
Dynamic data compression selection | ||
Patent #
US 10,742,232 B2
Filed 10/31/2019
|
Current Assignee
Oracle International Corporation
|
Original Assignee
Oracle International Corporation
|
Data aware deduplication object storage (DADOS) | ||
Patent #
US 10,761,758 B2
Filed 12/21/2016
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Joint de-duplication-erasure coded distributed storage | ||
Patent #
US 10,853,187 B2
Filed 02/26/2019
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Data Compression Systems and Methods | ||
Patent #
US 20110037626A1
Filed 02/09/2010
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and Methods For Accelerated Data Storage And Retrieval | ||
Patent #
US 20110208833A1
Filed 05/05/2011
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and Method For Data Feed Acceleration and Encryption | ||
Patent #
US 20110199243A1
Filed 08/16/2010
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Systems and Methods for Accelerated Loading of Operating Systems and Application Programs | ||
Patent #
US 20110231642A1
Filed 05/27/2011
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Bandwidth Sensitive Data Compression and Decompression | ||
Patent #
US 20110235697A1
Filed 06/06/2011
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Data LLC
|
Bandwidth sensitive data compression and decompression | ||
Patent #
US 8,054,879 B2
Filed 01/08/2010
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Data LLC
|
System and method for data feed acceleration and encryption | ||
Patent #
US 7,777,651 B2
Filed 06/02/2008
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
DATA STOREWIDTH ACCELERATOR | ||
Patent #
US 20100332700A1
Filed 01/15/2010
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
BANDWIDTH SENSITIVE DATA COMPRESSION AND DECOMPRESSION | ||
Patent #
US 20100316114A1
Filed 01/08/2010
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Data LLC
|
Data compression systems and methods | ||
Patent #
US 7,714,747 B2
Filed 01/08/2007
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
SYSTEM AND METHODS FOR ACCELERATED DATA STORAGE AND RETRIEVAL | ||
Patent #
US 20100318684A1
Filed 01/20/2010
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
MEMORY CONTROLLER INCLUDING A HARDWARE COMPRESSION AND DECOMPRESSION ENGINE FOR MANAGING SYSTEM MEMORY AND GRAPHICAL OPERATIONS | ||
Patent #
US 20090125698A1
Filed 01/14/2009
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Mossman Holdings LLC
|
BANDWIDTH SENSITIVE DATA COMPRESSION AND DECOMPRESSION | ||
Patent #
US 20090154545A1
Filed 05/19/2008
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Data LLC
|
Techniques for optimizing promotion delivery | ||
Patent #
US 7,552,069 B2
Filed 12/22/2000
|
Current Assignee
DS-IQ Incorporated
|
Original Assignee
Concept Shopping Inc.
|
Image transfer and archival system | ||
Patent #
US 7,565,441 B2
Filed 07/23/2001
|
Current Assignee
Philip B. Romanik, Amy H. Muntz
|
Original Assignee
Philip B. Romanik, Amy H. Muntz
|
SYSTEM AND METHOD FOR DATA FEED ACCELERATION AND ENCRYPTION | ||
Patent #
US 20090287839A1
Filed 06/02/2008
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Communication system with priority data compression | ||
Patent #
US 7,319,667 B1
Filed 11/15/2000
|
Current Assignee
Cisco Technology Incorporated
|
Original Assignee
Cisco Technology Incorporated
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 7,321,937 B2
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Method for quickly booting a computer system | ||
Patent #
US RE40,092 E1
Filed 08/12/2004
|
Current Assignee
Operating Systems Solutions LLC
|
Original Assignee
Protimus Technologies LLC
|
Configuration in a configurable system on a chip | ||
Patent #
US 7,330,912 B1
Filed 12/16/2004
|
Current Assignee
Xilinx Inc.
|
Original Assignee
Xilinx Inc.
|
Data compression systems and methods | ||
Patent #
US 7,352,300 B2
Filed 01/08/2007
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Content independent data compression method and system | ||
Patent #
US 7,358,867 B2
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Content independent data compression method and system | ||
Patent #
US 7,378,992 B2
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data storewidth accelerator | ||
Patent #
US 7,376,772 B2
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Bandwidth sensitive data compression and decompression | ||
Patent #
US 7,386,046 B2
Filed 02/13/2002
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Data LLC
|
System and method for data feed acceleration and encryption | ||
Patent #
US 7,400,274 B2
Filed 03/13/2007
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 7,395,345 B2
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 7,415,530 B2
Filed 10/26/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and method for data feed acceleration and encryption | ||
Patent #
US 7,417,568 B2
Filed 05/07/2003
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
BANDWIDTH SENSITIVE DATA COMPRESSION AND DECOMPRESSION | ||
Patent #
US 20080232457A1
Filed 06/03/2008
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Data LLC
|
Systems and methods for data compression such as content dependent data compression | ||
Patent #
US 7,161,506 B2
Filed 09/22/2003
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Systems and methods for accelerated loading of operating systems and application programs | ||
Patent #
US 7,181,608 B2
Filed 02/02/2001
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
SYSTEMS AND METHODS FOR ACCELERATED LOADING OF OPERATING SYSTEMS AND APPLICATION PROGRAMS | ||
Patent #
US 20070043939A1
Filed 10/19/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
SYSTEM AND METHODS FOR ACCELERATED DATA STORAGE AND RETRIEVAL | ||
Patent #
US 20070067483A1
Filed 10/26/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
SYSTEM AND METHODS FOR ACCELERATED DATA STORAGE AND RETRIEVAL | ||
Patent #
US 20070050515A1
Filed 10/26/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
SYSTEM AND METHODS FOR ACCELERATED DATA STORAGE AND RETRIEVAL | ||
Patent #
US 20070050514A1
Filed 10/26/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Selective lossless, lossy, or no compression of data based on address range, data type, and/or requesting agent | ||
Patent #
US 7,190,284 B1
Filed 01/29/1999
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Mossman Holdings LLC
|
SYSTEMS AND METHODS FOR ACCELERATED LOADING OF OPERATING SYSTEMS AND APPLICATION PROGRAMS | ||
Patent #
US 20070083746A1
Filed 10/19/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data compression systems and methods | ||
Patent #
US 20070109154A1
Filed 01/08/2007
|
Current Assignee
Realtime Data LLC
|
Original Assignee
James Fallon
|
Data compression system and methods | ||
Patent #
US 20070109156A1
Filed 01/08/2007
|
Current Assignee
Realtime Data LLC
|
Original Assignee
James Fallon
|
Data compression systems and methods | ||
Patent #
US 20070109155A1
Filed 01/08/2007
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
SYSTEM AND METHOD FOR DATA FEED ACCELERATION AND ENCRYPTION | ||
Patent #
US 20070174209A1
Filed 03/13/2007
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Multimedia interface having a processor and reconfigurable logic | ||
Patent #
US 6,810,434 B2
Filed 08/14/2001
|
Current Assignee
Kawasaki MicroElectronics
|
Original Assignee
Kawasaki MicroElectronics
|
Audio and video transmission and receiving system | ||
Patent #
US 5,132,992 A
Filed 01/07/1991
|
Current Assignee
Acacia Media Technologies Corporation
|
Original Assignee
Browne H. Lee
|
System for detecting and reporting data flow imbalance between computers using grab rate outflow rate arrival rate and play rate | ||
Patent #
US 5,864,678 A
Filed 05/08/1996
|
Current Assignee
Apple Inc.
|
Original Assignee
Apple Computer Incorporated
|
Video decompression | ||
Patent #
US 5,703,793 A
Filed 07/07/1995
|
Current Assignee
Talon Research LLC
|
Original Assignee
Discovision Associates
|
Content independent data compression method and system | ||
Patent #
US 6,309,424 B1
Filed 11/03/2000
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Method and apparatus for adaptive audio compression and decompression | ||
Patent #
US 5,832,443 A
Filed 02/25/1997
|
Current Assignee
XVD Technology Holdings Ltd.
|
Original Assignee
GT Technologies, Alaris Inc.
|
Dynamic compression-rate selection arrangement | ||
Patent #
US 5,506,872 A
Filed 04/26/1994
|
Current Assignee
Avaya Incorporated
|
Original Assignee
ATT Inc.
|
Methods and apparatus for compressing and decompressing paging data | ||
Patent #
US 5,396,228 A
Filed 01/16/1992
|
Current Assignee
Skytel Corporation
|
Original Assignee
Mobile Telecommunications Technologies LLC
|
Integrated circuit with programmable bus configuration | ||
Patent #
US 5,909,557 A
Filed 11/20/1995
|
Current Assignee
ATT Inc.
|
Original Assignee
Lucent Technologies Inc.
|
Video data compression method and system which measures compressed data storage time to optimize compression rate | ||
Patent #
US 5,621,820 A
Filed 08/25/1995
|
Current Assignee
Autodesk Inc.
|
Original Assignee
Radius Inc. Washington
|
System for formatting digital signals to be transmitted | ||
Patent #
US 4,729,020 A
Filed 06/01/1987
|
Current Assignee
Delta Information Systems Horsham Pennsylvania
|
Original Assignee
DELTA INFORMATION SYSTEMS
|
Dynamic selection of compression rate for a voice compression algorithm in a voice over data modem | ||
Patent #
US 5,546,395 A
Filed 11/29/1994
|
Current Assignee
Multi-Tech Systems Incorporated
|
Original Assignee
Multi-Tech Systems Incorporated
|
METHOD FOR PACKET-LEVEL FEC ENCODING, IN WHICH ON A SOURCE PACKET-BY-SOURCE PACKET BASIS, THE ERROR CORRECTION CONTRIBUTIONS OF A SOURCE PACKET TO A PLURALITY OF WILDCARD PACKETS ARE COMPUTED, AND THE SOURCE PACKET IS TRANSMITTED THEREAFTER | ||
Patent #
US 6,609,223 B1
Filed 04/06/2000
|
Current Assignee
KenCast Inc.
|
Original Assignee
KenCast Inc.
|
Method of optimizing the compression of image data, with automatic selection of compression conditions | ||
Patent #
US 6,031,939 A
Filed 03/13/1998
|
Current Assignee
Alcatel-Lucent SA
|
Original Assignee
Alcatel-Lucent SA
|
Fair queuing system with adaptive bandwidth redistribution | ||
Patent #
US 6,452,933 B1
Filed 11/18/1997
|
Current Assignee
Lucent Technologies Inc.
|
Original Assignee
Lucent Technologies Inc., ATT Inc.
|
Integrated block checking system for rapid file transfer of compressed data | ||
Patent #
US 6,711,709 B1
Filed 06/24/1998
|
Current Assignee
Unisys Corporation
|
Original Assignee
Unisys Corporation
|
Method and apparatus for using finite state machines to perform channel modulation and error correction and entropy coding | ||
Patent #
US 5,475,388 A
Filed 10/22/1993
|
Current Assignee
Ricoh Company Limited, Ricoh Corporation
|
Original Assignee
Ricoh Company Limited, Ricoh Corporation
|
Video and/or audio decompression and/or compression device that shares a memory interface | ||
Patent #
US 5,812,789 A
Filed 08/26/1996
|
Current Assignee
Parthenon Unified Memory Architecture LLC
|
Original Assignee
STMicroelectronics Incorporated
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 7,130,913 B2
Filed 07/28/2003
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Multi-spectral image compression with bounded loss | ||
Patent #
US 6,198,842 B1
Filed 06/19/1997
|
Current Assignee
MediaTek Inc.
|
Original Assignee
International Business Machines Corporation
|
Apparatus and method for compressing data signals and restoring the compressed data signals | ||
Patent #
US 4,464,650 A
Filed 08/10/1981
|
Current Assignee
Bell Telephone Laboratories Inc., American Telephone Telegraph
|
Original Assignee
Sperry Corporation
|
Transparent support of protocol and data compression features for data communication | ||
Patent #
US 5,768,525 A
Filed 04/25/1997
|
Current Assignee
HP Inc.
|
Original Assignee
US Robotics Corporation
|
Method and apparatus for providing rate control in a video encoder | ||
Patent #
US 6,963,608 B1
Filed 09/29/1999
|
Current Assignee
ARRIS Enterprises LLC
|
Original Assignee
General Instrument Corporation
|
Compression of three-dimensional graphics data including quantization, delta-encoding, and variable-length encoding | ||
Patent #
US 5,867,167 A
Filed 11/04/1997
|
Current Assignee
Sun Microsystems Incorporated
|
Original Assignee
Sun Microsystems Incorporated
|
Data compression system and method | ||
Patent #
US 6,661,845 B1
Filed 06/23/2000
|
Current Assignee
Vianix Delaware LLC
|
Original Assignee
VIANIX LC
|
Method and apparatus for compressing video and voice signals according to different standards | ||
Patent #
US 5,784,572 A
Filed 12/29/1995
|
Current Assignee
Avago Technologies General IP PTE Limited
|
Original Assignee
LSI Logic Corporation
|
System for allocating available bandwidth of a concentrated media output | ||
Patent #
US 6,078,958 A
Filed 01/31/1997
|
Current Assignee
Hughes Electronics Corporation
|
Original Assignee
Hughes Electronics Corporation
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 6,601,104 B1
Filed 03/11/1999
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Method of negotiation of protocols, classes, and options in computer and communication networks providing mixed packet, frame, cell, and circuit services | ||
Patent #
US 5,452,287 A
Filed 09/20/1993
|
Current Assignee
Motorola Mobility LLC
|
Original Assignee
Motorola Inc.
|
Call distribution system with distributed control of calls and data distribution | ||
Patent #
US 5,557,668 A
Filed 05/25/1995
|
Current Assignee
Teledata Solutions Inc.
|
Original Assignee
Teledata Solutions Inc.
|
System and method for implementing application functionality within a network infrastructure | ||
Patent #
US 7,127,518 B2
Filed 04/16/2001
|
Current Assignee
Circadence Corporation
|
Original Assignee
Circadence Corporation
|
Configurable digital signal interface using field programmable gate array to reformat data | ||
Patent #
US 5,692,159 A
Filed 05/19/1995
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
Digital Equipment Corporation
|
Method and apparatus for preloading data in a distributed data processing system | ||
Patent #
US 6,226,667 B1
Filed 05/26/1998
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Digital compressed sound recorder | ||
Patent #
US 5,675,333 A
Filed 08/29/1995
|
Current Assignee
Pendragon Wireless LLC
|
Original Assignee
US Philips Corporation
|
Apparatus and method for processing and displaying images in a digital procesor based system | ||
Patent #
US 5,046,027 A
Filed 11/08/1988
|
Current Assignee
Massachusetts General Hospital
|
Original Assignee
Massachusetts General Hospital
|
High speed multi-port serial-to-PCI bus interface | ||
Patent #
US 7,007,099 B1
Filed 05/01/2000
|
Current Assignee
Lucent Technologies Inc.
|
Original Assignee
Lucent Technologies Inc.
|
System for adaptive video/audio transport over a network | ||
Patent #
US 6,014,694 A
Filed 06/26/1997
|
Current Assignee
Citrix Systems Inc.
|
Original Assignee
Citrix Systems Inc.
|
Content independent data compression method and system | ||
Patent #
US 6,624,761 B2
Filed 10/29/2001
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data processing apparatus having first bus with bus arbitration independent of CPU, second bus for CPU, and gate between first and second buses | ||
Patent #
US 5,434,983 A
Filed 08/28/1992
|
Current Assignee
Matsushita Graphic Communication Systems Incorporated
|
Original Assignee
Fujitsu Limited
|
Method for data compression | ||
Patent #
US 5,533,051 A
Filed 03/12/1993
|
Current Assignee
HyperSpace Communications Inc.
|
Original Assignee
James Group LLC
|
Content independent data compression method and system | ||
Patent #
US 6,195,024 B1
Filed 12/11/1998
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Embedding web access functionality into a device for user interface functions | ||
Patent #
US 6,170,007 B1
Filed 08/31/1999
|
Current Assignee
Agilent Technologies Incorporated, HP Inc., Hewlett-Packard Development Company L.P.
|
Original Assignee
HP Inc.
|
Context generation | ||
Patent #
US 7,054,493 B2
Filed 01/08/2003
|
Current Assignee
Ricoh Company Limited, Ricoh Corporation
|
Original Assignee
Ricoh Company Limited
|
Method and apparatus for encoding and decoding data | ||
Patent #
US 5,717,394 A
Filed 12/17/1996
|
Current Assignee
Ricoh Company Limited, Ricoh Corporation
|
Original Assignee
Ricoh Company Limited, Ricoh Corporation
|
Method and apparatus for parallel decoding and encoding of data | ||
Patent #
US 5,381,145 A
Filed 02/10/1993
|
Current Assignee
Ricoh Company Limited, Ricoh Corporation
|
Original Assignee
Ricoh Company Limited, Ricoh Corporation
|
Apparatus and method for adaptively compressing successive blocks of digital video | ||
Patent #
US 5,091,782 A
Filed 04/09/1990
|
Current Assignee
CIF Licensing LLC
|
Original Assignee
General Instrument Corporation
|
Dual-channel communications protocol providing enhanced capabilities for modems | ||
Patent #
US 6,768,749 B1
Filed 10/14/1999
|
Current Assignee
Cisco Technology Incorporated
|
Original Assignee
Cisco Technology Incorporated
|
Command authentication process | ||
Patent #
US 5,293,576 A
Filed 11/21/1991
|
Current Assignee
CDC Propriete Intellectuelle
|
Original Assignee
Motorola Inc.
|
Digital video compression system utilizing vector adaptive transform | ||
Patent #
US 5,367,629 A
Filed 12/18/1992
|
Current Assignee
ShareVision Technology Inc.
|
Original Assignee
ShareVision Technology Inc.
|
System and method for transmission of data | ||
Patent #
US 6,021,433 A
Filed 01/24/1997
|
Current Assignee
Verus International Group Limited
|
Original Assignee
Wireless Internet Inc.
|
Video data compression method and system which measures compressed data storage time to optimize compression rate | ||
Patent #
US 5,563,961 A
Filed 03/03/1994
|
Current Assignee
Autodesk Inc.
|
Original Assignee
Radius Inc. Washington
|
Multiple coder technique | ||
Patent #
US 6,990,247 B2
Filed 01/08/2003
|
Current Assignee
Ricoh Company Limited, Ricoh Corporation
|
Original Assignee
Ricoh Company Limited, Ricoh Corporation
|
Method and apparatus for data compression of network packets | ||
Patent #
US 6,388,584 B1
Filed 03/16/2000
|
Current Assignee
Lucent Technologies Inc.
|
Original Assignee
Lucent Technologies Inc.
|
Enhanced delivery of audio data | ||
Patent #
US 5,841,979 A
Filed 05/07/1996
|
Current Assignee
Ironworks Patents LLC
|
Original Assignee
Information Highway Media Corporation
|
Method and apparatus for parallel decoding and encoding of data | ||
Patent #
US 5,471,206 A
Filed 12/05/1994
|
Current Assignee
Ricoh Company Limited, Ricoh Corporation
|
Original Assignee
Ricoh Company Limited, Ricoh Corporation
|
System and method for incremental and continuous data compression | ||
Patent #
US 6,856,651 B2
Filed 05/31/2001
|
Current Assignee
Riverbed Technology Incorporated
|
Original Assignee
Peribit Networks Inc.
|
Reconfigurable network interface apparatus and method | ||
Patent #
US 5,671,355 A
Filed 09/13/1996
|
Current Assignee
PREDACOMM INC.
|
Original Assignee
PREDACOMM INC.
|
Three-dimensional image coding by merger of left and right images | ||
Patent #
US 5,767,898 A
Filed 06/20/1995
|
Current Assignee
Sanyo Electric Company Limited
|
Original Assignee
Sanyo Electric Company Limited
|
Serial data decoding using state machine with selectable decoding tables | ||
Patent #
US 5,455,578 A
Filed 05/26/1993
|
Current Assignee
Sony United Kingdom Limited
|
Original Assignee
Sony United Kingdom Limited
|
Data compression on a data connection | ||
Patent #
US 6,434,168 B1
Filed 12/07/1998
|
Current Assignee
Nokia Solutions Networks Oy
|
Original Assignee
Nokia Telecommunications Oy
|
Adaptive quantization compatible with the JPEG baseline sequential mode | ||
Patent #
US 6,175,650 B1
Filed 01/26/1998
|
Current Assignee
Xerox Corporation
|
Original Assignee
Xerox Corporation
|
Method and apparatus for parallel encoding and decoding of data | ||
Patent #
US 5,583,500 A
Filed 12/23/1993
|
Current Assignee
Ricoh Company Limited, Ricoh Corporation
|
Original Assignee
Ricoh Company Limited, Ricoh Corporation
|
Rapid entropy coding for data compression or decompression | ||
Patent #
US 5,818,369 A
Filed 03/07/1996
|
Current Assignee
Pegasus Imaging Corporation
|
Original Assignee
Pegasus Imaging Corporation
|
Real time data transformation and transmission overlapping device | ||
Patent #
US 4,956,808 A
Filed 05/20/1987
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Internet upstream request compression | ||
Patent #
US 5,938,737 A
Filed 02/14/1997
|
Current Assignee
RPX Corporation
|
Original Assignee
Stanford Telecommunications Inc.
|
Terminal apparatus | ||
Patent #
US 6,993,597 B2
Filed 08/13/2003
|
Current Assignee
SOTA Semiconductor LLC
|
Original Assignee
Renesas Technology Corporation
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 20060015650A1
Filed 09/19/2005
|
Current Assignee
Realtime Data LLC
|
Original Assignee
James J. Fallon
|
Service-based compression of content within a network communication system | ||
Patent #
US 7,024,460 B2
Filed 03/11/2002
|
Current Assignee
Citrix Systems Inc.
|
Original Assignee
Bytemobile Inc.
|
Communication system with content-based data compression | ||
Patent #
US 7,069,342 B1
Filed 03/01/2001
|
Current Assignee
Cisco Technology Incorporated
|
Original Assignee
Cisco Technology Incorporated
|
Managing a codec engine for memory compression/decompression operations using a data movement engine | ||
Patent #
US 7,089,391 B2
Filed 08/23/2002
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Quickshift Inc.
|
Content independent data compression method and system | ||
Patent #
US 20060181442A1
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Content independent data compression method and system | ||
Patent #
US 20060181441A1
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
James J. Fallon
|
Data storewidth accelerator | ||
Patent #
US 20060190644A1
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
James J. Fallon
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 20060195601A1
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
James J. Fallon
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 20060184687A1
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data Compression Systems Inc.
|
Method and system for improving memory interface data integrity in PLDs | ||
Patent #
US 7,102,544 B1
Filed 05/31/2005
|
Current Assignee
Altera Corporation
|
Original Assignee
Altera Corporation
|
System and method for performing scalable embedded parallel data decompression | ||
Patent #
US 7,129,860 B2
Filed 03/28/2001
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Quickshift Inc.
|
System and method using a packetized encoded bitstream for parallel compression and decompression | ||
Patent #
US 6,862,278 B1
Filed 06/18/1998
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Memory module including scalable embedded parallel data compression and decompression engines | ||
Patent #
US 6,879,266 B1
Filed 07/14/2000
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Quickshift Inc.
|
System and method for generating optimally compressed data from a plurality of data compression/decompression engines implementing different data compression algorithms | ||
Patent #
US 6,885,319 B2
Filed 01/11/2002
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Quickshift Inc.
|
System and method for keyboard independent touch typing | ||
Patent #
US 6,885,316 B2
Filed 12/02/2003
|
Current Assignee
Carsten Mehring
|
Original Assignee
Carsten Mehring
|
System and process for broadcast and communication with very low bit-rate bi-level or sketch video | ||
Patent #
US 6,888,893 B2
Filed 04/28/2001
|
Current Assignee
Zhigu Holdings Limited
|
Original Assignee
Microsoft Corporation
|
Content adaptive video encoder | ||
Patent #
US 6,909,745 B1
Filed 06/05/2001
|
Current Assignee
ATT Intellectual Property II LP
|
Original Assignee
ATT Inc.
|
Systematic encoding and decoding of chain reaction codes | ||
Patent #
US 6,909,383 B2
Filed 10/01/2003
|
Current Assignee
Qualcomm Inc.
|
Original Assignee
Digital Fountain Incorporated
|
Method for performing compressed I/O with memory expansion technology | ||
Patent #
US 6,944,740 B2
Filed 03/27/2002
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Software prefetch system and method for concurrently overriding data prefetched into multiple levels of cache | ||
Patent #
US 6,959,359 B1
Filed 06/09/2000
|
Current Assignee
Hitachi Information Technology Co. Ltd., Hitachi America Limited
|
Original Assignee
Hitachi Computer Peripherals Company Limited, Hitachi America Limited
|
Accelerator system and method | ||
Patent #
US 6,952,409 B2
Filed 01/08/2001
|
Current Assignee
Lynne G. Jolitz
|
Original Assignee
Lynne G. Jolitz
|
Content independent data compression method and system | ||
Patent #
US 20040056783A1
Filed 09/22/2003
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and method for in-stream data compression | ||
Patent #
US 6,708,220 B1
Filed 11/19/1999
|
Current Assignee
XNet Associates Inc.
|
Original Assignee
XNet Associates Inc.
|
Computer system and method of computer initialization with caching of option BIOS | ||
Patent #
US 6,704,840 B2
Filed 06/19/2001
|
Current Assignee
Beijing Xiaomi Mobile Software Co. Ltd.
|
Original Assignee
Intel Corporation
|
System and method for data feed acceleration and encryption | ||
Patent #
US 20040042506A1
Filed 05/07/2003
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 20040073710A1
Filed 07/28/2003
|
Current Assignee
Realtime Data LLC
|
Original Assignee
James J. Fallon
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 20040073746A1
Filed 07/28/2003
|
Current Assignee
Realtime Data LLC
|
Original Assignee
James J. Fallon
|
Data encoding device and data decoding device | ||
Patent #
US 6,717,534 B2
Filed 01/15/2003
|
Current Assignee
Fuji Xerox Company Limited
|
Original Assignee
Fuji Xerox Company Limited
|
Method for compressing digital documents with control of image quality and compression rate | ||
Patent #
US 6,731,814 B2
Filed 12/04/2000
|
Current Assignee
Xerox Corporation
|
Original Assignee
Xerox Corporation
|
Compressed data managing apparatus and method therefor to manage compressed data of a disk storage | ||
Patent #
US 6,745,282 B2
Filed 11/15/2002
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
Data storewidth accelerator | ||
Patent #
US 6,748,457 B2
Filed 02/02/2001
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Method and system for compression of a set of mostly similar strings allowing fast retrieval | ||
Patent #
US 6,756,922 B2
Filed 05/21/2001
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Image data compression employing optimal subregion compression | ||
Patent #
US 6,792,151 B1
Filed 11/24/1999
|
Current Assignee
General Electric Company
|
Original Assignee
General Electric Company
|
System and method for performing scalable embedded parallel data decompression | ||
Patent #
US 6,822,589 B1
Filed 01/26/2000
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Quickshift Inc.
|
Parallel compression and decompression system and method having multiple parallel compression and decompression engines | ||
Patent #
US 6,819,271 B2
Filed 01/11/2002
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Quickshift Inc.
|
Communications architecture for a high throughput storage processor employing extensive I/O parallelization | ||
Patent #
US 6,813,689 B2
Filed 03/29/2002
|
Current Assignee
Emc IP Holding Company LLC
|
Original Assignee
EMC Corporation
|
Electronic instrument adapted to be selectively booted either from externally-connectable storage unit or from internal nonvolatile rewritable memory | ||
Patent #
US 6,513,113 B1
Filed 06/16/1999
|
Current Assignee
Ricoh Company Limited
|
Original Assignee
Ricoh Company Limited
|
System for minimizing screen refresh time using selectable compression speeds | ||
Patent #
US 6,505,239 B1
Filed 10/16/2000
|
Current Assignee
e-Parcel corporation
|
Original Assignee
Atabok Japan Inc.
|
Lossless data compression | ||
Patent #
US 20030030575A1
Filed 05/07/2001
|
Current Assignee
HARMONIC DATA SYSTEMS LTD.
|
Original Assignee
HARMONIC DATA SYSTEMS LTD.
|
Method and apparatus for video compression using block and wavelet techniques | ||
Patent #
US 6,526,174 B1
Filed 02/28/2000
|
Current Assignee
Apple Inc.
|
Original Assignee
NeXT Computer Inc.
|
PARALLEL COMPRESSION/DECOMPRESSION SYSTEM AND METHOD FOR IMPLEMENTATION OF IN-MEMORY COMPRESSED CACHE IMPROVING STORAGE DENSITY AND ACCESS SPEED FOR INDUSTRY STANDARD MEMORY SUBSYSTEMS AND IN-LINE MEMORY MODULES | ||
Patent #
US 6,523,102 B1
Filed 04/14/2000
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Interactive Silicon Inc.
|
System and method for encoding and decoding data files | ||
Patent #
US 20030034905A1
Filed 05/17/2002
|
Current Assignee
Cyber Operations LLC
|
Original Assignee
Cyber Operations LLC
|
Hardware acceleration of boot-up utilizing a non-volatile disk cache | ||
Patent #
US 6,539,456 B2
Filed 10/13/1999
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Parallel difference coding method for lossless compression and real time decompression | ||
Patent #
US 6,529,633 B1
Filed 09/10/1999
|
Current Assignee
Texas Instruments Inc.
|
Original Assignee
Texas Instruments Inc.
|
Compression algorithm with embedded meta-data for partial record operation augmented with expansion joints | ||
Patent #
US 6,532,121 B1
Filed 10/25/1999
|
Current Assignee
Hewlett Packard Enterprise Development LP
|
Original Assignee
HP Inc.
|
Reconfigurable computing system and method and apparatus employing same | ||
Patent #
US 6,539,438 B1
Filed 01/15/1999
|
Current Assignee
QuickFlex Inc.
|
Original Assignee
QuickFlex Inc.
|
Statistical data compression/decompression method | ||
Patent #
US 6,542,644 B1
Filed 09/28/1999
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
Data compression/decompression system | ||
Patent #
US 20030090397A1
Filed 11/14/2001
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
Hewlett-Packard Development Company L.P.
|
Storage control apparatus and method for compressing data for disk storage | ||
Patent #
US 20030084238A1
Filed 11/15/2002
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Shigeru Yoshida, Naoaki Okayasu, Yoshiyuki Okada, Hiroyuki Shimoi, Masanaga Tokuyo
|
Data compression/decompression system | ||
Patent #
US 6,577,254 B2
Filed 11/14/2001
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
Hewlett-Packard Development Company L.P.
|
Context generation | ||
Patent #
US 20030142874A1
Filed 01/08/2003
|
Current Assignee
Ricoh Company Limited
|
Original Assignee
Edward L. Schwartz
|
System and method for lossless data compression and decompression | ||
Patent #
US 6,597,812 B1
Filed 05/26/2000
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Image signal recording system | ||
Patent #
US 6,590,609 B1
Filed 02/19/1998
|
Current Assignee
Maxell Ltd.
|
Original Assignee
Hitachi America Limited
|
Method and apparatus for adaptive data compression | ||
Patent #
US 6,606,040 B2
Filed 02/13/2001
|
Current Assignee
Google LLC
|
Original Assignee
Mosaid Technologies Incorporated
|
Compression packaged image transmission for telemicroscopy | ||
Patent #
US 6,606,413 B1
Filed 06/01/1999
|
Current Assignee
Carl Zeiss Optical Incorporated
|
Original Assignee
Trestle Acquisition Corp.
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 6,604,158 B1
Filed 01/11/2000
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Apparatus and method for identifying tires and apparatus and method for evaluating road surface conditions | ||
Patent #
US 6,604,040 B2
Filed 12/10/2001
|
Current Assignee
Sumitomo Rubber Industries Limited
|
Original Assignee
Sumitomo Rubber Industries Limited
|
Multi-process compression | ||
Patent #
US 6,618,728 B1
Filed 01/31/1996
|
Current Assignee
Hewlett Packard Enterprise Development LP
|
Original Assignee
Electronic Data Systems Corporation
|
Data storewidth accelerator | ||
Patent #
US 20030191876A1
Filed 11/27/2002
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Pre-fetching of pages prior to a hard page fault sequence | ||
Patent #
US 6,633,968 B2
Filed 02/27/2001
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Efficient and lossless conversion for transmission or storage of data | ||
Patent #
US 6,633,244 B2
Filed 12/29/2000
|
Current Assignee
Efeckta Technologies Corporation
|
Original Assignee
Efeckta Technologies Corporation
|
Sliding window compression method utilizing defined match locations | ||
Patent #
US 6,650,261 B2
Filed 06/18/2002
|
Current Assignee
Xerox Corporation
|
Original Assignee
Xerox Corporation
|
Method and device for compressing and expanding data pattern | ||
Patent #
US 6,661,839 B1
Filed 11/20/1998
|
Current Assignee
Advantest Corporation
|
Original Assignee
Advantest Corporation
|
High-speed hybernation | ||
Patent #
US 6,336,153 B1
Filed 02/25/1999
|
Current Assignee
Toshiba Corporation
|
Original Assignee
Toshiba Corporation
|
Method and apparatus for compressing hypertext transfer protocol (HTTP) messages | ||
Patent #
US 6,345,307 B1
Filed 11/12/1999
|
Current Assignee
Google Technology Holdings LLC
|
Original Assignee
General Instrument Corporation
|
System and method for incremental and continuous data compression | ||
Patent #
US 20020037035A1
Filed 05/31/2001
|
Current Assignee
Riverbed Technology Incorporated
|
Original Assignee
Peribit Networks Inc.
|
Interoperable full-featured web-based and client-side e-mail system | ||
Patent #
US 6,356,937 B1
Filed 07/06/1999
|
Current Assignee
MEC Management LLC
|
Original Assignee
Adam Montville, David Montville
|
Sharing reference data between multiple encoders parallel encoding a sequence of video frames | ||
Patent #
US 6,356,589 B1
Filed 01/28/1999
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Information processing apparatus method of booting information processing apparatus at a high speed | ||
Patent #
US 6,374,353 B1
Filed 03/03/1999
|
Current Assignee
Mitsubishi Electric Corporation
|
Original Assignee
Mitsubishi Electric Corporation
|
Apparatus for repeatedly compressing a data string and a method thereof | ||
Patent #
US 6,392,567 B2
Filed 01/22/2001
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
System and method for data feed acceleration and encryption | ||
Patent #
US 20020080871A1
Filed 10/03/2001
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Systems and methods for accelerated loading of operating systems and application programs | ||
Patent #
US 20020069354A1
Filed 02/02/2001
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Code book construction for variable to variable length entropy encoding | ||
Patent #
US 6,404,931 B1
Filed 12/14/1998
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Methods and systems for forward error correction based loss recovery for interactive video transmission | ||
Patent #
US 6,421,387 B1
Filed 08/10/2000
|
Current Assignee
North Carolina State University
|
Original Assignee
North Carolina State University
|
Content independent data compression method and system | ||
Patent #
US 20020097172A1
Filed 10/29/2001
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and method for generating optimally compressed data from a plurality of data compression/decompression engines implementing different data compression algorithms | ||
Patent #
US 20020101367A1
Filed 01/11/2002
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Interactive Silicon Inc.
|
Computer operating system using compressed ROM image in RAM | ||
Patent #
US 6,434,695 B1
Filed 12/23/1998
|
Current Assignee
Apple Inc.
|
Original Assignee
Apple Computer Incorporated
|
Raid-type storage system and technique | ||
Patent #
US 6,442,659 B1
Filed 02/17/1998
|
Current Assignee
Emc IP Holding Company LLC
|
Original Assignee
EMC Corporation
|
Smart card for storage and retrieval of digitally compressed color images | ||
Patent #
US 20020104891A1
Filed 04/16/2001
|
Current Assignee
Ayao Wada
|
Original Assignee
Ayao Wada
|
Method and apparatus for storing compressed data | ||
Patent #
US 6,452,602 B1
Filed 12/13/1999
|
Current Assignee
ATI Technologies ULC
|
Original Assignee
ATI International SRL
|
System and method for inserting one or more files onto mass storage | ||
Patent #
US 6,449,682 B1
Filed 06/18/1999
|
Current Assignee
Phoenix Technologies Limited
|
Original Assignee
Phoenix Technologies Limited
|
System and process for broadcast and communication with very low bit-rate bi-level or sketch video | ||
Patent #
US 20020126755A1
Filed 04/28/2001
|
Current Assignee
Zhigu Holdings Limited
|
Original Assignee
Microsoft Corporation
|
Method and apparatus for accelerating data through communication networks | ||
Patent #
US 6,449,658 B1
Filed 11/18/1999
|
Current Assignee
IA Global Acquisition Co.
|
Original Assignee
Quikcat.com Incorporated
|
Preloading data in a cache memory according to user-specified preload criteria | ||
Patent #
US 6,463,509 B1
Filed 01/26/1999
|
Current Assignee
Rovi Technologies Corporation
|
Original Assignee
Motive Power Inc.
|
Segmenting compressed graphics data for parallel decompression and rendering | ||
Patent #
US 6,459,429 B1
Filed 06/14/1999
|
Current Assignee
Oracle America Inc.
|
Original Assignee
Sun Microsystems Incorporated
|
Memory access request reordering to reduce memory access latency | ||
Patent #
US 6,487,640 B1
Filed 01/19/1999
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Computer operating system using compressed ROM image in RAM | ||
Patent #
US 20020169950A1
Filed 06/27/2002
|
Current Assignee
Apple Inc.
|
Original Assignee
Ronald Hochsprung, Cameron J. Esfahani, Paul M. Resch, William M. Galcher
|
Bandwidth sensitive data compression and decompression | ||
Patent #
US 20020191692A1
Filed 02/13/2002
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Data LLC
|
Data compression for use with a communications channel | ||
Patent #
US 6,489,902 B2
Filed 09/17/2001
|
Current Assignee
Hughes Electronics Corporation
|
Original Assignee
Hughes Electronics Corporation
|
Methods for determining sendable information content based on a determined network latency | ||
Patent #
US 6,182,125 B1
Filed 10/13/1998
|
Current Assignee
Hewlett Packard Enterprise Development LP
|
Original Assignee
3Com Corporation
|
PC circuits, systems and methods | ||
Patent #
US 6,170,049 B1
Filed 08/11/1999
|
Current Assignee
Texas Instruments Inc.
|
Original Assignee
Texas Instruments Inc.
|
Memory controller including embedded data compression and decompression engines | ||
Patent #
US 6,173,381 B1
Filed 08/08/1997
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Interactive Silicon Inc.
|
Sound source with free compression and expansion of voice independently of pitch | ||
Patent #
US 6,169,241 B1
Filed 02/20/1998
|
Current Assignee
Yamaha Corporation
|
Original Assignee
Yamaha Corporation
|
System and method for managing system memory and/or non-volatile memory using a memory controller with integrated compression and decompression capabilities | ||
Patent #
US 6,170,047 B1
Filed 12/14/1999
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Interactive Silicon Inc.
|
Method and apparatus for dynamic selection of compression processing during teleconference call initiation | ||
Patent #
US 6,175,856 B1
Filed 09/30/1996
|
Current Assignee
Apple Inc.
|
Original Assignee
Apple Computer Incorporated
|
Memory circuit | ||
Patent #
US 6,172,936 B1
Filed 02/24/1999
|
Current Assignee
Socionext Inc.
|
Original Assignee
Fujitsu Limited
|
Method and apparatus for compression using reversible wavelet transforms and an embedded codestream | ||
Patent #
US 6,195,465 B1
Filed 06/30/1995
|
Current Assignee
Ricoh Company Limited
|
Original Assignee
Ricoh Company Limited, Ricoh Corporation
|
Scaling proxy server sending to the client a graphical user interface for establishing object encoding preferences after receiving the client's request for the object | ||
Patent #
US 6,185,625 B1
Filed 12/20/1996
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Hybrid video compression/decompression system | ||
Patent #
US 6,195,391 B1
Filed 05/31/1994
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Pixel shifting image sensor with a different number of images sensed in each mode | ||
Patent #
US 6,195,125 B1
Filed 08/07/1996
|
Current Assignee
Canon Kabushiki Kaisha
|
Original Assignee
Canon Kabushiki Kaisha
|
Adapting resource use to improve performance in a caching memory system | ||
Patent #
US 6,185,659 B1
Filed 03/23/1999
|
Current Assignee
Storage Technologies Corporation
|
Original Assignee
Storage Technologies Corporation
|
Systems and methods for reducing boundary artifacts in hybrid compression | ||
Patent #
US 6,192,155 B1
Filed 09/16/1998
|
Current Assignee
Xerox Corporation
|
Original Assignee
Xerox Corporation
|
Digital television data format conversion with automatic parity detection | ||
Patent #
US 6,192,082 B1
Filed 11/13/1998
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
Compaq Computer Corporation
|
System and method for segmentation dependent lossy and lossless compression for higher quality | ||
Patent #
US 6,198,850 B1
Filed 06/12/1998
|
Current Assignee
Xerox Corporation
|
Original Assignee
Xerox Corporation
|
System and method for performing scalable embedded parallel data compression | ||
Patent #
US 6,208,273 B1
Filed 10/20/1999
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Interactive Silicon Inc.
|
Processor with decompressed video bus | ||
Patent #
US 6,219,754 B1
Filed 12/19/1997
|
Current Assignee
Advanced Micro Devices Inc.
|
Original Assignee
Advanced Micro Devices Inc.
|
Apparatus and method for selecting encoding schemes based upon image content | ||
Patent #
US 6,215,904 B1
Filed 11/30/1994
|
Current Assignee
Xerox Corporation
|
Original Assignee
Xerox Corporation
|
Compression based reduced memory video decoder | ||
Patent #
US 6,222,886 B1
Filed 06/24/1996
|
Current Assignee
Toshiba Corporation
|
Original Assignee
Toshiba Corporation
|
Dual purpose apparatus method and system for accelerated graphics or second memory interface | ||
Patent #
US 6,230,223 B1
Filed 06/01/1998
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
Compaq Computer Corporation
|
Information processing apparatus and method that uses first and second power supplies for reducing booting time | ||
Patent #
US 6,226,740 B1
Filed 12/21/1998
|
Current Assignee
HTC Corporation
|
Original Assignee
NEC Corporation
|
System and method for compressing data using adaptive field encoding | ||
Patent #
US 6,225,922 B1
Filed 03/16/1998
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
HP Inc.
|
Network interface unit including a microcontroller having multiple configurable logic blocks, with a test/program bus for performing a plurality of selected functions | ||
Patent #
US 6,237,054 B1
Filed 09/14/1998
|
Current Assignee
GlobalFoundries Inc.
|
Original Assignee
Advanced Micro Devices Inc.
|
Coding network grouping data of same data type into blocks using file data structure and selecting compression for individual block base on block data type | ||
Patent #
US 6,253,264 B1
Filed 03/06/1998
|
Current Assignee
Viasat Inc.
|
Original Assignee
Intelligent Compression Technologies Inc.
|
Memory controller supporting redundant synchronous memories | ||
Patent #
US 6,243,829 B1
Filed 05/27/1998
|
Current Assignee
Hewlett Packard Enterprise Development LP
|
Original Assignee
HP Inc.
|
Boot code verification and recovery | ||
Patent #
US 6,272,628 B1
Filed 12/14/1998
|
Current Assignee
Lenovo PC International Limited
|
Original Assignee
International Business Machines Corporation
|
System for reconfiguring a boot device by swapping the logical device number of a user selected boot drive to a currently configured boot drive | ||
Patent #
US 6,282,641 B1
Filed 11/18/1998
|
Current Assignee
Kinglite Holdings Inc.
|
Original Assignee
Phoenix Technologies Limited
|
Method and apparatus for booting up a computing system with enhanced graphics | ||
Patent #
US 6,272,627 B1
Filed 10/30/1998
|
Current Assignee
ATI Technologies ULC
|
Original Assignee
ATI International SRL
|
Video data encoder and decoder | ||
Patent #
US 6,272,178 B1
Filed 10/15/1998
|
Current Assignee
Nokia Solutions Networks Oy
|
Original Assignee
Nokia Mobile Phones UK Limited
|
Image processing apparatus and method | ||
Patent #
US 6,285,458 B1
Filed 07/30/1997
|
Current Assignee
Fuji Xerox Company Limited
|
Original Assignee
Fuji Xerox Company Limited
|
Intelligent input and output controller for flexible interface | ||
Patent #
US 6,298,408 B1
Filed 03/03/1999
|
Current Assignee
Hanger Solutions LLC
|
Original Assignee
Samsung Electronics Co. Ltd.
|
Method and apparatus for enhanced decompressor parsing | ||
Patent #
US 6,310,563 B1
Filed 05/12/2000
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Techniques for optimizing promotion delivery | ||
Patent #
US 20010032128A1
Filed 12/22/2000
|
Current Assignee
DS-IQ Incorporated
|
Original Assignee
Concept Shopping Inc.
|
Method for compressing digital documents with control of image quality and compression rate | ||
Patent #
US 20010031092A1
Filed 12/04/2000
|
Current Assignee
Xerox Corporation
|
Original Assignee
Xerox Corporation
|
Method for reconfiguring a field programmable gate array from a host | ||
Patent #
US 6,308,311 B1
Filed 05/14/1999
|
Current Assignee
Xilinx Inc.
|
Original Assignee
Xilinx Inc.
|
Controller and associated mechanical characters operable for continuously performing received control data while engaging in bidirectional communications over a single communications channel | ||
Patent #
US 6,317,714 B1
Filed 02/04/1997
|
Current Assignee
Chartoleaux KG LLC
|
Original Assignee
Microsoft Corporation
|
Pre-fetching of pages prior to a hard page fault sequence | ||
Patent #
US 6,317,818 B1
Filed 03/30/1999
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Systems and methods for computer initialization | ||
Patent #
US 20010047473A1
Filed 02/02/2001
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Direct processor access via an external multi-purpose interface | ||
Patent #
US 6,330,622 B1
Filed 10/23/1998
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
System and method for perfoming scalable embedded parallel data compression | ||
Patent #
US 20010054131A1
Filed 03/27/2001
|
Current Assignee
Quickshift Inc.
|
Original Assignee
Quickshift Inc.
|
Data storewidth accelerator | ||
Patent #
US 20010052038A1
Filed 02/02/2001
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data processor having unified memory architecture providing priority memory access | ||
Patent #
US 6,333,745 B1
Filed 09/29/1997
|
Current Assignee
Renesas Electronics Corporation
|
Original Assignee
Hitachi America Limited
|
Compressed digital video record and playback system | ||
Patent #
US 6,011,901 A
Filed 11/26/1997
|
Current Assignee
TIMEPRES CORPORATION
|
Original Assignee
TIMEPRES CORPORATION
|
Method and apparatus for increasing disc drive performance | ||
Patent #
US 6,028,725 A
Filed 11/04/1997
|
Current Assignee
Emc IP Holding Company LLC
|
Original Assignee
EMC Corporation
|
Computer with programmable arrays which are reconfigurable in response to instructions to be executed | ||
Patent #
US 6,023,755 A
Filed 07/22/1998
|
Current Assignee
Tarofiss Data Limited Liability Company
|
Original Assignee
Virtual Computer Incorporated
|
Multilevel storage system with hybrid data compression | ||
Patent #
US 6,032,148 A
Filed 09/15/1997
|
Current Assignee
Hewlett Packard Enterprise Development LP
|
Original Assignee
HP Inc.
|
Method and apparatus for eliminating the transpose buffer during a decomposed forward or inverse 2-dimensional discrete cosine transform through operand decomposition storage and retrieval | ||
Patent #
US 6,026,217 A
Filed 06/21/1996
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
Digital Equipment Corporation
|
Data packet header compression for unidirectional transmission | ||
Patent #
US 6,032,197 A
Filed 09/25/1997
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Runs of adaptive pixel patterns (RAPP) for lossless image compression | ||
Patent #
US 6,038,346 A
Filed 01/29/1998
|
Current Assignee
Seiko Epson Corporation
|
Original Assignee
Seiko Epson Corporation
|
Compression and expansion methods and apparatus | ||
Patent #
US 6,061,473 A
Filed 04/18/1997
|
Current Assignee
Oki Data Corporation
|
Original Assignee
Oki Data Corporation
|
Video/audio decompression/compression device including an arbiter and method for accessing a shared memory | ||
Patent #
US 6,058,459 A
Filed 08/26/1996
|
Current Assignee
Parthenon Unified Memory Architecture LLC
|
Original Assignee
STMicroelectronics Incorporated
|
Method of and apparatus for compressing and restoring data | ||
Patent #
US 6,061,398 A
Filed 11/14/1996
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
Method and system for compressing unicode data within a data processing system | ||
Patent #
US 6,070,179 A
Filed 02/20/1998
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Method for minimizing a computer's initial program load time after a system reset or a power-on using non-volatile storage | ||
Patent #
US 6,073,232 A
Filed 02/25/1997
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Block-wise adaptive statistical data compressor | ||
Patent #
US 6,075,470 A
Filed 02/26/1998
|
Current Assignee
Blackberry Limited
|
Original Assignee
Blackberry Limited
|
Continuously adaptive digital video compression system and method for a web streamer | ||
Patent #
US 6,091,777 A
Filed 05/26/1998
|
Current Assignee
Systems Technology Incorporated
|
Original Assignee
CUBIC VIDEO TECHNOLOGIES INC.
|
Method and apparatus for changing functions of a hardware device using two or more communication channels | ||
Patent #
US 6,092,123 A
Filed 07/17/1997
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Data compressing apparatus, data decompressing apparatus, data compressing method, data decompressing method, and program recording medium | ||
Patent #
US 6,094,634 A
Filed 01/23/1998
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
Disk array system for processing and tracking the completion of I/O requests | ||
Patent #
US 6,098,114 A
Filed 03/04/1998
|
Current Assignee
Summit Data Systems LLC
|
Original Assignee
3WARE
|
Image discriminator | ||
Patent #
US 6,097,845 A
Filed 10/21/1997
|
Current Assignee
Canon Kabushiki Kaisha
|
Original Assignee
Canon Kabushiki Kaisha
|
Method for selectively booting from a desired peripheral device | ||
Patent #
US 6,105,130 A
Filed 01/30/1998
|
Current Assignee
PMC-Sierra Incorporated
|
Original Assignee
Adaptec Incorporated
|
Broadcast receiving method and broadcast receiving apparatus therefor | ||
Patent #
US 6,104,389 A
Filed 06/12/1998
|
Current Assignee
JVC Kenwood Corporation
|
Original Assignee
Victor Company of Japan Limited
|
Remote control receiver and method of operation | ||
Patent #
US 6,097,520 A
Filed 06/30/1997
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Gateway architecture for data communication bandwidth-constrained and charge-by-use networks | ||
Patent #
US 6,115,384 A
Filed 06/20/1996
|
Current Assignee
Venturi Wireless Incorporated
|
Original Assignee
FOURELLE SYSTEMS INC
|
Non-volatile memory with embedded programmable controller | ||
Patent #
US 6,134,631 A
Filed 10/31/1996
|
Current Assignee
Taiwan Semiconductor Manufacturing Company Limited
|
Original Assignee
Hyundai Electronics America Incorporated
|
Method of optimizing bandwidth for transmitting compressed video data streams | ||
Patent #
US 6,141,053 A
Filed 01/03/1997
|
Current Assignee
Teradata US Inc.
|
Original Assignee
NCR Corporation
|
Statistical data compression/decompression method | ||
Patent #
US 6,128,412 A
Filed 03/31/1997
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
Microcontroller incorporating an enhanced peripheral controller for automatic updating the configuration date of multiple peripherals by using a ferroelectric memory array | ||
Patent #
US 6,145,020 A
Filed 05/14/1998
|
Current Assignee
Silicon Storage Technology Incorporated
|
Original Assignee
Advanced Technology Materials Inc.
|
Parallel decompression and compression system and method for improving storage density and access speed for non-volatile memory and embedded memory devices | ||
Patent #
US 6,145,069 A
Filed 04/26/1999
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Interactive Silicon Inc.
|
Encoding method and system, and decoding method and system | ||
Patent #
US 5,861,824 A
Filed 02/06/1997
|
Current Assignee
Forensic Science Service Limited
|
Original Assignee
Ricoh Company Limited
|
Hierarchical low latency video compression | ||
Patent #
US 5,861,920 A
Filed 11/08/1996
|
Current Assignee
Hughes Electronics Corporation
|
Original Assignee
Hughes Electronics Corporation
|
Method and system for rendering graphical objects to image chunks | ||
Patent #
US 5,864,342 A
Filed 06/27/1996
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Reversible wavelet transform and embedded codestream manipulation | ||
Patent #
US 5,867,602 A
Filed 06/30/1995
|
Current Assignee
Ricoh Company Limited
|
Original Assignee
Ricoh Company Limited, Ricoh Corporation
|
Method of and apparatus for compressing and decompressing data and data processing apparatus and network system using the same | ||
Patent #
US 5,872,530 A
Filed 01/28/1997
|
Current Assignee
Hitachi America Limited
|
Original Assignee
Hitachi America Limited
|
Adaptive multiple dictionary data compression | ||
Patent #
US 5,870,036 A
Filed 02/24/1995
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
MPEG decoder system and method having a unified memory for transport decode and system controller functions | ||
Patent #
US 5,870,087 A
Filed 11/13/1996
|
Current Assignee
Avago Technologies General IP PTE Limited
|
Original Assignee
LSI Logic Corporation
|
Method and apparatus for providing improved data compression efficiency for an adaptive data compressor | ||
Patent #
US 5,874,907 A
Filed 09/19/1997
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Dynamically reconfigurable hardware system for real-time control of processes | ||
Patent #
US 5,887,165 A
Filed 06/20/1997
|
Current Assignee
Hanger Solutions LLC
|
Original Assignee
Mirage Technologies Inc.
|
Lossless compression/decompression of digital audio data | ||
Patent #
US 5,884,269 A
Filed 04/17/1995
|
Current Assignee
MERGING TECHNOLOGIES
|
Original Assignee
MERGING TECHNOLOGIES
|
Disk drive having program to be executed by a second processor stored in a first processor's ROM in a compressed form | ||
Patent #
US 5,889,961 A
Filed 06/27/1996
|
Current Assignee
Western Digital Technologies Incorporated
|
Original Assignee
International Business Machines Corporation
|
Compression and decompression methods on two-dimensional image data | ||
Patent #
US 5,883,975 A
Filed 09/11/1995
|
Current Assignee
Nippon Steel Corporation
|
Original Assignee
Nippon Steel Corporation
|
Arithmetic coding context model that accelerates adaptation for small amounts of data | ||
Patent #
US 5,886,655 A
Filed 04/09/1997
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
HP Inc.
|
Method and apparatus for compressing images | ||
Patent #
US 5,892,847 A
Filed 04/22/1996
|
Current Assignee
Citrix Systems Inc.
|
Original Assignee
Johnson-Grace
|
Apparatus and method for optimizing wireless financial transactions | ||
Patent #
US 5,907,801 A
Filed 09/22/1995
|
Current Assignee
Chanyu Holdings LLC
|
Original Assignee
ATT Wireless Services Incorporated
|
Bus bridge device including data bus of first width for a first processor, memory controller, arbiter circuit and second processor having a different second data width | ||
Patent #
US 5,909,559 A
Filed 04/04/1997
|
Current Assignee
Texas Instruments Inc.
|
Original Assignee
Texas Instruments Inc.
|
Multi-path data processing pipeline | ||
Patent #
US 5,915,079 A
Filed 06/17/1997
|
Current Assignee
HP Inc.
|
Original Assignee
HP Inc.
|
Data storing and outputting apparatus | ||
Patent #
US 5,917,438 A
Filed 06/25/1996
|
Current Assignee
JVC Kenwood Corporation
|
Original Assignee
Victor Company of Japan Limited
|
Reconfigurable interface for small disk drives | ||
Patent #
US 5,918,068 A
Filed 06/03/1997
|
Current Assignee
Mariana HDD B.V.
|
Original Assignee
International Business Machines Corporation
|
SQL-based database system with improved indexing methodology | ||
Patent #
US 5,918,225 A
Filed 03/20/1997
|
Current Assignee
Sybase Incorporated
|
Original Assignee
Sybase Incorporated
|
Caching and coherency control of multiple geometry accelerators in a computer graphics system | ||
Patent #
US 5,920,326 A
Filed 05/30/1997
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
HP Inc.
|
Storage device having a nonvolatile memory for storing user changeable operating parameters | ||
Patent #
US 5,930,358 A
Filed 03/13/1997
|
Current Assignee
Mitsubishi Kagaku Media Company Limited
|
Original Assignee
Mitsubishi Chemical Medience Corporation
|
Apparatus, method and system for remote peripheral component interconnect bus using accelerated graphics port logic circuits | ||
Patent #
US 5,923,860 A
Filed 06/25/1997
|
Current Assignee
Hewlett Packard Enterprise Development LP
|
Original Assignee
Compaq Computer Corporation
|
Mobile client computer system with flash memory management utilizing a virtual address map and variable length data | ||
Patent #
US 5,943,692 A
Filed 04/30/1997
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Method and system for accessing and displaying a compressed display image in a computer system | ||
Patent #
US 5,936,616 A
Filed 08/07/1996
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Adaptive packet compression apparatus and method | ||
Patent #
US 5,945,933 A
Filed 01/27/1998
|
Current Assignee
Riverbed Technology Incorporated
|
Original Assignee
INFIT LTD.
|
Lempel- Ziv data compression technique utilizing a dictionary pre-filled with frequent letter combinations, words and/or phrases | ||
Patent #
US 5,951,623 A
Filed 08/06/1996
|
Current Assignee
Pinpoint Incorporated
|
Original Assignee
Jeffrey C. Reynar, Jason M. Eisner, Fred Herz, Lyle Ungar
|
Data compression for use with a communications channel | ||
Patent #
US 5,955,976 A
Filed 12/02/1997
|
Current Assignee
Hughes Electronics Corporation
|
Original Assignee
Hughes Electronics Corporation
|
Method and apparatus for processing data for a visual-output device with reduced buffer memory requirements | ||
Patent #
US 5,949,968 A
Filed 06/25/1996
|
Current Assignee
Adobe Systems Incorporated
|
Original Assignee
Adobe Systems Incorporated
|
Apparatus and method for directly accessing compressed data utilizing a compressed memory address translation unit and compression descriptor table | ||
Patent #
US 5,960,465 A
Filed 02/27/1997
|
Current Assignee
Oracle International Corporation
|
Original Assignee
Novell Incorporated
|
Method, client device, server and computer readable medium for specifying and negotiating compression of uniform resource identifiers | ||
Patent #
US 5,956,490 A
Filed 06/30/1998
|
Current Assignee
Google Technology Holdings LLC
|
Original Assignee
Motorola Inc.
|
Method and apparatus for adaptive data compression | ||
Patent #
US 5,949,355 A
Filed 08/21/1997
|
Current Assignee
COMPRESSION FINANCING LLC
|
Original Assignee
CENNOID TECHNOLOGIES INC.
|
Tandem operation of input/output data compression modules | ||
Patent #
US 5,968,149 A
Filed 01/07/1998
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Audio recompression from higher rates for karaoke, video games, and other applications | ||
Patent #
US 5,974,387 A
Filed 06/17/1997
|
Current Assignee
Yamaha Corporation
|
Original Assignee
Yamaha Corporation
|
Integrated overload protective device | ||
Patent #
US 5,969,927 A
Filed 10/23/1997
|
Current Assignee
Robert Bosch GmbH
|
Original Assignee
Robert Bosch GmbH
|
Apparatus having flexible capabilities for analysis of video information | ||
Patent #
US 5,974,235 A
Filed 10/31/1996
|
Current Assignee
Sensormatic Electronics LLC
|
Original Assignee
Sensormatic Electronics Corporation
|
Data compression for use with a communications channel | ||
Patent #
US 5,973,630 A
Filed 03/01/1999
|
Current Assignee
Hughes Electronics Corporation
|
Original Assignee
Hughes Electronics Corporation
|
Computer system having distributed compression and decompression logic for compressed data movement | ||
Patent #
US 5,974,471 A
Filed 07/19/1996
|
Current Assignee
GlobalFoundries Inc.
|
Original Assignee
Advanced Micro Devices Inc.
|
Method and apparatus for scaling data compression based on system capacity | ||
Patent #
US 5,964,842 A
Filed 01/31/1997
|
Current Assignee
Network Computing Devices Incorporated
|
Original Assignee
Network Computing Devices Incorporated
|
Method and apparatus for compressing and decompressing data prior to display | ||
Patent #
US 5,991,515 A
Filed 07/15/1997
|
Current Assignee
Adobe Systems Incorporated
|
Original Assignee
Adobe Systems Incorporated
|
Adaptive-selection method for memory access priority control in MPEG processor | ||
Patent #
US 5,982,360 A
Filed 09/30/1997
|
Current Assignee
United Microelectronics Corporation
|
Original Assignee
United Microelectronics Corporation
|
Securely encrypted remote keyless entry system | ||
Patent #
US 5,978,483 A
Filed 06/18/1997
|
Current Assignee
Inkel Corporation
|
Original Assignee
Inkel Corporation
|
Apparatus and method for hybrid compression of raster data | ||
Patent #
US 5,982,937 A
Filed 12/24/1996
|
Current Assignee
Electronics For Imaging Incorporated
|
Original Assignee
Electronics For Imaging Incorporated
|
PC circuits, systems and methods | ||
Patent #
US 5,987,590 A
Filed 03/24/1997
|
Current Assignee
Texas Instruments Inc.
|
Original Assignee
Texas Instruments Inc.
|
Control of multimedia information with interface specification stored on multimedia component | ||
Patent #
US 5,990,884 A
Filed 05/02/1997
|
Current Assignee
Sony Electronics Inc., Sony Corporation
|
Original Assignee
Sony Electronics Inc., Sony Corporation
|
Data recording and reproducing method for multi-layered optical disk system | ||
Patent #
US 5,982,723 A
Filed 09/30/1996
|
Current Assignee
Disk Authoring Technologies LLC
|
Original Assignee
LaserDynamics Inc.
|
Data compression device comprising input connector for connecting to game player system, output connector for connecting to memory card, and virtual memory page switch | ||
Patent #
US 5,996,033 A
Filed 09/04/1997
|
Current Assignee
Cheng Chiu-Hao
|
Original Assignee
Cheng Chiu-Hao
|
Fault-tolerant central ticker plant system for distributing financial market data | ||
Patent #
US 5,987,432 A
Filed 12/29/1997
|
Current Assignee
Reuters Limited
|
Original Assignee
Reuters Limited
|
Method for transmitting multiple-protocol packetized data | ||
Patent #
US 5,987,022 A
Filed 12/27/1996
|
Current Assignee
Motorola Solutions Inc.
|
Original Assignee
Motorola Inc.
|
Method and apparatus for switching between data compression modes | ||
Patent #
US 6,008,743 A
Filed 11/19/1997
|
Current Assignee
Uniloc 2017 LLC
|
Original Assignee
International Business Machines Corporation
|
Method and apparatus for allocation of disk memory space for compressed data records | ||
Patent #
US 6,000,009 A
Filed 05/06/1997
|
Current Assignee
Western Digital Technologies Incorporated
|
Original Assignee
International Business Machines Corporation
|
Method and apparatus for predictive loading of a cache | ||
Patent #
US 6,003,115 A
Filed 07/29/1997
|
Current Assignee
Power Management Enterprises LLC
|
Original Assignee
Quarterdeck Corp.
|
Integrated video and memory controller with data processing and graphical processing capabilities | ||
Patent #
US 6,002,411 A
Filed 11/16/1994
|
Current Assignee
Intellectual Ventures I LLC
|
Original Assignee
Interactive Silicon Inc.
|
Method for adaptively compressing residual digital image data in a DPCM compression system | ||
Patent #
US 5,708,511 A
Filed 10/17/1996
|
Current Assignee
Harris Corporation
|
Original Assignee
Eastman Kodak Company
|
Packet-based dynamic de-skewing for network switch with local or central clock | ||
Patent #
US 5,719,862 A
Filed 05/14/1996
|
Current Assignee
Diodes Incorporated
|
Original Assignee
Pericom Semiconductor Corporation
|
Apparatus and method for peripheral device control with integrated data compression | ||
Patent #
US 5,715,477 A
Filed 12/04/1996
|
Current Assignee
PDACO LIMITED
|
Original Assignee
ELONEX I.P. HOLDINGS
|
Apparatus for data compression and data decompression | ||
Patent #
US 5,717,393 A
Filed 07/19/1996
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
Apparatus and method for peripheral device control with integrated data compression | ||
Patent #
US 5,721,958 A
Filed 12/04/1996
|
Current Assignee
PDACO LIMITED
|
Original Assignee
ELONEX I.P. HOLDINGS
|
Compressed digital video reload and playback system | ||
Patent #
US 5,724,475 A
Filed 05/18/1995
|
Current Assignee
TIMEPRES CORPORATION
|
Original Assignee
Jeff P. Kirsten
|
Parallel compression and decompression using a cooperative dictionary | ||
Patent #
US 5,729,228 A
Filed 07/06/1995
|
Current Assignee
GlobalFoundries Inc.
|
Original Assignee
International Business Machines Corporation
|
Method and apparatus for cleaning up a solid state memory disk storing floating sector data | ||
Patent #
US 5,740,395 A
Filed 10/30/1992
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Method and system for audio compression negotiation for multiple channels | ||
Patent #
US 5,742,773 A
Filed 04/18/1996
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Method and system for segment encoded graphic data compression | ||
Patent #
US 5,748,904 A
Filed 09/13/1996
|
Current Assignee
XGI Technology Inc.
|
Original Assignee
Silicon Integrated Systems Corporation USA
|
Method for compression of high resolution seismic data | ||
Patent #
US 5,757,852 A
Filed 01/24/1997
|
Current Assignee
WesternGeco LLC
|
Original Assignee
Western Atlas International Incorporated
|
Data compression method and print processing device utilizing the same | ||
Patent #
US 5,771,340 A
Filed 12/18/1996
|
Current Assignee
OKI Electric Industry Company Limited
|
Original Assignee
OKI Electric Industry Company Limited
|
Compression and decompression scheme performed on shared workstation memory by media coprocessor | ||
Patent #
US 5,768,445 A
Filed 09/13/1996
|
Current Assignee
Samsung Electronics Co. Ltd.
|
Original Assignee
Silicon Graphics Incorporated
|
Source data compression and decompression in code symbol printing and decoding | ||
Patent #
US 5,764,774 A
Filed 09/25/1995
|
Current Assignee
Intermec IP Corporation
|
Original Assignee
Intermec Corporation
|
Network controller which enables the local processor to have greater access to at least one memory device than the host computer in response to a control signal | ||
Patent #
US 5,765,027 A
Filed 09/26/1994
|
Current Assignee
Toshiba America Information Systems Incorporated
|
Original Assignee
Toshiba America Information Systems Incorporated
|
File system level compression using holes | ||
Patent #
US 5,774,715 A
Filed 03/27/1996
|
Current Assignee
Oracle America Inc.
|
Original Assignee
Sun Microsystems Incorporated
|
Method for virtual to physical mapping in a mapped compressed virtual storage subsystem | ||
Patent #
US 5,778,411 A
Filed 09/18/1997
|
Current Assignee
NetApp Inc.
|
Original Assignee
Symbion Incorporated
|
Package blocking method for a storage system having a bus common to a plurality of kinds of groups of packages | ||
Patent #
US 5,781,767 A
Filed 10/31/1996
|
Current Assignee
Hitachi America Limited, Hitachi Ltd.
|
Original Assignee
Hitachi America Limited
|
Information storage system for converting data at transfer | ||
Patent #
US 5,787,487 A
Filed 03/21/1997
|
Current Assignee
Fuji Xerox Company Limited
|
Original Assignee
Fuji Xerox Company Limited
|
Method and apparatus for real-time lossless compression and decompression of image data | ||
Patent #
US 5,796,864 A
Filed 01/04/1995
|
Current Assignee
Apple Inc.
|
Original Assignee
Apple Computer Incorporated
|
Hierarchical adaptive multistage vector quantization | ||
Patent #
US 5,799,110 A
Filed 11/09/1995
|
Current Assignee
Utah Valley University
|
Original Assignee
Utah Valley University
|
Database system with methodology for storing a database table by vertically partitioning all columns of the table | ||
Patent #
US 5,794,229 A
Filed 12/11/1995
|
Current Assignee
Sybase Incorporated
|
Original Assignee
Sybase Incorporated
|
Hot reconfigurable parallel bus bridging circuit | ||
Patent #
US 5,805,834 A
Filed 08/01/1996
|
Current Assignee
Acacia Patent Acquisition LLC
|
Original Assignee
ZiLOG Incorporated
|
System for transmitting compressed data if compression ratio is at least preset ratio and pre-compressed data if compression ratio is less than preset ratio | ||
Patent #
US 5,805,932 A
Filed 02/13/1996
|
Current Assignee
Sony Corporation
|
Original Assignee
Sony Corporation
|
Video compression using an iterative correction data coding method and systems | ||
Patent #
US 5,812,195 A
Filed 07/22/1997
|
Current Assignee
Envistech Incorporated
|
Original Assignee
Envistech Incorporated
|
Mass storage devices utilizing high speed serial communications | ||
Patent #
US 5,809,337 A
Filed 03/29/1996
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Video on-demand system with a plurality of reception apparatus connected in a daisy chain connection | ||
Patent #
US 5,808,660 A
Filed 09/04/1996
|
Current Assignee
Rockwell Collins Inc.
|
Original Assignee
Sony Corporation
|
Image data encoder/decoder system which divides uncompresed image data into a plurality of streams and method thereof | ||
Patent #
US 5,809,176 A
Filed 10/18/1995
|
Current Assignee
Seiko Epson Corporation
|
Original Assignee
Seiko Epson Corporation
|
Method of and apparatus for reduction of bandwidth requirements in the provision of electronic information and transaction services through communication networks | ||
Patent #
US 5,809,299 A
Filed 08/14/1996
|
Current Assignee
Morgan Signals LLC
|
Original Assignee
Home Information Services Incorporated
|
Method and apparatus for the compression of audio, video or other data | ||
Patent #
US 5,825,830 A
Filed 08/17/1995
|
Current Assignee
David A. Kopf
|
Original Assignee
David A. Kopf
|
Method and apparatus for wavelet based data compression having adaptive bit rate control for compression of digital audio or other sensory data | ||
Patent #
US 5,819,215 A
Filed 10/13/1995
|
Current Assignee
Hewlett Packard Enterprise Development LP
|
Original Assignee
US Robotics Mobile Communication Corporation
|
MPEG system which decompresses and recompresses image data before storing image data in a memory and in accordance with a resolution of a display device | ||
Patent #
US 5,825,424 A
Filed 06/19/1996
|
Current Assignee
Thomson Consumer Electronics Incorporated
|
Original Assignee
Thomson Consumer Electronics Incorporated
|
Sector-based storage device emulator having variable-sized sector | ||
Patent #
US 5,822,781 A
Filed 10/30/1992
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
MPEG compatible decoder including a dual stage data reduction network | ||
Patent #
US 5,818,530 A
Filed 06/19/1996
|
Current Assignee
Thomson Consumer Electronics Incorporated
|
Original Assignee
Thomson Consumer Electronics Incorporated
|
Method and apparatus for lossless digital data compression | ||
Patent #
US 5,818,368 A
Filed 04/18/1997
|
Current Assignee
Premier Research Labs
|
Original Assignee
Premier Research Labs
|
Method and apparatus for selecting compression method and for compressing file using the selected method | ||
Patent #
US 5,838,821 A
Filed 03/14/1996
|
Current Assignee
Ricoh Company Limited
|
Original Assignee
Ricoh Company Limited
|
Method and apparatus for compressing mixed text and image data | ||
Patent #
US 5,832,126 A
Filed 07/03/1996
|
Current Assignee
Oki Data Corporation
|
Original Assignee
Oki Data Corporation
|
System for determining presence of hardware decompression, selectively enabling hardware-based and software-based decompression, and conditioning the hardware when hardware decompression is available | ||
Patent #
US 5,838,996 A
Filed 05/31/1994
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Lossless and loss-limited compression of sampled data signals | ||
Patent #
US 5,839,100 A
Filed 04/22/1996
|
Current Assignee
Altera Corporation
|
Original Assignee
Albert William Wegener
|
Method of compressing and expanding data | ||
Patent #
US 5,832,037 A
Filed 06/24/1996
|
Current Assignee
Hanwha Techwin Co. Ltd.
|
Original Assignee
Samsung Electronics Co. Ltd.
|
Method and apparatus for compressing a continuous, indistinct data stream | ||
Patent #
US 5,838,927 A
Filed 11/22/1996
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
WEBTV NETWORKS
|
System for transferring input/output data independently through an input/output bus interface in response to programmable instructions stored in a program memory | ||
Patent #
US 5,835,788 A
Filed 09/18/1996
|
Current Assignee
Electronics For Imaging Incorporated
|
Original Assignee
Electronics For Imaging Incorporated
|
Methods and means for image and voice compression | ||
Patent #
US 5,836,003 A
Filed 12/13/1996
|
Current Assignee
Amstr Investments 2 KG LLC
|
Original Assignee
Visnet Ltd.
|
Data compression method and apparatus | ||
Patent #
US 5,850,565 A
Filed 08/26/1996
|
Current Assignee
Micro Focus Software Inc.
|
Original Assignee
Novell Incorporated
|
MPEG system which decompresses and then recompresses MPEG video data before storing said recompressed MPEG video data into memory | ||
Patent #
US 5,847,762 A
Filed 12/27/1995
|
Current Assignee
Thomson Consumer Electronics Incorporated
|
Original Assignee
Thomson Consumer Electronics Incorporated
|
Storing plural data records on tape in an entity with an index entry common to those records | ||
Patent #
US 5,598,388 A
Filed 01/06/1994
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
HP Inc.
|
State machine apparatus and methods for encoding data in serial form and decoding using multiple tables | ||
Patent #
US 5,596,674 A
Filed 05/26/1993
|
Current Assignee
Sony United Kingdom Limited, Sony Corporation
|
Original Assignee
Sony United Kingdom Limited, Sony Corporation
|
Method and apparatus for compression and decompression of documents and the like using splines and spline-wavelets | ||
Patent #
US 5,604,824 A
Filed 09/22/1994
|
Current Assignee
Foto-Wear Inc.
|
Original Assignee
Houston Advanced Research Center
|
Data storing system and data transfer method | ||
Patent #
US 5,606,706 A
Filed 08/22/1994
|
Current Assignee
Hitachi America Limited, Hitachi Ltd.
|
Original Assignee
Hitachi America Limited
|
Image compression technique | ||
Patent #
US 5,615,287 A
Filed 12/02/1994
|
Current Assignee
Lawrence Livermore National Security LLC
|
Original Assignee
Regents of the University of California
|
Non-blocking packet switching network with dynamic routing codes having incoming packets diverted and temporarily stored in processor inputs when network ouput is not available | ||
Patent #
US 5,613,069 A
Filed 12/16/1994
|
Current Assignee
Tony Walker
|
Original Assignee
Tony Walker
|
Video data compression apparatus for recording and reproducing compressed video data at their various compressed data rates | ||
Patent #
US 5,612,788 A
Filed 05/18/1994
|
Current Assignee
Sony United Kingdom Limited, Sony Corporation
|
Original Assignee
Sony United Kingdom Limited, Sony Corporation
|
Video compression using an iterative error data coding method | ||
Patent #
US 5,610,657 A
Filed 09/14/1993
|
Current Assignee
Envistech Incorporated
|
Original Assignee
Envistech Incorporated
|
Data compression of bit map images | ||
Patent #
US 5,611,024 A
Filed 08/28/1992
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
Compaq Computer Corporation
|
Method of and control circuit for compression recording and reproducing of multiple images | ||
Patent #
US 5,615,017 A
Filed 11/18/1992
|
Current Assignee
Samsung Electronics Co. Ltd.
|
Original Assignee
Samsung Electronics Co. Ltd.
|
Motion video transformation system and method | ||
Patent #
US 5,619,995 A
Filed 06/14/1994
|
Current Assignee
Suave M. Lobodzinski
|
Original Assignee
Suave M. Lobodzinski
|
Data compression method and structure for a direct access storage device | ||
Patent #
US 5,623,701 A
Filed 06/06/1995
|
Current Assignee
Western Digital Technologies Incorporated
|
Original Assignee
International Business Machines Corporation
|
Digital storage system adopting semiconductor memory device | ||
Patent #
US 5,623,623 A
Filed 05/11/1995
|
Current Assignee
Samsung Electronics Co. Ltd.
|
Original Assignee
Samsung Electronics Co. Ltd.
|
System and method for transferring compressed and uncompressed data between storage systems | ||
Patent #
US 5,630,092 A
Filed 01/02/1996
|
Current Assignee
International Business Machines SA
|
Original Assignee
International Business Machines SA
|
Dual stage compression of bit mapped image data using refined run length and LZ compression | ||
Patent #
US 5,627,534 A
Filed 03/23/1995
|
Current Assignee
Pendragon Networks LLC
|
Original Assignee
International Business Machines Corporation
|
Data compression and decompression using memory spaces of more than one size | ||
Patent #
US 5,627,995 A
Filed 06/01/1994
|
Current Assignee
Digital Data Funding LLC
|
Original Assignee
Alfred P. Gnadinger
|
Viewer controllable on-demand multimedia service | ||
Patent #
US 5,629,732 A
Filed 03/29/1994
|
Current Assignee
Trustees Of Columbia University In The City Of New York
|
Original Assignee
Trustees Of Columbia University In The City Of New York
|
Lempel-ziv compression with expulsion of dictionary buffer matches | ||
Patent #
US 5,635,932 A
Filed 07/21/1995
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
Settling process analysis device and method | ||
Patent #
US 5,635,632 A
Filed 04/26/1994
|
Current Assignee
Cytec Technology Corp.
|
Original Assignee
Cytec Technology Corp.
|
Reversible method of encoding data | ||
Patent #
US 5,640,158 A
Filed 09/14/1995
|
Current Assignee
Seiko Epson Corporation
|
Original Assignee
Seiko Epson Corporation
|
Method and apparatus for reducing storage requirements for display data | ||
Patent #
US 5,638,498 A
Filed 06/07/1995
|
Current Assignee
Adobe Systems Incorporated
|
Original Assignee
Adobe Systems Incorporated
|
Method and apparatus for initializing a multiprocessor system | ||
Patent #
US 5,642,506 A
Filed 01/16/1996
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
System for automatically aligning images to form a mosaic image | ||
Patent #
US 5,649,032 A
Filed 11/14/1994
|
Current Assignee
Sarnoff Corporation
|
Original Assignee
David Sarnoff Research Center Inc.
|
System for transmitting and receiving combination of compressed digital information and embedded strobe bit between computer and external device through parallel printer port of computer | ||
Patent #
US 5,652,917 A
Filed 07/30/1996
|
Current Assignee
Video Associates Labs Inc.
|
Original Assignee
VIDEO ASSOCIATES LABS INC.
|
Disk control apparatus for recording and reproducing compression data to physical device of direct access type | ||
Patent #
US 5,652,857 A
Filed 01/29/1996
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
Method and apparatus for an adapter card providing conditional access in a communication system | ||
Patent #
US 5,652,795 A
Filed 11/13/1995
|
Current Assignee
JP Morgan Chase Bank N.A.
|
Original Assignee
Hughes Electronics Corporation
|
Apparatus and method for peripheral device control with integrated data compression | ||
Patent #
US 5,655,138 A
Filed 04/11/1995
|
Current Assignee
PDACO LIMITED
|
Original Assignee
ELONEX I. P. HOLDINGS
|
Parallel data compression and decompression | ||
Patent #
US 5,654,703 A
Filed 06/17/1996
|
Current Assignee
Hewlett Packard Enterprise Development LP
|
Original Assignee
HP Inc.
|
Method and apparatus for providing basic input/output services in a computer | ||
Patent #
US 5,671,413 A
Filed 10/31/1994
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
High-speed data processor and coding method | ||
Patent #
US 5,668,737 A
Filed 03/22/1995
|
Current Assignee
CSR Technology Incorporated
|
Original Assignee
PIXEL MAGIC INC.
|
Digital video data compression technique | ||
Patent #
US 5,673,370 A
Filed 05/09/1996
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Adaptive compression caching for tape recording | ||
Patent #
US 5,671,389 A
Filed 01/11/1996
|
Current Assignee
Quantum Corporation
|
Original Assignee
Quantum Corporation
|
Storage method and hierarchical padding structure for direct access storage device (DASD) data compression | ||
Patent #
US 5,666,560 A
Filed 08/03/1995
|
Current Assignee
Western Digital Technologies Incorporated
|
Original Assignee
International Business Machines Corporation
|
File compression processor monitoring current available capacity and threshold value | ||
Patent #
US 5,675,789 A
Filed 06/26/1996
|
Current Assignee
NEC Corporation
|
Original Assignee
NEC Corporation
|
Multi-code-book variable length decoder | ||
Patent #
US 5,686,916 A
Filed 12/28/1995
|
Current Assignee
US Philips Corporation
|
Original Assignee
Philips Electronics North America Corporation
|
System for exclusively controlling access of a semiconductor memory module using a backup memory and compression and decompression techniques | ||
Patent #
US 5,694,619 A
Filed 06/16/1994
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
Memory paging system and method including compressed page mapping hierarchy | ||
Patent #
US 5,696,927 A
Filed 12/21/1995
|
Current Assignee
GlobalFoundries Inc.
|
Original Assignee
Advanced Micro Devices Inc.
|
Method and apparatus for iterative compression of digital data | ||
Patent #
US 5,486,826 A
Filed 05/19/1994
|
Current Assignee
USATALKS.COM INC.
|
Original Assignee
PS VENTURE 1 LLC
|
Method and apparatus for compressing and decompressing short blocks of data | ||
Patent #
US 5,488,365 A
Filed 03/01/1994
|
Current Assignee
HP Inc.
|
Original Assignee
HP Inc.
|
Timing verification by successive approximation | ||
Patent #
US 5,483,470 A
Filed 06/29/1992
|
Current Assignee
Nokia of America Corporation
|
Original Assignee
ATT Inc.
|
Recursive data compression | ||
Patent #
US 5,488,364 A
Filed 02/28/1994
|
Current Assignee
Sam H. Eulmi
|
Original Assignee
Sam H. Eulmi
|
Device for encoding and decoding transmission signals through adaptive selection of transforming methods | ||
Patent #
US 5,495,244 A
Filed 10/12/1994
|
Current Assignee
Samsung Electronics Co. Ltd.
|
Original Assignee
Samsung Electronics Co. Ltd.
|
Method and apparatus for processing data for a visual-output device with reduced buffer memory requirements | ||
Patent #
US 5,504,842 A
Filed 06/06/1995
|
Current Assignee
Adobe Systems Incorporated
|
Original Assignee
Adobe Systems Incorporated
|
Method and apparatus for processing data for a visual-output device with reduced buffer memory requirements | ||
Patent #
US 5,506,944 A
Filed 06/06/1995
|
Current Assignee
Adobe Systems Incorporated
|
Original Assignee
Adobe Systems Incorporated
|
Method for configuring a statistical multiplexer to dynamically allocate communication channel bandwidth | ||
Patent #
US 5,506,844 A
Filed 05/20/1994
|
Current Assignee
Google Technology Holdings LLC
|
Original Assignee
Compression Labs Incorporated
|
Method and device for the compression and decompression of data in a transmission system | ||
Patent #
US 5,521,940 A
Filed 08/02/1994
|
Current Assignee
OUEST STANDARD TLEMATIQUE S.A.
|
Original Assignee
OUEST STANDARD TELEMATIQUE SA
|
Storage control subsystem implemented with an application program on a computer | ||
Patent #
US 5,530,845 A
Filed 01/17/1995
|
Current Assignee
SBC Technology Resources Inc.
|
Original Assignee
Southwestern Bell Technology Resources Inc.
|
Apparatus for variable-length coding and variable-length-decoding using a plurality of Huffman coding tables | ||
Patent #
US 5,528,628 A
Filed 01/31/1995
|
Current Assignee
Samsung Electronics Co. Ltd.
|
Original Assignee
Samsung Electronics Co. Ltd.
|
Distributed directory method and structure for direct access storage device (DASD) data compression | ||
Patent #
US 5,537,658 A
Filed 06/07/1995
|
Current Assignee
HGST Netherlands B.V.
|
Original Assignee
International Business Machines Corporation
|
Method for allocating memory in a solid state memory disk | ||
Patent #
US 5,535,369 A
Filed 06/07/1995
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Digital data recording/playback system utilizing EEPROM and ROM memories as a storage medium | ||
Patent #
US 5,535,356 A
Filed 09/09/1992
|
Current Assignee
Samsung Electronics Co. Ltd.
|
Original Assignee
Samsung Electronics Co. Ltd.
|
Method and apparatus for image-type determination to enable choice of an optimum data compression procedure | ||
Patent #
US 5,535,311 A
Filed 07/28/1994
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
HP Inc.
|
Method and apparatus for processing data for a visual-output device with reduced buffer memory requirements | ||
Patent #
US 5,539,865 A
Filed 11/10/1992
|
Current Assignee
Adobe Systems Incorporated
|
Original Assignee
Adobe Systems Incorporated
|
Halftone computer imager | ||
Patent #
US 5,542,031 A
Filed 04/30/1993
|
Current Assignee
Benjamin D. Newman, Clay S. Douglass, Ying W. Chan, Paul A. Snow
|
Original Assignee
Benjamin D. Newman, Clay S. Douglass, Ying W. Chan, Paul A. Snow
|
Method and apparatus for processing data for a visual-output device with reduced buffer memory requirements | ||
Patent #
US 5,544,290 A
Filed 06/06/1995
|
Current Assignee
Adobe Systems Incorporated
|
Original Assignee
Adobe Systems Incorporated
|
Produce recognition system | ||
Patent #
US 5,546,475 A
Filed 04/29/1994
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
System for automatically compressing and decompressing data for sender and receiver processes upon determination of a common compression/decompression method understood by both sender and receiver processes | ||
Patent #
US 5,557,749 A
Filed 10/15/1992
|
Current Assignee
Micron Technology Inc.
|
Original Assignee
Intel Corporation
|
Method and apparatus for a thermal protection unit | ||
Patent #
US 5,557,551 A
Filed 07/18/1995
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Method and apparatus for dynamically selecting an image compression process based on image size and color resolution | ||
Patent #
US 5,553,160 A
Filed 09/01/1994
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Storage management of data for ensuring communication of minimal length data | ||
Patent #
US 5,561,824 A
Filed 10/04/1994
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Access method data compression with system-built generic dictionaries | ||
Patent #
US 5,561,421 A
Filed 07/28/1994
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Storing compressed data in non-contiguous memory | ||
Patent #
US 5,574,953 A
Filed 08/19/1994
|
Current Assignee
HP Inc.
|
Original Assignee
HP Inc.
|
Method and apparatus for finding longest and closest matching string in history buffer prior to current string | ||
Patent #
US 5,577,248 A
Filed 06/06/1995
|
Current Assignee
Symantec Corporation
|
Original Assignee
Salient Software Inc.
|
Data storage system and method for operating a disk controller including allocating disk space for compressed data | ||
Patent #
US 5,574,952 A
Filed 05/11/1994
|
Current Assignee
Western Digital Technologies Incorporated
|
Original Assignee
International Business Machines Corporation
|
Electronic translating device | ||
Patent #
US 5,576,953 A
Filed 09/07/1994
|
Current Assignee
Peter S. Stutman
|
Original Assignee
Max Hugentobler
|
Video optimized media streamer with cache management | ||
Patent #
US 5,586,264 A
Filed 09/08/1994
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Memory card management system for writing data with usage and recording codes made significant | ||
Patent #
US 5,590,306 A
Filed 07/20/1993
|
Current Assignee
Fujifilm Corporation
|
Original Assignee
Fuji Photo Film Co Limited
|
Method and circuitry for increasing reserve memory in a solid state memory disk | ||
Patent #
US 5,586,285 A
Filed 02/19/1993
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
IDE/ATA CD drive controller having a digital signal processor interface, dynamic random access memory, data error detection and correction, and a host interface | ||
Patent #
US 5,581,715 A
Filed 06/22/1994
|
Current Assignee
CSR Technology Incorporated
|
Original Assignee
Oak Technology Partners
|
Method of compressing endoscope image data based on image characteristics | ||
Patent #
US 5,379,757 A
Filed 11/30/1992
|
Current Assignee
Olympus Optical Corporation Limited
|
Original Assignee
Olympus Optical Corporation Limited
|
Method and apparatus for data compression | ||
Patent #
US 5,379,036 A
Filed 04/01/1992
|
Current Assignee
James A. Storer
|
Original Assignee
James A. Storer
|
Data compression/decompression and storage of compressed and uncompressed data on a same removable data storage medium | ||
Patent #
US 5,394,534 A
Filed 09/11/1992
|
Current Assignee
MediaTek Inc.
|
Original Assignee
International Business Machines Corporation
|
Compression using small dictionaries with applications to network packets | ||
Patent #
US 5,389,922 A
Filed 04/13/1993
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
HP Inc.
|
System and method for transmitting a plurality of digital services | ||
Patent #
US 5,400,401 A
Filed 10/30/1992
|
Current Assignee
Cisco Technology Incorporated
|
Original Assignee
Scientific-Atlanta Incorporated
|
File server having snapshot application data groups | ||
Patent #
US 5,403,639 A
Filed 09/02/1992
|
Current Assignee
Storage Technologies Corporation
|
Original Assignee
Storage Technologies Corporation
|
Data compression/decompression processor | ||
Patent #
US 5,410,671 A
Filed 05/21/1993
|
Current Assignee
VIA-Cyrix Inc.
|
Original Assignee
Cyrix Corp
|
General purpose, hash-based technique for single-pass lossless data compression | ||
Patent #
US 5,406,279 A
Filed 09/02/1992
|
Current Assignee
Cirrus Logic Incorporated
|
Original Assignee
Cirrus Logic Incorporated
|
Method and apparatus for data compression having an improved matching algorithm which utilizes a parallel hashing technique | ||
Patent #
US 5,406,278 A
Filed 02/28/1992
|
Current Assignee
INTERSECTING CONCEPTS INC.
|
Original Assignee
INTERSECTING CONCEPTS INC.
|
System for transparently compressing data files in a computer system | ||
Patent #
US 5,414,850 A
Filed 08/23/1991
|
Current Assignee
Hifn Inc.
|
Original Assignee
STAC Electronics Incorporated
|
Rate adaptive huffman coding | ||
Patent #
US 5,420,639 A
Filed 04/01/1993
|
Current Assignee
Cisco Technology Incorporated
|
Original Assignee
Scientific-Atlanta Incorporated
|
Method and system for adaptively building a static Ziv-Lempel dictionary for database compression | ||
Patent #
US 5,412,384 A
Filed 08/10/1994
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Method and circuitry for detecting lost sectors of data in a solid state memory disk | ||
Patent #
US 5,437,020 A
Filed 10/03/1992
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Cache memory support in an integrated memory system | ||
Patent #
US 5,454,107 A
Filed 11/30/1993
|
Current Assignee
Mosaid Technologies Incorporated
|
Original Assignee
VLSI Technology Inc.
|
Computer workstation | ||
Patent #
US 5,454,079 A
Filed 09/28/1993
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Data compression apparatus and method | ||
Patent #
US 5,463,390 A
Filed 07/21/1994
|
Current Assignee
Hifn Inc.
|
Original Assignee
STAC Electronics Incorporated
|
Apparatus for compressing and decompressing image data | ||
Patent #
US 5,455,680 A
Filed 11/17/1993
|
Current Assignee
Samsung Electronics Co. Ltd.
|
Original Assignee
Samsung Electronics Co. Ltd.
|
Method and apparatus for encoding/decoding image data | ||
Patent #
US 5,461,679 A
Filed 05/14/1993
|
Current Assignee
Apple Inc.
|
Original Assignee
Apple Computer Incorporated
|
Apparatus and methods for Lempel Ziv data compression with improved management of multiple dictionaries in content addressable memory | ||
Patent #
US 5,455,576 A
Filed 02/07/1994
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
HP Inc.
|
High speed lossless data compression system | ||
Patent #
US 5,467,087 A
Filed 12/18/1992
|
Current Assignee
Apple Inc.
|
Original Assignee
Apple Computer Incorporated
|
Page printer having adaptive data compression for memory minimization | ||
Patent #
US 5,479,587 A
Filed 09/03/1992
|
Current Assignee
HP Inc.
|
Original Assignee
HP Inc.
|
Method of controlling clean-up of a solid state memory disk storing floating sector data | ||
Patent #
US 5,479,633 A
Filed 10/30/1992
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Storage of compressed data with algorithm | ||
Patent #
US 5,280,600 A
Filed 11/18/1991
|
Current Assignee
HP Inc.
|
Original Assignee
HP Inc.
|
Programmable multiple I/O interface controller | ||
Patent #
US 5,289,580 A
Filed 05/10/1991
|
Current Assignee
Unisys Corporation
|
Original Assignee
Unisys Corporation
|
Method for image compression on a personal computer | ||
Patent #
US 5,287,420 A
Filed 04/08/1992
|
Current Assignee
Autodesk Inc.
|
Original Assignee
SUPERMAC TECHNOLOGY
|
Packet-based data compression method | ||
Patent #
US 5,293,379 A
Filed 05/27/1993
|
Current Assignee
Zarlink Semiconductor Inc.
|
Original Assignee
Gandalf Technologies Inc.
|
Disk operating system loadable from read only memory using installable file system interface | ||
Patent #
US 5,307,497 A
Filed 06/25/1990
|
Current Assignee
Lenovo Singapore Pte Limited
|
Original Assignee
International Business Machines Corporation
|
Realtime communication of hand drawn images in a multiprogramming window environment | ||
Patent #
US 5,309,555 A
Filed 05/14/1992
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Adaptive data compression system | ||
Patent #
US 5,319,682 A
Filed 12/09/1991
|
Current Assignee
CRAY COMMUNICATIONS LIMITED
|
Original Assignee
CRAY COMMUNICATIONS LIMITED
|
Image data encoding apparatus providing increased encoding efficiency with reduced dependency on image content | ||
Patent #
US 5,331,425 A
Filed 01/09/1992
|
Current Assignee
Panasonic Communications Company Limited
|
Original Assignee
Matsushita Graphic Communication Systems Inc.
|
Method and apparatus for increasing information compressibility | ||
Patent #
US 5,341,440 A
Filed 07/12/1991
|
Current Assignee
Joseph G. Earl, Michael D. Moffitt
|
Original Assignee
Joseph G. Earl, Michael D. Moffitt
|
Method and apparatus for compression and decompression of digital image data | ||
Patent #
US 5,347,600 A
Filed 10/23/1991
|
Current Assignee
MediaBin Inc.
|
Original Assignee
INTERATED SYSTEMS INC.
|
Image processing device | ||
Patent #
US 5,353,132 A
Filed 06/22/1992
|
Current Assignee
Canon Ayutthaya Limited
|
Original Assignee
Canon Kabushiki Kaisha
|
Cardiac stimulator with data converter for cardiac signal | ||
Patent #
US 5,354,315 A
Filed 06/04/1993
|
Current Assignee
Intermedics Incorporated
|
Original Assignee
Intermedics Incorporated
|
Data compression controller | ||
Patent #
US 5,357,614 A
Filed 09/17/1992
|
Current Assignee
Tecmar Technologies Inc.
|
Original Assignee
REXONTECMAR INC.
|
Method and apparatus for booting a computer system without loading a device driver into memory | ||
Patent #
US 5,355,498 A
Filed 08/30/1993
|
Current Assignee
Sun Microsystems Incorporated
|
Original Assignee
Sun Microsystems Incorporated
|
Apparatus and method for managing multiple dictionaries in content addressable memory based data compression | ||
Patent #
US 5,373,290 A
Filed 12/23/1992
|
Current Assignee
HP Inc.
|
Original Assignee
HP Inc.
|
Automatic electronic data type identification process | ||
Patent #
US 5,374,916 A
Filed 12/18/1992
|
Current Assignee
Apple Inc.
|
Original Assignee
Apple Computer Incorporated
|
Apparatus for retrieval and processing of selected archived images for display at workstation terminals | ||
Patent #
US 5,179,651 A
Filed 02/05/1991
|
Current Assignee
Massachusetts General Hospital
|
Original Assignee
Massachusetts General Hospital
|
Processor with hierarchal memory and using meta-instructions for software control of loading, unloading and execution of machine instructions stored in the cache | ||
Patent #
US 5,187,793 A
Filed 01/09/1989
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Recording apparatus having plural operating modes involving diverse signal compression rates and different apportioning of pilot signal recording area | ||
Patent #
US 5,191,431 A
Filed 08/13/1990
|
Current Assignee
Canon Kabushiki Kaisha
|
Original Assignee
Canon Kabushiki Kaisha
|
Method for high-quality compression of binary text images | ||
Patent #
US 5,204,756 A
Filed 07/30/1990
|
Current Assignee
IPG Healthcare 501 Limited
|
Original Assignee
International Business Machines Corporation
|
Method and apparatus for encoding/decoding image data | ||
Patent #
US 5,212,742 A
Filed 05/24/1991
|
Current Assignee
Apple Inc.
|
Original Assignee
Apple Computer Incorporated
|
Endoscope image data compressing apparatus | ||
Patent #
US 5,209,220 A
Filed 08/28/1990
|
Current Assignee
Olympus Optical Corporation Limited
|
Original Assignee
Olympus Optical Corporation Limited
|
Video and audio multiplex transmission system | ||
Patent #
US 5,231,492 A
Filed 11/16/1990
|
Current Assignee
Fujitsu Limited
|
Original Assignee
Fujitsu Limited
|
System for selectively aborting operation or waiting to load required data based upon user response to non-availability of network load device | ||
Patent #
US 5,226,176 A
Filed 08/20/1990
|
Current Assignee
Sun Microsystems Incorporated
|
Original Assignee
Microsystems Company LLC
|
Pseudo-bar code control of image transmission | ||
Patent #
US 5,227,893 A
Filed 10/31/1990
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Storage of compressed data on random access storage devices | ||
Patent #
US 5,237,460 A
Filed 09/04/1992
|
Current Assignee
Digital Data Funding LLC
|
Original Assignee
CeRam Incorporated
|
Apparatus and method for efficient organization of compressed data on a hard disk utilizing an estimated compression factor | ||
Patent #
US 5,237,675 A
Filed 03/19/1992
|
Current Assignee
Maxtor Corporation
|
Original Assignee
Maxtor Corporation
|
Lempel-Ziv compression scheme with enhanced adapation | ||
Patent #
US 5,243,341 A
Filed 06/01/1992
|
Current Assignee
HP Inc.
|
Original Assignee
HP Inc.
|
Filmless digital camera with selective image compression | ||
Patent #
US 5,249,053 A
Filed 08/07/1992
|
Current Assignee
DYCAM INC.
|
Original Assignee
DYCAM INC.
|
Partitioned digital encoder and method for encoding bit groups in parallel | ||
Patent #
US 5,243,348 A
Filed 04/27/1992
|
Current Assignee
Freescale Semiconductor Inc.
|
Original Assignee
Motorola Inc.
|
Apparatus for compressing data in a dynamically mapped virtual data storage subsystem | ||
Patent #
US 5,247,638 A
Filed 06/18/1990
|
Current Assignee
Storage Technologies Corporation
|
Original Assignee
Storage Technologies Corporation
|
Compressed data optical disk storage system | ||
Patent #
US 5,247,646 A
Filed 07/22/1991
|
Current Assignee
Computer Upgrade Corporation
|
Original Assignee
AQUIDNECK SYSTEMS INTERNATIONAL INC.
|
Circuitry for automatically entering and terminating an initialization mode in a data processing system in response to a control signal | ||
Patent #
US 5,263,168 A
Filed 06/03/1991
|
Current Assignee
Freescale Semiconductor Inc.
|
Original Assignee
Motorola Inc.
|
Image compressing apparatus and image coding synthesizing method | ||
Patent #
US 5,267,333 A
Filed 12/21/1992
|
Current Assignee
Sharp Corporation
|
Original Assignee
Sharp Electronics Corporation
|
System for compression and decompression of video data using discrete cosine transform and coding techniques | ||
Patent #
US 5,270,832 A
Filed 04/14/1992
|
Current Assignee
LSI Logic Corporation
|
Original Assignee
C-Cube Corporation
|
Adaptive video compression system | ||
Patent #
US 5,079,630 A
Filed 09/15/1989
|
Current Assignee
Intel Corporation
|
Original Assignee
Intel Corporation
|
Data compression for recording on a record medium | ||
Patent #
US 5,097,261 A
Filed 11/19/1990
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Parallel processors sequentially encoding/decoding compaction maintaining format compatibility | ||
Patent #
US 5,109,226 A
Filed 10/29/1990
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Compressing and decompressing text files | ||
Patent #
US 5,109,433 A
Filed 07/12/1990
|
Current Assignee
Microsoft Technology Licensing LLC
|
Original Assignee
Microsoft Corporation
|
Digital image compression employing a resolution gradient | ||
Patent #
US 5,103,306 A
Filed 03/28/1990
|
Current Assignee
Carefusion 303 Incorporated
|
Original Assignee
TRANSITIONS RESEARCH CORPORATION
|
Data processing system with system resource management for itself and for an associated alien processor | ||
Patent #
US 5,113,522 A
Filed 05/17/1989
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Method and apparatus for dynamic channel bandwidth allocation among multiple parallel video coders | ||
Patent #
US 5,115,309 A
Filed 09/10/1990
|
Current Assignee
American Telephone Telegraph
|
Original Assignee
ATT Inc.
|
Data compression apparatus and method | ||
Patent #
US 5,126,739 A
Filed 11/27/1990
|
Current Assignee
Hifn Inc.
|
Original Assignee
Stac Electronics
|
Apparatus for analyzing communication networks | ||
Patent #
US 5,121,342 A
Filed 08/28/1989
|
Current Assignee
Network Communications Incorporated
|
Original Assignee
Network Communications Incorporated
|
3-mode PCM/DPCM/APCM maximizing dynamic range | ||
Patent #
US 5,128,963 A
Filed 04/29/1987
|
Current Assignee
Sony Corporation
|
Original Assignee
Sony Corporation
|
Lossless data compression circuit and method | ||
Patent #
US 5,150,430 A
Filed 03/15/1991
|
Current Assignee
Board of Trustees of the Leland Stanford Junior University
|
Original Assignee
Board of Trustees of the Leland Stanford Junior University
|
Data compression apparatus and method | ||
Patent #
US 5,146,221 A
Filed 11/27/1990
|
Current Assignee
Hifn Inc.
|
Original Assignee
Stac Inc.
|
Fast data compressor with direct lookup table indexing into history buffer | ||
Patent #
US 5,155,484 A
Filed 09/13/1991
|
Current Assignee
Symantec Corporation
|
Original Assignee
Salient Software Inc.
|
Tape controller with data compression and error correction sharing a common buffer | ||
Patent #
US 5,159,336 A
Filed 08/13/1991
|
Current Assignee
Ditto TV
|
Original Assignee
Iomega Corporation
|
Data integrity for compaction devices | ||
Patent #
US 5,167,034 A
Filed 11/19/1990
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Dictionary reset performance enhancement for data compression applications | ||
Patent #
US 5,175,543 A
Filed 09/25/1991
|
Current Assignee
HP Inc.
|
Original Assignee
HP Inc.
|
Data compression system for successively applying at least two data compression methods to an input data stream | ||
Patent #
US 4,988,998 A
Filed 09/05/1989
|
Current Assignee
Storage Technologies Corporation
|
Original Assignee
Storage Technologies Corporation
|
Data compression apparatus with shift register search means | ||
Patent #
US 5,003,307 A
Filed 10/06/1989
|
Current Assignee
Hifn Inc.
|
Original Assignee
Stac Inc.
|
Data compression apparatus and method | ||
Patent #
US 5,016,009 A
Filed 01/13/1989
|
Current Assignee
Hifn Inc.
|
Original Assignee
Stac Inc.
|
Data telecommunications system and method for transmitting compressed data | ||
Patent #
US 5,027,376 A
Filed 05/31/1988
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
Microcom Systems Incorporated
|
Multiplexed encoder and decoder with address mark generation/check and precompensation circuits | ||
Patent #
US 5,028,922 A
Filed 10/30/1989
|
Current Assignee
Industrial Technology Research Institute
|
Original Assignee
Industrial Technology Research Institute
|
Dynamic model selection during data compression | ||
Patent #
US 5,045,852 A
Filed 03/30/1990
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Method of encoding market data and transmitting by radio to a plurality of receivers | ||
Patent #
US 5,045,848 A
Filed 09/29/1987
|
Current Assignee
ICE Data Services Inc.
|
Original Assignee
FNN
|
Apparatus and method for very high data rate-compression incorporating lossless data compression and expansion utilizing a hashing technique | ||
Patent #
US 5,049,881 A
Filed 06/18/1990
|
Current Assignee
Intersecting Concepts Inc.
|
Original Assignee
INTERSECTING CONCEPTS INC.
|
Computer-based video compression system | ||
Patent #
US 4,897,717 A
Filed 03/30/1988
|
Current Assignee
STARSIGNAL INC. A CA CORP.
|
Original Assignee
STARSIGNAL INC.
|
Data compression apparatus and method for data recorder | ||
Patent #
US 4,906,995 A
Filed 12/12/1986
|
Current Assignee
Sangamo Weston Inc.
|
Original Assignee
Sangamo Weston Inc.
|
Textual substitution data compression with finite length search windows | ||
Patent #
US 4,906,991 A
Filed 04/29/1988
|
Current Assignee
Xerox Corporation
|
Original Assignee
Xerox Corporation
|
Adaptive data compression apparatus including run length encoding for a tape drive system | ||
Patent #
US 4,929,946 A
Filed 02/09/1989
|
Current Assignee
Storage Technologies Corporation
|
Original Assignee
Storage Technologies Corporation
|
Personnel door for a RF shielded room | ||
Patent #
US 4,953,324 A
Filed 03/30/1989
|
Current Assignee
NOVE-TECH ENGINEERING INC.
|
Original Assignee
Nova-Tech Engineering Inc.
|
Method and apparatus for after-recording sound on a medium having pre-recorded video thereon | ||
Patent #
US 4,965,675 A
Filed 05/12/1988
|
Current Assignee
Canon Kabushiki Kaisha
|
Original Assignee
Canon Kabushiki Kaisha
|
Method and apparatus using multiple codes to increase storage capacity | ||
Patent #
US 4,804,959 A
Filed 11/10/1987
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Method and apparatus for transmitting digital data and real-time digitalized voice information over a communications channel | ||
Patent #
US 4,813,040 A
Filed 10/31/1986
|
Current Assignee
Steven P. Futato
|
Original Assignee
Steven P. Futato
|
Data compression method | ||
Patent #
US 4,814,746 A
Filed 08/11/1986
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Adaptive data compression method and apparatus | ||
Patent #
US 4,862,167 A
Filed 02/24/1987
|
Current Assignee
Telogy Networks Inc.
|
Original Assignee
Hayes Microcomputer Products Inc.
|
Data compression system with expansion protection | ||
Patent #
US 4,870,415 A
Filed 10/19/1987
|
Current Assignee
HP Inc.
|
Original Assignee
HP Inc.
|
Digital data bus architecture for computer disk drive controller | ||
Patent #
US 4,866,601 A
Filed 09/24/1987
|
Current Assignee
Taiwan Semiconductor Manufacturing Company Limited
|
Original Assignee
NCR Corporation
|
Method and apparatus for data compression and restoration | ||
Patent #
US 4,872,009 A
Filed 12/07/1987
|
Current Assignee
Hitachi Ltd., HITACHI COMPUTER PERIPHERALS 2880 KOZU ODAWARA-SHI KANAGAWA-KEN JAPAN A CORP. OF JAPAN
|
Original Assignee
Hitachi Computer Peripherals Company Limited, Hitachi America Limited
|
Stem for dynamically compressing and decompressing electronic data | ||
Patent #
US 4,876,541 A
Filed 10/15/1987
|
Current Assignee
James A. Storer
|
Original Assignee
DATA COMPRESSION CORPORATION
|
Document image processing system | ||
Patent #
US 4,888,812 A
Filed 12/18/1987
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Mixed mode compression for data transmission | ||
Patent #
US 4,890,282 A
Filed 03/08/1988
|
Current Assignee
Network Equipment Technologies Incorporated
|
Original Assignee
Network Equipment Technologies Incorporated
|
Adaptive data compression system | ||
Patent #
US 4,730,348 A
Filed 09/19/1986
|
Current Assignee
ADAPTIVE COMPUTER TECHNOLOGIES A CORP. OF CA.
|
Original Assignee
ADAPTIVE COMPUTER TECHNOLOGIES
|
Data telecommunications system and method for transmitting compressed data | ||
Patent #
US 4,748,638 A
Filed 10/30/1985
|
Current Assignee
Hewlett-Packard Development Company L.P.
|
Original Assignee
Microcom
|
Method and system for dynamically controlling the content of a local receiver data base from a transmitted data base in an information retrieval communication network | ||
Patent #
US 4,745,559 A
Filed 12/27/1985
|
Current Assignee
Reuters Limited
|
Original Assignee
Reuters Limited
|
Method and apparatus for controlling radial disk displacement in Winchester disk drives | ||
Patent #
US 4,754,351 A
Filed 03/25/1985
|
Current Assignee
CIT Group Incorporated
|
Original Assignee
Maxtor Corporation
|
Method for dynamically creating a receiver definable local trading instrument displayable record from a remotely transmitted trading instrument common data stream | ||
Patent #
US 4,750,135 A
Filed 05/01/1986
|
Current Assignee
Reuters Limited
|
Original Assignee
Reuters Limited
|
Data communication with modified Huffman coding | ||
Patent #
US 4,646,061 A
Filed 03/13/1985
|
Current Assignee
Racal-Datacom Inc.
|
Original Assignee
Racal Data Communications Incorporated
|
Data compression method and apparatus | ||
Patent #
US 4,682,150 A
Filed 12/09/1985
|
Current Assignee
Teledata Sound LLC
|
Original Assignee
NCR Corporation
|
Data compression system | ||
Patent #
US 4,701,745 A
Filed 03/03/1986
|
Current Assignee
Hifn Inc.
|
Original Assignee
Ferranti Limited
|
Apparatus for compressing and buffering data | ||
Patent #
US 4,574,351 A
Filed 03/03/1983
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Image data storing device | ||
Patent #
US 4,593,324 A
Filed 09/26/1985
|
Current Assignee
Fuji Xerox Company Limited
|
Original Assignee
Fuji Xerox Company Limited
|
Data compression using run length encoding and statistical encoding | ||
Patent #
US 4,626,829 A
Filed 08/19/1985
|
Current Assignee
INTELLISTOR INC.
|
Original Assignee
INTELLIGENT STORAGE INC.
|
Adaptive source modeling for data file compression within bounded memory | ||
Patent #
US 4,494,108 A
Filed 06/05/1984
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Method for identification and compression of facsimile symbols in text processing systems | ||
Patent #
US 4,499,499 A
Filed 12/29/1982
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Data compression, encryption, and in-line transmission system | ||
Patent #
US 4,386,416 A
Filed 06/02/1980
|
Current Assignee
Sgs-Thomson Microelectronics Limited
|
Original Assignee
Mostek Corporation
|
Digital video compression system and methods utilizing scene adaptive coding with rate buffer feedback | ||
Patent #
US 4,394,774 A
Filed 06/26/1981
|
Current Assignee
Magnitude Compression Systems Incorporated
|
Original Assignee
Compression Labs Incorporated
|
Method and apparatus for adaptive facsimile compression using a two dimensional maximum likelihood predictor | ||
Patent #
US 4,325,085 A
Filed 06/09/1980
|
Current Assignee
Hughes Electronics Corporation
|
Original Assignee
DIGITAL COMMUNICATIONS CORPORATION
|
Real time data compression/decompression scheme for facsimile transmission system | ||
Patent #
US 4,360,840 A
Filed 05/13/1980
|
Current Assignee
ECRM TRUST
|
Original Assignee
AM International Incorporated
|
Digital video compression system and methods utilizing scene adaptive coding with rate buffer feedback | ||
Patent #
US 4,302,775 A
Filed 12/15/1978
|
Current Assignee
Magnitude Compression Systems Incorporated
|
Original Assignee
Compression Labs Incorporated
|
Novel derivatives of gamma-endorphins, intermediates therefor, and compositions and methods employing said derivatives | ||
Patent #
US 4,127,518 A
Filed 06/16/1977
|
Current Assignee
VETERANS ADMINISTRATION THE UNITED STATES OF AMERICA AS REPRESENTED BY
|
Original Assignee
Abba J. Kastin, David H. Coy
|
Data compaction system and apparatus | ||
Patent #
US 4,021,782 A
Filed 04/30/1975
|
Current Assignee
Microsoft Corporation
|
Original Assignee
John S. Hoerning
|
Reconfigurable data bus | ||
Patent #
US 4,032,893 A
Filed 01/23/1976
|
Current Assignee
Sperry Rand Corporation
|
Original Assignee
Sperry Rand Corporation
|
Data expansion apparatus | ||
Patent #
US 4,054,951 A
Filed 06/30/1976
|
Current Assignee
International Business Machines Corporation
|
Original Assignee
International Business Machines Corporation
|
Bandwidth sensitive data compression and decompression | ||
Patent #
US 8,073,047 B2
Filed 05/19/2008
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Data LLC
|
Systems and methods for accelerated loading of operating systems and application programs | ||
Patent #
US 8,090,936 B2
Filed 10/19/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Systems and methods for accelerated loading of operating systems and application programs | ||
Patent #
US 8,112,619 B2
Filed 10/19/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
DATA FEED ACCELERATION | ||
Patent #
US 20120194362A1
Filed 02/23/2012
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data Storewidth Accelerator | ||
Patent #
US 20120239921A1
Filed 05/29/2012
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 8,275,897 B2
Filed 04/08/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Data compression systems and methods | ||
Patent #
US 8,502,707 B2
Filed 02/09/2010
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
System and methods for accelerated data storage and retrieval | ||
Patent #
US 8,504,710 B2
Filed 10/26/2006
|
Current Assignee
Realtime Data LLC
|
Original Assignee
Realtime Data LLC
|
Bandwidth sensitive data compression and decompression | ||
Patent #
US 8,553,759 B2
Filed 06/06/2011
|
Current Assignee
Realtime Adaptive Streaming LLC
|
Original Assignee
Realtime Data LLC
|
DATA REDUCTION SYSTEM | ||
Patent #
US 3,490,690 A
Filed 10/26/1964
|
Current Assignee
James T. Dervan, Clarence T. Apple, Luke F. Little, Clinton V. Davis Jr
|
Original Assignee
James T. Dervan, Clarence T. Apple, Luke F. Little, Clinton V. Davis Jr
|
Method of and apparatus for code communication | ||
Patent #
US 3,394,352 A
Filed 07/22/1965
|
Current Assignee
Electronic Image Systems Corporation Cambridge MA
|
Original Assignee
Robert Wernikoff, William F. Schreiber, Paul Epstein
|
22 Claims
-
1. A method of compressing a plurality of data blocks, comprising:
-
analyzing the plurality of data blocks to recognize when an appropriate content independent compression algorithm is to be applied to the plurality of data blocks; applying the appropriate content independent data compression algorithm to a portion of the plurality of data blocks to provide a compressed data portion; analyzing a data block from another portion of the plurality of data blocks for recognition of any characteristic, attribute, or parameter that is indicative of an appropriate content dependent algorithm to apply to the data block; and applying the appropriate content dependent data compression algorithm to the data block to provide a compressed data block when the characteristic, attribute, or parameter is identified, wherein the analyzing the plurality of data blocks to recognize when the appropriate content independent compression algorithm is to be applied excludes analyzing based only on a descriptor indicative of the any characteristic, attribute, or parameter, and wherein the analyzing the data block to recognize the any characteristic, attribute, or parameter excludes analyzing based only on the descriptor. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A device for compressing data comprising:
-
a first circuit configured to analyze a plurality of data blocks to recognize when an appropriate content independent compression algorithm is to be applied to the plurality of data blocks; a second circuit configured to apply the appropriate content independent data compression algorithm to a portion of the plurality of data blocks to provide a compressed data portion; a third circuit configured to analyze a data block from another portion of the plurality of data blocks for recognition of any characteristic, attribute, or parameter that is indicative of an appropriate content dependent algorithm to apply to the data block; and a fourth circuit configured to apply the appropriate content dependent data compression algorithm to the data block to provide a compressed data block when the any characteristic, attribute, or parameter is identified, wherein the first circuit is further configured to analyze the plurality of data blocks to recognize when the appropriate content independent compression algorithm is to be applied by excluding analyzing based only on a descriptor indicative of the any characteristic, attribute, or parameter, and wherein the third circuit is further configured to analyze the data block to recognize the any characteristic, attribute, or parameter by excluding analyzing based only on the descriptor. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22)
-
1 Specification
This application is a Continuation of U.S. patent application Ser. No. 12/703,042, filed Feb. 9, 2010, now U.S. Pat. No. 8,502,707, which is a Continuation of U.S. patent application Ser. No. 11/651,366, filed Jan. 8, 2007, now abandoned. U.S. patent application Ser. No. 12/703,042 is also a Continuation of U.S. patent application Ser. No. 11/651,365, filed Jan. 8, 2007, now U.S. Pat. No. 7,714,747. Each of application Ser. No. 11/651,366 and application Ser. No. 11/651,365 is a Continuation of U.S. patent application Ser. No. 10/668,768, filed Sep. 22, 2003, now U.S. Pat. No. 7,161,506, which is a Continuation of U.S. patent application Ser. No. 10/016,355, filed Oct. 29, 2001, now U.S. Pat. No. 6,624,761, which is a Continuation-In-Part of U.S. patent application Ser. No. 09/705,446, filed Nov. 3, 2000, now U.S. Pat. No. 6,309,424, which is a Continuation of U.S. patent application Ser. No. 09/210,491, filed Dec. 11, 1998, now U.S. Pat. No. 6,195,024. Each of the listed applications is incorporated herein by reference in its entirety.
1. Technical Field
The present invention relates generally to a data compression and decompression and, more particularly, to systems and methods for data compression using content independent and content dependent data compression and decompression.
2. Description of Related Art
Information may be represented in a variety of manners. Discrete information such as text and numbers are easily represented in digital data. This type of data representation is known as symbolic digital data. Symbolic digital data is thus an absolute representation of data such as a letter, figure, character, mark, machine code, or drawing.
Continuous information such as speech, music, audio, images and video, frequently exists in the natural world as analog information. As is well known to those skilled in the art, recent advances in very large scale integration (VLSI) digital computer technology have enabled both discrete and analog information to be represented with digital data. Continuous information represented as digital data is often referred to as diffuse data. Diffuse digital data is thus a representation of data that is of low information density and is typically not easily recognizable to humans in its native form.
There are many advantages associated with digital data representation. For instance, digital data is more readily processed, stored, and transmitted due to its inherently high noise immunity. In addition, the inclusion of redundancy in digital data representation enables error detection and/or correction. Error detection and/or correction capabilities are dependent upon the amount and type of data redundancy, available error detection and correction processing, and extent of data corruption.
One outcome of digital data representation is the continuing need for increased capacity in data processing, storage, and transmittal. This is especially true for diffuse data where increases in fidelity and resolution create exponentially greater quantities of data. Data compression is widely used to reduce the amount of data required to process, transmit, or store a given quantity of information. In general, there are two types of data compression techniques that may be utilized either separately or jointly to encode/decode data: lossless and lossy data compression.
Lossy data compression techniques provide for an inexact representation of the original uncompressed data such that the decoded (or reconstructed) data differs from the original unencoded/uncompressed data. Lossy data compression is also known as irreversible or noisy compression. Entropy is defined as the quantity of information in a given set of data. Thus, one obvious advantage of lossy data compression is that the compression ratios can be larger than the entropy limit, all at the expense of information content. Many lossy data compression techniques seek to exploit various traits within the human senses to eliminate otherwise imperceptible data. For example, lossy data compression of visual imagery might seek to delete information content in excess of the display resolution or contrast ratio.
On the other hand, lossless data compression techniques provide an exact representation of the original uncompressed data. Simply stated, the decoded (or reconstructed) data is identical to the original unencoded/uncompressed data. Lossless data compression is also known as reversible or noiseless compression. Thus, lossless data compression has, as its current limit, a minimum representation defined by the entropy of a given data set.
There are various problems associated with the use of lossless compression techniques. One fundamental problem encountered with most lossless data compression techniques are their content sensitive behavior. This is often referred to as data dependency. Data dependency implies that the compression ratio achieved is highly contingent upon the content of the data being compressed. For example, database files often have large unused fields and high data redundancies, offering the opportunity to losslessly compress data at ratios of 5 to 1 or more. In contrast, concise software programs have little to no data redundancy and, typically, will not losslessly compress better than 2 to 1.
Another problem with lossless compression is that there are significant variations in the compression ratio obtained when using a single lossless data compression technique for data streams having different data content and data size. This process is known as natural variation.
A further problem is that negative compression may occur when certain data compression techniques act upon many types of highly compressed data. Highly compressed data appears random and many data compression techniques will substantially expand, not compress this type of data.
For a given application, there are many factors that govern the applicability of various data compression techniques. These factors include compression ratio, encoding and decoding processing requirements, encoding and decoding time delays, compatibility with existing standards, and implementation complexity and cost, along with the is adaptability and robustness to variations in input data. A direct relationship exists in the current art between compression ratio and the amount and complexity of processing required. One of the limiting factors in most existing prior art lossless data compression techniques is the rate at which the encoding and decoding processes are performed. Hardware and software implementation tradeoffs are often dictated by encoder and decoder complexity along with cost.
Another problem associated with lossless compression methods is determining the optimal compression technique for a given set of input data and intended application. To combat this problem, there are many conventional content dependent techniques that may be utilized. For instance, file type descriptors are typically appended to file names to describe the application programs that normally act upon the data contained within the file. In this manner data types, data structures, and formats within a given file may be ascertained. Fundamental limitations with this content dependent technique include:
(1) the extremely large number of application programs, some of which do not possess published or documented file formats, data structures, or data type descriptors;
(2) the ability for any data compression supplier or consortium to acquire, store, and access the vast amounts of data required to identify known file descriptors and associated data types, data structures, and formats; and
(3) the rate at which new application programs are developed and the need to update file format data descriptions accordingly.
An alternative technique that approaches the problem of selecting an appropriate lossless data compression technique is disclosed, for example, in U.S. Pat. No. 5,467,087 to Chu entitled “High Speed Lossless Data Compression System” (“Chu”).
There are several limitations associated with the Chu method. One such limitation is the need to unambiguously identify various data types. While these might include such common data types as ASCII, binary, or unicode, there, in fact, exists a broad universe of data types that fall outside the three most common data types. Examples of these alternate data types include: signed and unsigned integers of various lengths, differing types and precision of floating point numbers, pointers, other forms of character text, and a multitude of user defined data types. Additionally, data types may be interspersed or partially compressed, making data type recognition difficult and/or impractical. Another limitation is that given a known data type, or mix of data types within a specific set or subset of input data, it may be difficult and/or impractical to predict which data encoding technique yields the highest compression ratio.
Accordingly, there is a need for a data compression system and method that would address limitations in conventional data compression techniques as described above.
The present invention is directed to systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect of the invention, a method for compressing data comprises the steps of:
analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types;
performing content dependent data compression on the data block, if the data type of the data block is identified;
performing content independent data compression on the data block, if the data type of the data block is not identified.
In another aspect, the step of performing, content independent data compression comprises: encoding the data block with a plurality of encoders to provide a plurality of encoded data blocks; determining a compression ratio obtained for each of the encoders; comparing each of the determined compression ratios with a first compression threshold; selecting for output the input data block and appending a null compression descriptor to the input data block, if all of the encoder compression ratios do not meet the first compression threshold; and selecting for output the encoded data block having the highest compression ratio and appending a corresponding compression type descriptor to the selected encoded data block, if at least one of the compression ratios meet the first compression threshold.
In another aspect, the step of performing content dependent compression comprises the steps of: selecting one or more encoders associated with the identified data type and encoding the 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; comparing each of the determined compression ratios with a second compression threshold; selecting for output the input data block and appending a null compression descriptor to the input data block, if all of the encoder compression do not meet the second compression threshold; and selecting for output the encoded data block having the highest compression ratio and appending a corresponding compression type descriptor to the selected encoded data block, if at least one of the compression ratios meet the second compression threshold.
In yet another aspect, the step of performing content independent data compression on the data block, if the data type of the data block is not identified, comprises the steps of: estimating a desirability of using of one or more encoder types based one characteristics of the data block; and compressing the data block using one or more desirable encoders.
In another aspect, the step of performing content dependent data compression on the data block, if the data type of the data block is identified, comprises the steps of: estimating a desirability of using of one or more encoder types based on characteristics of the data block; and compressing the data block using one or more desirable encoders.
In another aspect, the step of analyzing the data block comprises analyzing the data block to recognize one of a data type, data structure, data block format, file substructure, and/or file types. A further step comprises maintaining an association between encoder types and data types, data structures, data block formats, file substructure, and/or file types.
In yet another aspect of the invention, a method for compressing data comprises the steps of:
analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types;
performing content dependent data compression on the data block, if the data type of the data block is identified;
determining a compression ratio of the compressed data block obtained using the content dependent compression and comparing the compression ratio with a first compression threshold; and
performing content independent data compression on the data block, if the data type of the data block is not identified or if the compression ratio of the compressed data block obtained using the content dependent compression does not meet the first compression threshold.
Advantageously, the present invention employs a plurality of encoders applying a plurality of compression techniques on an input data stream so as to achieve maximum compression in accordance with the real-time or pseudo real-time data rate constraint. Thus, the output bit rate is not fixed and the amount, if any, of permissible data quality degradation is user or data specified.
These and other aspects, features and advantages of the present invention will become apparent from the following detailed description of preferred embodiments, which is to be read in connection with the accompanying drawings.
The present invention is directed to systems and methods for providing data compression and decompression using content independent and content dependent data compression and decompression. In the following description, it is to be understood that system elements having equivalent or similar functionality are designated with the same reference numerals in the Figures. It is to be further understood that the present invention may be implemented in various forms of hardware, software, firmware, or a combination thereof. In particular, the system modules described herein are preferably implemented in software as an application program that is executable by, e.g., a general purpose computer or any machine or device having any suitable and preferred microprocessor architecture. Preferably, the present invention is implemented on a computer platform including hardware such as one or more central processing units (CPU), a random access memory (RAM), and input/output (I/O) interface(s). The computer platform also includes an operating system and microinstruction code. The various processes and functions described herein may be either part of the microinstruction code or application programs which are executed via the operating system. In addition, various other peripheral devices may be connected to the computer platform such as an additional data storage device and a printing device.
It is to be further understood that, because some of the constituent system components described herein are preferably implemented as software modules, the actual system connections shown in the Figures may differ depending upon the manner in which the systems are programmed. It is to be appreciated that special purpose microprocessors may be employed to implement the present invention. Given the teachings herein, one of ordinary skill in the related art will be able to contemplate these and similar implementations or configurations of the present invention.
Referring now to
An input data buffer 20, operatively connected to the counter module 10, may be provided for buffering the input data stream in order to output an uncompressed data stream in the event that, as discussed in further detail below, every encoder fails to achieve a level of compression that exceeds an a priori specified minimum compression ratio threshold. It is to be understood that the input data buffer 20 is not required for implementing the present invention.
An encoder module 30 is operatively connected to the buffer 20 and comprises a set of encoders E1, E2, E3 . . . En. The encoder set E1, E2, E3 . . . En may include any number “n” of those lossless encoding techniques currently well known within the art such as ran length, Huffman, Lempel-Ziv Dictionary Compression, arithmetic coding, data compaction, and data null suppression. It is to be understood that the encoding techniques are selected based upon their ability to effectively encode different types of input data. It is to be appreciated that a full complement of encoders are preferably selected to provide a broad coverage of existing and future data types.
The encoder module 30 successively receives as input each of the buffered input data blocks (or unbuffered input data blocks from the counter module 10). Data compression is performed by the encoder module 30 wherein each of the encoders E1 . . . En processes a given input data block and outputs a corresponding set of encoded data blocks. It is to be appreciated that the system affords a user the option to enable/disable any one or more of the encoders E1 . . . En prior to operation. As is understood by those skilled in the art, such feature allows the user to tailor the operation of the data compression system for specific applications. It is to be further appreciated that the is encoding process may be performed either in parallel or sequentially. In particular, the encoders E1 through En of encoder module 30 may operate in parallel (i.e., simultaneously processing a given input data block by utilizing task multiplexing on a single central processor, via dedicated hardware, by executing on a plurality of processor or dedicated hardware systems, or any combination thereof). In addition, encoders E1 through En may operate sequentially on a given unbuffered or buffered input data block. This process is intended to eliminate the complexity and additional processing overhead associated with multiplexing concurrent encoding techniques on a single central processor and/or dedicated hardware, set of central processors and/or dedicated hardware, or any achievable combination. It is to be further appreciated that encoders of the identical type may be applied in parallel to enhance encoding speed. For instance, encoder E1 may comprise two parallel Huffman encoders for parallel processing of an input data block.
A buffer/counter module 40 is operatively connected to the encoding module 30 for buffering and counting the size of each of the encoded data blocks output from encoder module 30. Specifically, the buffer/counter 30 comprises a plurality of buffer/counters BC1, BC2, BC3 . . . BCn, each operatively associated with a corresponding one of the encoders E1 . . . En. A compression ratio module 50, operatively connected to the output buffer/counter 40, determines the compression ratio obtained for each of the enabled encoders E1 . . . En by taking the ratio of the size of the input data block to the size of the output data block stored in the corresponding buffer/counters BC1 . . . BCn. In addition, the compression ratio module 50 compares each compression ratio with an a priori-specified compression ratio threshold limit to determine if at least one of the encoded data blocks output from the enabled encoders E1 . . . En achieves a compression that exceeds an a priori-specified threshold. As is understood by those skilled in the art, the threshold limit may be specified as any value inclusive of data expansion, no data compression or expansion, or any arbitrarily desired compression limit. A description module 60, operatively coupled to the compression ratio module 50, appends a corresponding compression type descriptor to each encoded data block which is selected for output so as to indicate the type of compression format of the encoded data block.
The operation of the data compression system of
Next, a compression ratio is calculated for each encoded data block by taking the ratio of the size of the input data block (as determined by the input counter 10) to the size of each encoded data block output from the enabled encoders (step 312). Each compression ratio is then compared with an a priori-specified compression ratio threshold (step 314). It is to be understood that the threshold limit may be specified as any value inclusive of data expansion, no data compression or expansion, or any arbitrarily desired compression limit. It is to be further understood that notwithstanding that the current limit for lossless data compression is the entropy limit (the present definition of information content) for the data, the present invention does not preclude the use of future developments in lossless data compression that may increase lossless data compression ratios beyond what is currently known within the art.
After the compression ratios are compared with the threshold, a determination is s made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 316). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 316), then the original unencoded input data block is selected for output and a null data compression type descriptor is appended thereto (step 318). A null data compression type descriptor is defined as any recognizable data token or descriptor that indicates no data encoding has been applied to the input data block. Accordingly, the unencoded input data block with its corresponding null data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 320).
On the other hand, if one or more of the encoded data blocks possess a compression ratio greater than the compression ratio threshold limit (affirmative result in step 316), then the encoded data block having the greatest compression ratio is selected (step 322). An appropriate data compression type descriptor is then appended (step 324). A data compression type descriptor is defined as any recognizable data token or descriptor that indicates which data encoding technique has been applied to the data. It is to be understood that, since encoders of the identical type may be applied in parallel to enhance encoding speed (as discussed above), the data compression type descriptor identifies the corresponding encoding technique applied to the encoded data block, not necessarily the specific encoder. The encoded data block having the greatest compression ratio along with its corresponding data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 326).
After the encoded data block or the unencoded data input data block is output (steps 326 and 320), a determination is made as to whether the input data stream contains additional data blocks to be processed (step 328). If the input data stream includes additional data blocks (affirmative result in step 328), the next successive data block is received (step 330), its block size is counted (return to step 302) and the data compression process in repeated. This process is iterated for each data block in the input data stream. Once the final input data block is processed (negative result in step 328), data compression of the input data stream is finished (step 322).
Since a multitude of data types may be present within a given input data block, it is often difficult and/or impractical to predict the level of compression that will be achieved by a specific encoder. Consequently, by processing the input data blocks with a plurality of encoding techniques and comparing the compression results, content free data compression is advantageously achieved. It is to be appreciated that this approach is scalable through future generations of processors, dedicated hardware, and software. As processing capacity increases and costs reduce, the benefits provided by the present invention will continue to increase. It should again be noted that the present invention may employ any lossless data encoding technique.
Referring now to
The operation of the data compression system of
Next, a compression ratio obtained by each enabled encoder is calculated by taking the ratio of the size of the input data block (as determined by the input counter 10) to the size of the encoded data block output from each enabled encoder (step 514). Each compression ratio is then compared with an a priori-specified compression ratio threshold (step 516). A determination is made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 518). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 518), then the original unencoded input data block is selected for output and a null data compression type descriptor (as discussed above) is appended thereto (step 520). Accordingly, the original unencoded input data block with its corresponding null data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 522).
On the other hand, if one or more of the encoded data blocks possess a compression ratio greater than the compression ratio threshold limit (affirmative result in step 518), then a figure of merit is calculated for each encoded data block having a compression ratio which exceeds the compression ratio threshold limit (step 524). Again, the figure of merit for a given encoded data block is comprised of a weighted average of the a priori user specified threshold and the corresponding encoder desirability factor associated with the encoded data block. Next, the encoded data block having the greatest figure of merit is selected for output (step 526). An appropriate data compression type descriptor is then appended (step 528) to indicate the data encoding technique applied to the encoded data block. The encoded data block (which has the greatest figure of merit) along with its corresponding data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 530).
After the encoded data block or the unencoded input data block is output (steps 530 and 522), a determination is made as to whether the input data stream contains additional data blocks to be processed (step 532). If the input data stream includes additional data blocks (affirmative result in step 532), then the next successive data block is received (step 534), its block size is counted (return to step 502) and the data compression process is iterated for each successive data block in the input data stream. Once the final input data block is processed (negative result in step 532), data compression of the input data stream is finished (step 536).
Referring now to
The operation of the data compression system of
Next, concurrent with the completion of the receipt and counting of the first data block, the interval timer 90 is initialized (step 706) and starts counting towards a user-specified time limit. The input data block is then sent to the encoder module 30 wherein data compression of the data block by each (enabled) encoder E1 . . . En commences (step 708). Next, a determination is made as to whether the user specified time expires before the completion of the encoding process (steps 710 and 712). If the encoding process is completed before or at the expiration of the timer, i.e., each encoder (E1 through En) completes its respective encoding process (negative result in step 710 and affirmative result in step 712), then an encoded data block is output from each (enabled) encoder E1 . . . En and maintained in a corresponding buffer (step 714).
On the other hand, if the timer expires (affirmative result in 710), the encoding process is halted (step 716). Then, encoded data blocks from only those enabled encoders E1 . . . En that have completed the encoding process are selected and maintained in buffers (step 718). It is to be appreciated that it is not necessary (or in some cases desirable) that some or all of the encoders complete the encoding process before the interval timer expires. Specifically, due to encoder data dependency and natural variation, it is possible that certain encoders may not operate quickly enough and, therefore, do not comply with the timing constraints of the end use. Accordingly, the time limit ensures that the real-time or pseudo real-time nature of the data encoding is preserved.
After the encoded data blocks are buffered (step 714 or 718), the size of each encoded data block is counted (step 720). Next, a compression ratio is calculated for each encoded data block by taking the ratio of the size of the input data block (as determined by the input counter 10) to the size of the encoded data block output from each enabled encoder (step 722). Each compression ratio is then compared with an a priori-specified compression ratio threshold (step 724). A determination is made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 726). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 726), then the original unencoded input data block is selected for output and a null data compression type descriptor is appended thereto (step 728). The original unencoded input data block with its corresponding null data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 730).
On the other hand, if one or more of the encoded data blocks possess a compression ratio greater than the compression ratio threshold limit (affirmative result in step 726), then the encoded data block having the greatest compression ratio is selected (step 732). An appropriate data compression type descriptor is then appended (step 734). The encoded data block having the greatest compression ratio along with its corresponding data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 736).
After the encoded data block or the unencoded input data block is output (steps 730 or 736), a determination is made as to whether the input data stream contains additional data blocks to be processed (step 738). If the input data stream includes additional data blocks (affirmative result in step 738), the next successive data block is received (step 740), its block size is counted (return to step 702) and the data compression process in repeated. This process is iterated for each data block in the input data stream, with each data block being processed within the user-specified time limit as discussed above. Once the final input data block is processed (negative result in step 738), data compression of the input data stream is complete (step 742).
Referring now to
Referring now to
The system of
As with each previously discussed embodiment, the encoders Em,n may include those lossless encoding techniques currently well known within the art, including: run length, Huffman, Lempel-Ziv Dictionary Compression, arithmetic coding, data compaction, and data null suppression. Encoding techniques are selected based upon their ability to effectively encode different types of input data. A full complement of encoders provides for broad coverage of existing and future data types. The input data blocks may be applied simultaneously to the encoder paths (i.e., the encoder paths may operate in parallel, utilizing task multiplexing on a single central processor, or via dedicated hardware, or by executing on a plurality of processor or dedicated hardware systems, or any combination thereof). In addition, an input data block may be sequentially applied to the encoder paths. Moreover, each serially cascaded encoder path may comprise a fixed (predetermined) sequence of encoders or a random sequence of encoders. Advantageously, by simultaneously or sequentially processing input data blocks via a plurality of sets of serially cascaded encoders, content free data compression is achieved.
The operation of the data compression system of
Next, concurrent with the completion of the receipt and counting of the first data block, the interval timer 90 is initialized (step 106) and starts counting towards a user-specified time limit. The input data block is then sent to the cascade encoder module 30C wherein the input data block is applied to the first encoder (i.e., first encoding stage) in each of the cascaded encoder paths E1,1 . . . Em,1 (step 108). Next, a determination is made as to whether the user specified time expires before the completion of the first stage encoding process (steps 110 and 112). If the first stage encoding process is completed before the expiration of the timer, i.e., each encoder (E1,1 . . . Em,1) completes its respective encoding process (negative result in step 110 and affirmative result in step 112), then an encoded data block is output from each encoder E1,1 . . . Em,1 and maintained in a corresponding buffer (step 114). Then for each cascade encoder path, the output of the completed encoding stage is applied to the next successive encoding stage in the cascade path (step 116). This process (steps 110, 112, 114, and 116) is repeated until the earlier of the timer expiration (affirmative result in step 110) or the completion of encoding by each encoder stage in the serially cascaded paths, at which time the encoding process is halted (step 118).
Then, for each cascade encoder path, the buffered encoded data block output by the last encoder stage that completes the encoding process before the expiration of the timer is selected for further processing (step 120). Advantageously, the interim stages of the multi-stage data encoding process are preserved. For example, the results of encoder E1,1 are preserved even after encoder E1,2 begins encoding the output of encoder E1,1. If the interval timer expires after encoder E1,1 completes its respective encoding process but before encoder E1,2 completes its respective encoding process, the encoded data block from encoder E1,1 is complete and is utilized for calculating the compression ratio for the corresponding encoder path. The incomplete encoded data block from encoder E1,2 is either discarded or ignored.
It is to be appreciated that it is not necessary (or in some cases desirable) that some or all of the encoders in the cascade encoder paths complete the encoding process before the interval timer expires. Specifically, due to encoder data dependency, natural variation and the sequential application of the cascaded encoders, it is possible that certain encoders may not operate quickly enough and therefore do not comply with the timing constraints of the end use. Accordingly, the time limit ensures that the real-time or pseudo real-time nature of the data encoding is preserved.
After the encoded data blocks are selected (step 120), the size of each encoded data block is counted (step 122). Next, a compression ratio is calculated for each encoded data block by taking the ratio of the size of the input data block (as determined by the input counter 10) to the size of the encoded data block output from each encoder (step 124). Each compression ratio is then compared with an a priori-specified compression ratio threshold (step 126). A determination is made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 128). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 128), then the original unencoded input data block is selected for output and a null data compression type descriptor is appended thereto (step 130). The original unencoded data block and its corresponding null data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 132).
On the other hand, if one or more of the encoded data blocks possess a compression ratio greater than the compression ratio threshold limit (affirmative result in step 128), then a figure of merit is calculated for each encoded data block having a compression ratio which exceeds the compression ratio threshold limit (step 134). Again, the figure of merit for a given encoded data block is comprised of a weighted average of the a priori user specified threshold and the corresponding encoder desirability factor associated with the encoded data block. Next, the encoded data block having the greatest figure of merit is selected (step 136). An appropriate data compression type descriptor is then appended (step 138) to indicate the data encoding technique applied to the encoded data block. For instance, the data type compression descriptor can indicate that the encoded data block was processed by either a single encoding type, a plurality of sequential encoding types, and a plurality of random encoding types. The encoded data block (which has the greatest figure of merit) along with its corresponding data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 140).
After the unencoded data block or the encoded data input data block is output (steps 132 and 140), a determination is made as to whether the input data stream contains additional data blocks to be processed (step 142). If the input data stream includes additional data blocks (affirmative result in step 142), then the next successive data block is received (step 144), its block size is counted (return to step 102) and the data compression process is iterated for each successive data block in the input data stream. Once the final input data block is processed (negative result in step 142), data compression of the input data stream is finished (step 146).
Referring now to
A decoder module 1104 includes a plurality of decoders D1 . . . Dn for decoding the input data block using a decoder, set of decoders, or a sequential set of decoders corresponding to the extracted compression type descriptor. The decoders D1 . . . Dn may include those lossless encoding techniques currently well known within the art, including: run length, Huffman, Lempel-Ziv Dictionary Compression, arithmetic coding, data compaction, and data null suppression. Decoding techniques are selected based upon their ability to effectively decode the various different types of encoded input data generated by the data compression systems described above or originating from any other desired source. As with the data compression systems discussed above, the decoder module 1104 may include multiple decoders of the same type applied in parallel so as to reduce the data decoding time.
The data decompression system also includes an output data buffer 1106 for buffering the decoded data block output from the decoder module 1104.
The operation of the data decompression system of
On the other hand, if the data compression type descriptor is determined to be any value other than null (negative result in step 1206), the corresponding decoder or decoders are then selected (step 1210) from the available set of decoders D1 . . . Dn in the decoding module 1104. It is to be understood that the data compression type descriptor may mandate the application of: a single specific decoder, an ordered sequence of specific decoders, a random order of specific decoders, a class or family of decoders, a mandatory or optional application of parallel decoders, or any combination or permutation thereof. The input data block is then decoded using the selected decoders (step 1212), and output (or maintained in the output buffer 1106) for subsequent data processing, storage, or transmittal (step 1214). A determination is then made as to whether the input data stream contains additional data blocks to be processed (step 1216). If the input data stream includes additional data blocks (affirmative result in step 1216), the next successive data block is received (step 1220), and buffered (return to step 1202). Thereafter, the data decompression process is iterated for each data block in the input data stream. Once the final input data block is processed (negative result in step 1216), data decompression of the input data stream is finished (step 1218).
In other embodiments of the present invention described below, data compression is achieved using a combination of content dependent data compression and content independent data compression. For example,
An input data buffer 20, operatively connected to the counter module 10, may be provided for buffering the input data stream in order to output an uncompressed data stream in the event that, as discussed in further detail below, every encoder fails to achieve a level of compression that exceeds a priori specified content independent or content dependent minimum compression ratio thresholds. It is to be understood that the input data buffer 20 is not required for implementing the present invention.
A content dependent data recognition module 1300 analyzes the incoming data stream to recognize data types, data structures, data block formats, file substructures, file types, and/or any other parameters that may be indicative of either the data type/content of a given data block or the appropriate data compression algorithm or algorithms (in serial or in parallel) to be applied. Optionally, a data file recognition list(s) or algorithm(s) 1310 module may be employed to hold and/or determine associations between recognized data parameters and appropriate algorithms. Each data block that is recognized by the content data compression module 1300 is routed to a content dependent encoder module 1320, if not the data is routed to the content independent encoder module 30.
A content dependent encoder module 1320 is operatively connected to the content dependent data recognition module 1300 and comprises a set of encoders D1, D2, D3 . . . Dm. The encoder set D1, D2, D3 . . . Dm may include any number “n” of those lossless or lossy encoding techniques currently well known within the art such as MPEG4, various voice codecs, MPEG3, AC3, AAC, as well as lossless algorithms such as run length, Huffman, Lempel-Ziv Dictionary Compression, arithmetic coding, data compaction, and data null suppression. It is to be understood that the encoding techniques are selected based upon their ability to effectively encode different types of input data. It is to be appreciated that a full complement of encoders and or codecs are preferably selected to provide a broad coverage of existing and future data types.
The content independent encoder module 30, which is operatively connected to the content dependent data recognition module 1300, comprises a set of encoders E1, E2, E3 . . . En. The encoder set E1, E2, E3 . . . En may include any number “n” of those lossless encoding techniques currently well known within the art such as run length, Huffman, Lempel-Ziv Dictionary Compression, arithmetic coding, data compaction, and data null suppression. Again, it is to be understood that the encoding techniques are selected based upon their ability to effectively encode different types of input data. It is to be appreciated that a full complement of encoders are preferably selected to provide a broad coverage of existing and future data types.
The encoder modules (content dependent 1320 and content independent 30) selectively receive the buffered input data blocks (or unbuffered input data blocks from the counter module 10) from module 1300 based on the results of recognition. Data compression is performed by the respective encoder modules wherein some or all of the encoders D1 . . . Dm or E1 . . . En processes a given input data block and outputs a corresponding set of encoded data blocks. It is to be appreciated that the system affords a user the option to enable/disable any one or more of the encoders D1 . . . Dm and E1 . . . En prior to operation. As is understood by those skilled in the art, such feature allows the user to tailor the operation of the data compression system for specific applications. It is to be further appreciated that the encoding process may be performed either in parallel or sequentially. In particular, the encoder set D1 through Dm of encoder module 1320 and/or the encoder set E1 through En of encoder module 30 may operate in parallel (i.e., simultaneously processing a given input data block by utilizing task multiplexing on a single central processor, via dedicated hardware, by executing on a plurality of processor or dedicated hardware systems, or any combination thereof). In addition, encoders D1 through Dm and E1 through En may operate sequentially on a given unbuffered or buffered input data block. This process is intended to eliminate the complexity and additional processing overhead associated with multiplexing concurrent encoding techniques on a single central processor and/or dedicated hardware, set of central processors and/or dedicated hardware, or any achievable combination. It is to be further appreciated that encoders of the identical type may be applied in parallel to enhance encoding speed. For instance, encoder E1 may comprise two parallel Huffman encoders for parallel processing of an input data block. It should be further noted that one or more algorithms may be implemented in dedicated hardware such as an MPEG4 or MP3 encoding integrated circuit.
Buffer/counter modules 1330 and 40 are operatively connected to their respective encoding modules 1320 and 30, for buffering and counting the size of each of the encoded data blocks output from the respective encoder modules. Specifically, the content dependent buffer/counter 1330 comprises a plurality of buffer/counters BCD1, BCD2, BCD3 . . . BCDm, each operatively associated with a corresponding one of the encoders D1 . . . Dm. Similarly the content independent buffer/counters BCE1, BCE2, BCE3 . . . BCEn, each operatively associated with a corresponding one of the encoders E1 . . . En. A compression ratio module 1340, operatively connected to the content dependent output buffer/counters 1330 and content independent buffer/counters 40 determines the compression ratio obtained for each of the enabled encoders and or E1 . . . En by taking the ratio of the size of the input data block to the size of the output data block stored in the corresponding buffer/counters BCD1, BCD2, BCD3 . . . BCDm and or BCE1, BCE2, BCE3 . . . BCEn. In addition, the compression ratio module 1340 compares each compression ratio with an a priori-specified compression ratio threshold limit to determine if at least one of the encoded data blocks output from the enabled encoders BCD1, BCD2, BCD3 . . . BCDm and or BCE1, BCE2, BCE3 . . . BCEn achieves a compression that meets an a priori-specified threshold. As is. understood by those skilled in the art, the threshold limit maybe specified as any value inclusive of data expansion, no data compression or expansion, or any arbitrarily desired compression limit. It should be noted that different threshold values may be applied to content dependent and content independent encoded data. Further these thresholds may be adaptively modified based upon enabled encoders in either or both the content dependent or content independent encoder sets, along with any associated parameters. A compression type description module 1350, operatively coupled to the compression ratio module 1340, appends a corresponding compression type descriptor to each encoded data block which is selected for output so as to indicate the type of compression format of the encoded data block.
A mode of operation of the data compression system of
Next, a compression ratio is calculated for each encoded data block by taking the ratio of the size of the input data block (as determined by the input counter 10 to the size of each encoded data block output from the enabled encoders (step 1416). Each compression ratio is then compared with an apriori-specified compression ratio threshold (step 1418). It is to be understood that the threshold limit may be specified as any value inclusive of data expansion, no data compression or expansion, or any arbitrarily desired compression limit. It is to be further understood that notwithstanding that the current limit for lossless data compression is the entropy limit (the present definition of information content) for the data, the present invention does not preclude the use of future developments in lossless data compression that may increase lossless data compression ratios beyond what is currently known within the art. Additionally the content independent data compression threshold may be different from the content dependent threshold and either may be modified by the specific enabled encoders.
After the compression ratios are compared with the threshold, a determination is made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 1420). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 1420), then the original unencoded input data block is selected for output and a null data compression type descriptor is appended thereto (step 1434). A null data compression type descriptor is defined as any recognizable data token or descriptor that indicates no data encoding has been applied to the input data block. Accordingly, the unencoded input data block with its corresponding null data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1436).
On the other hand, if one or more of the encoded data blocks possess a compression ratio greater than the compression ratio threshold limit (affirmative result in step 1420), then the encoded data block having the greatest compression ratio is selected (step 1422). An appropriate data compression type descriptor is then appended (step 1424). A data compression type descriptor is defined as any recognizable data token or descriptor that indicates which data encoding technique has been applied to the data. It is to be understood that, since encoders of the identical type may be applied in parallel to enhance encoding speed (as discussed above), the data compression type descriptor identifies the corresponding encoding technique applied to the encoded data block, not necessarily the specific encoder. The encoded data block having the greatest compression ratio along with its corresponding data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1426).
As previously stated the data block stored in the buffer 20 (step 1404) is analyzed on a per block or multi-block basis by the content dependent data recognition module 1300 (step 1406). If the data stream content is recognized utilizing the recognition list(s) or algorithms(s) module 1310 (step 1434) the appropriate content dependent algorithms are enabled and initialized (step 1436), and the data is routed to the content dependent encoder module 1320 and compressed by each (enabled) encoder D1 . . . Dm (step 1438). Upon completion of the encoding of the input data block, an encoded data block is output from each (enabled) encoder D1 . . . Dm and maintained in a corresponding buffer (step 1440), and the encoded data block size is counted (step 1442).
Next, a compression ratio is calculated for each encoded data block by taking the ratio of the size of the input data block (as determined by the input counter 10 to the size of each encoded data block output from the enabled encoders (step 1444). Each compression ratio is then compared with an a priori-specified compression ratio threshold (step 1448). It is to be understood that the threshold limit may be specified as any value inclusive of data expansion, no data compression or expansion, or any arbitrarily desired compression limit. It is to be further understood that many of these algorithms may be lossy, and as such the limits may be subject to or modified by an end target storage, listening, or viewing device. Further notwithstanding that the current limit for lossless data compression is the entropy limit (the present definition of information content) for the data, the present invention does not preclude the use of future developments in lossless data compression that may increase lossless data compression ratios beyond what is currently known within the art. Additionally the content independent data compression threshold may be different from the content dependent threshold and either may be modified by the specific enabled encoders.
After the compression ratios are compared with the threshold, a determination is made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 1420). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 1420), then the original unencoded input data block is selected for output and a null data compression type descriptor is appended thereto (step 1434). A null data compression type descriptor is defined as any recognizable data token or descriptor that indicates no data encoding has been applied to the input data block. Accordingly, the unencoded input data block with its corresponding null data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1436).
On the other hand, if one or more of the encoded data blocks possess a compression ratio greater than the compression ratio threshold limit (affirmative result in step 1420), then the encoded data block having the greatest compression ratio is selected (step 1422). An appropriate data compression type descriptor is then appended (step 1424). A data compression type descriptor is defined as any recognizable data token or descriptor that indicates which data encoding technique has been applied to the data. It is to be understood that, since encoders of the identical type may be applied in parallel to enhance encoding speed (as discussed above), the data compression type descriptor identifies the corresponding encoding technique applied to the encoded data block, not necessarily the specific encoder. The encoded data block having the greatest compression ratio along with its corresponding data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1426).
After the encoded data block or the unencoded data input data block is output (steps 1426 and 1436), a determination is made as to whether the input data stream contains additional data blocks to be processed (step 1428). If the input data stream includes additional data blocks (affirmative result in step 1428), the next successive data block is received (step 1432), its block size is counted (return to step 1402) and the data compression process in repeated. This process is iterated for each data block in the input data stream. Once the final input data block is processed (negative result in step 1428), data compression of the input data stream is finished (step 1430).
Since a multitude of data types may be present within a given input data block, it is often difficult and/or impractical to predict the level of compression that will be achieved by a specific encoder. Consequently, by processing the input data blocks with a plurality of encoding techniques and comparing the compression results, content free data compression is advantageously achieved. Further the encoding may be lossy or lossless dependent upon the input data types. Further if the data type is not recognized the default content independent lossless compression is applied. It is not a requirement that this process be deterministic—in fact a certain probability may be applied if occasional data loss is permitted. It is to be appreciated that this approach is scalable through future generations of processors, dedicated hardware, and software. As processing capacity increases and costs reduce, the benefits provided by the present invention will continue to increase. It should again be noted that the present invention may employ any lossless data encoding technique.
A mode of operation of the data compression system of
Next, a compression ratio is calculated for each encoded data block by taking the ratio of the size of the input data block (as determined by the input counter 10 to the size of each encoded data block output from the enabled encoders (step 1616). Each compression ratio is then compared with an a priori-specified compression ratio threshold (step 1618). It is to be understood that the threshold limit may be specified as any value inclusive of data expansion, no data compression or expansion, or any arbitrarily desired compression limit. It is to be further understood that notwithstanding that the current limit for lossless data compression is the entropy limit (the present definition of information content) for the data, the present invention does not preclude the use of future developments in lossless data compression that may increase lossless data compression ratios beyond what is currently known within the art. Additionally the content independent data compression threshold may be different from the content dependent threshold and either may be modified by the specific enabled encoders.
After the compression ratios are compared with the threshold, a determination is made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 1620). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 1620), then the original unencoded input data block is selected for output and a null data compression type descriptor is appended thereto (step 1634). A null data compression type descriptor is defined as any recognizable data token or descriptor that indicates no data encoding has been applied to the input data block. Accordingly, the unencoded input data block with its corresponding null data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1636).
On the other hand, if one or more of the encoded data blocks possess a compression ratio greater than the compression ratio threshold limit (affirmative result in step 1620), then the encoded data block having the greatest compression ratio is selected (step 1622). An appropriate data compression type descriptor is then appended (step 1624). A data compression type descriptor is defined as any recognizable data token or descriptor that indicates which data encoding technique has been applied to the data. It is to be understood that, since encoders of the identical type may be applied in parallel to enhance encoding speed (as discussed above), the data compression type descriptor identifies the corresponding encoding technique applied to the encoded data block, not necessarily the specific encoder. The encoded data block having the greatest compression ratio along with its corresponding data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1626).
As previously stated the data block stored in the buffer 20 (step 1604) is analyzed on a per block or multi-block basis by the content dependent data recognition module 1300 (step 1606). If the data stream content is recognized utilizing the recognition list(s) or algorithms(s) module 1310 (step 1634) the appropriate content dependent algorithms are enabled and initialized (step 1636) and the data is routed to the content dependent encoder module 1620 and compressed by each (enabled) encoder D1 . . . Dm (step 1638). Upon completion of the encoding of the input data block, an encoded data block is output from each (enabled) encoder D1 . . . Dm and maintained in a corresponding buffer (step 1640), and the encoded data block size is counted (step 1642).
Next, a compression ratio is calculated for each encoded data block by taking the ratio of the size of the input data block (as determined by the input counter 10 to the size of each encoded data block output from the enabled encoders (step 1644). Each compression ratio is then compared with an a priori-specified compression ratio threshold (step 1648). It is to be understood that the threshold limit may be specified as any value inclusive of data expansion, no data compression or expansion, or any arbitrarily desired compression limit. It is to be further understood that many of these algorithms may be lossy, and as such the limits may be subject to or modified by an end target storage, listening, or viewing device. Further notwithstanding that the current limit for lossless data compression is the entropy limit (the present definition of information content) for the data, the present invention does not preclude the use of future developments in lossless data compression that may increase lossless data compression ratios beyond what is currently known within the art. Additionally the content independent data compression threshold may be different from the content dependent threshold and either may be modified by the specific enabled encoders.
After the compression ratios are compared with the threshold, a determination is made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 1648). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 1620), then the original unencoded input data block is routed to the content independent encoder module 30 and the process resumes with compression utilizing content independent encoders (step 1610).
After the encoded data block or the unencoded data input data block is output (steps 1626 and 1636), a determination is made as to whether the input data stream contains additional data blocks to be processed (step 1628). If the input data stream includes additional data blocks (affirmative result in step 1628), the next successive data block is received (step 1632), its block size is counted (return to step 1602) and the data compression process in repeated. This process is iterated for each data block in the input data stream. Once the final input data block is processed (negative result in step 1628), data compression of the input data stream is finished (step 1630).
More specifically, a content dependent data recognition and or estimation module 1700 is utilized to analyze the incoming data stream for recognition of data types, data strictures, data block formats, file substructures, file types, or any other parameters that may be indicative of the appropriate data compression algorithm or algorithms (in serial or in parallel) to be applied. Optionally, a data file recognition list(s) or algorithm(s) 1710 module may be employed to hold associations between recognized data parameters and appropriate algorithms. If the content data compression module recognizes a portion of the data, that portion is routed to the content dependent encoder module 1320, if not the data is routed to the content independent encoder module 30. It is to be appreciated that process of recognition (modules 1700 and 1710) is not limited to a deterministic recognition, but may further comprise a probabilistic estimation of which encoders to select for compression from the set of encoders of the content dependent module 1320 or the content independent module 30. For example, a method may be employed to compute statistics of a data block whereby a determination that the locality of repetition of characters in a data stream is determined is high can suggest a text document, which may be beneficially compressed with a lossless dictionary type algorithm. Further the statistics of repeated characters and relative frequencies may suggest a specific type of dictionary algorithm. Long strings will require a wide dictionary file while a wide diversity of strings may suggest a deep dictionary, Statistics may also be utilized in algorithms such as Huffman where various character statistics will dictate the choice of different Huffman compression tables. This technique is not limited to lossless algorithms but may be widely employed with lossy algorithms. Header information in frames for video files can imply a specific data resolution. The estimator then may select the appropriate lossy compression algorithm and compression parameters (amount of resolution desired). As shown in previous embodiments of the present invention, desirability of various algorithms and now associated resolutions with lossy type algorithms may also be applied in the estimation selection process.
A mode of operation of the data compression system of
Next, a compression ratio is calculated for each encoded data block by taking the ratio of the size of the input data block (as determined by the input counter 10 to the size of each encoded data block output from the enabled encoders (step 1816). Each compression ratio is then compared with an a priori-specified compression ratio threshold (step 1818). It is to be understood that the threshold limit may be specified as any value inclusive of data expansion, no data compression or expansion, or any arbitrarily desired compression limit. It is to be further understood that notwithstanding that the current limit for lossless data compression is the entropy limit (the present definition of information content) for the data, the present invention does not preclude the use of future developments in lossless data compression that may increase lossless data compression ratios beyond what is currently known within the art. Additionally the content independent data compression threshold may be different from the content dependent threshold and either may be modified by the specific enabled encoders.
After the compression ratios are compared with the threshold, a determination is made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 1820). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 1820), then the original unencoded input data block is selected for output and a null data compression type descriptor is appended thereto (step 1834). A null data compression type descriptor is defined as any recognizable data token or descriptor that indicates no data encoding has been applied to the input data block. Accordingly, the unencoded input data block with its corresponding null data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1836).
On the other hand, if one or more of the encoded data blocks possess a compression ratio greater than the compression ratio threshold limit (affirmative result in step 1820), then the encoded data block having the greatest compression ratio is selected (step 1822). An appropriate data compression type descriptor is then appended (step 1824). A data compression type descriptor is defined as any recognizable data token or descriptor that indicates which data encoding technique has been applied to the data. It is to be understood that, since encoders of the identical type may be applied in parallel to enhance encoding speed (as discussed above), the data compression type descriptor identifies the corresponding encoding technique applied to the encoded data block, not necessarily the specific encoder. The encoded data block having the greatest compression ratio along with its corresponding data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1826).
As previously stated the data block stored in the buffer 20 (step 1804) is analyzed on a per block or multi-block basis by the content dependent data recognition module 1300 (step 1806). If the data stream content is recognized or estimated utilizing the recognition list(s) or algorithms(s) module 1710 (affirmative result in step 1808) the recognized data type/file or block is selected based on a list or algorithm (step 1838) and an estimate of the desirability of using the associated content dependent algorithms can be determined (step 1840). For instance, even though a recognized data type may be associated with three different encoders, an estimation of the desirability of using each encoder may result in only one or two of the encoders being actually selected for use. The data is routed to the content dependent encoder module 1320 and compressed by each (enabled) encoder D1 . . . Dm (step 1842). Upon completion of the encoding of the input data block, an encoded data block is output from each (enabled) encoder D1 . . . Dm and maintained in a corresponding buffer (step 1844), and the encoded data block size is counted (step 1846).
Next, a compression ratio is calculated for each encoded data block by taking the ratio of the size of the input data block (as determined by the input counter 10 to the size of each encoded data block output from the enabled encoders (step 1848). Each compression ratio is then compared with an a priori-specified compression ratio threshold (step 1850). It is to be understood that the threshold limit may be specified as any value inclusive of data expansion, no data compression or expansion, or any arbitrarily desired compression limit. It is to be further understood that many of these algorithms may be lossy, and as such the limits may be subject to or modified by an end target storage, listening, or viewing device. Further notwithstanding that the current limit for lossless data compression is the entropy limit (the present definition of information content) for the data, the present invention does not preclude the use of future developments in lossless data compression that may increase lossless data compression ratios beyond what is currently known within the art. Additionally the content independent data compression threshold may be different from the content dependent threshold and either may be modified by the specific enabled encoders.
After the compression ratios are compared with the threshold, a determination is made as to whether the compression ratio of at least one of the encoded data blocks exceeds the threshold limit (step 1820). If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit (negative determination in step 1820), then the original unencoded input data block is selected for output and a null data compression type descriptor is appended thereto (step 1834). A null data compression type descriptor is defined as any recognizable data token or descriptor that indicates no data encoding has been applied to the input data block. Accordingly, the unencoded input data block with its corresponding null data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1836).
On the other hand, if one or more of the encoded data blocks possess a compression ratio greater than the compression ratio threshold limit (affirmative result in step 1820), then the encoded data block having the greatest compression ratio is selected (step 1822). An appropriate data compression type descriptor is then appended (step 1824). A data compression type descriptor is defined as any recognizable data token or descriptor that indicates which data encoding technique has been applied to the data. It is to be understood that, since encoders of the identical type may be applied in parallel to enhance encoding speed (as discussed above), the data compression type descriptor identifies the corresponding encoding technique applied to the encoded data block, not necessarily the specific encoder. The encoded data block having the greatest compression ratio along with its corresponding data compression type descriptor is then output for subsequent data processing, storage, or transmittal (step 1826).
After the encoded data block or the unencoded data input data block is output (steps 1826 and 1836), a determination is made as to whether the input data stream contains additional data blocks to be processed (step 1828). If the input data stream includes additional data blocks (affirmative result in step 1428), the next successive data block is received (step 1832), its block size is counted (return to step 1802) and the data compression process in repeated. This process is iterated for each data block in the input data stream. Once the final input data block is processed (negative result in step 1828), data compression of the input data stream is finished (step 1830).
It is to be appreciated that in the embodiments described above with reference to
Although illustrative embodiments have been described herein with reference to the accompanying drawings, it is to be understood that the present invention is not limited to those precise embodiments, and that various other changes and modifications may be affected therein by one skilled in the art without departing from the scope or spirit of the invention. All such changes and modifications are intended to be included within the scope of the invention as defined by the appended claims.