APLIKASI KOMPRESI DATA MENGGUNAKAN METODE HUFFMAN STATIK PADA PERANGKAT MOBILE BERBASIS ANDROID

Heru Cahya Rustamaji, Mariani Mariani, Bambang Yuwono

Abstract


Efficient use of bandwidth and memory into the main focus that must be considered in the process of data exchange. More and more data is stored, the greater the size of the data. One alternative that can be implemented is to reduce the size of the (compressed) data. In addition to the process of data transmission, compression is also useful in the data storage medium in the secondary. Compression aims to reduce the amount of data used to represent the contents of a text file, image, audio, and video without reducing the quality of the original data. Compression is done by reducing the number of bits needed to store or transmit the digital media. For data compression, one algorithm has a good performance is the type of the Huffman algorithm.In this study, the Static Huffman algorithm which is one technique that is lossless data compression. Static Huffman algorithm uses frequency/probability of occurrences of a symbol in a string as input and produce output in the form of a prefix code that encodes a string using the little bits of all possible binary prefix code that may be. Static Huffman algorithm implementation is aimed to compress the data so that the compressed data size is smaller than the size of the original data. So that the compressed data can be retrieved, then the decompression process. This application was made and in the making based on Android using Eclipse and the methodology GRAPPLE (Guidlines for Rappid Application Engineering). GRAPPLE is a process modeling in software development which emphasizes the actions carried out in a number of stages , each stage will result in products that work with object-oriented form.With applications of data compression with Huffman Static method in Android -based mobile devices, the data size becomes smaller so that it can speed up the process of delivery and storage. Compression using Huffman code would be optimal if the range of the character of the information is not too much despite the high frequency of occurrence and the size of the compression results obtained that the compression of each file depending on the characteristics of the file to be compressed.

 

Keywords : Compression, Decompression, Static Huffman Algorithm, Lossless, Android

References


Adisantoso, J., Sulistio, D.D., Silalahi, B.P., 2004, Kompresi Data Menggunakan Algoritma Huffman, http://journal.uii.ac.id/index.php/Snati/article/viewFile/1822/1601, Diakses pada tanggal 23 September 2013.

Adityo, W., 2008, Penggunaan Kode Huffman dan Kode Aritmatik pada Entropy Coding, www.informatika.org/~rinaldi/Matdis/2007-2008/. Makalah/MakalahIF2153-0708-105.pdf, Diakses pada tanggal 23 September 2013.

Brookshear, J. Glenn, 2003,Computer Science Suatu pengantar, Jilid 7, Terjemahan Irzam Hardiansyah, Jakarta: Erlangga.

Citra, Anastasya, 2010,Aplikasi Kompresi Sms Menggunakan Kode Huffman pada Mobile Phone Berbasis JavaTM, Departemen Teknik Elektro Fakultas Teknik Universitas Sumatera Utara.

Fauzi, Rahmad, 2010,Analisis Beberapa Teknik Coding,http://library.usu.id/download/ft/elekro-rahmad%20fauzi.pdf, Diakses pada tanggal 23 September 2013.

Gonzalez, Rafael, 1992,Digital Image Processing, USA: Addison-Wesley Publishing Co.

Jogiyanto, 2005, Analisis dan desain Sistem Informasi, Penerbit: ANDI, Yogyakarta.

Johnsonbaugh, Richard, 1998, Matematika Diskrit, Jilid 2, Jakarta: Prenhallindo.

Jong, Jek Siang, 2002, Matematika Diskrit dan Aplikasinya pada Ilmu Komputer, Yogyakarta: Andi.

Kadir, A., 2002, Pengenalan Sistem Informasi, Andi, Yogyakarta.

Kristanto, A., 2003, Struktur Data Dengan C++. Edisi Pertama, Yogyakarta: Graha Ilmu.

Munir, Rinaldi., 2004,Pengolahan Citra Digital dengan Pendekatan Algoritmik. Bandung: Informatika.

Pearlman, William.A., 1997, The Set Partitioning in Hierarchical Trees (SPIHT) Algorithm, Rensselaer Polytechnic Institute.

