Title :
Reconfigurable Constraint Repetition Unit for Regular Expression Matching
Author :
Faezipour, Miad ; Nourani, Mehrdad
Author_Institution :
Center for Integrated Circuits & Syst., Univ. of Texas at Dallas, Richardson, TX, USA
Abstract :
This paper introduces a new basic building block based on Non-deterministic Finite Automata (NFA) hardware implementation to support complex constraint repetitions in regular expressions. This block is a customized counter capable of handling any type of constraint repetition, applicable to any sub-regular expression. We also apply optimization techniques to reduce the area and improve the overall performance.
Keywords :
constraint handling; finite automata; meta data; optimisation; reconfigurable architectures; string matching; meta-character; nondeterministic finite automata hardware; optimization; reconfigurable constraint repetition unit; regular expression matching; string matching; Automata; Computer languages; Counting circuits; Field programmable gate arrays; Hardware; High-speed networks; Intrusion detection; Payloads; Signal detection; Time of arrival estimation; Network Intrusion Detection System; Non-deterministic Finite Automata; Regular Expression;
Conference_Titel :
Field-Programmable Custom Computing Machines, 2008. FCCM '08. 16th International Symposium on
Conference_Location :
Palo Alto, CA
Print_ISBN :
978-0-7695-3307-0
DOI :
10.1109/FCCM.2008.22
