Performance-based reset of data compression dictionary

Abstract: An adaptive data compression system is reset when performance drops below a predetermined threshold to permit greater compression of long files with evolving distributions of symbol combinations. The compression inclludes a data compressor (11), a timer (13), a up-down counter (15), a comparator (17), and a resettable dictionary (21). Initially unassigned codes in the dictionary are strategically assigned to symbol combinations as they are encountered in the data stream. The difference between the bit-lengths of corresponding lengths of the compressor input and output is determined by the up-down counter (15). The comparator (17) compares this difference with a value representing a predetermined performance threshold. The dictionary (21) can be reset if the actual performance falls below a performance threshold set by a threshold programmer (29). The reset can be inhibited while the dictionary (21) is less than half-full to ensure that performance measures are statistically significant. However, if the performance is such that data expansion is occurring, reset is not so delayed.

Description: The present invention relates to data storage and communications and, more particularly, to data compression. A major objective of the present invention is to provide improved performance in adaptive data compression systems. Data compression is the reversible re-encoding of information into a more compact expression. This more compact expression permits information to be stored and/or communicated more efficiently, generally saving both time and expense. A typical encoding scheme, e.g., those based on ASCII, encode alphanumeric characters and other symbols into binary sequences. A major class of compression schemes encode symbol combinations using binary sequences not otherwise used to encode individual symbols. Compression is effected to the degree that the symbol combinations represented in the encoding scheme are encountered in a given text or other file. By analogy with bilingual dictionaries used to translate between human languages, the device that embodies the mapping of uncompressed code into compressed code is commonly referred to as a "dictionary". The present invention is primarily applicable to dictionary-based compression schemes, which are part of a larger class of sequential compression schemes. These are contrasted with non-sequential schemes which examine an entire file before determining the encoding to be used. Other sequential compression schemes, such as run-length limited (RLL) compression, can be used in conjunction with the present invention. Generally, the usefulness of a dictionary-based compression scheme is dependent on the frequency with which the symbol combination entries in the dictionary are matched as a given file is being compressed. A dictionary optimized for one file type is unlikely to be optimized for another. For example, a dictionary which includes a large number of symbol combinations likely to be found in newspaper text files is unlikely to compress effectively data base files, spreadsheet files, bit-mapped graphics files, computer-aided design files, Musical Instrument Data Interface (MIDI) files, etc. Thus, a strategy using a single fixed dictionary might be best tied to a single application program. A more sophisticated strategy can incorporate means for identifying file types and select among a predetermined set of dictionaries accordingly. Even the more sophisticated fixed dictionary schemes are limited by the requirement that a file to be compressed must be matched to one of a limited number of dictionaries. Furthermore, there is no widely accepted standard for identifying file types, essentially limiting multiple dictionary schemes to specific applications or manufacturers. Adaptive compression schemes are known in which the dictionary used to compress a given file is developed as that file is being compressed. Entries are made into a dictionary as symbol combinations are encountered in the file. The entries are used on subsequent occurrences of an encoded combination. Compression is effected to the extent that the symbol combinations occurring most frequently in the file are encountered as the dictionary is developing. Systems incorporating adaptive compression schemes can include means for clearing the dictionary between files so that the dictionary can be adapted on a file-by-file basis. Adaptive compression systems and methods are disclosed in U.S. Patent No. 4,464,650 to Eastman et al. and U.S. Patent No. 4,558,302 to Welch. These references explain further the use of dictionaries in both adaptive and non-adaptive compression strategies. Further pertinent references to compression strategies include: G. Herd, "Data Compression: Techniques and Applications - Hardware and Software Considerations, Wiley, 1983; R.G. Gallager, "Variations on a Theme of Huffman", IEEE Transactions on Information Theory, Vol. IT-24, No. 6, pp. 668-674, November 1978; J. Ziv and A. Lempel, "A Universal AIgorithm for Sequential Data Compression", IEEE Transactions on Information Theory, Vol. IT-23, No. 3, pp. 337-343, May 1977; J. Ziv and A. Lempel, "Compression of Individual Sequences via Variable Rate Coding", IEEE Transactions of Information Theory, Vol. IT-24, No. 5, pp. 530-536, September 1978; and T.A. Welch, "A Technique for High Performance Data Compression", IEEE computer 1984. US 4386416 describes a compression system with compressor means for processing a digital data stream according to an adaptive strategy. The compressor includes a dictionary with assignable codes, and assignment means for assigning codes to input digital data. The system also includes reset means for resetting the dictionary. The system employs access counters to record the number of occasions the dictionary codes are used, and the counters indicate the relative frequencies of the codes. When all the counters reach a maximum value of seven, a reset is triggered irrespective of the efficiency of the present assigned codes. US 4646061 describes a non-adaptive compressor system which uses compressor means in the form of parallel "frequency encoders" which indicate the frequencies of predetermined data sequences. Three encoders are used, one each adapted for optimum efficiency with text data, numerical data, and program-text type data. The frequency encoders provide their outputs in parallel to a controller which then selects the frequency encoder with the best "frequency" values. The selected output is supplied to a Huffman encoder. US 4626829 describes a system comprising a compressor in the form of a run-length encoder in series with a statistical Huffman encoder. The statistical encoding is pre-set based on prior data, and the system is said to alleviate the need for "tagging signals" to identify the decoding technique to be used (and thereby reduce the likelihood of data expansion) and it also reduces the size of the encoding and decoding dictionary databases. In an adaptive compression scheme, the degree of compression depends on the extent to which the portion of the file used to develop the dictionary resembles the remainder of the file. "Resembles" is used here to refer to a similarity in symbol-combination frequency distributions. However, especially with certain long files, the frequency distribution of symbol combinations can shift dramatically over the length of a file. For example, a financial report beginning with a verbal description of a company and its performance and concluding with primarily tabular numeric data would not be compressed optimally when the dictionary was completed before the numeric tables were encountered. Accordingly, a compression scheme is desired which provides the advantages of adaptive compression schemes but yields improved performance for long files with changing frequency distributions of symbol combinations. Such a scheme should be adapted to communications and storage systems without requiring special file type codes so that the scheme can be applied effectively to a great variety of file types. SUMMARY OF THE INVENTION The present invention is defined in the claims. The present invention provides for a compression scheme in which a dictionary can be reset during file compression in response to feedback from a performance monitoring function. More specifically, the dictionary can be reset when performance falls below a selected threshold. In a preferred embodiment, the reset function is inhibited until the dictionary is sufficiently developed for a meaningful performance evaluation. For example, the reset function can be inhibited until an appropriate percentage of the assignable codes have been assigned to symbol combinations. However, if during this part of the dictionary's development, the performance falls below a second threshold, the dictionary is reset anyway. More specifically, if the compressor is expanding rather than compressing, the dictionary can be reset even if only a minority of its assignable codes have been assigned. The performance monitoring function can involve an up/down counter which determines the difference between the numbers of input bits and output bits for a given data block. This difference can be made to correspond to a compression ratio by fixing the length of the data block over which the difference is determined. A timer in the form of a simple counter can be used to trigger a read of the up/down counter after a fixed number of input bits. The threshold below which a reset is triggered, for example, by a comparator, can be fixed. Alternatively, a threshold programmer can be used to adjust the threshold. In the case of files which maintain a relatively constant combination frequency distribution, resets are not made and the present invention emulates the schemes of the prior art. In the case of long files over which combination distributions change, improved performance is achieved by allowing the dictionary to be re-developed for different distinct portions of a long file. Other features and advantages of the present invention are apparent from the description below with reference to the following drawing. BRIEF DESCRIPTION OF THE DRAWING The FIGURE is a schematic view of a data compression system in accordance with the present invention. DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention provides for a data compression system including a data compressor 11, a timer 13, an up/down counter 15 and a comparator 17, as shown in the FIGURE. Timer 13 and up/down counter 15 constitute a performance monitor, the output of which can be compared to a threshold by comparator 17. A reset loop is closed by a line 19 connecting the comparator output to one of two reset inputs of data compressor 11. Data compressor 11 includes a dictionary 21 with a fixed section 23 and a programmable section 25. Fixed section 23 includes codes which are preassigned to certain inputs, such as individual symbols. Programmable section 25 includes codes which are assignable, for example, to symbol combinations. According to a predetermined adaptive compression strategy, certain of the symbol combinations encountered in an input file are assigned available dictionary codes. The illustrated dictionary 21 has about four thousand codes, of which about 95% are in the programmable section 25. Thus, once dictionary 21 is filled, i.e., all of its assignable codes assigned, each of a great majority of dictionary codes can be used to represent multiple input codes, thus promoting data compression. The reset strategy employed in the data compression system of the FIGURE is twofold. Basically, dictionary 21 is cleared, i.e., reset, when compression performance falls below a predetermined threshold, provided dictionary 21 has developed far enough for the performance determination output by up/down counter 15 to be meaningful. In addition, a reset occurs via line 27 without regard to dictionary development when it is determined that the data stream is expanding rather than contracting. Data compressor 11 receives data from a "data in" line 101 at an input 103 and directs, from an output 105, re-encoded, and preferably compressed, data to a "data out" line 107. In addition, data compressor 11 includes a status output 109 indicating when dictionary 21 is one-half full and two functionally equivalent reset inputs 111 and 113 which can be used to reset dictionary 21 in accordance with feedback from counter 15 or comparator 17. When data compressor 11 is reset, dictionary 21 is cleared for "re-development" as the nature of the file being compressed changes. Up/down counter 15, otherwise characterizable as a bi-directional counter, counts up each bit it receives at an input 115 representing data input and counts down for each bit it receives at an input 117 representing data output and thus reflects the difference between the input and output code lengths for a given data block. Block length can be measured in bits or multiples thereof. The magnitude and sign of a difference in length reflect the performance of data compressor 11. Since compression ratios rather than differences are of interest, it is necessary to relate this difference to the absolute number of input data bits received at an input 115. This function is provided by timer 13. Timer 13 fixes the data block length over which performance is assessed so that the differences read out from up/down counter 15 can be converted to compression ratios. Timer 13 can be a simple unidirectional counter which receives data at an input 119 and which resets itself using an input 121 and provides an output signal from an output 123 when a predetermined count is reached. The illustrated timer 13 is a 1K counter. As an alternative, a programmable counter can be used to provide for variable sample sizes. When an output signal from timer 13 activates a latch input L 125 of up/down counter 15, its current value X is latched and up/down counter 15 itself is cleared. The latched value X, representing the difference between the bits received at input 115 less the bits received at input 117, is directed from an output 127 an input 129 of comparator 17 for comparison with a preset threshold N. If the latched value X exceeds the threshold, dictionary 21, with its current mapping to symbol combinations, is providing satisfactory compression; therefore, no reset signal is issued. However, if the difference falls below the predetermined threshold, i.e., X<N, a reset signal can be issued along line 19 to clear dictionary 21. Compression performance is inherently limited at the beginning of dictionary development. Thus the illustrated system directs the status output 109 of compressor 11 to an output enable input 131 of comparator 17 to prevent reset for less than optimal performance before dictionary 21 is half-full. Once dictionary 21 is at least half-full, comparator output 133 is activated to direct a signal to reset input 113 so that if the programmed threshold is not met, dictionary 21 is reset. However, if latched counter value X is negative, the compression ratio is less than one and the data is being expanded rather than compressed. Accordingly, a negative value indicated by an active signal from an output 135 to reset data compressor 11 via input 111 whether or not dictionary 21 is half-full. The illustrated dictionary 21 has a capacity of 4K and so will be about 1/4 full after 1K bytes of input with little or no matching of symbol combinations. The threshold input to the comparator can be a predetermined constant. However, the illustrated system includes a threshold programmer 29 for varying the threshold based on the compression performance history of the file as indicated by a series of outputs from up/down counter 15 received at an input 137. Theshold programmer 29 directs a threshold signal from its output 139 to an input 141 of comparator 17. This arrangement permits a higher threshold can be set for a file where high compression ratios have been achieved, and lower thresholds can be set for files with low maximum compression ratios. In this regard, it is noted that files differ greatly in the extent to which they can be compressed by any strategy. Accordingly, a higher threshold can be used to detect performance degradation in the latter portions of a file in which a relatively great compression ratio has been achieved in the earlier portions. On the other hand, a lower threshold can be applied when it appears that the compression ratio achieved, although relatively low, has remained near a file maximum and thus is optimal for the current file. In the illustrated embodiment a compression ratio below unity, indicated by a negative output from up/down counter 15, serves as a lower threshold which is operative even while dictionary 21 is less than half full. In alternative embodiments, the lower threshold can be set elsewhere. Other embodiments incorporate more complex relationships between dictionary status and thresholds. In a variation of the illustrated system, two series combinations of a counter and pre-scaler (programmable divider) are inserted at node A 143 and at node B 145 so that counting ranges for the timer and the up/down counter need not be very wide. Provisions can be made for making the timer programmable to allow longer and shorter sample periods. The level of dictionary development can be made adjustable so that levels other than 1/2 can be used to control whether or not the comparator can reset the dictionary. Of course, a wide range of adaptive compression strategies can be employed by the compressor. In addition, the adaptive strategy can be used in combination with various strategies, such as run length compression. These and other variations and modifications on the described embodiments can be made on the present invention, the scope of which is limited only by the following claims.

