Hardware based String Matching Algorithms: A Survey

are various string matching Algorithms which are software based but some are hardware based. The main factor of string matching algorithm is depending on searching efficiency. In this paper we have discussed about the hardware based string matching algorithms such as Brute Force, KMP, and Aho-Corasicks with their applications. There are different types of string matching algorithms which are software based solution and hardware based solution. Since software-based solutions are slower and less efficient, now a day, so the hardware-based solutions are highly preferred. Hardware based approaches are more efficient in terms of speed, memory size and power consumption than software based approaches. Hardware based solutions has great importance in the real life applications. This paper focus on the hardware based solutions and describes the hardware based implementation of string matching algorithms such as Brute Force, KMP and Aho- Corasicks.

[1]  Thierry Lecroq,et al.  Handbook of Exact String Matching Algorithms , 2004 .

[2]  Hyunjin Kim,et al.  A hardware-efficent multi-character string matching architecture using brute-force algorithm , 2009, 2009 International SoC Design Conference (ISOCC).

[3]  Nader I. Rafla,et al.  A reconfigurable pattern matching hardware implementation using on-chip RAM-based FSM , 2010, 2010 53rd IEEE International Midwest Symposium on Circuits and Systems.

[4]  Stefano Lonardi,et al.  String Matching in Hardware Using the FM-Index , 2011, 2011 IEEE 19th Annual International Symposium on Field-Programmable Custom Computing Machines.

[5]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[6]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[7]  Sheng-De Wang,et al.  A MULTI-CHARACTER TRANSITION STRING MATCHING ARCHITECTURE BASED ON AHO-CORASICK ALGORITHM , 2012 .

[8]  Jorma Tarhio,et al.  Multipattern string matching with q-grams , 2007, ACM J. Exp. Algorithmics.