A Rolling Hash Algorithm and the Implementation to LZ4 Data Compression

22Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Jiang, H., & Lin, S. J. (2020). A Rolling Hash Algorithm and the Implementation to LZ4 Data Compression. IEEE Access, 8, 35529–35534. https://doi.org/10.1109/ACCESS.2020.2974489

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free