Cellular automata based scheme for solution of Boolean equations

The paper utilises a particular class of nongroup CA as a mathematical tool to derive solutions of XOR dominated Boolean equations. Some problems in digital circuits (such as logic synthesis, test pattern generation etc.) demand efficient schemes for the solution of Boolean equations. A large number of combinational benchmarks and real life circuits used in the fields of built in self test (BIST) structures, cryptography, error correcting codes etc. Can be found to have dominance of such XOR functionality. The proposed scheme is suited to such XOR dominated circuits. A comparison between the execution time of the proposed method and popular schemes based on tabular algebra shows a maximum speedup of up to ten times. In the worst case, the performance of the algorithm presented is equivalent to that of tabular algebra, which is inescapable since the problem is inherently NP hard