About this Journal Submit a Manuscript Table of Contents
VLSI Design
Volume 9 (1999), Issue 1, Pages 55-67
http://dx.doi.org/10.1155/1999/75313

Partitionable Bus-based String-matching Algorithm for Run-length Coded Strings With VLDCs

1Department of Information Management, Van-Nung Institute of Technology, 63-1, Shuiwei, Chungli 320, Taoyuan, Taiwan
2Department of Information Management, National Taiwan University of Science and Technology, 43, Section 4, Keelung Road, Taipei 10672, Taiwan

Received 5 May 1997

Copyright © 1999 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

String matching (SM) problem is to find the occurrences of a pattern within a text. A vanable length don't care (VLDC) is a special symbol, not belonging to a finite alphabet ∑ but in ∑*. Each VLDC in the pattern can match any substring in the text. Given a run-length coded text of length 2n over ∑ and a run-length coded pattern of length 2m over ∑*, this paper first presents an O(1) time parallel SM algorithm for run-length coded strings with VLDCs on a reconfigurable mesh (RM) using O(nm) processors. Consider the hardware limitation in VLSI implementation. In order to be suitable for VLSI modular implementation, a partitionable parallel algorithm on the RM with limited processors is further presented. For N < n and M < m, the SM for run-length coded strings with VLDCs can be solved in O(X^Y^) time on the RM using O(NM)(= O((nm)/((X^Y^))) processors, where X^ = [(n – 1)/(N – 1)] and Y^ = [(m – 1)/(M – 1)].