| 摘要 |
<p>A method for compressing data efficiently exploiting the periodicity of the data. In order to output a code stream by compressing an input data stream, encoded input data is stored in a moving window having a specified size. A partial sequence from a location (entry) in the moving window is compared with a data sequence to be encoded by means of a plurality of comparators. An entry having the greatest matching length is found as a result of the comparison by means of a matching finder. If a matching is found by the matching finder, a set (offset, matching length) of an offset up to the entry and the matching length is encoded by a matching code generator. The number of comparators is smaller than the size of the moving window. Part of the offset in the neighborhood of 0 (0 is not included), the offset in neighborhood of L, the offset in neighborhood of 2L, the offset in neighborhood of 3L, ... is used as the entry.</p> |
