2.5

CiteScore

8.8

Global Impact Factor

Experimental Study of Huffman Algorithm of Data Compression with LZW Technique


Paper ID: EIJTEM_2015_2_2_11-14

Author's Name: Tansen Patel, Shika Gupta and Dr.P. Udayakumar

Volume: 2

Issue: 2

Year: 2015

Page No: 11-14

Abstract:

The Huffman algorithm is widely used in data compression because it achieves an excellent compromise between compression performance and speed of execution. The main purpose of this paper is to present the technique used in data compression for high performance and efficient way of both Huffman and LZW (Lempel- Ziv – Welch)compression technique. The compression that is achieved by a coding technique, data structure is best in terms of both speed and memory consumption. The data structure of Huffman Coding is simple and very good, and the design of the hash function also teaches the reader a great deal about LZW in general. Here we focus on compression’s data structure scheme of the Huffman coding technique as well as LZW technique. Huffman coding treat as itself a data structure to manipulating the data items but in case of LZW technique a hash function is applied as data structure for compressing the data of source files. An analysis of Huffman algorithm and study of LZW compression are effectively covered. To applying the hash function in the process of compression in the algorithm of LZW compression is implemented in the experimental platform. We implement the Huffman coding technique as a method of the compression technique. This methods are the benchmark for the compression, it manipulate the data of the source file during process of the compressing. Inserting and searching of the data is performing faster and better in hash technique. In this paper we take different type of files and apply some files in different format to calculating the performance of compression. Result of applied Huffman coding and LZW technique is calculated in the term of compression ratio and space saving, all resultant data are represented in form of figures and tables, and finally describe conclusion and future work of this paper.

Keywords: Data Compression, Huffman, LZW, Hash Function, Compression Ratio

View PDF