Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2015, Vol. 38 ›› Issue (6): 69-73.doi: 10.13190/j.jbupt.2015.06.015

• Reports • Previous Articles     Next Articles

Design and Simulation of FPGA Engine for Regular Expressions Matching Based on PFA

JING Mao-hua1,2,3, JIANG Bin2, XIN Yang3,4, YANG Yi-xian2,4   

  1. 1. School of Computer and Communication Engineering and Northeastern University at Qinhuangdao, Hebei Qinhuangdao 066004, China;
    2. College of Information Science and Engineering and Northeastern University, Shenyang 110819, China;
    3. Beijing Engineering Laboratory for Cloud Security, Beijing 100082, China;
    4. Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2015-01-22 Online:2015-12-28 Published:2015-12-01

Abstract:

A field programmable gate array(FPGA) engine for regular expressions matching based on postfix automata(PFA) was designed. PFA can obtain smaller size and then reduce the space effectively. The limited FPGA resources can be used to implement more regular expressions simultaneously. Simulation by Testbench implies that the number and speed of the supported regular expressions is deeply improved. Compared with Thompson non-deterministic finite automata (NFA) method, it needs less hardware resources and the number of regular expressions that can be implemented concurrently becomes more, so the efficiency of implement has been increased.

Key words: regular expression, pattern matching, field programmable, postfix automata, Thompson non-deterministic

CLC Number: