Date Added: Oct 2009
The mainstream lossless data compression algorithms have been extensively studied in recent years. However, rather less attention has been paid to the block algorithm of those algorithms. The aim of this study was therefore to investigate the block performance of those methods. The main idea of this paper is to break the input into different sized blocks, compress separately, and compare the results to determine the optimal block size. The select of optimal block size involves tradeoffs between the compression ratio and the processing time. The paper found that, for PPM, BWT and LZSS, a block size of greater than 32 KiB may be optimal. For Huffman coding and LZW, a moderate sized block (16KiB for Huffman and 32KiB for LZSS) is better.