TY - GEN
T1 - A reconfigurable pattern matching hardware implementation using on-chip RAM-based FSM
AU - Rafla, Nader I.
AU - Gauba, Indrawati
PY - 2010
Y1 - 2010
N2 - The use of synthesizable reconfigurable IP cores has increasingly become a trend in System on Chip (SoC) designs because of their flexibility and powerful functionality. The market introduction of multi-featured platform FPGAs equipped with embedded memory and processor blocks has further expanded the possibility of utilizing dynamic reconfiguration to improve overall system adaptability to meet varying product requirements. In this paper, a reconfigurable hardware implementation for pattern matching using Finite State machine (FSM) is proposed. The FSM design is RAMbased and is reconfigured on the fly through altering memory contents only. An embedded processor is used for orchestrating run time reconfiguration. Experimental results show that the system can reconfigure itself based on a new incoming pattern and perform the text search without the need of a host processor. Results also proved that each search iteration was executed in one clock cycle and the maximum achievable clock frequency is independent of search pattern length.
AB - The use of synthesizable reconfigurable IP cores has increasingly become a trend in System on Chip (SoC) designs because of their flexibility and powerful functionality. The market introduction of multi-featured platform FPGAs equipped with embedded memory and processor blocks has further expanded the possibility of utilizing dynamic reconfiguration to improve overall system adaptability to meet varying product requirements. In this paper, a reconfigurable hardware implementation for pattern matching using Finite State machine (FSM) is proposed. The FSM design is RAMbased and is reconfigured on the fly through altering memory contents only. An embedded processor is used for orchestrating run time reconfiguration. Experimental results show that the system can reconfigure itself based on a new incoming pattern and perform the text search without the need of a host processor. Results also proved that each search iteration was executed in one clock cycle and the maximum achievable clock frequency is independent of search pattern length.
UR - http://www.scopus.com/inward/record.url?scp=77956602404&partnerID=8YFLogxK
U2 - 10.1109/MWSCAS.2010.5548558
DO - 10.1109/MWSCAS.2010.5548558
M3 - Conference contribution
AN - SCOPUS:77956602404
SN - 9781424477715
T3 - Midwest Symposium on Circuits and Systems
SP - 49
EP - 52
BT - 2010 IEEE International 53rd Midwest Symposium on Circuits and Systems, MWSCAS 2010
T2 - 53rd IEEE International Midwest Symposium on Circuits and Systems, MWSCAS 2010
Y2 - 1 August 2010 through 4 August 2010
ER -