Also Available Domains Communications|Xilinx ISE
In this project, string pattern matching by improved AC is implemented. We have, in fact, discovered several reasons why regular expressions can slow down scanning based on the nature of the used algorithm, Aho-Corasick. Since every byte of a packet has to be inspected by a large set of patterns, it often becomes a bottleneck of these applications and dominates the performance of an entire system. Many existing works have been devoted to alleviate this performance bottleneck either by algorithm optimization or hardware acceleration. We have proposed a new version of this algorithm and have implemented it in the original version of this tool. The experiments are presented, proving that the speed of pattern matching with regular expressions can indeed be improved. In selected cases, the proposed version was faster than the original version. And in instances where strings were optimized for the original version, their speed was found to be comparable. The effectiveness of the proposed method is synthesized and simulated using Xilinx Vivado.
Keywords:- String pattern matching, Deterministic and Non deterministic Finite Automaton, Aho-Corasick (AC) algorithm
NOTE: Without the concern of our team, please don't submit to the college. This Abstract varies based on student requirements.

Software Requirements:
Hardware Requirements: