A regular expression matching circuit based on a decomposed automaton

Authors:
Hiroki Nakahara;Tsutomu Sasao;Munehiro Matsuura
Affiliations:
Kyushu Institute of Technology, Japan;Kyushu Institute of Technology, Japan;Kyushu Institute of Technology, Japan
Venue:
ARC'11 Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications
Year:
2011

Citing 9
Cited 4

A new approach to text searching

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
Fast Regular Expression Matching Using FPGAs

FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A High Throughput String Matching Architecture for Intrusion Detection and Prevention

Proceedings of the 32nd annual international symposium on Computer Architecture
Optimization of regular expression pattern matching circuits on FPGA

Proceedings of the conference on Design, automation and test in Europe: Designers' forum
A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching

Proceedings of the 33rd annual international symposium on Computer Architecture
Fast and memory-efficient regular expression matching for deep packet inspection

Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata

Efficient regular expression pattern matching for network intrusion detection systems using modified word-based automata

Proceedings of the Fifth International Conference on Security of Information and Networks
A regular expression matching circuit: Decomposed non-deterministic realization with prefix sharing and multi-character transition

Microprocessors & Microsystems
Designing a Programmable Wire-Speed Regular-Expression Matching Accelerator

MICRO-45 Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture
Exploring the design space of programmable regular expression matching accelerators

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expressions into a non-deterministic finite automaton (NFA). Then, to reduce the number of states, we convert the NFA into a modular non-deterministic finite automaton with unbounded string transition (MNFAU). Next, to realize it by a feasible amount of hardware, we decompose the MNFAU into the deterministic finite automaton (DFA) and the NFA. The DFA part is implemented by an off-chip memory and a simple sequencer, while the NFA part is implemented by a cascade of logic cells. Also, in this paper, we show that the MNFAU based implementation has lower area complexity than the DFA and the NFA based ones.