Hardware architecture for high-performance regular expression matching

Tsern-Huei Lee*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

This paper presents a bitmap-based hardware architecture for the Glushkov nondeterministic finite automaton (G-NFA), which recognizes a given regular expression. We show that the inductions of the functions needed to construct the G-NFA can be generalized to include other special symbols commonly used in extended regular expressions such as the POSIX 1003.2 format. Our proposed implementation can detect the ending positions of all substrings of an input string T, which start at arbitrary positions of T and belong to the language defined by the given regular expression. To achieve high performance, the implementation is generalized to the NFA, which processes K symbols in each operation cycle. We provide an efficient solution for the boundary condition when the length of the input string is not an integral multiple of K. Compared with previous designs, our proposed architecture is more flexible and programmable because the pattern matching engine uses memory rather than logic.

Original languageEnglish
Pages (from-to)984-993
Number of pages10
JournalIEEE Transactions on Computers
Volume58
Issue number7
DOIs
StatePublished - 13 May 2009

Keywords

  • Hardware acceleration
  • Nondeterministic finite automaton
  • Regular expression

Fingerprint Dive into the research topics of 'Hardware architecture for high-performance regular expression matching'. Together they form a unique fingerprint.

Cite this