A recursive MISD architecture for pattern matching

  • Authors:

  • Arne Halaas;Børge Svingen;Magnar Nedland;Pål Sætrom;Ola Snøve, Jr.;Olaf René Birkeland

  • Affiliations:

  • Depamnent of Computer and Information Science, Norwegian University of Science and Technology, No-7491 Trondheim, Norway;Depamnent of Computer and Information Science, Norwegian University of Science and Technology, No-7491 Trondheim, Norway;Interagon AS, Medisinsk Teknisk Senter, NO-7489 Trondheim, Norway;Interagon AS, Medisinsk Teknisk Senter, NO-7489 Trondheim, Norway;Interagon AS, Medisinsk Teknisk Senter, NO-7489 Trondheim, Norway;Interagon AS, Medisinsk Teknisk Senter, NO-7489 Trondheim, Norway

  • Venue:
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many applications require searching for multiple patterns in large data streams for which there is no preprocessed index to rely on for efficient lookups. An multiple instruction stream-single data stream (MISD) VLSI architecture that is based on a recursive divide and conquer approach to pattern matching is proposed. This architecture allows searching for multiple patterns simultaneously. The patterns can be constructed much like regular expressions, and add features such as requiring subpatterns to match in a specific order with some fuzzy distance between them, and the ability to allow errors according to prescribed thresholds, or ranges of such. The current implementation permits up to 127 simultaneous patterns at a clock frequency of 100 MHz, and does 1.024 × 1011 character comparisons per second.