Reconfigurable Constraint Repetition Unit for Regular Expression Matching
Miad Faezipour, Mehrdad Nourani · 2008
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.