Application Of Coding Arithmetic Methods And Methods Lzw For Compression Files
DOI:
https://doi.org/10.58471/ju-ti.v2i02.243Keywords:
file compression, Arithmetic Coding, LZW, storage efficiency, compression ratioAbstract
Efficient data storage and transmission have become of utmost importance in today's digital era. File compression processes are crucial to addressing this issue. The purpose of this study is to examine and compare the use of the Arithmetic Coding Method and the LZW Method in file compression. Both of these methods are known for their excellent compression capabilities, but there has been limited research comparing them in the context of real-world use. This research employed a range of files, including text, photos, and recordings, to test both approaches. Results indicate that the arithmetic coding method typically offers a slightly better compression ratio compared to the LZW method. However, LZW provides faster compression and decompression speeds, making it more suitable for real-time applications or where response time is critical. Nonetheless, the choice between these two methods largely depends on the specific needs of a given application. For purposes requiring the highest compression ratio, the arithmetic coding method might be more appropriate. however, the LZW method might be more suitable for purposes demanding quick compression and decompression. In summary, both the arithmetic coding and LZW methods have their own strengths and weaknesses. A thorough understanding of the features and requirements of the file to be compressed is vital for choosing the most fitting method. the LZW method might be more suitable for purposes demanding quick compression and decompression. In summary, both the arithmetic coding and LZW methods have their own strengths and weaknesses. A thorough understanding of the features and requirements of the file to be compressed is vital for choosing the most fitting method. the LZW method might be more suitable for purposes demanding quick compression and decompression. In summary, both the arithmetic coding and LZW methods have their own strengths and weaknesses. A thorough understanding of the features and requirements of the file to be compressed is vital for choosing the most fitting method.
References
. Anton, 2005. Kompresi dan Teks. Fakultas Teknik Informatika. Univesitas Kristen Duta Wacan http://lecturer.ukdw.ac.id/anton/download/multimedia6.pdf Tanggal Akses: 12 Februari 2016
. Mokhamad, Adi Pn Fazmah Arief Yulianto, Endro Ariyanto 2008 Analisis dan Implementassi Perbandinga Kinerja Algoritma Kompresi Huffman,LZW,dan DMC Pada Berbagai Tipe File Teknik Informatika, Fakultas Teknik Informatika, Universitas Telkom Tanggal Akses 5 Februari 2016
. Taleumbanua, Pilipus 2011 Analisis Perbandingan Algoritma Kompresi LEMPEL ZIV WELCH, ARITHMETIC CODING, dan RUN-LENGTH ENCODING Pada File Teks Fakultas Matematika dan Ilmu Pengetahuan Alam, Ilmu Komputer, Universitas Sumatra Utara. Tanggal Akses : 12 Februari 2016
. Subarka Aan, Fuad 2010 Rancangan Bangun Aplikasi Kompresi File Menggunakan Metode LZW Berbasis Java Fakultas Sains Teknologi, Teknik Informatika, Universitas Islam Negeri (UIN) Maulana Malik Ibrahim Malang http://lib.uinmalang.ac.id/files/thesis/fullchapter/05550055.pdf Tanggal Akses:01 Februari
. Petrus Santoso, 2001 Studi Kompresi Data dengan Metode Arithmetic Coding JurusanTeknik Elektro, Fakultas Teknologi Industri – Universitas Kristen Petra http://puslit.petra.ac.id/journals/electrical/ Tanggal Akses : 01 Februari 2016
. Suarga, 2006 Algoritma dan Pemograman. Andi Offset. Yogyakarta. ISBN : 978-979-292745-0.







