https://eurogeojournal.eu/ https://jurnal.pendidikanbiologiukaw.ac.id/
https://e-kerja.bnpp.go.id/bkp/https://journal.dkpp.go.id/wow/https://ppid.dkpp.go.id/_fungsi/dana/https://jurnal.pendidikanbiologiukaw.ac.id/https://e-kerja.bnpp.go.id/Pengawas/demo/https://jos.unsoed.ac.id/stats/2024/https://journal.umkendari.ac.id/dm/https://jurnal.radenfatah.ac.id/demo/https://journal.ar-raniry.ac.id/lap/https://sipeg.ui.ac.id/dm/https://e-kerja.bnpp.go.id/Pengawas/dana/
slot gacor 2025slot gacor 2025slot gacor 2025slot gacor 2025slot gacor 2025slot gacor
Analisa Perbandingan Algoritma HuffmanDengan Rice Code Dalam Kompresi File Video | Melisa | KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)

Analisa Perbandingan Algoritma HuffmanDengan Rice Code Dalam Kompresi File Video

Melisa Melisa, Nelly Astuti Hasibuan, Ilhamsyah Ilhamsyah

Abstract


With the development and advancement of technology, it is something that we should be grateful for, but there are many things that must be considered, one of which is the full storage memory, and also the slow file transfer process so that it takes quite a long time. Data compression (data utilization) is a technique to reduce the amount of data size (compression result) from the original data. To solve this problem, it is recommended to compress video files with the appropriate algorithm in order to get optimal results. The analysis is carried out in comparing the process of how the Huffman algorithm works and the Rice Code algorithm using the exponential method. To compress video files on both algorithms will be measured using the parameters Ratio Of Compression, Compression Ratio, Redundancy, Space Caving, and Time Compression. the file to be compressed is a video file with MP4 format. Video file compression is a process to remove various redundancies from the bit set in a video file so that the size becomes smaller. In the comparison of the two Huffman algorithms with Rice Code, both have a type of lossless compression algorithm, which is a type of compression that can be decompressed and the results obtained from the comparison of the two algorithms, that the Rice Code algorithm is superior to Huffman.

Keywords


Compretition; Huffman Algorithm; Rice Code Algorithm; Video file

Full Text:

PDF

References


K. Ramayani, “Penerapan Algoritma Rice Codes Untuk Mengkompresi File Video,†vol. 5, pp. 186–192, 2021, doi: 10.30865/komik.v5i1.3670.

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.

D. M. Rajagukguk, A. Mahmud, P. Informatika, B. Darma, and V. I. Volume, “Algoritma Huffman Dengan Algoritma ( Lempel-Zip- Welch ) Pada Kompresi Gambar Menggunakan M ...â€

M. L. Imani, R. R. Muhima, S. Agustini, T. Informatika, I. Teknologi, and A. Tama, “Penerapan Metode Huffman dalam Kompresi Data,†Semin. Nas. Sains Dan Teknol. Terap., pp. 457–462, 2021.

M. L. Bukhori and E. E. Prasetiyo, “Sistem Kompresi Data Pada Muatan Roket Menggunakan Kode Huffman,†Tek. STTKD J. Tek. …, vol. 7, no. 2, pp. 270–280, 2021, [Online]. Available: https://jurnal.sttkd.ac.id/index.php/ts/article/view/330.

P. Fitria, “Penerapan Algoritma Rice Codes Pada Aplikasi Kompresi File Gambar,†J. Comput. Syst. Informatics, vol. 1, no. 3, pp. 158–165, 2020.

H. E. Wibowo, I. S. Wijayanto, and N. Herucahyono, “Kompresi Video Menggunakan Discrete Cosine Transform,†pp. 1–5.

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.

W. P. Nugroho, “JURNAL BIT,†vol. 16, no. 2, pp. 47–53, 2020.

H. A. P. Laurentinus, “Perbandingan kinerja RSA dan AES terhadap kompresi pesan SMS menggunakan algoritme Huffman Performance comparison of RSA and AES to SMS messages compression using,†vol. 8, no. April, pp. 171–177, 2020, doi: 10.14710/jtsiskom.2020.13468.

A. S. LASWI, “10668-Article Text-25461-1-10-20191008.pdf.†.

R. M. Abarca, “Bab Iii Metodologi Penelitian Kualitatif,†Nuevos Sist. Comun. e Inf., pp. 2013–2015, 2021.




DOI: https://doi.org/10.30865/komik.v6i1.5751

Refbacks

  • There are currently no refbacks.


Copyright (c) 2022 Melisa Melisa, Nelly Astuti Hasibuan, Ilhamsyah Ilhamsyah

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.