（毕业论文毕业设计）-KMP算法的FPGA实现.docVIP

杭州电子科技大学本科毕业设计 PAGE 杭州电子科技大学本科毕业设计 本科毕业设计 题 目 KMP算法的FPGA实现 学 院 电子信息学院 专 业 集成电路设计与集成系统 班 级 学 号 学生姓名 指导教师 完成日期 摘 要 随着网络技术的迅猛发展，所要检测的数据包越来越多，单纯的依靠软件来检测，越来越显得力不从心。伴随着FPGA技术的发展，在硬件上实现模式匹配，来提高网络数据处理速度的需求越来越普遍。把搜索算法固化到FPGA里，从而可以大大提高算法的速度，适应科技的迅速发展。 本文重点分析了几种典型的模式匹配算法。包括：BF算法、KMP算法、BM算法、BMH算法、AC算法和AC-BM算法。另外文章还介绍了FPGA的的相关基本知识以及硬件描述语言的选择。 综合考虑现有的比较成熟的模式匹配算法，并且追踪国外基于FPGA技术来实现模式匹配的研究成果，认为在硬件实现方面，KMP算法效率较高，结构简单，可行性强，而且易于对主串进行多模式的匹配，所以选其作为模式匹配硬件模块的核心算法，通过硬线逻辑来进一步提高串模式匹配的效率。本文KMP算法程序设计部分主要分为三个部分：模式串输入、next函数的计算、字符串的匹配。具体情况会在第四章中介绍。 关键词：模式匹配算法；KMP算法；FPGA ABSTRACT With the rapid development of network technology, have to text more and more packets. Thus, simply relying on software to detect becomes more and more inadequate. As the development of FPGA technology, it’s becomes increasingly popular to realize the pattern matching on hardware to meet the demand for the improvement of the processing speed of network data. Putting the search algorithm to the FPGA, which can greatly improve the speed of the algorithm, is adapt to the quick development of technology. This paper focuses on several typical patterns matching algorithm involving: BF algorithm, KMP algorithm, BM algorithm, BMH algorithm, AC algorithm and the AC-BM algorithm.Besides, this paper will also introduce the basic knowledge related to FPGA as well as the selection of the description language of hardware. Considering the current pattern matching algorithms which are relatively through and the reseaching findings from abroad of using FPGA to achieve pattern mactching, KMP has advantages of efficient arithmetic, simple organization, strong feasibility and easy multi-pattern macthing to primary string in realizing hardware.Thats the reason why choose it to be the core arithmetic of matching pattern and hardware module, which makes further improvement on effiency of pattern maching in string by via hard wire logic.This part of KMP Algorithm Programming is divided into three parts: t