|
|||||
|
|
| PFA在FPGA正则引擎上的设计和仿真 | |
| 引用本文： | 敬茂华,江彬,辛阳,杨义先. PFA在FPGA正则引擎上的设计和仿真[J]. 北京邮电大学学报, 2015, 38(6): 69-73. DOI: 10.13190/j.jbupt.2015.06.015 |
| 作者姓名： | 敬茂华 江彬 辛阳 杨义先 |
| 作者单位： | 1. 东北大学秦皇岛分校 计算机与通信工程学院, 河北 秦皇岛 066004; 2. 东北大学 信息科学与工程学院, 沈阳 110819; 3. 云安全技术北京市工程实验室, 北京 100082; 4. 北京邮电大学 信息安全中心, 北京 100876 |
| 基金项目： | 国家自然科学基金,河北省自然科学基金,河北省教育厅自然科学指导项目 |
| 摘 要： | 将后缀自动机构造方法应用到现场可编程门阵列的正则引擎设计上,能够有效地压缩状态空间,提高"速度"和"面积"这2个最主要的现场可编程门阵列的引擎性能指标,并能利用有限的现场可编程门阵列资源来实现更多正则表达式的匹配处理. Testbench模拟仿真结果表明,所设计的正则引擎完全实现了预期匹配要求,而其支持的正则表达式的数量和匹配速度都因有效的规模压缩而得到了很大的提升,对比传统的基于Thompson不确定的有限自动机实现的硬件引擎,其所需要的硬件逻辑资源更少,能够并行执行的正则表达式数量也就越多,有效地提高了匹配效率. |
| 关 键 词： | 正则表达式 模式匹配 现场可编程门阵列 后缀自动机 Thompson不确定的有限自动机 |
| 收稿时间： | 2015-01-22 |
Design and Simulation of FPGA Engine for Regular Expressions Matching Based on PFA |
|
| JING Mao-hua,JIANG Bin,XIN Yang,YANG Yi-xian. Design and Simulation of FPGA Engine for Regular Expressions Matching Based on PFA[J]. Journal of Beijing University of Posts and Telecommunications, 2015, 38(6): 69-73. DOI: 10.13190/j.jbupt.2015.06.015 | |
| Authors: | JING Mao-hua JIANG Bin XIN Yang YANG Yi-xian |
| Affiliation: | 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 |
| 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. Simula-tion by Testbench implies that the number and speed of the supported regular expressions is deeply im-proved. Compared with Thompson non-deterministic finite automata ( NFA) method, it needs less hard-ware resources and the number of regular expressions that can be implemented concurrently becomes more, so the efficiency of implement has been increased. |
| Keywords: | regular expression pattern matching field programmable gate array postfix automata Thompson non-deterministic |
| 本文献已被 万方数据 等数据库收录！ | |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 | |
| 点击此处可从《北京邮电大学学报》下载全文 | |