Perbandingan Kinerja Algoritma Kompresi Huffman, LZW, dan DMC Pada Berbagai Tipe File  

Oleh:

Linawati ; Panggabean, Henry P.

Jenis: Article from Bulletin/Magazine
Dalam koleksi: Integral: Majalah Ilmiah Matematika dan Ilmu Pengetahuan Alam vol. 9 no. 1 (Mar. 2004), page 7-16.
Topik: algorithms; data compression; huffman algortihm; LZW algorithm; DMC algorithm

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II48.2 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

This paper presents performance comparison of three comrpesison algorithms, each of which uses different coding technique : huffman, LZW (Lempel - Ziv - Welch) and DMC (Dynamic Markow Compression). These three algorithms are implemented into a computer program, tested upon 12 classes of test case, and their performances are measured in terms of size ratio between compressed file and initial file and compression speed. It can be concluded that in terms of compression ratio, in average DMC is the best and huffman is the worst, meanwhile in terms of compression speed, LZW is the best and DMC is the worst. There are several file types that are not suitable to be compressed by certain algorithm, because the compressed file becomes bigger in size.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali