Dynamically Reconfigurable Regular Expression Matching Architecture


Autoria(s): Divyasree, J; Rajashekar, H; Varghese, Kuruvilla
Data(s)

29/07/2008

Resumo

Regular Expressions are generic representations for a string or a collection of strings. This paper focuses on implementation of a regular expression matching architecture on reconfigurable fabric like FPGA. We present a Nondeterministic Finite Automata based implementation with extended regular expression syntax set compared to previous approaches. We also describe a dynamically reconfigurable generic block that implements the supported regular expression syntax. This enables formation of the regular expression hardware by a simple cascade of generic blocks as well as a possibility for reconfiguring the generic blocks to change the regular expression being matched. Further,we have developed an HDL code generator to obtain the VHDL description of the hardware for any regular expression set. Our optimized regular expression engine achieves a throughput of 2.45 Gbps. Our dynamically reconfigurable regular expression engine achieves a throughput of 0.8 Gbps using 12 FPGA slices per generic block on Xilinx Virtex2Pro FPGA.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/40647/1/Dynamically_Reconfigurable.pdf

Divyasree, J and Rajashekar, H and Varghese, Kuruvilla (2008) Dynamically Reconfigurable Regular Expression Matching Architecture. In: 20th IEEE International Conference on Application-specific Systems, Architectures and Processors 2008 (ASAP 2008), 2-4 July 2008, Leuven.

Publicador

IEEE

Relação

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4580165

http://eprints.iisc.ernet.in/40647/

Palavras-Chave #Electronic Systems Engineering (Formerly, (CEDT) Centre for Electronic Design & Technology)
Tipo

Conference Paper

PeerReviewed