| dc.identifier.citation | Gilbert, Held, 1991, Data Compression – 3rd edition, John Willey & Sons, Ltd. Herianto, Tjendri, 1995, Tuntunan Praktis Pemrograman C++, Elex Media Computindo Lempel, A., 2005, A Universal Algorithm for Sequential Data Copmression, IEEE Transaction on Information Theory, IT-23(3):337-343. Lelewer, Debra A., Daniel S. Hirschberg,4/1/2002, Data Compression, Situs internet, URL: http://www1.ics.uci.edu/~dan/pubs/DC-sec3.html. Nelson, M., Jean-Loup Gailly, 1996, The Data Compression Book, 2nd edition, M&T Books, New York. Phamdo, Nam, 2002, Data-Compression.com (internet site), Department of Electrical and Computer Engineering State University of New York Stony Brook, NY 11794-2350. URL: http://www.datacompression. com. Salomon, D., Nam Phamdo, 2002, Data Compression.com (internet site), Department of Electrical EngineeringState University of New York Stony Brook, NY 11794-2350. Sedgwick, Robert, 1990, Algoritma in C, Addison-Wesley Publishing Company. Wibowo, Wahyu C., 1991, Pemrograman Berorientasi Objek, PT. Elexmedia Komputindo, Gramedia Jakarta. Wikipedia, 2006, Lossless Data Compression, wikipedia foundation, US. URL: http://www.data-compression.com URL: http://www.howstuffworks/datacompression.html URL: http://www.cblomm.com/src/lzw trie.zip URL: http://datacompression.info/huffiman.shtml URL: http://www.cs.mu.oz.au/alistair/abstractc/mnw98:acmtois.html | en_US |
| dc.description.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 | en_US |
