bamboolll
Newbie level 2
I had a project which i must implement Regular Expression Matching on FPGA. I had chosen Nondeterminate Final Automat (NFA), a kind of Finite State Machine (FSM) to implement it.
Because of using FSM, so in my project there are so many states to implement a list of Regular Expression. With the list of 20 Regular Expression, it take about 1100 State, at this level XST on ISE synthesis just fine, about 3-4 minute to do. But with the list of 100 Regular Expression, XST hang on for a long time. I didn't see any sign which indicate that it still working.
Anyone can give me some advice for this situation?
Can i separate synthesis with XST ?
is there any way to XST show the log when it synthesize. I want to know what make XST hang on for a long time.
Because of using FSM, so in my project there are so many states to implement a list of Regular Expression. With the list of 20 Regular Expression, it take about 1100 State, at this level XST on ISE synthesis just fine, about 3-4 minute to do. But with the list of 100 Regular Expression, XST hang on for a long time. I didn't see any sign which indicate that it still working.
Anyone can give me some advice for this situation?
Can i separate synthesis with XST ?
is there any way to XST show the log when it synthesize. I want to know what make XST hang on for a long time.