Regular Expression Pattern Matching Supporting Constrained Repetitions

Authors:
Sangkyun Yun;Kyuhee Lee
Affiliations:
Department of Computer and Telecommunications Engineering, Yonsei University, Wonju, Korea 220-710;Department of Computer and Telecommunications Engineering, Yonsei University, Wonju, Korea 220-710
Venue:
ARC '09 Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications
Year:
2009

Citing 5
Cited 0

Assisting Network Intrusion Detection with Reconfigurable Hardware

FCCM '02 Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Fast Regular Expression Matching Using FPGAs

FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Optimization of regular expression pattern matching circuits on FPGA

Proceedings of the conference on Design, automation and test in Europe: Designers' forum
Regular Expression Matching in Reconfigurable Hardware

Journal of Signal Processing Systems
Synthesis of regular expressions targeting FPGAs: current status and open issues

ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present regular expression pattern matching architecture supporting constrained repetitions. The proposed architecture can implement the constrained repetitions of a regular expression while previous works support only the constrained repetitions of a single character or a multi-cycle, fixed length pattern. The blocks for the constrained repetitions are simply implemented using a counter. The beginning constrained repetition blocks are implemented differently from the non-beginning blocks to support overlapped matching. The proposed architecture can implement all constrained repetitions used in Snort rule-sets with smaller resources.