Analisis Perbandingan Kinerja Algoritma Huffman Dan Algoritma Levenstein Dalam Kompresi File Dokumen Format .RTF

 (*)Dwi Asdini Mail (Universitas Budi Darma, Medan, Indonesia)
 Dito Putro Utomo (Universitas Budi Darma, Medan, Indonesia)

(*) Corresponding Author

Abstract

Document files with the .RTF format are files that are quite often used but have a fairly large size. Large file sizes often experience problems when sending files where the sending process can take a long time and can consume a lot of storage space because too much large data is stored. This is certainly very difficult if there are many files that must be stored, while the storage media has a size limit. To overcome this problem it is necessary to do compression to compress the data. To choose the optimal algorithm for compressing document files, it is necessary to compare the Huffman algorithm and the Levenstein algorithm by measuring performance based on the Ratio Of Compression (RC), Compression Ratio (CR), Redundancy (Rd) and Space Saving (SS). After the calculation, the results of the most optimal algorithm in compressing document files are obtained, namely the Huffman algorithm with higher space saving and lower compression results compared to the Levenstein algorithm. This is because the greater the space saving (ss) the compression is getting better and faster.

Keywords


Compression; Comparison; Document File; Huffman; Levenstein

Full Text:

PDF


Article Metrics

Abstract view : 249 times
PDF - 165 times

References

N. Aftikasyah, “Penerapan Algoritma Yamamoto ’ s Recursive Code Untuk Mengkompresi File Dokumen,” vol. 5, pp. 255–263, 2022, doi: 10.30865/komik.v5i1.3716.

E. Prayoga and K. M. Suryaningrum, “Implementasi Algoritma Huffman Dan Run Length Encoding Pada Aplikasi Kompresi Berbasis Web,” J. Ilm. Teknol. Infomasi Terap., vol. 4, no. 2, pp. 92–101, 2018, doi: 10.33197/jitter.vol4.iss2.2018.154.

L. V. Simanjuntak, “Perbandingan Algoritma Elias Delta Code dengan Levenstein Untuk Kompresi File Teks,” vol. 1, no. 3, pp. 184–190, 2020.

H. Sinaga, P. Sihombing, and H. Handrizal, “Perbandingan Algoritma Huffman Dan Run Length Encoding Untuk Kompresi File Audio,” Talent. Conf. Ser. Sci. Technol., vol. 1, no. 1, pp. 010–015, 2018, doi: 10.32734/st.v1i1.183.

N. Sari, “Perancangan Aplikasi kamus Bahasa Minang Indonesia Dan Indonesia Minang Menggunakan Algoritma Levenshtein,” J. Mhs. Fak. Tek. dan Ilmu Komput., vol. 1, no. 1, pp. 1113–1124, 2020, [Online]. Available: http://e-journal.potensi-utama.ac.id/ojs/index.php/FTIK/article/view/950.

Supriyadi and O. Frida, “Analisis Perbandingan Pemampatan Data Teks Dengan Menggunakan Metode Huffman Dan Half – Byte,” Algoritm. J. Ilmu Komput. dan Inform., vol. 2, no. 1, pp. 1–6, 2018.

D. Pratiwi and T. Zebua, “Analisis Perbandingan Kinerja Algoritma Fixed Length Binary Encoding Dan Algoritma Elias Gamma Code Dalam Kompresi File Teks,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 3, no. 1, pp. 424–430, 2019, doi: 10.30865/komik.v3i1.1623.

A. Pahdi, “Algoritma Huffman Dalam Pemampatan Dan Enksripsi Data,” IJNS - Indones. J. Netw. Secur., vol. 6, no. 3, pp. 1–7, 2017, [Online]. Available: http://ijns.org/journal/index.php/ijns/article/view/1461.

N. F. Rizky, S. D. Nasution, and F. Fadlina, “Penerapan Algoritma Elias Delta Codes Dalam Kompresi File Teks,” Build. Informatics, Technol. Sci., vol. 2, no. 2, pp. 109–114, 2020, doi: 10.47065/bits.v2i2.138.

B. A. ANASTA, “ANALISIS PERBANDINGAN ALGORITMA RUN-LENGTH ENCODING DAN ALGORITMA FIBONACCI CODE DALAM KOMPRESI CITRA,” vol. 1, no. 3, pp. 82–91, 2018.

R. Yanur Tanjung, “Perancangan Aplikasi Kompresi File Dokumen Menggunakan Algoritma Adiitive Code,” J. Ris. Komputer), vol. 8, no. 4, pp. 2407–389, 2021, doi: 10.30865/jurikom.v8i4.3593.

R. D. A. RAWIE, “PERBANDINGAN KINERJA ALGORITMA ELIAS OMEGA CODE DAN ALGORITMA LEVENSTEIN CODE DALAM KOMPRESI CITRA,” p. 6, 2021.

Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Analisis Perbandingan Kinerja Algoritma Huffman Dan Algoritma Levenstein Dalam Kompresi File Dokumen Format .RTF

Refbacks

  • There are currently no refbacks.


Copyright (c) 2022 Dwi Asdini, Dito Putro Utomo

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)
P3M STMIK Budi Darma
Sekretariat Jln. Sisingamangaraja No. 338 Telp 061-7875998
email: komik@univ-bd.ac.id, komik.budidarma@gmail.com

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.