Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

High performance Lempel-Ziv compression using optimized longest string parsing and adaptive Huffman window size

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Rishe, N. ; Sch. of Comput. Sci., Florida Int. Univ., Miami, FL, USA ; Shaposhnikov, A. ; Vaschillo, A. ; Vasilevsky, D.
more authors

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

Published in:

Data Compression Conference, 2000. Proceedings. DCC 2000

Date of Conference: