Analisa Perbandingan Algoritma Yamamoto’s Recursive Code Dan Algoritma Fibonacci Code Dalam Mengkompresi File Pptx

 (*)Rahadi Putra Mail (Universitas Budi Darma, Medan, Indonesia)
 Abdul Sani Sembiring (Universitas Budi Darma, Medan, Indonesia)
 Saidi Ramadan Siregar (Universitas Budi Darma, Medan, Indonesia)

(*) Corresponding Author

Abstract

In the world of work, power point or pptx files are indispensable as presentation tools. By using pptx for presentations, presentation activities can be easier to explain. However, the problem that occurs is that sometimes the data size of this pptx file is quite large compared to other data, resulting in a waste of storage. So to solve the problem required compression technique, compression is to reduce the number of bits to be fewer, Thus, it is clear that the use of compression aims to reduce the percentage of storage. This research was conducted with the aim and purpose of analyzing the Yamamoto's recursive code algorithm and Fibonacci codes in pptx file compression with parameters, namely Ratio of Compression (RC), Compression Ratio (CR), and also Space Saving (SS). After being compressed then compare the performance of the two algorithms using the exponential method based on the parameter values that have been set. From the results of the study, the results obtained for the Yamamoto's recursive code algorithm with the RC value of 1.26, the CR value of 79.17%, and the SS value of 20.83%. For the results of the Fibonacci code algorithm, the RC value is 1.71, the CR value is 58.33%, the SS value and value is 41.66%. The results of the comparison of Yamammoto's recursive code algorithm and Fibonacci code obtained that the more optimal algorithm in compressing pptx files is the Fiboancci code algorithm with the acquisition of space saving values of 41.66%.

Keywords


Compression; Algorithm; Yamammoto’s Recursive Code; Fibonacci; pptx

Full Text:

PDF


Article Metrics

Abstract view : 282 times
PDF - 147 times

References

I. Hasan, N. Irsa Syahputri, and U. Harapan Medan, “Analisis Parameter Kompresi Algoritma Elias Omega Code dan Fibonacci Code Pada File Digital,” Algoritm. J. Ilmu Komput. dan Inform., vol. 6341, no. April, p. 1, 2021.

S. B. Ginting et al., “Perbandingan Algoritma Yamamoto ’ s Recursive Code Dan Additive Code Dalam Kompresi File Video,” vol. 5, 2021, doi: 10.30865/komik.v5i1.3819.

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

R. A. Sandra, “Implementasi Kombinasi Algoritma Tunstall Code da Boldi-Vigna Untuk Kompresi File Pdf,” vol. 8, no. 2, pp. 67–71, 2021.

J. Martina and B. Panjaitan, “Penerapan Algoritma Fibonacci Codes Pada Kompresi Aplikasi Audio Mp3 Berbasis Dekstop,” vol. 1, no. 1, pp. 27–33, 2021.

M. A. Syahputra and P. Ramadhani, “Implementasi Metode Fibonacci Dalam Kompresi Iklan Pada Website PT. Amanah Wisata Travel,” KOMIK (Konferensi Nas. …, vol. 4, pp. 228–231, 2020, doi: 10.30865/komik.v4i1.2685.

M. Mawar, “Perancangan Aplikasi Kompresi File Pdf Dengan Menerapkan Algoritma Punctured Elias Codes,” Inf. dan Teknol. Ilm., vol. 7, no. 3, pp. 217–223, 2020, [Online]. Available: http://ejurnal.stmik-budidarma.ac.id/index.php/inti/article/view/2391

S. Siregar, F. Fadlina, and S. Nasution, “Enhancing Data Security of Columnar Transposition Cipher by Fibonacci Codes Algorithm,” 2020, doi: 10.4108/eai.11-12-2019.2290839.

S. Nainggolan, “Analisa Perbandingan Algoritma Goldbach Codes Dengan Algoritma Dynamic Markov Compression (DMC) Pada Kompresi File Teks Menggunakan Metode Eksponensial,” Maj. Ilm. INTI, vol. 6, no. 3, pp. 395–399, 2019.

Engel, “済無No Title No Title No Title,” Pap. Knowl. . Towar. a Media Hist. Doc., no. 0272, 2014.

A. Fau, Mesran, and G. L. Ginting, “Analisa Perbandingan Boyer Moore Dan Knuth Morris Pratt Dalam Pencarian Judul Buku Menerapkan Metode Perbandingan Eksponensial ( Studi Kasus : Perpustakaan STMIK Budi Darma ),” J. Times (Technology Informatics Comput. Syst., vol. 6, no. 1, pp. 12–22, 2017.

M. A. Latif, S. D. Nasution, and Pristiwanto, “Analisa Perbandingan Algoritma Rice Codes Dengan Algoritma Goldbach Codes Pada Kompresi File Text Menggunakan Metode Exponential,” Maj. Ilm. INTI (Informasi dan Teknol. Ilmiah), vol. 13, no. 1, pp. 28–33, 2018.

Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Analisa Perbandingan Algoritma Yamamoto’s Recursive Code Dan Algoritma Fibonacci Code Dalam Mengkompresi File Pptx

Refbacks

  • There are currently no refbacks.


Copyright (c) 2022 Rahadi Putra, Abdul Sani Sembiring, Saidi Ramadan Siregar

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.