Research Article
Study on Data Compression Technique
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 159 - Issue 5 |
| Published: Feb 2017 |
| Authors: Md Jayedul Haque, Mohammad Nurul Huda |
10.5120/ijca2017912416
|
Md Jayedul Haque, Mohammad Nurul Huda . Study on Data Compression Technique. International Journal of Computer Applications. 159, 5 (Feb 2017), 6-13. DOI=10.5120/ijca2017912416
@article{ 10.5120/ijca2017912416,
author = { Md Jayedul Haque,Mohammad Nurul Huda },
title = { Study on Data Compression Technique },
journal = { International Journal of Computer Applications },
year = { 2017 },
volume = { 159 },
number = { 5 },
pages = { 6-13 },
doi = { 10.5120/ijca2017912416 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2017
%A Md Jayedul Haque
%A Mohammad Nurul Huda
%T Study on Data Compression Technique%T
%J International Journal of Computer Applications
%V 159
%N 5
%P 6-13
%R 10.5120/ijca2017912416
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this current age both communication and generic file compression technologies are using different kind of efficient data compression methods massively. This paper surveys a variety of data compression methods. The aim of data compression is to reduce redundancy in stored or communicated data. Data compression has important application in the area of file storage and distributed system. This paper will provide an overview of several compression methods and will formulate new algorithms that may improve compression ratio and abate error in the reconstructed data. In this work the data compression techniques: Huffman, Run-Length, LZW, Shannon-Fano, Repeated-Huffman, Run-Length-Huffman, and Huffman-Run-Length are tested against different types of multimedia formats such as images and text, which shows the difference of various data compression methods on image and text file.
References
- Connel, J. B., “A Huffman-Shannon-Fano Code”, Proc. IEEE 61 (Jul. 1973), 1046-1047.
- Gallager, R. G., “Variations on a theme by Huffman”, IEEE Trans. Inf. Theory IT-24, 6(Nov. 1978), 668-674.
- Hashemian, R., “Memory efficient and high-speed search Huffman coding”, IEEE Trans. Comm. 43(10)(1995)2576-2581.
- M. N. Huda, "Study on Huffman Coding," Graduate Thesis, 2004.
- S. Porwal, Y. Chaudhary, J. Joshi and M. Jain , “ Data Compression Methodologies for Lossless Data and Comparison between Algorithms” International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 2, March 2013.
- Campos, A. S. E. Run Length Encoding. Available: http://www.arturocampos.com/ac_rle.html (last accessed July 2012).
- WELCH, T. A. 1984.” A technique for high-performance data compression”. IEEE Comput. 17, 6, 8–19. 9.
- ZIV, J. AND LEMPEL, A. 1978. “Compression of individual sequences via variable-rate coding”. IEEE Trans. Inform. Theory 24, 5, 530–536.
- ZIV, J. AND LEMPEL, A. 1977. A “universal algorithm for sequential data compression”. IEEE Trans. Inform. Theory 23, 3, 337–343.
- S. Shanmugasundaram and R. Lourdusamy, “A Comparative Study of Text Compression Algorithms” International Journal of Wisdom Based Computing, Vol. 1 (3), December 2011.
- Kao, Ch., H, and Hwang, R. J.: 'Information Hiding in Lossy Compression Gray Scale Image', Tamkang Journal of Science and Engineering, Vol. 8, No 2, 2005, pp. 99- 108.
- Ueno, H., and Morikawa, Y.: 'A New Distribution Modeling for Lossless Image Coding Using MMAE Predictors'. The 6th International Conference on Information Technology and Applications, 2009.
- Grgic, S., Mrak, M., and Grgic, M.: 'Comparison of JPEG Image Coders'. University of Zagreb, Faculty of Electrical Engineering and Computing Unska 3 / XII, HR-10000 Zagreb, Croatia.
- http://sipi.usc.edu, accessed Mar 2011.
- http://www.gutenberg.org/cache/epub/571/pg571.txt.
- Fano R.M., “The Transmission of Information”, Technical Report No. 65, Research Laboratory of Electronics, M.I.T., Cambridge, Mass.; 1949.
- Buro. M.: ‘On the maximum length of Huffman codes’, Information Processing Letters, Vol. 45, No.5, pp. 219-223, April 1993.
- Chen, H. C. and Wang, Y. L. and Lan, Y. F.: ‘A Memory Efficient and Fast Huffman Decoding Algorithm’Information Processing Letters, Vol. 69, No. 3, pp. 119- 122, February 1999.
- Ostadzadeh, S. A. and Elahi, B. M. and Zeialpour, Z. T, and Moulavi, M. M and Bertels, K. L. M, : A Two Phase Practical Parallel Algorithm for Construction of Huffman Codes, Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 284-291, Las Vegas, USA, June 2007.
- Wong, S. and Cotofana, D. and Vassiliadis, S.: General-Purpose Processor Huffman Encoding Extension, Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC 2000), pp. 158-163, Las Vegas, Nevada, March 2000.
- Huffman, D. A. : ‘A Method for the Construction of Minimum Redundancy Codes", Proc. IRE, Vol. 40, No. 9, pp. 1098-1101, September 1952.
- Doa'a Saad El-Shora & Ehab Rushdy Mohamed. A "Performance Evalution of Data Compression Techniques Versus Differenct Types of Data" . Article : (IJCSIS) International Journal of Computer Science and Information Security, Vol. 11, No. 12, December 2013
- Kashfia Sailunaz, Mohammed Rokibul Alam Kotwal and Dr.Mohammad Nurul Huda. Article: Data Compression Considering Text Files. International Journal of Computer Applications 90(11):27-32, March 2014. Full text available.
Index Terms
Keywords