Implementation of nondeterministic finite automata in an autoassociative CAM circuit

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.

[1]  Dave Brown,et al.  Supplementary Material for An Efficient and Scalable Semiconductor Architecture for Parallel Automata Processing , 2013 .

[2]  Eric Torng,et al.  An overlay automata approach to regular expression matching , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[3]  Eric Torng,et al.  Fast Regular Expression Matching Using Small TCAMs for Network Intrusion Detection and Prevention Systems , 2010, USENIX Security Symposium.

[4]  Jussi H. Poikonen,et al.  A 512×512-cell associative CAM/Willshaw memory with vector arithmetic , 2015, 2015 IEEE International Symposium on Circuits and Systems (ISCAS).

[5]  Anat Bremler-Barr,et al.  CompactDFA: Generic State Machine Compression for Scalable Pattern Matching , 2010, 2010 Proceedings IEEE INFOCOM.

[6]  Jussi H. Poikonen,et al.  Large-Scale Memristive Associative Memories , 2014, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.