Reconfigurable Constraint Repetition Unit for Regular Expression Matching

被引：0
|
作者：
Faezipour, Miad [1 ]
Nourani, Mehrdad [1 ]
机构：
[1] Univ Texas Dallas, Ctr Integrated Circuits & Syst, Richardson, TX 75083 USA
来源：
PROCEEDINGS OF THE SIXTEENTH IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES | 2008年
关键词：
D O I：
10.1109/FCCM.2008.22
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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 or constraint repetition, applicable to any sub-regular expression. We also apply optimization techniques to reduce the area and improve the overall performance.
引用
收藏
页码：279 / 280
页数：2
相关论文
共 50 条
  • [31] Regular expression matching and operational semantics
    Rathnayake, Asiri
    Thielecke, Hayo
    Electronic Proceedings in Theoretical Computer Science, EPTCS, 2011, 62 : 31 - 45
  • [32] New algorithms for regular expression matching
    Bille, Philip
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 643 - 654
  • [33] Proving correctness of regular expression matchers with constrained repetition
    Heyse, K.
    Bruneel, K.
    Stroobandt, D.
    ELECTRONICS LETTERS, 2013, 49 (01) : 41 - 42
  • [34] A Reconfigurable Multi-Byte Regular-Expression Matching Architecture for Signature-Based Intrusion Detection
    Badran, Tamer F.
    Ahmad, Hany H.
    Abdelgawad, Mohamad
    2008 3RD INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES: FROM THEORY TO APPLICATIONS, VOLS 1-5, 2008, : 2571 - 2574
  • [35] Type Inference for Regular Expression Pattern Matching
    Marin, Mircea
    Craciun, Adrian
    12TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2010), 2011, : 366 - 373
  • [36] Complexity analysis of extended regular expression matching
    Takahashi, Kazuya
    Minamide, Yasuhiko
    1600, Japan Society for Software Science and Technology (38): : 53 - 70
  • [37] Formalising Boost POSIX Regular Expression Matching
    Berglund, Martin
    Bester, Willem
    van der Merwe, Brink
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2018, 2018, 11187 : 99 - 115
  • [38] TiReX: Tiled Regular eXpression matching architecture
    Comodi, Alessandro
    Conficconi, Davide
    Scolari, Alberto
    Santambrogio, Marco D.
    2018 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2018), 2018, : 131 - 137
  • [39] An Improved DFA for Fast Regular Expression Matching
    Ficara, Domenico
    Giordano, Stefano
    Procissi, Gregorio
    Vitucci, Fabio
    Antichi, Gianni
    Di Pietro, Andrea
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (05) : 31 - 40
  • [40] Multiple regular expression matching hardware architecture
    Zhang, Wei
    Xue, Yibo
    Song, Tian
    Qinghua Daxue Xuebao/Journal of Tsinghua University, 2009, 49 (10): : 1704 - 1707
12345