SN Computer Science Computer Graphics and Computer-Aided Design
Combining Forward Compression with PPM
Abstract
A new Forward Looking variant of dynamic Huffman or arithmetic encoding has been recently proposed, that provably always performs better than the corresponding general static encoding schemes, as far as the net compressed file, without the necessary header, is concerned. The current paper suggests to integrate the Forward Looking paradigm with the well-known adaptive PPM—Prediction by Partial Matching algorithm. This combination, that attempts to predict the following character based on the context that has already occurred in past, but uses its knowledge of the exact frequencies in the future, is empirically shown to enhance the prediction capability, and therefore to improve the compression efficiency.