Claims: A system comprising: compressor means (11) for processing a digital data stream according to a predetermined adaptive compression strategy, said compressor means (11) including: compressor input means (103) for receiving an input stream to be compressed, compressor output means (105) for outputting an output stream yielded by said compression strategy, dictionary means (21) for translating digital input sequences in said input stream into codes constituting said output stream, said dictionary means (21) having a predetermined set of codes including assignable codes, said dictionary means (21) having an initial state in which said assignable codes are not assigned to input sequences, and assignment means for, in accordance with said compression strategy, assigning unassigned ones of said assignable codes to digital input sequences as they are received in said input stream by said compressor input means (103); monitor means (15) for providing a performance reading for said compressor means (11) by comparing the bit-lengths of corresponding segments of said input stream and said output stream, said monitor means (15) being coupled to said compressor input means (103) and said compressor output means (105); threshold means (17) for providing a performance comparison of said performance reading with a predetermined performance threshold, said threshold means (17) being coupled to said monitor means (15); and reset means (133) for resetting said dictionary means (21) to said initial state as a function of said performance comparison, said reset means (133) being coupled to said threshold means (17) and said compressor means (11). The system of Claim 1 further comprising dictionary level means (109) for providing dictionary status information regarding the extent to which assignable codes have been assigned at any given time, said dictionary level means (109) being coupled to said reset means (133) so that said reset means (133) can reset said dictionary means (21) as a function of said performance comparison and said dictionary status information. The system of Claim 2 wherein said dictionary level means (109) provides a dictionary status signal to said reset means (133) indicating whether a predetermined percentage of said assignable codes has been assigned. The system of Claim 3 wherein said reset means (133) resets said dictionary means (21) to its initial state when said monitor means (15) indicates said compressor means (11) is expanding said digital data stream rather than compressing it, said reset means (133) also resetting said dictionary means (21) when said performance, as determined by said monitor means (15), falls below said performance threshold as determined by said threshold means (17) provided said predetermined percentage of assignable codes has been achieved as indicated by said dictionary level means (109). The system of Claim 1 wherein: said monitor means (15) includes bi-directional counter means ( 15) for providing a performance measure for said compressor means (11) by counting in one direction in proportion to number of bits in said input stream received by said compressor input means (103) and by counting in the opposite direction in proportion to the number of bits output by said compressor means (11) in said output stream, and uni-directional counter means (13) coupled to said compressor input means (103) for detecting when a predetermined number of input bits have been received, said uni-directional counter means (13) being coupled to said bi-directional counter (15) so as to enable it to provide a bi-directional count output when the predetermined number of input bits has been received; and said threshold means (17) includes a comparator ( 17) for comparing said bi-directional count output from the bi-directional counter (15) with said performance threshold. The system of Claim 1 further comprising: threshold programming means (29) for programming said performance threshold of said threshold means (17) as a function of performances previously indicated by said monitor means (15), said threshold programming means (29) being coupled to said monitor means (15) and said threshold means (17). A method for enhancing the performance of a compressor embodying a dictionary-based adaptive compression strategy, said method comprising: inputting a data file into an adaptive data compressor (11) having a resettable dictionary (21); monitoring the performance of said compressor (11) by comparing the bit-lengths of corresponding segments of the data input to said compressor (11) and data output by said compressor (11); and clearing assignable codes in said dictionary (21) when the performance of said compressor (11) falls below a first threshold (at 17). The method of Claim 7 further comprising: setting said first threshold as a function of prior performance of said compressor (11) since the later of a) the beginning of the present file and b) the most recent reset. The method of Claim 7 further comprising: prior to said clearing step, waiting until a predetermined percentage of assignable codes in said dictionary have been assigned. The method of Claim 9 wherein: if during said waiting step, the performance of said compressor (11) falls below a second threshold corresponding to poorer performance than said first threshold, clearing said dictionary irrespective of the percentage of assignable codes which have been assigned.

Inventors: KATO JEFF J, RUSKA DAVID W, VAN MAREN DAVID J, KATO, JEFF J., RUSKA, DAVID W., VAN MAREN, DAVID J.
Applicants: HEWLETT PACKARD CO, HEWLETT-PACKARD COMPANY
Application year: 1988
Main classification: H03M7
IPC codes: H03M7, G06F5