The impact of the rule structure on the algorithm of 2D cellular automata implementation

In case of the 2D cellular automata (CA) the whole rule f can be considered the set of sub-junctions grouped due to the number of “ones” in the neighbourhood. Such decomposition enables indication of sub-functions, which are more important for the global dynamics of the automaton then others. The cellular automata can be implemented on a cellular neural network (CNN). The simplest way of such implementation on the CNN universal machine was proposed by Cronuse and Chua (1995). We present the modification of this method due to which the information about sub-functions can be saved; and from this we are able to simplify the architecture of a CNN-universal machine implementing CA. Furthermore, the shortage of the time of a new state evaluation is possible. The advantage of the modified CA implementation is the possibility to receive the new automaton by manipulation of this part of the structure, which is connected with the sub-function