Low-power TCAM for regular expression matching
A character-indexed regular expression matching algorithm was presented to address the limitations of TCAM power consumption. This algorithm used the idea of separating the alphabet table from the states in deterministic finite automaton (DFA) for building a character index, in order to reduce the n...
Saved in:
Main Authors: | Lin-xuan DING, Kun HUANG, Da-fang ZHANG |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2014-08-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.08.020/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Highly Parallel Regular Expression Matching Using a Real Processing-in-Memory System
by: Jeonghyeon Joo, et al.
Published: (2025-01-01) -
Range matching method based on TCAM:C-TCAM
by: Guo-sheng ZHU, et al.
Published: (2012-01-01) -
The matching polynomial of a distance-regular graph
by: Robert A. Beezer, et al.
Published: (2000-01-01) -
Novel NFA engine construction method of regular expressions
by: Mao-hua JING, et al.
Published: (2014-10-01) -
Regular expression matching technology with two-stage memory
by: Shu-hui CHEN, et al.
Published: (2014-06-01)