The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dua algoritma baharu untuk meningkatkan kelajuan pemampatan LZ77 dicadangkan. Satu adalah berdasarkan algoritma pencincangan baharu yang dinamakan pencincangan dua peringkat yang membolehkan carian padanan terpanjang yang pantas daripada kamus gelongsor, dan satu lagi menggunakan pengisihan akhiran. Yang pertama sesuai untuk kamus kecil dan ia meningkatkan kelajuan dengan ketara gzip, yang menggunakan algoritma pencincangan naif. Yang terakhir ini sesuai untuk kamus besar yang meningkatkan nisbah mampatan untuk fail besar. Kami juga bereksperimen pada nisbah mampatan dan kelajuan mampatan pengisihan blok, yang menggunakan pengisihan akhiran dalam algoritma pemampatannya. Keputusan menunjukkan bahawa LZ77 menggunakan cincang dua peringkat sesuai untuk kamus kecil, LZ77 menggunakan isihan akhiran adalah baik untuk kamus besar apabila kelajuan penyahmampatan yang cepat dan penggunaan memori yang cekap diperlukan, dan pengisihan blok adalah baik untuk kamus besar.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Kunihiko SADAKANE, Hiroshi IMAI, "Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 12, pp. 2689-2698, December 2000, doi: .
Abstract: Two new algorithms for improving the speed of the LZ77 compression are proposed. One is based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting. The former is suitable for small dictionaries and it significantly improves the speed of gzip, which uses a naive hashing algorithm. The latter is suitable for large dictionaries which improve compression ratio for large files. We also experiment on the compression ratio and the speed of block sorting compression, which uses suffix sorting in its compression algorithm. The results show that the LZ77 using the two-level hash is suitable for small dictionaries, the LZ77 using suffix sorting is good for large dictionaries when fast decompression speed and efficient use of memory are necessary, and block sorting is good for large dictionaries.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_12_2689/_p
Salinan
@ARTICLE{e83-a_12_2689,
author={Kunihiko SADAKANE, Hiroshi IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting},
year={2000},
volume={E83-A},
number={12},
pages={2689-2698},
abstract={Two new algorithms for improving the speed of the LZ77 compression are proposed. One is based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting. The former is suitable for small dictionaries and it significantly improves the speed of gzip, which uses a naive hashing algorithm. The latter is suitable for large dictionaries which improve compression ratio for large files. We also experiment on the compression ratio and the speed of block sorting compression, which uses suffix sorting in its compression algorithm. The results show that the LZ77 using the two-level hash is suitable for small dictionaries, the LZ77 using suffix sorting is good for large dictionaries when fast decompression speed and efficient use of memory are necessary, and block sorting is good for large dictionaries.},
keywords={},
doi={},
ISSN={},
month={December},}
Salinan
TY - JOUR
TI - Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2689
EP - 2698
AU - Kunihiko SADAKANE
AU - Hiroshi IMAI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2000
AB - Two new algorithms for improving the speed of the LZ77 compression are proposed. One is based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting. The former is suitable for small dictionaries and it significantly improves the speed of gzip, which uses a naive hashing algorithm. The latter is suitable for large dictionaries which improve compression ratio for large files. We also experiment on the compression ratio and the speed of block sorting compression, which uses suffix sorting in its compression algorithm. The results show that the LZ77 using the two-level hash is suitable for small dictionaries, the LZ77 using suffix sorting is good for large dictionaries when fast decompression speed and efficient use of memory are necessary, and block sorting is good for large dictionaries.
ER -