Fast Regular Expression Matching using FPGAs

@misc{citeulike:1154391, abstract = {This paper presents an ecient method for nding matches to a given regular expression in given text using FPGAs. To match a regular expression of length n, a serial machine requires O(2 n ) memory and takes O(1) time per text character. The proposed approach requires only O(n 2 ) space and still processes a text character in O(1) time (one clock cycle). The improvement is due to the Nondeterministic Finite Automaton (NFA) used to perform the matching. As far as the authors are aware, this...}, author = {Sidhu, R. and Prasanna, V. }, citeulike-article-id = {1154391}, keywords = {fpga, regular\_expression, string\_search}, posted-at = {2007-03-23 05:29:48}, priority = {2}, title = {Fast Regular Expression Matching using FPGAs}, url = {http://citeseer.ist.psu.edu/474327.html}, year = {2001} }

TY - GEN ID - citeulike:1154391 L3 - citeulike-article-id:1154391 N2 - This paper presents an ecient method for nding matches to a given regular expression in given text using FPGAs. To match a regular expression of length n, a serial machine requires O(2 n ) memory and takes O(1) time per text character. The proposed approach requires only O(n 2 ) space and still processes a text character in O(1) time (one clock cycle). The improvement is due to the Nondeterministic Finite Automaton (NFA) used to perform the matching. As far as the authors are aware, this... TI - Fast Regular Expression Matching using FPGAs KW - fpga KW - regular_expression KW - string_search AU - Sidhu, R AU - Prasanna, V PY - 2001/// UR - http://citeseer.ist.psu.edu/474327.html ER -