IEICE TRANSACTIONS on transactions
A Programmable Pattern Matching Machine for High Speed Recognition of Regular Sets
Summary :
The great technological progress in very large scale integration (VLSI) of electronic circuits has made it possible to implement a large distributed computing system on a single VLSI chip. Distributed algorithms suited for VLSI implementation are generally called 'VLSI algorithms', and many VLSI algorithms have been devised for solving several kinds of problems. This paper discusses a VLSI algorithm for pattern matching. We propose a new VLSI-oriented pattern matching algorithm in which regular expressions are adopted to represent a pattern. The proposed algorithm will be implemented on a configurable multi-processor system, which can dynamically change its interconnections among the processors according to the external inputs. Thus the pattern may be arbitrarily changed after the chip fabrication. We call such an algorithm the 'programmable' pattern matching machine (PPM for short). The programmability makes it possible for PPM to have wide applications which the previously known algorithms could hardly have. PPM consists of n(n
- Publication
- IEICE TRANSACTIONS on transactions Vol.E67-E No.7 pp.363-370
- Publication Date
- 1984/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- VLSI Algorithms
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shin'ichi WAKABAYASHI, Tohru KIKUNO, Noriyoshi YOSHIDA, Takashi FUJII, "A Programmable Pattern Matching Machine for High Speed Recognition of Regular Sets" in IEICE TRANSACTIONS on transactions,
vol. E67-E, no. 7, pp. 363-370, July 1984, doi: .
Abstract: The great technological progress in very large scale integration (VLSI) of electronic circuits has made it possible to implement a large distributed computing system on a single VLSI chip. Distributed algorithms suited for VLSI implementation are generally called 'VLSI algorithms', and many VLSI algorithms have been devised for solving several kinds of problems. This paper discusses a VLSI algorithm for pattern matching. We propose a new VLSI-oriented pattern matching algorithm in which regular expressions are adopted to represent a pattern. The proposed algorithm will be implemented on a configurable multi-processor system, which can dynamically change its interconnections among the processors according to the external inputs. Thus the pattern may be arbitrarily changed after the chip fabrication. We call such an algorithm the 'programmable' pattern matching machine (PPM for short). The programmability makes it possible for PPM to have wide applications which the previously known algorithms could hardly have. PPM consists of n(n
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e67-e_7_363/_p
Copy
@ARTICLE{e67-e_7_363,
author={Shin'ichi WAKABAYASHI, Tohru KIKUNO, Noriyoshi YOSHIDA, Takashi FUJII, },
journal={IEICE TRANSACTIONS on transactions},
title={A Programmable Pattern Matching Machine for High Speed Recognition of Regular Sets},
year={1984},
volume={E67-E},
number={7},
pages={363-370},
abstract={The great technological progress in very large scale integration (VLSI) of electronic circuits has made it possible to implement a large distributed computing system on a single VLSI chip. Distributed algorithms suited for VLSI implementation are generally called 'VLSI algorithms', and many VLSI algorithms have been devised for solving several kinds of problems. This paper discusses a VLSI algorithm for pattern matching. We propose a new VLSI-oriented pattern matching algorithm in which regular expressions are adopted to represent a pattern. The proposed algorithm will be implemented on a configurable multi-processor system, which can dynamically change its interconnections among the processors according to the external inputs. Thus the pattern may be arbitrarily changed after the chip fabrication. We call such an algorithm the 'programmable' pattern matching machine (PPM for short). The programmability makes it possible for PPM to have wide applications which the previously known algorithms could hardly have. PPM consists of n(n
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - A Programmable Pattern Matching Machine for High Speed Recognition of Regular Sets
T2 - IEICE TRANSACTIONS on transactions
SP - 363
EP - 370
AU - Shin'ichi WAKABAYASHI
AU - Tohru KIKUNO
AU - Noriyoshi YOSHIDA
AU - Takashi FUJII
PY - 1984
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E67-E
IS - 7
JA - IEICE TRANSACTIONS on transactions
Y1 - July 1984
AB - The great technological progress in very large scale integration (VLSI) of electronic circuits has made it possible to implement a large distributed computing system on a single VLSI chip. Distributed algorithms suited for VLSI implementation are generally called 'VLSI algorithms', and many VLSI algorithms have been devised for solving several kinds of problems. This paper discusses a VLSI algorithm for pattern matching. We propose a new VLSI-oriented pattern matching algorithm in which regular expressions are adopted to represent a pattern. The proposed algorithm will be implemented on a configurable multi-processor system, which can dynamically change its interconnections among the processors according to the external inputs. Thus the pattern may be arbitrarily changed after the chip fabrication. We call such an algorithm the 'programmable' pattern matching machine (PPM for short). The programmability makes it possible for PPM to have wide applications which the previously known algorithms could hardly have. PPM consists of n(n
ER -
English
