FPGA-based synthesis of FSMs through decomposition

In this paper, we present a heuristic to synthesize a finite state machine as a set of smaller interacting submachines based on FPGA technology. This heuristic partitions inputs as well as outputs. Experimental results show that the sizes of submachines are much smaller than the size of original machine. As a result, the distributed smaller submachines can be operated faster than the original machine because of shorter critical paths.<<ETX>>

[1]  Sartaj Sahni,et al.  Simulated Annealing and Combinatorial Optimization , 1986, DAC 1986.

[2]  Srinivas Devadas,et al.  Decomposition and factorization of sequential finite state machines , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Mary Jane Irwin,et al.  Multi-Level Logic Synthesis Using Communication Complexity , 1989, 26th ACM/IEEE Design Automation Conference.

[4]  Stephen H. Unger,et al.  Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..

[5]  S. Devadas,et al.  Finite state machine decomposition by transition pairing , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[6]  Fabrizio Luccio,et al.  A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..

[7]  Srinivas Devadas,et al.  Optimum and heuristic algorithms for an approach to finite state machine decomposition , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Mary Jane Irwin,et al.  Multi-way FSM decomposition based on interconnect complexity , 1993, Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference.