Implementation of nondeterministic finite automata in an autoassociative CAM circuit




Jussi Poikonen, Eero Lehtonen, Mika Laiho, Timo Knuutila

IEEE International Symposium on Circuits and Systems

2015

Circuits and Systems (ISCAS), 2015 IEEE International Symposium on

ISCAS

1342

1345

4

978-1-4799-8391-9

0271-4302

DOIhttps://doi.org/10.1109/ISCAS.2015.7168890

http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=7168890



In this work we consider the implementation of nondeterministic finite automata in autoassociative memory, and demonstrate mapping and operating such automata in an associative content-addressable/Willshaw-type memory circuit presented in a companion paper. This topic is relevant in the broader scope of in-memory computing, and offers a simple, flexible, and computationally efficient way of implementing nondeterministic finite automata using existing general-purpose associative memory hardware.



Last updated on 2024-26-11 at 21:36