Kinerja Algoritma Yamamoto’s Recursive Code dan Algoritma Fixed Length Binary Encoding pada Kompresi File PDF
- Yulrismawati Sihura Universitas Budi Darma, Medan, Indonesia
-
Taronisokhi Zebua
*
Universitas Budi Darma, Medan,
Indonesia
- Hukendik Hutabarat Universitas Budi Darma, Medan, Indonesia (*) Corresponding Author
Abstract
The use of files in digital form is currently growing and requires media to store them. The more files that store, the more storage space need. This encourages the development of file reduction techniques or data compression techniques with the aim of reducing the required storage space. The compression technique has several algorithms that can be used to compress files such as Yamamoto's recursive code algorithm and Fixed Length Binary Encoding (FLBE). These algorithms have different performance to produce quality compressed results, so they need to be compared. This study describes the analysis and comparison of the performance of the two algorithms based on the exponential method as measured by the quality of the compressed pdf file. The exponential comparison method is one of the methods of the Decision Support System (DSS) to determine the priority order of decision alternatives with multiple criteria. Compression quality parameters that are measured as an alternative comparison are the value of the ratio of compression, compression ratio, space saving. Based on the results of the comparison with Exponential Comparison Method (MPE), it was found that the fixed length binary encoding algorithm has a better performance with a value of 2.55% compared to the Yamomoto's recursive code algorithm with a smaller value of 2.22%.
Downloads
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.
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.
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.
W. T. W. Simanjuntak, “Analisa Perbandingan Algortima Prediction By Partial Matching Dengan Sequitur Pada Kompresi File Teks,” vol. 5, pp. 221–227, 2021, doi: 10.30865/komik.v5i1.3675.
M. A. Latif, S. D. Nasution, and P. 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, [Online]. Available: http://ejurnal.stmik-budidarma.ac.id/index.php/inti/article/view/639.
R. Y. TANJUNG, “Perancangan aplikasi kompresi file dokumen menggunakan algoritma additive code,” vol. 8, no. 4, pp. 108–113, 2020, doi: 10.30865/jurikom.v8i4.3593.
B. Ramadhana, “Implementasi Kombinasi Algoritma Fibonacci Codes Dan Levenstein Codes Untuk Kompresi File Pdf,” vol. 8, no. 2, pp. 67–71, 2021.
M. Apriyanto and H. Hutrianto, “Analisa Penerapan Algortima Goldbach Codes Dan Metode Shannon-Fano Pada Kompresi File Teks,” Bina Darma Conf. …, pp. 207–218, 2020, [Online]. Available: https://conference.binadarma.ac.id/index.php/BDCCS/article/download/1714/771.
D. Muliadi, “Perbandingan Algoritma Yamamoto Recursive Dan Punctured Elias Code Dalam Kompresi File Teks,” pp. 7–37, 2019.
R. D. Pratiwi, S. D. Nasution, and F. Fadlina, “Perancangan Aplikasi Kompresi File Teks Dengan Menerapkan Algortima Fixed Length Binary Encoding (Flbe),” J. Media Inform. Budidarma, vol. 2, no. 1, pp. 10–14, 2018, doi: 10.30865/mib.v2i1.813.
I. Lestari, “Analisa Perbadingan Algoritma Goldbach Codes Dengan Algoritma Sequitur Pada Kompresi File Text Menggunakan Metode …,” Pelita Inform. Inf. dan …, vol. 8, pp. 15–18, 2019, [Online]. Available: https://www.ejurnal.stmik-budidarma.ac.id/index.php/pelita/article/view/1520.
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.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Kinerja Algoritma Yamamoto’s Recursive Code dan Algoritma Fixed Length Binary Encoding pada Kompresi File PDF
Pages: 303-312
Copyright (c) 2022 Yulrismawati Sihura, Taronisokhi Zebua, Hukendik Hutabarat
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
