Data Compression Scheme with Composition of The Burrows-Wheeler Transform, Move-to-Front Transform, and Huffman Coding
Armin Lawi, Latief, Nurhayati · Hasanuddin University Repository · 2013
Data compression is one of the most important aspects in our daily life. One of the most popular methods in data compression area is the Burrows-Wheeler Compression Algorithm (BWCA). This algorithm is introduced by Burrows and Wheeler, it consists of three transformations: Burrows-Wheeler transform (BWT), Move-to-Front transform (MTF), and Huffman Coding (HC). In this paper we analyze the combination of compression schemes from the composition of the Burrows-Wheeler transform, Move to Front transform, and Huffman Coding. We investigate three combination schemes, i.e., BWT+MTF+HC, MTF+HC and BWT+HC. Our result shows that the most efficient compression scheme is the BWT+HC since it produces the highest efficiency of 99.68% but it is not really effective. The most effective compression scheme is BWT+MTF+HC since it produces the smallest data and still have high efficiency of 99.55%.