.png){kind=icon}
.png){kind=icon}
Return
A Rolling Hash Algorithm and the Implementation to LZ4 Data Compression
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2974489.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
LZ77 is a dictionary compression algorithm by replacing the repeating sequence with the addresses of the previous referenced data in the stream. To find out these repetition, the LZ77 encoder maintains a hashing table, which have to frequently calculate hash values during the encoding process. In this paper, we present a class of rolling hash functions, that can calculate multiple hash values via a carry-less multiplication instruction. Then the proposed hash function is implemented in LZ4, which is a derivative of LZ77. The simulation shows that the encoding throughput of LZ4 has 15.7% improvement in average, and the compression ratio is +/- 1% in most cases.
Keywords:
Encoding
Data compression
Compression algorithms
Dictionaries
Indexes
Image coding
Image restoration
Carry-less multiplication
LZ4
LZ77
rolling hash
SIMD
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.