%0 Journal Article
%A JIANG Bin
%A JING Mao-hua
%A XIN Yang
%A YANG Yi-xian
%T Design and Simulation of FPGA Engine for Regular Expressions Matching Based on PFA
%D 2015
%R 10.13190/j.jbupt.2015.06.015
%J Journal of Beijing University of Posts and Telecommunications
%P 69-73
%V 38
%N 6
%X <p>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.</p>
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2015.06.015