Upcoming events

  • No upcoming events available

An adaptable FPGA-based System for Regular Expression Matching

Source:

Design, Automation and Test in Europe, DATE 08, p.1262 - 1267 (2008)

URL:

http://www.ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4484624&arnumber=4484852&count=312&index=227

Keywords:

silmarillion; blanket; recpu; 2008

Abstract:

In many applications, string pattern matching is one of the most intensive task in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Sequence Matching are two of those. Since software solutions are not able to satisfy the requirements in terms of performance, specialized hardware architectures are required. In this paper we propose a complete framework for regular expression matching, both in its architecture and compiler. This special-purpose processor is programmed using a regular expression programming language. The parallelism adopted in the design grants the possibility to achieve a throughput greater than one character per clock cycle requiring $O(n)$ memory space. The VHDL description of the proposed architecture is fully configurable. A design space exploration to find the optimal architecture based on area and performance cost-function is presented.