US 7,415,530 B2Grant
System and methods for accelerated data storage and retrieval
Issue Date:2008-08-19
•23 Claims
•21 Drawing Sheets
Abstract
Systems and methods for providing accelerated data storage and retrieval utilizing lossless data compression and decompression. A data storage accelerator includes one or a plurality of high speed data compression encoders that are configured to simultaneously or sequentially losslessly compress data at a rate equivalent to or faster than the transmission rate of an input data stream. The compressed data is subsequently stored in a target memory or other storage device whose input data storage bandwidth is lower than the original input data stream bandwidth. Similarly, a data retrieval accelerator includes one or a plurality of high speed data decompression decoders that are configured to simultaneously or sequentially losslessly decompress data at a rate equivalent to or faster than the input data stream from the target memory or storage device. The decompressed data is then output at rate data that is greater than the output rate from the target memory or data storage device. The data storage and retrieval accelerator method and system may employed: in a disk storage adapter to reduce the time required to store and retrieve data from computer to disk; in conjunction with random access memory to reduce the time required to store and retrieve data from random access memory; in a display controller to reduce the time required to send display data to the display controller or processor; and/or in an input/output controller to reduce the time required to store, retrieve, or transmit data.
Metadata
Assignee
- Realtime Data LLC
Inventor
- James J Fallon
Application Information
Application Number:US 11/553,426
Filing Date:2006-10-26
Priority Date:1999-03-11
Art Unit:2155
Classifications
IPC:
G06F13/00
Patent Drawings (21 sheets)
Description
[0001] This application is a continuation of U.S. patent application Ser. No. 10/628,795, filed on Jul. 28, 2003, now U.S. Pat. No. 7,130,913, which is a continuation of U.S. patent application Ser. No. 09/266,394 filed on Mar 11, 1999, now U.S. Pat. No. 6,601,104, both of which are hereby incorporated by reference herein in their entirety.
Background
[0002] 1. Technical Field
[0003] The present invention relates generally to data storage and retrieval and, more particularly to systems and methods for improving data storage and retrieval bandwidth utilizing lossless data compression and decompression.
[0004] 2. Description of the Related Art
[0005] 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.
[0006] 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.
[0007] 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.
[0008] 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: lossy and lossless data compression.
[0009] 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. Negentropy 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 that dictated by the negentropy 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 of the target display device.
[0010] 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 negentropy of a given data set.
[0011] It is well known within the current art that data compression provides several unique benefits. First, data compression can reduce the time to transmit data by more efficiently utilizing low bandwidth data links. Second, data compression economizes on data storage and allows more information to be stored for a fixed memory size by representing information more efficiently.
[0012] One problem with the current art is that existing memory storage devices severely limit the performance of consumer, entertainment, office, workstation, servers, and mainframe computers for all disk and memory intensive operations. For example, magnetic disk mass storage devices currently employed in a variety of home, business, and scientific computing applications suffer from significant seek-time access delays along with profound read/write data rate limitations. Currently the fastest available (10,000) rpm disk drives support only a 17.1 Megabyte per second data rate (MB/sec). This is in stark contrast to the modern Personal Computer's Peripheral Component Interconnect (PCI) Bus's input/output capability of 264 MB/sec and internal local bus capability of 800 MB/sec.
[0013] Another problem within the current art is that emergent high performance disk interface standards such as the Small Computer Systems Interface (SCSI-3) and Fibre Channel offer only the promise of higher data transfer rates through intermediate data buffering in random access memory. These interconnect strategies do not address the fundamental problem that all modern magnetic disk storage devices for the personal computer marketplace are still limited by the same physical media restriction of 17.1 MB/sec. Faster disk access data rates are only achieved by the high cost solution of simultaneously accessing multiple disk drives with a technique known within the art as data striping.
[0014] Additional problems with bandwidth limitations similarly occur within the art by all other forms of sequential, pseudo-random, and random access mass storage devices. Typically mass storage devices include magnetic and optical tape, magnetic and optical disks, and various solid-state mass storage devices. It should be noted that the present invention applies to all forms and manners of memory devices including storage devices utilizing magnetic, optical, and chemical techniques, or any combination thereof.
Summary of the Invention
[0015] The present invention is directed to systems and methods for providing accelerated data storage and retrieval by utilizing lossless data compression and decompression. The present invention provides an effective increase of the data storage and retrieval bandwidth of a memory storage device. In one aspect of the present invention, a method for providing accelerated data storage and retrieval comprises the steps of:
[0016] receiving a data stream at an input data transmission rate which is greater than a data storage rate of a target storage device;
[0017] compressing the data stream at a compression ratio which provides a data compression rate that is greater than the data storage rate;
[0018] storing the compressed data stream in the target storage device;
[0019] retrieving the compressed data stream from the target storage device at a rate equal to a data access rate of the target storage device; and
[0020] decompressing the compressed data at a decompression ratio to provide an output data stream having an output transmission rate which is greater than the data access rate of the target storage device.
[0021] In another aspect of the present invention, the method for providing accelerated data storage and retrieval utilizes a compression ratio that is at least equal to the ratio of the input data transmission rate to the data storage rate so as to provide continuous storage of the input data stream at the input data transmission rate.
[0022] In another aspect of the present invention, the method for providing accelerated data storage and retrieval utilizes a decompression ratio which is equal to or greater than the ratio of the data access rate to a maximum accepted output data transmission rate so as to provide a continuous and optimal data output transmission rate.
[0023] In another aspect of the present invention the data storage and retrieval accelerator method and system is employed in a disk storage adapter to reduce the time required to store and retrieve data from computer to a disk memory device.
[0024] In another aspect of the present invention the data storage and retrieval accelerator method and system is employed in conjunction with random access memory to reduce the time required to store and retrieve data from random access memory.
[0025] In another aspect of the present invention a data storage and retrieval accelerator method and system is employed in a video data storage system to reduce the time required to store digital video data.
[0026] In another aspect of the present invention the data storage and retrieval accelerator method and system is employed in a display controller to reduce the time required to send display data to the display controller or processor.
[0027] In another aspect of the present invention the data storage and retrieval accelerator method and system is employed in an input/output controller to reduce the time required to store, retrieve, or transmit data various forms of data.
[0028] The present invention is realized due to recent improvements in processing speed, inclusive of dedicated analog and digital hardware circuits, central processing units, digital signal processors, dedicated finite state machines (and any hybrid combinations thereof), that, coupled with advanced data compression and decompression algorithms, are enabling of ultra high bandwidth data compression and decompression methods that enable improved data storage and retrieval bandwidth.
[0029] These and other aspects, features and advantages, of the present invention will become apparent from the following detailed description of preferred embodiments, that is to be read in connection with the accompanying drawings.
Brief Description of the Drawings
[0030] FIG. 1 is a block diagram of a system for accelerated data storage and retrieval according to one embodiment of the present invention;
[0031] FIG. 2 is a flow diagram of a method for accelerated data storage in accordance with one aspect of the present invention;
[0032] FIG. 3 is a flow diagram of a method for accelerated data retrieval in accordance with one aspect of the present invention;
[0033] FIGS. 4 a and 4b are timing diagrams of methods for accelerated data storage according to the present invention;
[0034] FIGS. 5 a and 5b are timing diagrams of methods for accelerated data retrieval according to the present invention;
[0035] FIGS. 6 a and 6b comprise a flow diagram of a method for accelerated data storage in accordance with a further aspect of the present invention;
[0036] FIGS. 7 a and 7b comprise a flow diagram of a method for accelerated data retrieval in accordance with a further aspect of the present invention;
[0037] FIG. 8 is a detailed block diagram of a system for accelerated data storage according to a preferred embodiment of the present invention;
[0038] FIG. 9 is a detailed block diagram of a system for accelerated data retrieval according to a preferred embodiment of the present invention;
[0039] FIG. 10 is a block diagram of a system for accelerated video storage according to one embodiment of the present invention;
[0040] FIG. 11 is a block diagram of a system for accelerated retrieval of video data according to one embodiment of the present invention;
[0041] FIG. 12 is a block diagram of an input/output controller system for accelerated storage of analog, digital, and serial data according to one embodiment of the present invention;
[0042] FIG. 13 is a flow diagram of a method for accelerated storage of analog, digital, and serial data according to one aspect of the present invention;
[0043] FIG. 14 is a block diagram of an input/output system for accelerated retrieval of analog, digital, and serial data according to one embodiment of the present invention; and
[0044] FIGS. 15 a and 15b comprise a flow diagram of method for accelerated retrieval of analog, digital, and serial data according to one aspect of the present invention.
Detailed Description of Preferred Embodiments
[0045] The present invention is directed to systems and methods for providing improved data storage and retrieval bandwidth utilizing lossless 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. Preferably, the present invention is implemented on a computer platform including hardware such as one or more central processing units (CPU) or digital signal processors (DSP), a random access memory (RAM), and input/output (I/O) interface(s). The computer platform may also include an operating system, microinstruction code, and dedicated processing hardware utilizing combinatorial logic or finite state machines. The various processes and functions described herein may be either part of the hardware, microinstruction code or application programs that are executed via the operating system, or any combination thereof.
[0046] 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 that the systems are programmed. It is to be appreciated that special purpose microprocessors, digital signal processors, dedicated hardware, or and combination thereof 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.
[0047] Referring now to FIG. 1 , a block diagram illustrates a system for accelerated data storage and retrieval in accordance with an embodiment of the present invention. The system includes a data storage accelerator 10, operatively coupled to a data storage device 45. The data storage accelerator operates to increase the effective data storage rate of the data storage device 45. It is to be appreciated that the data storage device 45 may be any form of memory device including all forms of sequential, pseudo-random, and random access storage devices. The memory storage device 45 may be volatile or non-volatile in nature, or any combination thereof. Storage devices as known within the current art include all forms of random access memory, magnetic and optical tape, magnetic and optical disks, along with various other forms of solid-state mass storage devices. Thus it should be noted that the current invention applies to all forms and manners of memory devices including, but not limited to, storage devices utilizing magnetic, optical, and chemical techniques, or any combination thereof.
[0048] The data storage accelerator 10 receives and processes data blocks from an input data stream. The data blocks may range in size from individual bits through complete files or collections of multiple files, and the data block size may be fixed or variable. In order to achieve continuous data storage acceleration, the data storage accelerator 10 must be configured to compress a given input data block at a rate that is equal to or faster than receipt of the input data. Thus, to achieve optimum throughput, the rate that data blocks from the input data stream may be accepted by the data storage accelerator 10 is a function of the size of each input data block, the compression ratio achieved, and the bandwidth of the target storage device. For example, if the data storage device 45 (e.g., a typical target mass storage device) is capable of storing 20 megabytes per second and the data storage accelerator 10 is capable of providing an average compression ratio of 3:1, then 60 megabytes per second may be accepted as input and the data storage acceleration is precisely 3:1, equivalent to the average compression ratio.
[0049] It should be noted that it is not a requirement of the present invention to configure the storage accelerator 10 to compress a given input data block at a rate that is equal to or faster than receipt of the input data. Indeed, if the storage accelerator 10 compresses data at a rate that is less than the input data rate, buffering may be applied to accept data from the input data stream for subsequent compression.
[0050] Additionally, it is not a requirement that the data storage accelerator 10 utilize data compression with a ratio that is at least the ratio of the input data stream to the data storage access rate of the data storage device 45. Indeed, if the compression ratio is less than this ratio, the input data stream may be periodically halted to effectively reduce the rate of the input data stream. Alternatively, the input data stream or the output of the data accelerator 10 may be buffered to temporarily accommodate the mismatch in data bandwidth. An additional alternative is to reduce the input data rate to rate that is equal to or slower than the ratio of the input data rate to the data storage device access rate by signaling the data input source and requesting a slower data input rate, if possible.
[0051] Referring again to FIG. 1 , a data retrieval accelerator 80 is operatively connected to and receives data from the data storage device 45. The data retrieval accelerator 80 receives and processes compressed data from data storage device 45 in data blocks that may range in size from individual bits through complete files or collections of multiple files. Additionally, the input data block size may be fixed or variable. The data retrieval accelerator 80 is configured to decompress each compressed data block which is received from the data storage device 45. In order to achieve continuous accelerated data retrieval, the data retrieval accelerator must decompress a given input data block at a rate that is equal to or faster than receipt of the input data.
[0052] In a manner analogous to the data storage accelerator 10, achieving optimum throughput with the data retrieval accelerator 80 is a function of the rate that compressed data blocks are retrieved from the data storage device 45, the size of each data block, the decompression ratio achieved, and the limitation on the bandwidth of the output data stream, if any. For example, if the data storage device 45 is capable of continuously supplying 20 megabytes per second and the data retrieval accelerator 80 is capable of providing an average decompression ratio of 1:3, then a 60 megabytes per second output data stream is achieved, and the corresponding data retrieval acceleration is precisely 1:3, equivalent to the average decompression ratio.
[0053] It is to be understood that it is not required that the data retrieval accelerator 80 utilize data decompression with a ratio that is at most equal to the ratio of the retrieval rate of the data storage device 45 to the maximum rate data output stream. Indeed, if the decompression ratio is greater than this ratio, retrieving data from the data storage device may be periodically halted to effectively reduce the rate of the output data stream to be at or below its maximum. Alternatively, the compressed data retrieved from the data storage device 45 or the output of the data decompressor may be buffered to temporarily accommodate the mismatch in data bandwidth. An additional alternative is to increase the output data rate by signaling or otherwise requesting the data output device(s) receiving the output data stream to accept a higher bandwidth, if possible.
[0054] Referring now to FIG. 2 , a flow diagram of a method for accelerated data storage according to one aspect of the present invention illustrates the operation of the data storage acceleration shown in FIG. 1 . As previously stated above, data compression is performed on a per data block basis. Accordingly, the initial input data block in the input data stream (step 200) is input into and compressed by the data storage accelerator 10 (step 202). Upon completion of the encoding of the input data block, the encoded data block is then stored in the data storage device 45 (step 204). A check or other form of test is performed to see if there are additional data blocks available in the input stream (step 206). If no more data blocks are available, the storage acceleration process is terminated (step 208). If more data blocks are available in the input data stream, the next data block is received (step 210) and the process repeats beginning with data compression (step 202).
[0055] Referring now to FIG. 3 , a flow diagram of a method for accelerated data retrieval according to one aspect of the present invention illustrates the operation of the data retrieval accelerator 80 shown in FIG. 1 . Data decompression is also performed on a per data block basis. The initial compressed data block is retrieved from the storage device 45 (step 300) and is decompressed by the data retrieval accelerator 80 (step 302). Upon completion of the decoding of the initial data block, the decoded data block is then output for subsequent processing, storage, or transmittal (step 304). A check or other form of test is performed to see if additional data blocks available from the data storage device (step 306). If no more data blocks are available, the data retrieval acceleration process is terminated (step 308). If more data blocks are available from the data storage device, the next data block is retrieved (step 310) and the process repeats beginning with data decompression (step 302).
[0056] Referring now to FIGS. 4 a and 4b, a timing diagram illustrates methods for accelerated data storage utilizing data compression in accordance with the present invention. Successive time intervals of equal duration are represented as T1 through T(n+2). Data block 1 is received from an input stream of one or more data blocks. Similarly, data block 2 through data block n are received during time intervals T2 through Tn, respectively. For the purposes of discussion, FIGS. 4 a and 4b demonstrate one embodiment of the data storage utilizing a stream of n data blocks. As previously stated, the input data stream is comprised of one or more data blocks data blocks that may range in size from individual bits through complete files or collections of multiple files. Additionally, the input data block size may be fixed or variable.
[0057] In accordance with Method 1, compression of data block 1 and subsequent storage of the encoded data block 1 occurs within time interval T1. Similarly, the compression and storage of each successive data block occurs within the time interval the data block is received. Specifically, data blocks 2 . . . n are compressed in time intervals T2 . . . Tn, respectively, and the corresponding encoded data blocks 2 . . . n are stored during the time intervals T2 . . . Tn, respectively. It is to be understood that Method 1 relies on data compression and encoding techniques that process data as a contiguous stream, i.e., are not block oriented. It is well known within the current art that certain data compression techniques including, but not limited to, dictionary compression, run length encoding, null suppression and arithmetic compression are capable of encoding data when received. Method 1 possesses the advantage of introducing a minimum delay in the time from receipt of input to storage of encoded data blocks.
[0058] Referring again to FIGS. 4 a and 4b, Method 2 illustrates compressing and storing data utilizing pipelined data processing. For Method 2, successive time intervals of equal duration are represented as T1 through T(n+2). Data block 1 is received from an input stream of one or more data blocks during time interval T1. Similarly, data block 2 through data block n are received during time intervals T2 through Tn, respectively. Compression of data block 1 occurs during time interval T2 and the storage of encoded data block 1 occurs during time interval T3. As shown by Method 2, compression of each successive data block occurs within the next time interval after the data block is received and data storage of the corresponding encoded data block occur in the next time interval after completion of data compression.
[0059] The pipelining of Method 2, as shown, utilizes successive single time interval delays for data compression and data storage. Within the current invention, it is permissible to have increased pipelining to facilitate additional data processing or storage delays. For example, data compression processing for a single input data block may utilize more than one time interval. Accommodating more than one time interval for data compression requires additional data compressors to process successive data blocks, e.g., data compression processing of a single data block through three successive time intervals requires three data compressors, each processing a successive input data block. Due to the principle of causality, encoded data blocks are output only after compression encoding.
[0060] Method 2 provides for block oriented processing of the input data blocks. Within the current art, block oriented data compression techniques provide the opportunity for increased data compression ratios. The disadvantage of Method 2 is increased delay from receipt of input data block to storage of encoded data. Depending on factors such as the size of input data blocks, the rate that they are received, the time required for data compression processing, the data compression ratio achieved, the bandwidth of the data storage device, and the intended application, the delay may or may not be significant. For example, in a modern database system, recording data for archival purposes, the opportunity for increased data compression may far outweigh the need for minimum delay. Conversely, in systems such as a military real-time video targeting system, minimizing delay is often of the essence. It should be noted that Method 1 and Method 2 are not mutually exclusive, and may be utilized in any combination.
[0061] Referring now to FIGS. 5 a and 5b, a timing diagram illustrates methods for accelerated data retrieval utilizing data decompression in accordance the present invention shown. Successive time intervals of equal duration are represented as T1 through T(n+2). Data block 1 is retrieved or otherwise accepted as input from one or more compressed data blocks retrieved from a data storage device. As shown, data block 2 through data block n are retrieved during time intervals T2 through Tn, respectively. For the purposes of discussion, FIGS. 5 a and 5b demonstrate one embodiment of the data retrieval accelerator utilizing a stream of n data blocks. Once again, the retrieved data stream is comprised of one or more data blocks that may range in size from individual bits through complete files or collections of multiple files. Additionally, the retrieved data block size may be fixed or variable.
[0062] In accordance with Method 1, decompression of data block 1 and subsequent outputting of the decoded data block 1 occurs within time interval T1. Similarly, decompression and outputting of each successive data block occurs within the time intervals they are retrieved. In particular, data block 2 through data block n are decompressed and decoded data block 2 through decoded data block n are output during time intervals T2 . . . Tn, respectively. It is to be understood that Method 1 relies on data decompression and decoding techniques that process compressed data as a contiguous stream, i.e., are not block oriented. It is well known within the current art that certain data decompression techniques including, but not limited to, dictionary compression, run length encoding, null suppression and arithmetic compression are capable of decoding data when received. Method 1 possesses the advantage of introducing a minimum delay in the time from retrieval of compressed data to output of decoded data blocks.
[0063] Referring again to FIGS. 5 a and 5b, Method 2 involves decompressing and outputting data utilizing pipelined data processing. For Method 2, successive time intervals of equal duration are represented as T1 through T(n+2). Data block 1 through data block n are retrieved or otherwise accepted as input from a data storage device during time intervals T1 through Tn, respectively. Decompression of data block 1 occurs during time interval T2 and the decoded data block 1 is output during time interval T3. Similarly, decompression of each successive data block occurs within the next time interval after the data block is retrieved and the outputting of the decoded data block occurs during the next time interval after completion of data decompression.
[0064] The pipelining of Method 2, utilizes successive single time interval delays for data decompression and data output. Within the current invention, it is permissible to have increased pipelining to facilitate additional data retrieval or data decompression processing delays. For example, data decompression processing for a single input data block may utilize more than one time interval. Accommodating more than one time interval for data compression requires additional data decompressors to process successive compressed data blocks, e.g., data decompression processing of a single data block through three successive time intervals requires three data decompressors, each processing a successive input data block. Due to the principle of causality, decoded data blocks are only output after decompression decoding.
[0065] As before, Method 2 provides for block oriented processing of the retrieved data blocks. Within the current art, block oriented data decompression techniques provide the opportunity to utilize data compression encoders that increase data compression ratios. The disadvantage of method 2 is increased delay from retrieval of compressed data block to output of decompressed data. As previously discussed for data storage acceleration, depending on the size of retrieved data blocks, the rate that they are retrieved, the time required for data decompression processing, the data decompression ratio achieved, the bandwidth of the data output, and the intended application, the delay may or may not be significant.
[0066] Referring now to FIGS. 6 a and 6b, a flow diagram illustrates a method for accelerated data storage according to a further aspect of the present invention. With this method, the data compression rate of the storage accelerator 10 is not required to be equal to or greater than the ratio of the input data rate to the data storage access rate. As previously stated above, data compression is performed on a per data block basis. Accordingly, the initial input data block in the input data stream is received (step 600) and then timed and counted (step 602). Timing and counting enables determination of the bandwidth of the input data stream. The input data block is then buffered (step 604) and compressed by the data storage accelerator 10 (step 606). During and after the encoding of the input data block, the encoded data block is then timed and counted (step 608), thus enabling determination of the compression ratio and compression bandwidth. The compressed, timed and counted data block is then buffered (step 610). The compression ratio and bandwidths of the input data stream and the encoder are then determined (step 612). The compressed data block is then stored in the data storage device 45 (step 614). Checks or other forms of testing are applied to ensure that the data bandwidths of the input data stream, data compressor, and data storage device are compatible (step 616). If the bandwidths are not compatible, then one or more system parameters may be modified to make the bandwidths compatible (step 618). For instance, the input bandwidth may be adjusted by either not accepting input data requests, lowering the duty cycle of input data requests, or by signaling one or more of the data sources that transmit the input data stream to request or mandate a lower data rate. In addition, the data compression ratio of the data storage accelerator 10 may be adjusted by applying a different type of encoding process such as employing a single encoder, multiple parallel or sequential encoders, or any combination thereof. Furthermore, additional temporary buffering of either the input data stream or the compressed data stream (or both) may be utilized.
[0067] By way of example, assuming the input data rate is 90 MB/sec and the data storage accelerator 10 provides a compression ration of 3:1, then the output of the data storage accelerator 10 would be 30 MB/sec. If the maximum data storage rate of the data storage device 45 is 20 MB/sec (which is less than the data rate output from the data storage accelerator 10), data congestion and backup would occur at the output of the data storage accelerator 10. This problem may be solved by adjusting any one of the system parameters as discussed above, e.g., by adjusting the compression ratio to provide a data output rate from the data storage accelerator 10 to be equal to the data storage rate of the data storage device 45.
[0068] On the other hand, if the bandwidths are compatible (or made compatible by adjusting one or more of the system parameters), then a check or other form of test is performed to determine if there are additional data blocks available in the input stream (step 620). If no more data blocks are available, the storage acceleration process is terminated (step 622). If more data blocks are available in the input data stream, the next data block is received (step 624) and the process repeats beginning with timing and counting of the input data block (step 602).
[0069] Referring now to FIGS. 7 a and 7b, a flow diagram illustrates a method for accelerated data retrieval according to one aspect of the present invention. With this method, the data decompression ratio is not required to be less than or equal to the ratio of the data retrieval access rate to the maximum output data rate. As previously stated above, data decompression is performed on a per data block basis. Accordingly, the initial input data block is retrieved from the storage device (step 700) and is timed and counted (step 702). Timing and counting enables determination of the bandwidth of data retrieval. The retrieved data block is then buffered (step 704) and decompressed by the data retrieval accelerator 80 (step 706). During and after the decoding of the input data block, the decoded data block is then timed and counted (step 708), thus enabling determination of the decompression ratio and decompression bandwidth. The decompressed, timed and counted data block is then buffered (step 710). The decompression ratio and bandwidths of the retrieved data and the decoder are then determined (step 712). The decompressed data block is then output (step 714). Checks or other forms of testing are applied to ensure that the data bandwidths of the retrieved data, data decompressor, and data output are compatible (step 716). If the bandwidths are not compatible, then one or more system parameters may be modified to make the bandwidths compatible (step 718). For instance, the data retrieval bandwidth may be adjusted either not accepting (continuously) data blocks retrieved from the data storage device or lowering the duty cycle of data blocks retrieved from the data storage device. In addition, one or more of the output data devices that receive the output data stream may be signaled or otherwise requested to accept a higher data rate. Moreover, a different type of decoding process may be applied to adjust the data decompression rate by applying, for example, a single decoder, multiple parallel or sequential decoders, or any combination thereof. Also, additional temporary buffering of either the retrieved or output data or both may be utilized.
[0070] By way of example, assuming the data storage device 45 has a data retrieval rate of 20 MB/sec and the data retrieval accelerator 80 provides a 1:4 decompression ratio, then the output of the data retrieval accelerator 80 would be 80 MB/sec. If the maximum output data transmission rate that can be accepted from the data retrieval accelerator 80 is 60 MB/sec (which is lower than the data output data rate of 80 MB/sec of the data retrieval accelerator 80), data congestion and backup would occur at the output of the data retrieval accelerator 80. This problem may be solved by adjusting any one of the system parameters as discussed above, e.g., by adjusting the decompression ratio to provide a data output rate from the data storage accelerator 80 to be equal to the maximum accepted output data transmission rate.
[0071] On the other hand, if the bandwidths are compatible (or made compatible by adjusting one or more system parameters), then a check or other form of test is performed to see if there are additional data blocks available from the data storage device (step 720). If no more data blocks are available for output, the retrieval acceleration process is terminated (step 722). If more data blocks are available to be retrieved from the data storage device, the next data block is retrieved (step 724) and the process repeats beginning with timing and counting of the retrieved data block (return to step 702).
[0072] It is to be understood that any conventional compression/decompression system and method (which comply with the above mentioned constraints) may be employed in the data storage accelerator 10 and data retrieval accelerator 80 for providing accelerated data storage and retrieval in accordance with the present invention. Preferably, the present invention employs the data compression/decompression techniques disclosed in U.S. Ser. No. 09/210,491 entitled “Content Independent Data Compression Method and System,” filed on Dec. 11, 1998, which is commonly assigned and which is fully incorporated herein by reference. It is to be appreciated that the compression and decompression systems and methods disclosed in U.S. Ser. No. 09/210,491 are suitable for compressing and decompressing data at rates which provide accelerated data storage and retrieval.
[0073] Referring now to FIG. 8 , a detailed block diagram illustrates a preferred system for accelerated data storage which employs a compression system as disclosed in the above-incorporated U.S. Ser. No. 09/210,491. In this embodiment, the data storage accelerator 10 accepts data blocks from an input data stream and stores the input data block in an input buffer or cache 15. It is to be understood that the system processes the input data stream in data blocks that may range in size from individual bits through complete files or collections of multiple files. Additionally, the input data block size may be fixed or variable. A counter 20 counts or otherwise enumerates the size of input data block in any convenient units including bits, bytes, words, double words. It should be noted that the input buffer 15 and counter 20 are not required elements of the present invention. The input data buffer 15 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.
[0074] Data compression is performed by an encoder module 25 which may comprise a set of encoders E1, E2, E3 . . . En. The encoder set E1, E2, E3 . . . En may include any number “n” (where n may=1) 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. 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.
[0075] The encoder module 25 successively receives as input each of the buffered input data blocks (or unbuffered input data blocks from the counter module 20). Data compression is performed by the encoder module 25 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 encoding process may be performed either in parallel or sequentially. In particular, the encoders E1 through En of encoder module 25 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.
[0076] A buffer/counter module 30 is operatively connected to the encoder module 25 for buffering and counting the size of each of the encoded data blocks output from encoder module 25. 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 35, operatively connected to the output buffer/counter 30, 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 35 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 38, operatively coupled to the compression ratio module 35, 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 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. If there are no encoded data blocks having a compression ratio that exceeds the compression ratio threshold limit, then the original unencoded input data block is selected for output and a null data compression type descriptor is appended thereto. 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.
[0077] The data storage acceleration device 10 is connected to a data storage device interface 40. The function of the data storage interface 40 is to facilitate the formatting and transfer of data to one or more data storage devices 45. The data storage interface may be any of the data interfaces known to those skilled in the art such as SCSI (Small Computer Systems Interface), Fibre Channel, “Firewire”, IEEE P1394, SSA (Serial Storage Architecture), IDE (Integrated Disk Electronics), and ATA/ATAPI interfaces. It should be noted that the storage device data interface 40 is not required for implementing the present invention. As before, the data storage device 45 may be any form of memory device including all forms of sequential, pseudo-random, and random access storage devices. The data storage device 45 may be volatile or non-volatile in nature, or any combination thereof. Storage devices as known within the current art include all forms of random access memory (RAM), magnetic and optical tape, magnetic and optical disks, along with various other forms of solid-state mass storage devices (e.g., ATA/ATAPI IDE disk). Thus it should be noted that the current invention applies to all forms and manners of memory devices including, but not limited to, storage devices utilizing magnetic, optical, and chemical techniques, or any combination thereof.
[0078] Again, it is to be understood that the embodiment of the data storage accelerator 10 of FIG. 8 is exemplary of a preferred compression system which may be implemented in the present invention, and that other compression systems and methods known to those skilled in the art may be employed for providing accelerated data storage in accordance with the teachings herein. Indeed, in another embodiment of the compression system disclosed in the above-incorporated U.S. Ser. No. 09/210,491, a timer is included to measure the time elapsed during the encoding process against an a priori-specified time limit. When the time limit expires, only the data output from those encoders (in the encoder module 25) that have completed the present encoding cycle are compared to determine the encoded data with the highest compression ratio. The time limit ensures that the real-time or pseudo real-time nature of the data encoding is preserved. In addition, the results from each encoder in the encoder module 25 may be buffered to allow additional encoders to be sequentially applied to the output of the previous encoder, yielding a more optimal lossless data compression ratio. Such techniques are discussed in greater detail in the above-incorporated U.S. Ser. No. 09/210,491.
[0079] Referring now to FIG. 9 , a detailed block diagram illustrates a preferred system for accelerated data retrieval employing a decompression system as disclosed in the above-incorporated U.S. Ser. No. 09/210,491. In this embodiment, the data retrieval accelerator 80 retrieves or otherwise accepts data blocks from one or more data storage devices 45 and inputs the data via a data storage interface 50. It is to be understood that the system processes the input data stream in data blocks that may range in size from individual bits through complete files or collections of multiple files. Additionally, the input data block size may be fixed or variable. As stated above, the memory storage device 45 may be volatile or non-volatile in nature, or any combination thereof. Storage devices as known within the current art include all forms of random access memory, magnetic and optical tape, magnetic and optical disks, along with various other forms of solid-state mass storage devices. Thus it should be noted that the current invention applies to all forms and manners of memory devices including storage devices utilizing magnetic, optical, and chemical techniques, or any combination thereof. The data storage device interface 50 converts the input data from the storage device format to a format useful for data decompression.
[0080] The storage device data interface 50 is operatively connected to the data retrieval accelerator 80 which is utilized for decoding the stored (compressed) data, thus providing accelerated retrieval of stored data. In this embodiment, the data retrieval accelerator 80 comprises an input buffer 55 which receives as input an uncompressed or compressed data stream comprising one or more data blocks. The data blocks may range in size from individual bits through complete files or collections of multiple files. Additionally, the data block size may be fixed or variable. The input data buffer 55 is preferably included (not required) to provide storage of input data for various hardware implementations. A descriptor extraction module 60 receives the buffered (or unbuffered) input data block and then parses, lexically, syntactically, or otherwise analyzes the input data block using methods known by those skilled in the art to extract the data compression type descriptor associated with the data block. The data compression type descriptor may possess values corresponding to null (no encoding applied), a single applied encoding technique, or multiple encoding techniques applied in a specific or random order (in accordance with the data compression system embodiments and methods discussed above).
[0081] A decoder module 65 includes one or more 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.
[0082] As with the data compression systems discussed in U.S. application Ser. No. 09/210,491, the decoder module 65 may include multiple decoders of the same type applied in parallel so as to reduce the data decoding time. The data retrieval accelerator 80 also includes an output data buffer or cache 70 for buffering the decoded data block output from the decoder module 65. The output buffer 70 then provides data to the output data stream. It is to be appreciated by those skilled in the art that the data retrieval accelerator 80 may also include an input data counter and output data counter operatively coupled to the input and output, respectively, of the decoder module 65. In this manner, the compressed and corresponding decompressed data block may be counted to ensure that sufficient decompression is obtained for the input data block.
[0083] Again, it is to be understood that the embodiment of the data retrieval accelerator 80 of FIG. 9 is exemplary of a preferred decompression system and method which may be implemented in the present invention, and that other data decompression systems and methods known to those skilled in the art may be employed for providing accelerated data retrieval in accordance with the teachings herein.
[0084] In accordance with another aspect of the present invention, the data storage and retrieval accelerator system and method may be employed in for increasing the storage rate of video data. In particular, referring now to FIG. 10 , a block diagram illustrates a system for providing accelerated video data storage in accordance with one embodiment of the present invention. The video data storage acceleration system accepts as input one or more video data streams that are analog, digital, or any combination thereof in nature. The input multiplexer 1010 selects the initial video data stream for data compression and acceleration. The input multiplexer 1010 is operatively connected to an analog to digital converter 1020 which converts analog video inputs to digital format of desired resolution. The analog to digital converter 1020 may also include functions to strip video data synchronization to perform other data formatting functions. It should be noted that the analog to digital conversion process is not required for digital video inputs. The analog to digital converter 1020 is operatively connected a video memory 1030 that is, in turn, operatively connected to a video processor 1040. The video processor 1040 performs manipulation of the digital video data in accordance with any user desired processing functions. The video processor 1040 is operatively coupled to a video output memory 1050, that is operatively connected to a data storage accelerator 10 which compresses the video data to provide accelerated video data to the output data stream for subsequent data processing, storage, or transmittal of the video data. This video data acceleration process is repeated for all data blocks in the input data stream. If more video data blocks are available in the input data stream, the video multiplexer selects the next block of video for accelerated processing. Again, it is to be understood that the data storage accelerator 10 may employ any compression system which is capable of compressing data at a rate suitable for providing accelerated video data storage in accordance with the teachings herein.
[0085] In accordance with another aspect of the present invention, the accelerated data storage and retrieval system may be employed in a display controller to reduce the time required to send display data to a display controller or processor. In particular, referring now to FIG. 11 , a block diagram illustrates a display accelerator system in accordance with one embodiment of the present invention. The video display accelerator accepts as input one or more digital display data blocks from an input display data stream. It is to be understood that the system processes the input data stream in data blocks that may range in size from individual bits through complete files or collections of multiple files. Additionally, the input video data block size may be fixed or variable. The input data blocks are processed by a data retrieval accelerator 80 which employs a data decompression system in accordance with the teachings herein. Upon completion of data decompression, the decompressed data block is then output to a display memory 1110 that provides data to a display processor 1120. The display processor 1120 performs any user desired processing function. It is well known within the current art that display data is often provided in one or more symbolic formats such as Open Graphics Language (Open GL) or another display or image language. The display processor 1120 is operatively connected an output memory buffer 1130. The output memory 1130 supplies data to a display formatter 1140 that converts the data to a format compatible with the output display device or devices. Data from the display formatter 1140 is provided to the display driver 1150 that outputs data in appropriate format and drive signal levels to one or more display devices. It should be noted that the display memory 1110, display processor 1120, output memory 1130, display formatter 1140, and display driver 1150 are not required elements of the present invention.
[0086] In accordance with yet another aspect of the present invention, the data storage and retrieval accelerator system and method may be employed in an I/O controller to reduce the time for storing, retrieving or transmitting parallel data streams. In particular, referring now to FIG. 12 , a block diagram illustrates a system for accelerated data storage of analog, digital, and serial data in accordance with one embodiment of the present invention. The data storage accelerator 10 is capable of accepting one or more simultaneous analog, parallel digital, and serial data inputs. An analog input multiplexer 1205 selects the initial analog data for data compression and acceleration. The analog input multiplexer 1205 is operatively connected to an analog to digital converter 1210 that converts the analog input signal to digital data of the desired resolution. The digitized data output of the analog to digital converter 1210 is stored in an analog data memory buffer 1215 for subsequent data storage acceleration. Similarly, a parallel digital data input multiplexer 1220 selects the initial parallel digital data for data compression and acceleration. The parallel digital data input multiplexer 1220 is operatively connected to an input data latch 1225 that holds the input parallel digital data. The parallel digital data is then stored in digital data memory buffer 1245 for subsequent data storage acceleration. In addition, a serial digital data input multiplexer 1235 selects the initial serial digital data for data compression and acceleration. The serial digital data input multiplexer 1235 is operatively connected to a serial data interface 1240 that converts the serial data stream to a format useful for data acceleration. The formatted serial digital data is then stored in serial data memory buffer 1245 for subsequent data acceleration. The analog data memory 1215, parallel digital data memory 1230, and serial data memory 1245 are operatively connected to the data storage accelerator device 10. Data is selected from each data memory subsystem based upon a user defined algorithm or other selection criteria. It should be noted that the analog input multiplexer 1205, analog to digital converter 1210, analog data memory 1215, parallel data input multiplexer 1220, data latch 1225, digital data memory 1230, serial data input multiplexer 1235, serial data interface 1240, serial data memory 1245, and counter 20 are not required elements of the present invention. As stated above, the data storage accelerator 10 employs any of the data compression methods disclosed in the above-incorporated U.S. Ser. No. 09/210,491, or any conventional data compression method suitable for compressing data at a rate necessary for obtaining accelerated data storage. The data storage accelerator supplies accelerated data to the output data stream for subsequent data processing, storage, or transmittal.
[0087] Referring now to FIG. 13 , a flow diagram illustrates a method for accelerated data storage of analog, digital, and serial data according to one aspect of the present invention. The analog input multiplexer selects the initial analog data for data compression and acceleration (step 1300). The analog input multiplexer provides analog data to the analog to digital converter that converts the analog input signal to digital data of the desired resolution (step 1302). The digitized data output of the analog to digital converter is then buffered in the analog data memory buffer (step 1304) for subsequent data acceleration. Similarly, the parallel digital data multiplexer selects the initial parallel digital data for data compression and acceleration (step 1306). The parallel digital data multiplexer provides data to the input data latch that then holds the input parallel digital data (step 1308). The parallel digital data is then stored in digital data memory buffer for subsequent data acceleration (step 1310). The serial digital data input multiplexer selects the initial serial digital data for data compression and acceleration (step 1312). The serial digital data input multiplexer provides serial data to the serial data interface that converts the serial data stream to a format useful for data acceleration (step 1314). The formatted serial digital data is then stored in the serial data memory buffer for subsequent data acceleration (step 1316). A test or other check is performed to see if new analog data is available (step 1318). If no new analog data is available a second check is performed to see if new parallel data is available (step 1320). If no new parallel data is available, a third test is performed to see if new serial data is available (step 1322). If no new serial data is available (step 1322) the test sequence repeats with the test for new analog data (step 1318). If new analog data block is available (step 1318), or if new parallel data block is available (step 1320), or if new serial data block is available (step 1322), the input data block is compressed by the data storage accelerator (step 1324) utilizing any compression method suitable for providing accelerated data storage in accordance with the teachings herein. After data compression is complete, the compressed data block is then output subsequent accelerated data processing, storage, or transmittal (step 1326). After outputting data the process repeats beginning with a test for new analog data (return to step 1318).
[0088] Referring now to FIG. 14 , a block diagram illustrates a system for accelerated retrieval of analog, digital, and serial data in accordance with one embodiment of the present invention. A data retrieval accelerator 80 receives data from an input data stream. It is to be understood that the system processes the input data stream in data blocks that may range in size from individual bits through complete files or collections of multiple files. Additionally, the input data block size may be fixed or variable. The data retrieval accelerator 80 decompresses the input data utilizing any of the decompression methods suitable for providing accelerated data retrieval in accordance with the teachings herein. The data retrieval accelerator 80 is operatively connected to analog data memory 1405, digital data memory 1420, and serial data memory 1435. Dependent upon the type of input data block, the decoded data block is stored in the appropriate analog 1405, digital 1420, or serial 1435 data memory.
[0089] The analog data memory 1405 is operatively connected to a digital to analog converter 1410 that converts the decompressed digital data block into an analog signal. The digital to analog converter 1410 is further operatively connected to an analog hold and output driver 1415. The analog hold and output driver 1415 demultiplexes the analog signal output from the digital to analog converter 1410, samples and holds the analog data, and buffers the output analog data.
[0090] In a similar manner, the digital data memory 1420 is operatively connected to a digital data demultiplexer 1425 that routes the decompressed parallel digital data to the output data latch and driver 1430. The output latch and driver 1430 holds the digital data and buffers the parallel digital output.
[0091] Likewise, the serial data memory 1435 is operatively connected to a serial data interface 1440 that converts the decompressed data block to an output serial data stream. The serial data interface 1440 is further operatively connected to the serial demultiplexer and driver 1445 that routes the serial digital data to the appropriate output and buffers the serial data output.
[0092] Referring now to FIGS. 15 a and 15b, a flow diagram illustrates a method for accelerated retrieval of analog, digital, and serial data according to one aspect of the present invention. An initial data block is received (step 1500) and then decompressed by the data storage retrieval accelerator (step 1502). Upon completion of data decompression, a test or other check is performed to see if the data block is digitized analog data (step 1508). If the data block is not digitized analog data, a second check is performed to see if the data block is parallel digital data (step 1510). If the data block is not parallel digital data, a third test is performed to see if the data block serial data (step 1512). The result of at least one of the three tests will be affirmative.
[0093] If the data block is comprised of digitized analog data, the decoded data block is buffered in an “analog” digital data memory (step 1514). The decoded data block is then converted to an analog signal by a digital to analog converter (step 1520). The analog signal is then output (step 1522).
[0094] If the data block is comprised of parallel digital data, the decoded data block is buffered in a “parallel” digital data memory (step 1516). The decoded data block is then demultiplexed (step 1524) and routed to the appropriate the output data latch and driver. The output latch and driver then holds the digital data and buffers the parallel digital output (step 1526).
[0095] If the data block is comprised of serial data, the decoded data block is buffered in “serial” digital data memory (step 1518). The decoded data is then formatted to a serial data format (step 1528). The serial data is then demultiplexed, routed to the appropriate output, and output to a buffer (step 1530).
[0096] Upon output of analog data (step 1522), parallel digital data (step 1526), or serial digital data (step 1530), a test or other form of check is performed for more data blocks in the input stream (step 1532). If no more data blocks are available, the test repeats (return to step 1532). If a data block is available, the next data block is received (step 1534) and the process repeats beginning with step 1502.
[0097] 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.
Claims
Post-issuance certificates present
The text shown below may not reflect later post-issuance changes.
What is claimed is:
1. A system comprising:
a memory device; and
a data accelerator, wherein said data accelerator is coupled to said memory device, a data stream is received by said data accelerator in received form, said data stream includes a first data block and a second data block, said data stream is compressed by said data accelerator to provide a compressed data stream by compressing said first data block with a first compression technique and said second data block with a second compression technique, said first and second compression techniques are different, said compressed data stream is stored on said memory device, said compression and storage occurs faster than said data stream is able to be stored on said memory device in said received form, a first data descriptor is stored on said memory device indicative of said first compression technique, and said first descriptor is utilized to decompress the portion of said compressed data stream associated with said first data block.
2. The system of claim 1, wherein said data accelerator stores said first descriptor to said memory device.
3. The system of claim 1, wherein said data accelerator retrieves said first descriptor and said compressed data stream from said memory device.
4. The system of claim 1, wherein said data accelerator retrieves said compressed data stream from said memory device.
5. The system of claim 1, wherein said data accelerator retrieves said compressed data stream from said memory device and said decompression of the portion of said compressed data stream associated with said first data block is performed by said data accelerator.
6. The system of claim 1, wherein said data accelerator is coupled to said memory device via a small computer systems interface.
7. The system of claim 1, wherein said data accelerator is coupled to said memory device via a fibre channel.
8. The system of claim 1, wherein said data accelerator is coupled to said memory device via a serial storage architecture.
9. The system of claim 1, wherein said memory device is a magnetic memory device.
10. The system of claim 1, wherein said memory device is an optical memory device.
11. The system of claim 1, wherein said memory device is a random access memory.
12. The system of claim 1, wherein said memory device is a solid-state mass storage device.
13. The system of claim 1, wherein said first compression technique includes compressing with Huffman encoding.
14. The system of claim 1, wherein said first compression technique includes compressing with Lempel-Ziv encoding.
15. The system of claim 1, wherein said first compression technique includes compressing with a plurality of encoders in a serial configuration.
16. The system of claim 1, wherein said first compression technique includes compressing with a plurality of encoders in a parallel configuration.
17. The system of claim 1, wherein said first compression technique includes compressing with a plurality of encoders in a parallel configuration and each one of said plurality of encoders is an identical type of encoder.
18. The system of claim 1, wherein said first compression technique comprises compressing with a first encoder.
19. The system of claim 1, wherein said data stream comprises a collection of multiple files.
20. The system of claim 1, wherein said data stream includes a third data block and a fourth data block.
21. The system of claim 1, wherein said data stream includes a third data block and a fourth data block and said compressed data stream is provided by compressing said third data block with a third compression technique and compressing said fourth data block with a fourth compression technique.
22. The system of claim 1, wherein said data stream is an analog video data stream.
23. The system of claim 1, wherein said data stream is a digital video data stream.
Patent Citations (323)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4302775(A) | 1981-11-01 | Widergren et al. | Applicant |
| US4394774(A) | 1983-07-01 | Widergren et al. | Applicant |
| US4574351(A) | 1986-03-01 | Dang et al. | Applicant |
| US4593324(A) | 1986-06-01 | Ohkubo et al. | Applicant |
| US4682150(A) | 1987-07-01 | Mathes et al. | Applicant |
| US4730348(A) | 1988-03-01 | MacCrisken | Applicant |
| US4754351(A) | 1988-06-01 | Wright | Applicant |
| US4804959(A) | 1989-02-01 | Makansi et al. | Applicant |
| US4870415(A) | 1989-09-01 | Van Maren et al. | Applicant |
| US4872009(A) | 1989-10-01 | Tsukiyama et al. | Applicant |
| US4876541(A) | 1989-10-01 | Storer | Applicant |
| US4888812(A) | 1989-12-01 | Dinan et al. | Applicant |
| US4906995(A) | 1990-03-01 | Swanson | Applicant |
| US4929946(A) | 1990-05-01 | O'Brien et al. | Applicant |
| US4953324(A) | 1990-09-01 | Herrmann | Applicant |
| US4965675(A) | 1990-10-01 | Hori et al. | Applicant |
| US4988998(A) | 1991-01-01 | O'Brien | Applicant |
| US5028922(A) | 1991-07-01 | Huang | Applicant |
| US5045848(A) | 1991-09-01 | Fascenda | Applicant |
| US5045852(A) | 1991-09-01 | Mitchell et al. | Applicant |
| US5046027(A) | 1991-09-01 | Taaffe et al. | Applicant |
| US5049881(A) | 1991-09-01 | Gibson et al. | Applicant |
| US5091782(A) | 1992-02-01 | Krause et al. | Applicant |
| US5097261(A) | 1992-03-01 | Langdon, Jr. et al. | Applicant |
| US5113522(A) | 1992-05-01 | Dinwiddie, Jr. et al. | Applicant |
| US5121342(A) | 1992-06-01 | Szymborski | Applicant |
| US5150430(A) | 1992-09-01 | Chu | Applicant |
| US5159336(A) | 1992-10-01 | Rabin et al. | Applicant |
| US5175543(A) | 1992-12-01 | Lantz | Applicant |
| US5179651(A) | 1993-01-01 | Taaffe et al. | Applicant |
| US5187793(A) | 1993-02-01 | Keith et al. | Applicant |
| US5191431(A) | 1993-03-01 | Hasegawa et al. | Applicant |
| US5204756(A) | 1993-04-01 | Chevion et al. | Applicant |
| US5209220(A) | 1993-05-01 | Hiyama et al. | Applicant |
| US5212742(A) | 1993-05-01 | Normile et al. | Applicant |
| US5226176(A) | 1993-07-01 | Westaway et al. | Applicant |
| US5227893(A) | 1993-07-01 | Ett | Applicant |
| US5231492(A) | 1993-07-01 | Dangi et al. | Applicant |
| US5237460(A) | 1993-08-01 | Miller et al. | Applicant |
| US5237675(A) | 1993-08-01 | Hannon, Jr. | Applicant |
| US5243341(A) | 1993-09-01 | Seroussi et al. | Applicant |
| US5243348(A) | 1993-09-01 | Jackson | Applicant |
| US5247638(A) | 1993-09-01 | O'Brien et al. | Applicant |
| US5247646(A) | 1993-09-01 | Osterlund et al. | Applicant |
| US5263168(A) | 1993-11-01 | Toms et al. | Applicant |
| US5270832(A) | 1993-12-01 | Balkanski et al. | Applicant |
| US5287420(A) | 1994-02-01 | Barrett | Applicant |
| US5293379(A) | 1994-03-01 | Carr | Applicant |
| US5307497(A) | 1994-04-01 | Feigenbaum et al. | Applicant |
| US5309555(A) | 1994-05-01 | Akins et al. | Applicant |
| US5355498(A) | 1994-10-01 | Provino et al. | Applicant |
| US5357614(A) | 1994-10-01 | Pattisam et al. | Applicant |
| US5379036(A) | 1995-01-01 | Storer | Applicant |
| US5379757(A) | 1995-01-01 | Hiyama et al. | Applicant |
| US5381145(A) | 1995-01-01 | Allen et al. | Applicant |
| US5394534(A) | 1995-02-01 | Kulakowski et al. | Applicant |
| US5396228(A) | 1995-03-01 | Garahi | Applicant |
| US5400401(A) | 1995-03-01 | Wasilewski et al. | Applicant |
| US5403639(A) | 1995-04-01 | Belsan et al. | Applicant |
| US5406278(A) | 1995-04-01 | Graybill et al. | Applicant |
| US5406279(A) | 1995-04-01 | Anderson et al. | Applicant |
| US5412384(A) | 1995-05-01 | Chang et al. | Applicant |
| US5414850(A) | 1995-05-01 | Whiting | Applicant |
| US5420639(A) | 1995-05-01 | Perkins | Applicant |
| US5434983(A) | 1995-07-01 | Yaso et al. | Applicant |
| US5452287(A) | 1995-09-01 | Dicecco | Applicant |
| US5461679(A) | 1995-10-01 | Normile et al. | Applicant |
| US5467087(A) | 1995-11-01 | Chu | Applicant |
| US5471206(A) | 1995-11-01 | Allen et al. | Applicant |
| US5479587(A) | 1995-12-01 | Campbell et al. | Applicant |
| US5483470(A) | 1996-01-01 | Alur et al. | Applicant |
| US5486826(A) | 1996-01-01 | Remillard | Applicant |
| US5495244(A) | 1996-02-01 | Jeong et al. | Applicant |
| US5506844(A) | 1996-04-01 | Rao | Applicant |
| US5506872(A) | 1996-04-01 | Mohler | Applicant |
| US5530845(A) | 1996-06-01 | Hiatt et al. | Applicant |
| US5533051(A) | 1996-07-01 | James | Applicant |
| US5535356(A) | 1996-07-01 | Kim et al. | Applicant |
| US5537658(A) | 1996-07-01 | Bakke et al. | Applicant |
| US5557551(A) | 1996-09-01 | Craft | Applicant |
| US5557668(A) | 1996-09-01 | Brady | Applicant |
| US5557749(A) | 1996-09-01 | Norris | Applicant |
| US5561824(A) | 1996-10-01 | Carreiro et al. | Applicant |
| US5563961(A) | 1996-10-01 | Rynderman et al. | Applicant |
| US5574952(A) | 1996-11-01 | Brady et al. | Applicant |
| US5574953(A) | 1996-11-01 | Rust et al. | Applicant |
| US5576953(A) | 1996-11-01 | Hugentobler | Applicant |
| US5583500(A) | 1996-12-01 | Allen et al. | Applicant |
| US5590306(A) | 1996-12-01 | Watanabe et al. | Applicant |
| US5596674(A) | 1997-01-01 | Bhandari et al. | Applicant |
| US5604824(A) | 1997-02-01 | Chui et al. | Applicant |
| US5606706(A) | 1997-02-01 | Takamoto et al. | Applicant |
| US5611024(A) | 1997-03-01 | Campbell et al. | Applicant |
| US5612788(A) | 1997-03-01 | Stone | Applicant |
| US5613069(A) | 1997-03-01 | Walker | Applicant |
| US5615017(A) | 1997-03-01 | Choi | Applicant |
| US5621820(A) | 1997-04-01 | Rynderman et al. | Applicant |
| US5623623(A) | 1997-04-01 | Kim et al. | Applicant |
| US5623701(A) | 1997-04-01 | Bakke et al. | Applicant |
| US5627534(A) | 1997-05-01 | Craft | Applicant |
| US5627995(A) | 1997-05-01 | Miller et al. | Applicant |
| US5629732(A) | 1997-05-01 | Moskowitz et al. | Applicant |
| US5630092(A) | 1997-05-01 | Carreiro et al. | Applicant |
| US5635632(A) | 1997-06-01 | Fay et al. | Applicant |
| US5635932(A) | 1997-06-01 | Shinagawa et al. | Applicant |
| US5638498(A) | 1997-06-01 | Tyler et al. | Applicant |
| US5640158(A) | 1997-06-01 | Okayama et al. | Applicant |
| US5642506(A) | 1997-06-01 | Lee | Applicant |
| US5649032(A) | 1997-07-01 | Burt et al. | Applicant |
| US5652795(A) | 1997-07-01 | Dillon et al. | Applicant |
| US5652857(A) | 1997-07-01 | Shimoi et al. | Applicant |
| US5652917(A) | 1997-07-01 | Maupin et al. | Applicant |
| US5654703(A) | 1997-08-01 | Clark, II | Applicant |
| US5655138(A) | 1997-08-01 | Kikinis | Applicant |
| US5666560(A) | 1997-09-01 | Moertl et al. | Applicant |
| US5668737(A) | 1997-09-01 | Iler | Applicant |
| US5671389(A) | 1997-09-01 | Saliba | Applicant |
| US5675333(A) | 1997-10-01 | Boursier et al. | Applicant |
| US5686916(A) | 1997-11-01 | Bakhmutsky | Applicant |
| US5694619(A) | 1997-12-01 | Konno | Applicant |
| US5696927(A) | 1997-12-01 | MacDonald et al. | Applicant |
| US5703793(A) | 1997-12-01 | Wise et al. | Applicant |
| US5715477(A) | 1998-02-01 | Kikinis | Applicant |
| US5717393(A) | 1998-02-01 | Nakano et al. | Applicant |
| US5717394(A) | 1998-02-01 | Schwartz et al. | Applicant |
| US5719862(A) | 1998-02-01 | Lee et al. | Applicant |
| US5721958(A) | 1998-02-01 | Kikinis | Applicant |
| US5724475(A) | 1998-03-01 | Kirsten | Applicant |
| US5729228(A) | 1998-03-01 | Franaszek et al. | Applicant |
| US5748904(A) | 1998-05-01 | Huang et al. | Applicant |
| US5757852(A) | 1998-05-01 | Jericevic et al. | Applicant |
| US5771340(A) | 1998-06-01 | Nakazato et al. | Applicant |
| US5778411(A) | 1998-07-01 | DeMoss et al. | Applicant |
| US5781767(A) | 1998-07-01 | Inoue et al. | Applicant |
| US5784572(A) | 1998-07-01 | Rostoker et al. | Applicant |
| US5787487(A) | 1998-07-01 | Hashimoto et al. | Applicant |
| US5796864(A) | 1998-08-01 | Callahan | Applicant |
| US5799110(A) | 1998-08-01 | Israelsen et al. | Applicant |
| US5805932(A) | 1998-09-01 | Kawashima et al. | Applicant |
| US5808660(A) | 1998-09-01 | Sekine et al. | Applicant |
| US5809176(A) | 1998-09-01 | Yajima | Applicant |
| US5809337(A) | 1998-09-01 | Hannah et al. | Applicant |
| US5812789(A) | 1998-09-01 | Diaz et al. | Applicant |
| US5818368(A) | 1998-10-01 | Langley | Applicant |
| US5818369(A) | 1998-10-01 | Withers | Applicant |
| US5818530(A) | 1998-10-01 | Canfield et al. | Applicant |
| US5819215(A) | 1998-10-01 | Dobson et al. | Applicant |
| US5825424(A) | 1998-10-01 | Canfield et al. | Applicant |
| US5825830(A) | 1998-10-01 | Kopf | Applicant |
| US5832037(A) | 1998-11-01 | Park | Applicant |
| US5832126(A) | 1998-11-01 | Tanaka | Applicant |
| US5836003(A) | 1998-11-01 | Sadeh | Applicant |
| US5838996(A) | 1998-11-01 | deCarmo | Applicant |
| US5839100(A) | 1998-11-01 | Wegener | Applicant |
| US5841979(A) | 1998-11-01 | Schulhof et al. | Applicant |
| US5847762(A) | 1998-12-01 | Canfield | Applicant |
| US5861824(A) | 1999-01-01 | Ryu et al. | Applicant |
| US5861920(A) | 1999-01-01 | Mead et al. | Applicant |
| US5864342(A) | 1999-01-01 | Kajiya et al. | Applicant |
| US5867167(A) | 1999-02-01 | Deering | Applicant |
| US5867602(A) | 1999-02-01 | Zandi et al. | Applicant |
| US5870036(A) | 1999-02-01 | Franaszek et al. | Applicant |
| US5870087(A) | 1999-02-01 | Chau | Applicant |
| US5872530(A) | 1999-02-01 | Domyo et al. | Applicant |
| US5883975(A) | 1999-03-01 | Narita et al. | Applicant |
| US5886655(A) | 1999-03-01 | Rust | Applicant |
| US5889961(A) | 1999-03-01 | Dobbek | Applicant |
| US5915079(A) | 1999-06-01 | Vondran, Jr. et al. | Applicant |
| US5917438(A) | 1999-06-01 | Ando | Applicant |
| US5920326(A) | 1999-07-01 | Rentschler et al. | Applicant |
| US5936616(A) | 1999-08-01 | Torborg, Jr. et al. | Applicant |
| US5949355(A) | 1999-09-01 | Panaoussis | Applicant |
| US5955976(A) | 1999-09-01 | Heath | Applicant |
| US5960465(A) | 1999-09-01 | Adams | Applicant |
| US5964842(A) | 1999-10-01 | Packard | Applicant |
| US5968149(A) | 1999-10-01 | Jaquette et al. | Applicant |
| US5973630(A) | 1999-10-01 | Heath | Applicant |
| US5974235(A) | 1999-10-01 | Nunally et al. | Applicant |
| US5974471(A) | 1999-10-01 | Belt | Applicant |
| US5978483(A) | 1999-11-01 | Thompson, Jr. et al. | Applicant |
| US5982723(A) | 1999-11-01 | Kamatani | Applicant |
| US5991515(A) | 1999-11-01 | Fall et al. | Applicant |
| US5996033(A) | 1999-11-01 | Chiu-Hao | Applicant |
| US6000009(A) | 1999-12-01 | Brady | Applicant |
| US6002411(A) | 1999-12-01 | Dye | Applicant |
| US6003115(A) | 1999-12-01 | Spear et al. | Applicant |
| US6008743(A) | 1999-12-01 | Jaquette | Applicant |
| US6011901(A) | 2000-01-01 | Kirsten | Applicant |
| US6014694(A) | 2000-01-01 | Aharoni et al. | Applicant |
| US6026217(A) | 2000-02-01 | Adiletta | Applicant |
| US6028725(A) | 2000-02-01 | Blumenau | Applicant |
| US6031939(A) | 2000-02-01 | Gilbert et al. | Applicant |
| US6032148(A) | 2000-02-01 | Wilkes | Applicant |
| US6061398(A) | 2000-05-01 | Satoh et al. | Applicant |
| US6073232(A) | 2000-06-01 | Kroeker et al. | Applicant |
| US6075470(A) | 2000-06-01 | Little et al. | Applicant |
| US6091777(A) | 2000-07-01 | Guetz et al. | Applicant |
| US6094634(A) | 2000-07-01 | Yahagi et al. | Applicant |
| US6097520(A) | 2000-08-01 | Kadnier | Applicant |
| US6104389(A) | 2000-08-01 | Ando | Applicant |
| US6105130(A) | 2000-08-01 | Wu et al. | Applicant |
| US6128412(A) | 2000-10-01 | Satoh | Applicant |
| US6141053(A) | 2000-10-01 | Saukkonen | Applicant |
| US6145069(A) | 2000-11-01 | Dye | Applicant |
| US6169241(B1) | 2001-01-01 | Shimizu | Applicant |
| US6172936(B1) | 2001-01-01 | Kitazaki | Applicant |
| US6173381(B1) | 2001-01-01 | Dye | Applicant |
| US6182125(B1) | 2001-01-01 | Borella et al. | Applicant |
| US6192082(B1) | 2001-02-01 | Moriarty et al. | Applicant |
| US6195024(B1) | 2001-02-01 | Fallon | Applicant |
| US6195465(B1) | 2001-02-01 | Zandi et al. | Applicant |
| US6222886(B1) | 2001-04-01 | Yogeshwar | Examiner |
| US6225922(B1) | 2001-05-01 | Norton | Applicant |
| US6226667(B1) | 2001-05-01 | Matthews et al. | Applicant |
| US6226740(B1) | 2001-05-01 | Iga | Applicant |
| US6253264(B1) | 2001-06-01 | Sebastian | Applicant |
| US6272178(B1) | 2001-08-01 | Nieweglowski et al. | Applicant |
| US6272627(B1) | 2001-08-01 | Mann | Applicant |
| US6272628(B1) | 2001-08-01 | Aguilar et al. | Applicant |
| US6282641(B1) | 2001-08-01 | Christensen | Applicant |
| US6308311(B1) | 2001-10-01 | Carmichael et al. | Applicant |
| US6309424(B1) | 2001-10-01 | Fallon | Applicant |
| US6317714(B1) | 2001-11-01 | Del Castillo et al. | Applicant |
| US6330622(B1) | 2001-12-01 | Schaefer | Applicant |
| US6345307(B1) | 2002-02-01 | Booth | Applicant |
| US6392567(B2) | 2002-05-01 | Satoh | Applicant |
| US6404931(B1) | 2002-06-01 | Chen et al. | Applicant |
| US6421387(B1) | 2002-07-01 | Rhee | Applicant |
| US6434168(B1) | 2002-08-01 | Kari | Applicant |
| US6434695(B1) | 2002-08-01 | Esfahani et al. | Applicant |
| US6442659(B1) | 2002-08-01 | Blumenau | Applicant |
| US6449682(B1) | 2002-09-01 | Toorians | Applicant |
| US6452602(B1) | 2002-09-01 | Morein | Applicant |
| US6463509(B1) | 2002-10-01 | Teoman et al. | Applicant |
| US6487640(B1) | 2002-11-01 | Lipasti | Applicant |
| US6489902(B2) | 2002-12-01 | Heath | Applicant |
| US6513113(B1) | 2003-01-01 | Kobayashi | Applicant |
| US6529633(B1) | 2003-03-01 | Easwar et al. | Applicant |
| US6532121(B1) | 2003-03-01 | Rust et al. | Examiner |
| US6539456(B2) | 2003-03-01 | Stewart | Applicant |
| US6542644(B1) | 2003-04-01 | Satoh | Applicant |
| US6577254(B2) | 2003-06-01 | Rasmussen | Applicant |
| US6590609(B1) | 2003-07-01 | Kitade et al. | Applicant |
| US6597812(B1) | 2003-07-01 | Fallon et al. | Applicant |
| US6601104(B1) | 2003-07-01 | Fallon | Applicant |
| US6604040(B2) | 2003-08-01 | Kawasaki et al. | Applicant |
| US6604158(B1) | 2003-08-01 | Fallon | Applicant |
| US6606040(B2) | 2003-08-01 | Abdat | Applicant |
| US6606413(B1) | 2003-08-01 | Zeineh | Applicant |
| US6609223(B1) | 2003-08-01 | Wolfgang | Applicant |
| US6618728(B1) | 2003-09-01 | Rail | Applicant |
| US6624761(B2) | 2003-09-01 | Fallon | Applicant |
| US6650261(B2) | 2003-11-01 | Nelson et al. | Applicant |
| US6661839(B1) | 2003-12-01 | Ishida et al. | Applicant |
| US6661845(B1) | 2003-12-01 | Herath | Applicant |
| US6704840(B2) | 2004-03-01 | Nalawadi et al. | Applicant |
| US6711709(B1) | 2004-03-01 | York | Applicant |
| US6717534(B2) | 2004-04-01 | Yokose | Applicant |
| US6731814(B2) | 2004-05-01 | Zeck et al. | Applicant |
| US6745282(B2) | 2004-06-01 | Okada et al. | Applicant |
| US6748457(B2) | 2004-06-01 | Fallon et al. | Applicant |
| US6756922(B2) | 2004-06-01 | Ossia | Applicant |
| US6810434(B2) | 2004-10-01 | Muthujumaraswathy et al. | Applicant |
| US6856651(B2) | 2005-02-01 | Singh | Applicant |
| US6885316(B2) | 2005-04-01 | Mehring | Applicant |
| US6885319(B2) | 2005-04-01 | Geiger et al. | Applicant |
| US6888893(B2) | 2005-05-01 | Li et al. | Applicant |
| US6909383(B2) | 2005-06-01 | Shokrollahi et al. | Applicant |
| US6944740(B2) | 2005-09-01 | Abali et al. | Applicant |
| US7054493(B2) | 2006-05-01 | Schwartz | Applicant |
| US7102544(B1) | 2006-09-01 | Liu | Applicant |
| US7130913(B2) | 2006-10-01 | Fallon | Applicant |
| US7161506(B2) | 2007-01-01 | Fallon | Applicant |
| US7181608(B2) | 2007-02-01 | Fallon et al. | Applicant |
| US7190284(B1) | 2007-03-01 | Dye et al. | Applicant |
| US7321937(B2) | 2008-01-01 | Fallon | Applicant |
| US2001/0031092(A1) | 2001-10-01 | Zeck et al. | Applicant |
| US2001/0032128(A1) | 2001-10-01 | Kepecs | Applicant |
| US2001/0052038(A1) | 2001-12-01 | Fallon et al. | Applicant |
| US2002/0037035(A1) | 2002-03-01 | Singh | Applicant |
| US2002/0080871(A1) | 2002-06-01 | Fallon et al. | Applicant |
| US2002/0101367(A1) | 2002-08-01 | Geiger et al. | Applicant |
| US2002/0104891(A1) | 2002-08-01 | Otto | Applicant |
| US2002/0126755(A1) | 2002-09-01 | Li et al. | Applicant |
| US2002/0191692(A1) | 2002-12-01 | Fallon et al. | Applicant |
| US2003/0030575(A1) | 2003-02-01 | Frachtenberg et al. | Applicant |
| US2003/0034905(A1) | 2003-02-01 | Anton et al. | Applicant |
| US2003/0084238(A1) | 2003-05-01 | Okada et al. | Applicant |
| US2003/0142874(A1) | 2003-07-01 | Schwartz | Applicant |
| US2003/0191876(A1) | 2003-10-01 | Fallon | Applicant |
| US2004/0042506(A1) | 2004-03-01 | Fallon et al. | Applicant |
| US2004/0073710(A1) | 2004-04-01 | Fallon | Applicant |
| US2006/0015650(A1) | 2006-01-01 | Fallon | Applicant |
| US2006/0181441(A1) | 2006-08-01 | Fallon | Applicant |
| US2006/0181442(A1) | 2006-08-01 | Fallon | Applicant |
| US2006/0184696(A1) | 2006-08-01 | Fallon | Applicant |
| US2006/0190644(A1) | 2006-08-01 | Fallon | Applicant |
| US2006/0195601(A1) | 2006-08-01 | Fallon | Applicant |
| US2007/0043939(A1) | 2007-02-01 | Fallon et al. | Applicant |
| US2007/0050514(A1) | 2007-03-01 | Fallon | Applicant |
| US2007/0050515(A1) | 2007-03-01 | Fallon | Applicant |
| US2007/0083746(A1) | 2007-04-01 | Fallon et al. | Applicant |
| US2007/0109154(A1) | 2007-05-01 | Fallon | Applicant |
| US2007/0109155(A1) | 2007-05-01 | Fallon | Applicant |
| US2007/0109156(A1) | 2007-05-01 | Fallon | Applicant |
| US2007/0174209(A1) | 2007-07-01 | Fallon et al. | Applicant |
| DE4127518 | 1992-02-01 | Applicant | |
| EP164677 | 1985-12-01 | Applicant | |
| EP185098 | 1986-06-01 | Applicant | |
| EP283798 | 1988-09-01 | Applicant | |
| EP405572 | 1991-01-01 | Applicant | |
| EP493130 | 1992-07-01 | Applicant | |
| EP587437 | 1994-03-01 | Applicant | |
| EP595406 | 1994-05-01 | Applicant | |
| EP718751 | 1996-06-01 | Applicant | |
| GB2162025 | 1986-01-01 | Applicant | |
| JP6051989 | 1994-02-01 | Applicant | |
| JP9188009 | 1997-07-01 | Applicant | |
| JP11149376 | 1999-06-01 | Applicant | |
| WO9414273 | 1994-06-01 | Applicant | |
| WO9429852 | 1994-12-01 | Applicant | |
| WO9502873 | 1995-01-01 | Applicant | |
| WO9748212 | 1997-12-01 | Applicant |
Non-Patent Literature (18)
- Rice, Robert F., “Some Practical Universal Noiseless Coding Techniques”, Jet Propulsion Laboratory, Pasadena, California, JPL Publication 79-22, Mar. 15, 1979.Applicant
- Anderson, J., et al. “Codec squeezes color teleconferencing through digital telephone lines”, Electronics 1984, pp. 113-115.Applicant
- Venbrux, Jack, “A VLSI Chip Set for High-Speed Lossless Data Compression”, IEEE Trans. On Circuits and Systems for Video Technology, vol. 2, No. 44, Dec. 1992, pp. 381-391.Applicant
- “Fast Dos Soft Boot”, IBM Technical Disclosure Bulletin, Feb. 1994, vol. 37, Issue No. 2B, pp. 185-186.Applicant
- “Operating System Platform Abstraction Method”, IBM Technical Disclosure Bulletin, Feb. 1995, vol. 38, Issue No. 2, pp. 343-344.Applicant
- Murashita, K., et al., “High-Speed Statistical Compression using Self-organized Rules and Predetermined Code Tables”, IEEE, 1996 Data Compression Conference.Applicant
- Coene, W., et al. “A Fast Route For Application of Rate-distortion Optimal Quantization in an MPEG Video Encoder” Proceedings of the International Conference on Image Processing, Lausanne, Switzerland, IEEE, Sep. 16, 1996, pp. 825-828.Applicant
- Rice, Robert, “Lossless Coding Standards for Space Data Systems”, IEEE 1058-6393/97, pp. 577-585.Applicant
- Yeh, Pen-Shu, “The CCSDS Lossless Data Compression Recommendation for Space Applications”, Chapter 16, Lossless Compression Handbook, Elsevier Science (USA), 2003, pp. 311-326.Applicant
- Millman, Howard, “Image and video compression”, Computerworld, vol. 33, Issue No. 3, Jan. 18, 1999, pp. 78.Applicant
- “IBM boosts your memory”, Geek.com [online], Jun. 26, 2000 [retrieved on Jul. 6, 2007], <URL: http://www.geek.com/ibm-boosts-your-memory/>.Applicant
- “IBM Research Breakthrough Doubles Computer Memory Capacity”, IBM Press Release [online], Jun. 26, 2000 [retrieved on Jul. 6, 2007], <URL: http://www-03.ibm.com/press/us/en/pressrelease /1653.wss>.Applicant
- “ServerWorks To Deliver IBM's Memory eXpansion Technology in Next-Generation Core Logic for Servers”, ServerWorks Press Release [online], Jun. 27, 2000 [retrieved on Jul. 14, 2000], <URL: http://www.serverworks.com/news/press/ 000627.html>.Applicant
- Abali, B., et al., “Memory Expansion Technology (MXT) Software support and performance”, IBM Journal of Research and Development, vol. 45, Issue No. 2, Mar. 2001, pp. 287-301.Applicant
- Franaszek, P. A., et al., “Algorithms and data structures for compressed-memory machines”, IBM Journal of Research and Development, vol. 45, Issue No. 2, Mar. 2001, pp. 245-258.Applicant
- Franaszek, P. A., et al., “On internal organization in compressed random-access memories”, IBM Journal of Research and Development, vol. 45, Issue No. 2, Mar. 2001, pp. 259-270.Applicant
- Smith, T.B., et al., “Memory Expansion Technology (MXT) Competitive impact”, IBM Journal of Research and Development, Vo. 45, Issue No. 2, Mar. 2001, pp. 303-309.Applicant
- Tremaine, R. B., et al., “IBM Memory Expansion Technology (MXT)”, IBM Journal of Research and Development, vol. 45, Issue No. 2, Mar. 2001, pp. 271-285.Applicant