Abstract

This paper addresses Cellular Automata (CA) based algorithm implementations using circuits with memory resistors (memristors). Memristors are two-terminal passive nonvolatile resistance switching devices whose unique adaptive properties are suitable for massively parallel computational purposes. The sparse nature of computations using network configurations of memristors resembles certain operational features and computing capabilities of CA. Here a memristive CA capable of detecting the shortest path between given nodes of a mesh with weighted edges is proposed. Simulation results are in absolute agreement with the solutions given by the corresponding CA-based algorithmic approach. The proposed memristive CA circuit structure is also used for the effective solution of the traveling salesman problem.