基于FPGA的正则表达式匹配算法综述  

Survey on FPGA-based regular expressions matching algorithms

作　　者：唐球[1,2] 姜磊[2] 谭建龙[2] 刘金刚[1,2] 

机构地区：[1]首都师范大学计算机科学联合研究院,北京100037 [2]中国科学院计算技术研究所,北京100190

出　　处：《计算机应用》2011年第11期2943-2946,共4页journal of Computer Applications

基　　金：国家973计划项目(2007CB311100);国家自然科学基金资助项目(61070026)

摘　　要：分析了基于硬件正则表达式匹配的优势,介绍了基于现场可编程门阵列(FPGA)的正则表达式匹配算法的基本思想和设计方法,从匹配速度和资源利用率两个技术指标的角度对现有算法进行分类,综述了当前的主流算法并分析了其优缺点,最后论述了目前基于FPGA正则表达式匹配算法设计的难点并展望了未来研究的发展趋势。The advantages of hardware-based regular expressions matching were analyzed.At the same time,the basic ideas and methodology for Field Programmable Gate Array（FPGA）-based regular expressions matching were introduced.Furthermore,an algorithm classification approach was proposed in terms of two technical indicators： matching speed and resource utilization.The advantages,disadvantages and the basic ideas of various algorithms were summarized.Finally,the key techniques,difficulties and the future direction in this field were discussed.

关 键 词：有穷自动机 现场可编程门阵列 正则表达式 入侵检测 模式匹配 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]