Conference paper Open Access

Time-division Multiplexing Automata Processor

Jintao Yu; Hoang Anh Du Nguyen; Muath Abu Lebdeh; Mottaqiallah Taouil; Said Hamdioui

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Jintao Yu</dc:creator>
  <dc:creator>Hoang Anh Du Nguyen</dc:creator>
  <dc:creator>Muath Abu Lebdeh</dc:creator>
  <dc:creator>Mottaqiallah Taouil</dc:creator>
  <dc:creator>Said Hamdioui</dc:creator>
  <dc:description>Automata Processor (AP) is a special implementation of non-deterministic finite automata that performs pattern matching by exploring parallel state transitions. The implementation typically contains a hierarchical switching network, causing long latency. This paper proposes a methodology to split such a hierarchical switching network into multiple pipelined stages, making it possible to process several input sequences in parallel by using time-division multiplexing. We use a new resistive RAM based AP (instead of known DRAM or SRAM based) to illustrate the potential of our method. The experimental results show that our approach increases the throughput by almost a factor of 2 at a cost of marginal area overhead.</dc:description>
  <dc:subject>time-division multiplexing</dc:subject>
  <dc:subject>parallel processing</dc:subject>
  <dc:title>Time-division Multiplexing Automata Processor</dc:title>
All versions This version
Views 5757
Downloads 4040
Data volume 25.1 MB25.1 MB
Unique views 5151
Unique downloads 3838


Cite as