摘要 |
A dictionary window storing a history of data to be compressed is compared with data to be compressed, and, when a data match is found, a code indicating a length of the data match and a code indicating a relative position of data in the dictionary window that produced the data match are generated. In the comparison, m groups of data in the dictionary window, each of the m groups including a total of n data, are compared substantially simultaneously with a total of n data in the data to be compressed, where m=2, 3, . . . and n=2, 3, . . . , and the compressed data is generated by encoding the data that produced the longest data match. |