A VLSI architecture for cellular automata based parallel data compression

Analytical study of three neighbourhood two state per cell Cellular Automata (CA) behaviour is a comparatively recent phenomenon. A wide variety of applications have been developed utilizing the elegant structure of group CA. In this paper some of the characterizations of the state transition behaviour of non-group CA are reported. These results are subsequently utilized to develop an efficient parallel scheme for data compression. The experimental results confirms its superiority in terms of compression ratio over UNIX Compress and GZIP packages.