Pu, I. M., 2006,Fundamental Data Compression,Oxford : Elsevier.

Risyana, 2009, Pengertian Data, Informasi, Knowledge, dan Sistem, http://risyana.wordpress.com/2009/11/14/pengertian-data-informasi-knowledge-dan-sistem/, Diakses pada tanggal 23 September 2013.

Romdoni, A., 2010, Pengertian Aplikasi Mobile,

http://agusbarupunyablog.blogspot.com, Diakses pada tanggal 23 September 2013.

Salomon, D., 2007,Data Compression The Complete Reference, 4th Edition, Northridge: Spinger.

Salomon, David dan Giovanni, 2010,Handbook of Data Compression,Fifth Edition,London : Springer – Verlag Limited.

Sayood, K., 2003, Lossless Compression Handbook, 1st Edition, San Diego: Elsevier.

Sayood, K., 2005,Introduction to Data Compression. 3rd Edition, San Diego: Elsevier.

Schmuller, Joseph, 1999,Teach Yourself UML in 24 Hours, Indianapolis: Sams Publishing.

Sedgewick, R., 2002, Algoritms in Java. 3rd Edition, Pearson Education.

Setiawan, Wawan. dan Munir, 2006,Pengantar Teknologi Informasi: Basis Data, Bandung: Universitas Pendidikan Indonesia.

Sharma, M., 2010,Compression using Huffman coding,IJCSNS International Journal of Computer Science and Network Security.10(2).131-141.

ST, Mulyadi, 2010, Membuat Aplikasi untuk Android, Multimedia Center Publishing, Yogyakarta.

Sudewa, Ida Bagus Adi, 2003,Mengenal Character Set,www.ilmukomputer.com, Diakses pada tanggal 23 September 2013.

Suhendar A. dan Gunadi H., 2002, Visual Modeling Menggunakan UML dan Rational Rose, Informatika, Bandung.

Sulistyanto, Hernawan,2006, Kompresi Data Lossless dengan Metode Lempel-Zip, Surakarta: Jurnal Teknik Elektro dan Komputer EMITOR, Bandung.

Sutoyo, T. dkk, 2009, Teori Pengolahan Citra Digital, Penerbit Andi, Yogyakarta.

Timotius, Triputra, 2010, Perbandingan Kompresi Data Dengan Algoritma Huffman Statik dan Adaptif,http://informatika.stei.itb.ac.id/~rinaldi.munir/Matdis/2010-

/Makalah2010/MakalahStrukdis2010-008.pdf, Diakses pada tanggal 23 September 2013.

Vercellis, Carlo, 2009,Business intelligence : data mining and optimization for decision making, Chichester: John Wiley & Sons.

Wahidah, Wahyu L., 2008, Aplikasi Perbandingan Metode Huffman dan Run Length Encoding Pada Kompresi Citra Digital, Yogyakarta : Universitas Pembangunan Nasional Veteran Yogyakarta.

_____, http://st0lenc0des.googlepages.com, Diakses pada tanggal 23 September 2013.

_____, http://www.mcscv.com/, Diakses pada tanggal 23 September 2013.

_____,ASCII, Wikipedia, http://id.wikipedia.org/wiki/ASCII, Diakses pada tanggal 23 September 2013.




DOI: https://doi.org/10.31315/telematika.v11i1.311

DOI (PDF (Indonesia) (Indonesian)): https://doi.org/10.31315/telematika.v11i1.311.g423

Refbacks

  • There are currently no refbacks.




Copyright of :
TELEMATIKA: Jurnal Informatika dan Teknologi Informasi
ISSN 1829-667X (print); ISSN 2460-9021 (online)


Dipublikasi oleh
Jurusan Teknik Informatika, UPN Veteran Yogyakarta
Jl. Babarsari 2 Yogyakarta 55281 (Kampus Unit II)
Telp: +62 274 485786
email: jurnaltelematika@upnyk.ac.id

 

Jurnal Telematika sudah diindeks oleh beberapa lembaga berikut:
 

 

Status Kunjungan Jurnal Telematika