Text compression using two-dimensional cellular automata

This paper presents an elegant mathematical model using simple matrix algebra for characterising the behaviour of two-dimensional nearest neighbourhood linear cellular automata with periodic boundary conditions. Based on this mathematical model, the VLSI architecture of a Cellular Automata Machine (CAM) has been proposed for text compression. Experimental results of comparisons with adaptive Huffman coding scheme also presented.