Data compression is a procedure of shortening the data by following some encoding rules to store or transmit the particular file from one location to another. Data compression is an important task as it cost more to store a large amount of data and to transfer the large amount of data over a network. So we can say that the data compression is a technique by which reduction of data is performed from its original representation so that it can be stored and transferred over the network easily and with lesser cost. In the proposed system, a dynamic nibble based data compression approach is used to compress the data. In this approach data is compressed in the combination of four bits. Performance of the proposed system is evaluated on the various input strings and is compared with the existing systems which is static but reduction algorithm. Performance results shows that the propose system is better than that of the existing system in terms of output bits, saving bits and compression ratio.

Data compression, Lossless data compression, Nibble based data compression, Static Bit Reduction

[1] U. N. Katugampola, “A New Technique for Text Data Compression”,International Symposium on Computer, Consumer and Control , 978-0-7695-4655-1 pp. 405-409, 2012.
[2] A.S. Sidhu, M. Garg, “Text Data Compression Algorithm using Hybrid Approach”, International Journal of Computer Science and Mobile Computing, Vol.3 Issue.12, pp. 01-10, 2014.
[3] S. Shanmugasundaram and R. Lourdusamy, “A Comparative Study of Text Compression Algorithms”,International Journal of Wisdom Based Computing, Vol. 1 (3), pp 68-76 , 2011.
[4] S. Kapoor and A. Chopra, "A Review of Lempel Ziv Compression Techniques" IJCST, Vol. 4, Issue 2, 2013.
[5] M.A.D. Suarjaya, "A New Algorithm for Data Compression Optimization", International Journal of Advanced Computer Science and Applications, Vol. 3, No. 8, pp.14-17,2012.
[6] S.R. Kodituwakku and U. S. Amarasinghe , "Comparison Of Lossless Data Compression Algorithms For Text Data" Indian Journal of Computer Science and Engineering, Vol. 1, No. 4, pp. 416-425 , 2010.
[7] R. Kaur and M. Goyal, “An Algorithm for Lossless Text Data Compression” International Journal of Engineering Research & Technology , Vol. 2 Issue 7, 2013
[8] H. Altarawneh and M. Altarawneh, "Data Compression Techniques on Text Files: A Comparison Study ”, International Journal of Computer Applications, Vol. 26 No.5, 2011.
[9] U. Khurana and A. Koul, “Text Compression And Superfast Searching” Thapar Institute Of Engineering and Technology, Patiala, Punjab, India-147004
[10] A. Singh and Y. Bhatnagar, “Enhancement of data compression using Incremental Encoding” International Journal of Scientific & Engineering Research, Vol. 3, Issue 5,2012.
[11] A.J Mann, “Analysis and Comparison of Algorithms for Lossless Data Compression", International Journal of Information and Computation Technology, Vol. 3, No.3, pp. 139-146, 2013.
[12] K. Rastogi, K. Sengar, “Analysis and Performance Comparison of Lossless Compression Techniques for Text Data” International Journal of Engineering Technology and Computer Research, Vol. 2 (1), pp. 16-19, 2014.
[13] M. Sharma, “Compression using Huffman Coding”, International Journal of Computer Science and Network Security, Vol.10 No.5, 2010.
[14] S. Shanmugasundaram and R. Lourdusamy, "IIDBE: A Lossless Text Transform for Better Compression " International Journal of Wisdom Based Computing, Vol. 1 (2), 2011
[15] P. Kumar and A.K Varshney, “ Double Huffman Coding ” International Journal of Advanced Research in Computer Science and Software Engineering , Vol. 2, Issue 8, pp. 517-520, 2012.