A programmable array processor architecture for flexible approximate string matching algorithms

This paper proposes a generic programmable array processor architecture for a wide variety of approximate string matching algorithms. Further, we describe the architecture of the array and the architecture of the cell in detail in order to efficiently implement for both the preprocessing and searchi...

Full description

Saved in:
Bibliographic Details
Published in:2005 International Conference on Parallel Processing Workshops (ICPPW'05) pp. 201 - 209
Main Authors: Michailidis, P.D., Margaritis, K.G.
Format: Conference Proceeding
Language:English
Published: IEEE 2005
Subjects:
Computer architecture
Distributed processing
Field programmable gate arrays
Hamming distance
Informatics
Laboratories
Parallel processing
Pattern matching
Phased arrays
Very large scale integration
ISBN:9780769523811, 0769523811
ISSN:0190-3918
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a generic programmable array processor architecture for a wide variety of approximate string matching algorithms. Further, we describe the architecture of the array and the architecture of the cell in detail in order to efficiently implement for both the preprocessing and searching phases of most string matching algorithms. Further, the architecture performs approximate string matching for complex patterns that contain don't care, complement and classes symbols. Our architecture maximizes the strength of VLSI in terms of intensive and pipelined computing and yet circumvents the limitation on communication. It may be adopted as a basic structure for a universal flexible string matcher engine.
ISBN:9780769523811
0769523811
ISSN:0190-3918
DOI:10.1109/ICPPW.2005.15