Analysis of Huffman Coding and Lempel–Ziv–Welch (LZW) Coding as Data Compression Techniques
Keywords:
Digital data, input symbols, compression, minimum-redundancy, LZ Wcoding, Huffman codingAbstract
Huffman Coding is a statistical data compression providing to reduce code length that is used to represent the symbols of an alphabet. This is a standard technique for the creation of Minimum-Redundancy Codes. LZW is a dictionary based compression tool which is widely popular. This implies that instead of tabulating character counts and building trees LZW encodes data by referencing a dictionary. Compared to any adaptive and dynamic compression method, the concept is to initiate with an initial model, read data and update the framework and data encoding. In this paper, we investigated the following question: Which coding, LZW or Huffman, is more suitable compared to each other? The implemented results show that LZW requires no prior information about the input data stream, and also LZW can compress the input stream in one single pass allowing fast execution. LZW coding is more feasible when the high compression ratio and less compression-decompression time are needed.
References
https://en.wikipedia.org/wiki/Huffman_coding
http://www.geeks3.forgeeks.org/lzw-lempel-ziv-welch-compression-technique/
https://users.cs.cf.ac.uk/Dave.Marshall/Multimedia/node210.html
https://www.researchgate.net/publication/4140913_A_Memoryefficient_Huffman_Decoding_Algorithm
“Introduction to Data Compression”, by Guy E. Blelloch, Carnegie Mellon University, (October 16, 2001).
M. Rabbani, and P. W. Jones, “Digital Image Compression Techniques”, (Edition-4), p. 51, 1991.
S. Saha, “Image Compression – from DCT to Wavelets: A Review”, Unpublished.
http://www/acm/org/crossroads/xrds6-3/sahaimgcoding.html.
J.J. Rissanen and Langdon G. G. Jr., “Arithmetic Coding” (PDF), IBM Journal of Research and Development, Vol. 23, issue 2, pp. 149-162., 1979
http://researchweb.watson.ibm.com/journal/rd/232/ibmrd2302G.pdf. Retrieved 2007-09-22
S. Kajihara, “On Combining Pinpoint Test Set Relaxation and Run-Length Codes for Reducing Test Data Volume,” In Proceedings of the 21st International Conference on Computer Design (ICCD ’03) , San Jose, Calif, USA, 2003.
ITU-T Rec. T.81 ISO/IEC 10918-1, “Information Technology — Digital Compression and Coding of Continuous-Tone Still Images: Requirements and Guidelines,” 1994
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
