Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Shortest Path Computing Using Memristor-Based Circuits and Cellular Automata
verfasst von : Dimitrios Stathis, Ioannis Vourkas, Georgios Ch. Sirakoulis
Erschienen in: Cellular Automata
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.