IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 11    
Website: http://www.ijser.org
scirp IJSER >> Volume 2, Issue 11, November 2011
Data Compression using Huffman based LZW Encoding Technique
Full Text(PDF, 3000)  PP.  
Md. Rubaiyat Hasan
Double Compression, Huffman based LZW Encoding, Data Compression, and Software Tools
Data compression is of interest in business data processing, both because of the cost savings it offers and because of the large volume of data manipulated in many business applications. A method and system for transmitting a digital image (i.e., an array of pixels) from a digital data source to a digital data receiver. More the size of the data be smaller, it provides better transmission speed and saves time. In this communication we always want to transmit data efficiently and noise free. Both the LZW and Huffman data compression methods are lossless in manner. These methods or some versions of them are very common in use of compressing different types of data. Even though on average Huffman gives better compression results, it determines the case in which the LZW performs best and when the compression efficiency gap between the LZW algorithm and its Huffman counterpart is the largest. In the case of Hybrid compression it gives better compression ratio than in single compression. So, at first I wanted to compress original data by Huffman Encoding Technique then by the LZW Encoding Technique .But it did not give better compression ratio than in single LZW compression. At that time I have found that if we compress the data by Huffman first and then by LZW all the cases it gives better compression ratio. Then it named as "Data compression using Huffman based LZW Encoding". Its compression ratio most of the cases above 2.55 and in some cases it becomes above 3.25 or more. It will provide cheap, reliable and efficient system for data compression in digital communication system.
[1] Digital Image Processing (Second papers: Edition)-2006 –Rafael C. Gonzalez and Richard E. Woods. Pages: 411, 440-442, 459

[2] Lecture 17on Data Compression: Patrick Karlsson Patrick. karlsson@cb.uu.se Center for Image Analysis. Uppsala University, Computer Assisted Image Analysis May 19 2006

[3] Chesnokov Yuriy-Former Cambridge University post -doc(http://www-ucc.ch.cam.ac.uk/research/yc274-research.html) currently lives in Krasnodar, Russia and doing some contract research for third parties.

[4] Mark Nelson's ""LZW Data Compression"" from the October, 1989 issue of Dr. Dobb's Journal.

[5] Huffman's original article:D.A. Huffman, ""[3]"" (PDF), Proceedings of the I.R.E., September 1952, pp1098-1102

[6] Background story Profile:David A. Huffman, Scientific American, Sept. 1991, pp. 54-58

[7] Thomas H. Cormen , Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to http://en.wikipedia.org/wiki/Huffman_coding22-Aug-07

[8] Abramson, N. 1963. Information Theory and Coding. McGraw-Hill, New York.

[9] Apostolico, A. and Fraenkel, A. S. 1985. Robust Transmission of Unbounded Strings Using Fibonacci Representations. Tech. Rep. CS85-14, Dept. of Appl. Math., The Weizmann Institute of Science, Sept.

[10] Elias, P. 1975. Universal Code word Sets and Representations of the Integers. Trans. Inform. Theory 21, 2 (Mar.), 194-203.

[11] Cappellini, V., Ed. 1985. Data Compression and Error Control Techniques with Applications. Academic Press, London.

[12] Connell, J. B. 1973. A Huffman-Shannon-Fano Code. Proc. IEEE 61, 7 (July), 1046-1047.

[13] Cormack, G. V. 1985. Data Compression on a Database System. Commun. ACM 28, 12 (Dec.), 1336-42.

[14] Cormack, G. V., and Horspool, R. N. 1984. Algorithms for Adaptive Huffman Codes. Inform. Process. Letts. 18, 3 (Mar.),159-65.

[15] Cortesi, D. 1982. An Effective Text-Compression Algorithm. BYTE 7, 1 (Jan.), 397-403.

[16] Cot, N. 1977. Characterization and Design of Optimal Prefix Codes. Ph. D. dissertation, Computer Science Dept.,StanfordUniv.,Stanford,Calif

Untitled Page