Shortest Path Computing Using Memristor-Based Circuits and Cellular Automata

摘要: 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 suitable for massively parallel computational purposes. The sparse nature of computations network configurations memristors resembles certain operational features and computing capabilities CA. Here a memristive CA capable detecting the shortest path between given nodes mesh weighted edges is proposed. Simulation results in absolute agreement solutions by corresponding CA-based algorithmic approach. proposed circuit structure also used effective solution traveling salesman problem.