| 摘要 |
PROBLEM TO BE SOLVED: To provide a data compression method that can losslessly compress data at high-speed by utilizing high-speed processing of expansion. SOLUTION: A dictionary area is reserved and initialized. A 1st storage area stores '0' when succeeding data to the 3rd byte of read data appear in the past by using top 2 bytes of the read data for an index and stores address information of a 2nd storage area storing information with respect to the succeeding data when appearing. The 2nd storage area comprises succeeding data in 1-byte, a 1st address, '0' when other pattern taken by a succeeding 1 byte does not exist, and an address in chain connection to other 2nd storage area storing data of other pattern when existing. When the same data equal to 3 bytes including the 2nd storage area appear in the past, data after the 4th byte of the read data are compared with the data after the 3 bytes + an address precedingly appearing and the longest coincident length L and the address are coded and outputted. |
