Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression

Authors

  • Mohamad Nurkamal Fauzan Department of Informatics Engineering, Polytechnic Pos Indonesia
  • Muhammad Alif Department of Informatics Engineering, Polytechnic Pos Indonesia
  • Cahyo Prianto3 Department of Informatics Engineering, Polytechnic Pos Indonesia

DOI:

https://doi.org/10.25299/itjrd.2023.10437

Keywords:

Comparison, Compression, Lossless, Huffman, Lempel Ziv Welch

Abstract

The development of data storage hardware is very rapidly over time. In line with the development of storage hardware, the amount of digital data shared on the internet is increasing every day. That way no matter how big the size of the storage device we have, of course, it will only be a matter of time until that storage space is exhausted. Therefore, in terms of maximizing storage space, a technique called compression emerged. This study focuses on a  comparative analysis of 2 Lossless compression technique algorithms, namely the Huffman algorithm and Lempel Ziv Welch (LZW). A number of test files with different file types are applied to both algorithms that are compared. The performance of the algorithm is determined based on the comparison of space saving and compression time. The test results showed that the Lempel Ziv Welch (LZW) algorithm was superior to Huffman’s algorithm in .txt file type compression and .csv, the average space savings produced were 63.85% and 77.56%. The degree of compression speed that each algorithm produces is directly proportional to the file size.

Downloads

Download data is not yet available.

References

M. R. Ashila, N. Atikah, D. R. I. M. Setiadi, E. H. Rachmawanto, and C. A. Sari, “Hybrid AES-Huffman Coding for Secure Lossless Transmission.”

I. K. Jaya and R. Perangin-angin, “Analisa Perbandingan Rasio Kecepatan Kompresi Algoritma Dynamic Markov Compression dan Huffman,” Publikasi Jurnal dan Penelitian Teknik Informatika, vol. 2, pp. 78–85, 2018.

Y. Murdianingsih and I. Isbahatunnisa, “IMPLEMENTASI METODE FUZZY TAHANI DALAM MENENTUKAN REKOMENDASI PEMBELIAN LAPTOP (Studi kasus di Toko Mega Alvindo Kalijati Subang),” Jurnal Teknologi Informasi dan Komunikasi STMIK Subang, vol. 13, no. 1, pp. 41–51, 2020.

N. I. Putri, R. Komalasari, and Z. Munawar, “PENTINGNYA KEAMANAN DATA DALAM INTELIJEN BISNIS,” Jurnal Sistem Informasi, vol. 1, no. 2, pp. 41–49, 2020.

Pujianto, Mujito, B. H. Prasetyo, and D. Prabowo, “Perbandingan Metode Huffman dan Run Length Encoding Pada Kompresi Document,” InfoTekjar: Jurnal Nasional Informatika dan Teknologi Jaringan, vol. 5, no. 1, pp. 216–223, 2020, doi: 10.30743/infotekjar.v5i1.2892.

M. Ignatoski, J. Lerga, L. Stanković, and M. Daković, “Comparison of entropy and dictionary based text compression in English, German, French, Italian, Czech, Hungarian, Finnish, and Croatian,” Mathematics, vol. 8, no. 7, Jul. 2020, doi: 10.3390/MATH8071059.

K. B. Adedeji, “Performance Evaluation of Data Compression Algorithms for IoT-Based Smart Water Network Management Applications,” Journal of Applied Science & Process Engineering, vol. 7, no. 2, pp. 554–563, 2020.

A. Gupta, A. Bansal, and V. Khanduja, Modern Lossless Compression Techniques: Review, Comparison and Analysis. 2017.

A. Gupta and S. Nigam, “A Review on Different Types of Lossless Data Compression Techniques,” International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 7, no. 1, pp. 50–56, Jan. 2021, doi: 10.32628/cseit217113.

A. Gopinath and M. Ravisankar, “Comparison of Lossless Data Compression Techniques,” in Proceedings of the 5th International Conference on Inventive Computation Technologies, ICICT 2020, Feb. 2020, pp. 628–633. doi: 10.1109/ICICT48043.2020.9112516.

W. Semunigus and B. Pattanaik, “Analysis for Lossless Data Compression Algorithms for Low Bandwidth Networks,” J Phys Conf Ser, vol. 1964, no. 4, pp. 1–5, Jul. 2021, doi: 10.1088/1742-6596/1964/4/042046.

B. A. Krishna, N. Madhuri, and M. Malleswari, “Comparison and Implementation of Compression Algorithms in WSNs,” IJERT Journal International Journal of Engineering Research and Technology, vol. 8, no. 7, pp. 1039–1042, 2019, [Online]. Available: www.ijert.org

E. Prayoga and K. M. Suryaningrum, “IMPLEMENTASI ALGORITMA HUFFMAN DAN RUN LENGTH ENCODING PADA APLIKASI KOMPRESI BERBASIS WEB,” 2018.

A. P. U. Siahan, “IMPLEMENTASI TEKNIK KOMPRESI TEKS HUFFMAN,” Jurnal Informatika, vol. 10, no. 2, pp. 1251–1261, 2016.

G. Shrividhiya, K. S. Srujana, S. N. Kashyap, and C. Gururaj, “Robust data compression algorithm utilizing LZW framework based on huffman technique,” in 2021 International Conference on Emerging Smart Computing and Informatics, ESCI 2021, Mar. 2021, pp. 234–237. doi: 10.1109/ESCI50559.2021.9396785.

H. N. Saad, F. mushtaq Jafar, and H. A. Salman, “A new compression technique in MANET: Compressed-LZW algorithm,” Indonesian Journal of Electrical Engineering and Computer Science, vol. 16, no. 2, pp. 890–896, 2019, doi: 10.11591/ijeecs.v16.i2.pp890-896.

R. Radescu, Comparative Study of Performances in Lossless Data Compression for English and Romanian Text Files Using the Q-Coder. 2018.

Downloads

Published

2022-12-30

How to Cite

Fauzan, M. N., Alif, M. ., & Prianto3, C. . (2022). Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression. IT Journal Research and Development, 7(2), 184–197. https://doi.org/10.25299/itjrd.2023.10437

Issue

Section

Articles

Most read articles by the same author(s)