Analogue Combinatorics and Cellular Automata—key Algorithms and Lay-Out Design

Abstract

This paper demonstrates how certain logic and combinatorial tasks can be solved using CNNs. A design method is proposed for solving combinatorial tasks on a CNN. It can be used to simulate cellular automata on a CNN, to prove the self‐reproducing capability of the CNNUM and for sorting, histogram calculation, parity analysis and minimum Hamming distance computation. These solutions are especially useful since they can serve as subroutines of more complex CNNUM algorithms. As an important real‐life application the lay‐out of printed circuit boards is designed with the CNNUM at an extremely high speed.