PEMAMPATAN DATA LOSSLESS DENGAN METODE STATIC-ADAPTIVE ARITHMETIC CODING

Abstract

This research explains about some popular algorithms of lossless compression that more people have implemented it in their programs, and how to join them to become a library file which use one of the features of object oriented programming. Implementation of Arithmetic Coding algorithm uses array of both low and high range. Low range array saves the lowest limit for interval of alphabet whereas high range saves limit highest interval. To test the library (the proof of concept), some application programs that use (call) the routines of lossless compression in the library are created to compress-decompress any file types. So the goal of this research is acquire a library file that contain all of the lossless compression algorithms, especially an application program is like toolbox of lossless compression, which is used to test the performance of the library or to support the advanced research (such as cascaded compression, etc.).The results of this research are a library file (static and dynamic) that contain some routines of lossless compression algorithms, namely Static Huffman order-0, Adaptive Huffman order-0,1, Run- Length Encoding order 0,1,2, and 3, LZW, Static Adaptive Aithmetic Coding. Totally, there are four kinds of lossless compression algorithm. In conclusion, the Arithmetic Coding algorithm is the best method based on the performance of compression ratio at 73% , then LZW algorithm, Huffman algorithm and RLE algorithm gain compression ratio 69%, 49% and 19%., respectively