Multi-way FSM decomposition based on interconnect complexity
暂无分享,去创建一个
[1] Srinivas Devadas,et al. Decomposition and factorization of sequential finite state machines , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2] P. R. Stephan,et al. SIS : A System for Sequential Circuit Synthesis , 1992 .
[3] Mary Jane Irwin,et al. Multi-Level Logic Synthesis Using Communication Complexity , 1989, 26th ACM/IEEE Design Automation Conference.
[4] Fabrizio Luccio,et al. A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..
[5] 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..
[6] J. Hartmanis,et al. Algebraic Structure Theory Of Sequential Machines , 1966 .
[7] Stephen H. Unger,et al. Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..
[8] S. Devadas,et al. Finite state machine decomposition by transition pairing , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.
[9] Michael Yoeli,et al. The Cascade Decomposition of Sequential Machines , 1961, IRE Trans. Electron. Comput..
[10] Sartaj Sahni,et al. Simulated Annealing and Combinatorial Optimization , 1986, DAC 1986.