Automatic Generation of HDL Code for Regular Expression Matching
碩士 === 國立交通大學 === 電信工程系所 === 93 === The regular expression matching is an important problem that occurs in many areas of science and information processing. In this paper, we design a C code which accepts the regular expression and then outputs a NFA described by verilog language. By means of the NF...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/01150014767278355053 |
id |
ndltd-TW-093NCTU5435009 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-093NCTU54350092016-06-06T04:11:38Z http://ndltd.ncl.edu.tw/handle/01150014767278355053 Automatic Generation of HDL Code for Regular Expression Matching 自動產生硬體描述語言實現正規表示法比對 Wen-Ben Wang 王文彬 碩士 國立交通大學 電信工程系所 93 The regular expression matching is an important problem that occurs in many areas of science and information processing. In this paper, we design a C code which accepts the regular expression and then outputs a NFA described by verilog language. By means of the NFA circuit, the circuit can read the string and examine whether the substring matches the regular expression or not. Using our approach, the area of the hardware used grow in O(n) , where n is the length of the regular expression. To match a regular expression, GNU grep (DFA) requires O(2^n) memory and approaches using the NFA in [1] require O(n^2) area. Beside the improvement of the area, this new design has not bad performance on debug, suitable device, optimization, easily modifying the circuit. We evaluate our approach on the machine which has a processor of the Pentium 4 and the target device is the APEX EP20K600EBC-6521X. Tsern-Huei Lee 李程輝 2005 學位論文 ; thesis 46 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 電信工程系所 === 93 === The regular expression matching is an important problem that occurs in many areas of science and information processing. In this paper, we design a C code which accepts the regular expression and then outputs a NFA described by verilog language. By means of the NFA circuit, the circuit can read the string and examine whether the substring matches the regular expression or not. Using our approach, the area of the hardware used grow in O(n) , where n is the length of the regular expression. To match a regular expression, GNU grep (DFA) requires O(2^n) memory and approaches using the NFA in [1] require O(n^2) area. Beside the improvement of the area, this new design has not bad performance on debug, suitable device, optimization, easily modifying the circuit. We evaluate our approach on the machine which has a processor of the Pentium 4 and the target device is the APEX EP20K600EBC-6521X.
|
author2 |
Tsern-Huei Lee |
author_facet |
Tsern-Huei Lee Wen-Ben Wang 王文彬 |
author |
Wen-Ben Wang 王文彬 |
spellingShingle |
Wen-Ben Wang 王文彬 Automatic Generation of HDL Code for Regular Expression Matching |
author_sort |
Wen-Ben Wang |
title |
Automatic Generation of HDL Code for Regular Expression Matching |
title_short |
Automatic Generation of HDL Code for Regular Expression Matching |
title_full |
Automatic Generation of HDL Code for Regular Expression Matching |
title_fullStr |
Automatic Generation of HDL Code for Regular Expression Matching |
title_full_unstemmed |
Automatic Generation of HDL Code for Regular Expression Matching |
title_sort |
automatic generation of hdl code for regular expression matching |
publishDate |
2005 |
url |
http://ndltd.ncl.edu.tw/handle/01150014767278355053 |
work_keys_str_mv |
AT wenbenwang automaticgenerationofhdlcodeforregularexpressionmatching AT wángwénbīn automaticgenerationofhdlcodeforregularexpressionmatching AT wenbenwang zìdòngchǎnshēngyìngtǐmiáoshùyǔyánshíxiànzhèngguībiǎoshìfǎbǐduì AT wángwénbīn zìdòngchǎnshēngyìngtǐmiáoshùyǔyánshíxiànzhèngguībiǎoshìfǎbǐduì |
_version_ |
1718296873098280960 |