Paper Info
Title
High Performance Lempel-Ziv Compression Using Optimized Longest String Parsing and Adaptive Huffman Window Size
Abstract
Summary form only given. We present optimizations that improve the compression and computational efficiency of Lempel-Ziv (LZ77) and Huffman algorithms. The compression performance of the LZ77 algorithm can be improved by using an optimized longest match parsing strategy. Another factor that can be considered is the size of the reference to the matching string, which can vary due to the secondary Huffman compression. We present an efficient parsing algorithm that considers both factors while minimizing the computational requirements. Our second optimization technique optimizes static Huffman encoding by efficiently dividing the input into blocks of varying size with uneven character frequency distributions
Year
DOI
Venue
2000
10.1109/DCC.2000.838215
Data Compression Conference
Keywords
Field
DocType
huffman algorithm,computational requirement,varying size,high performance lempel-ziv compression,optimized longest string parsing,computational efficiency,adaptive huffman window size,static huffman encoding,secondary huffman compression,efficient parsing algorithm,compression performance,lz77 algorithm,present optimizations,hardware,data compression,huffman,minimisation,compression algorithms,string matching,dictionaries,encoding,huffman codes,minimization
String searching algorithm,Computer science,Algorithm,Theoretical computer science,Minimisation (psychology),Minification,Huffman coding,Parsing,Data compression,Canonical Huffman code,Encoding (memory)
Conference
ISSN
ISBN
Citations 
1068-0314
0-7695-0592-9
0
PageRank 
References 
Authors
0.34
0
5
Name
Order
Citations
PageRank
Naphtali Rishe11178398.80
Artyom Shaposhnikov2297.49
Alexander Vaschillo3175.54
Dmitry Vasilevsky4176.56
Shu-Ching Chen51978182.74