ACM Home Page
Please provide us with feedback. Feedback
Context-free-grammar based token tagger in reconfigurable devices
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays table of contents
Monterey, California, USA
POSTER SESSION: Applications table of contents
Pages: 237 - 237  
Year of Publication: 2006
ISBN:1-59593-292-5
Authors
Young H. Cho  Washington University in St. Louis, St. Louis, MO
James Moscola  Washington University in St. Louis, St. Louis, MO
John W. Lockwood  Washington University in St. Louis, St. Louis, MO
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
Additional Information:

abstract   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1117201.1117265
What is a DOI?

ABSTRACT

We present a high performance reconfigurable hardware architecture for detecting patterns as well as their contextual meaning. By analyzing for both semantic content and structure, the accuracy of content-level processing systems can be improved. Our system is built using semantics defined by context-free-grammar (CFG) to tag the streaming data. Unlike the traditional table look up and stack based engines used in CFG parsers, we explore a new method that maps the grammar structure on to the Field Programmable Gate Arrays (FPGA) hardware. The structure is a direct translation of the grammar which enables the meaning of the patterns to be determined based on the location of its detection. The parallel pattern detection engines are instantiated using FPGA resources. Our implementation scans for the regular expression patterns and determines their semantics as defined by a grammar. This highly parallel and fine grained pipelined engine with 8 bit input bus can operate in bandwidth above 2 Gbps. For a simple XML grammar example, our engine can detect and tag the patterns at 1.57 Gbps on Xilinx VirtexE FPGA and 4.26 Gbps on the new Virtex 4 devices.


Collaborative Colleagues:
Young H. Cho: colleagues
James Moscola: colleagues
John W. Lockwood: colleagues