摘要 |
In a data compressor, the input stream of data characters is formed into one or more data character groupings where each grouping comprises a predetermined number of the data characters (grouped character) followed by one or more of the input data characters. The formed input is compared to similarly configured stored strings until a longest match is determined. Each stored string has a code associated therewith and the code of the longest match is output by the compressor. An extended string is stored comprising the longest match extended by the data character that caused the mismatch. A next compression cycle begins with a grouped character comprising the data character that caused the mismatch concatenated by one less than the predetermined number of the next following data characters.
|