It has been demonstrated with recent software implementations of context modeling the capability of PPM (Prediction by Partial Matching) type of algorithms by J.G. Cleary and I.H. Witten (1984) to achieve very high compression rates. However, the cost is high in terms of computational complexity and low speed. Hardware implementations of compression algorithms are capable of increasing compression speed by at least an order of magnitude compared with same compression methods implemented in software. In this paper we investigate and study the issues related to the simplification of one PPM type of algorithms, the PPMC by A. Moffat (1990) to achieve high performance.