Totally Self Checking FSM Based on Convolutional Codes

In this paper a new technique for designing totally self- checking finite state machines is presented using convolutional codes. In order to correct the fault, we propose a novel scheme which can not only detect, but also correct errors occurred in FSM transition. More specifically, we demonstrate the FSMs hardware which can be reused based on convolutional code partitioning and we formulate the optimization problem of maximizing hardware reusability. Synthesis results produced by our proposed procedure for the MCNC´89 FSM benchmark circuits show an average 20% reduction in literal counts compared to previous techniques. Moreover, we realize the IP core of the self-checking module by SMIC 0.25 mum technology and also simulate its function in FPGA.