Text data compression for mobile phone using burrows-wheeler transform, move-to-front code and arithmetic coding (Case Study: Sunan Ibnu Majah Bahasa Translation)

Abstract

Text files are still dominant to be used in many storage devices, including mobile storage device. With fixed and small memory capacity of mobile phone, text compression is needed for the optimation of memory usage. Compression is the process of transforming data to code sets functioned to reduce the usage of memory wether or not reducing data quality and accelerating data transmission time. Compression can be lossless or lossy. In lossless compression, original text can be rearranged from compressed data. Combination of algorithms Burrows-Wheeler Transform, Move-To-Front Code and Arithmetic Coding can be used in lossless compression. There are many Quran applications for mobile phone, but rarely Hadits applications. Hadits is information about Prophet Muhammad (pbuh) tradition. There are six most referenced Hadits collections. One of them is Sunan Ibnu Majah. It has 32 chapters. This research remains the compressing those text file using four schemes combination of algorithm: (1) Arithmetic Coding alone, (2) Move-To-Front Code and Arithmetic Coding, (3) Burrows Wheeler-Transform and Arithmetic Coding (without Move-To-Front), (4) Burrows Wheeler-Transform, Move-To-Front Code and Arithmetic Coding. Several chapter from Sunan Ibnu Majah that vary in filesize have been selected to be compressed. Blocksize 1024, 2048, 4096 and 8192 byte will be used while using Move-To-Front Code algorithm. The best result from each schemes respectively are 58.9%, 36.30%, 59.01% and 32.62%. Using combination Burrows-Wheeler, Move-To-Front Code and Arithmetic Coding with the length of block 8192 bytes can achieve the best compression ratio 32.62%.