On state assignment of finite state machines using hypercube embedding approach
暂无分享,去创建一个
[1] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.
[2] John K. Antonio,et al. Hypersphere Mapper: a nonlinear programming approach to the hypercube embedding problem , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.
[3] Prithviraj Banerjee,et al. A Parallel Algorithm for State Assignment of Finite State Machines , 1998, IEEE Trans. Computers.
[4] S. Yang,et al. Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .
[5] P. R. Stephan,et al. SIS : A System for Sequential Circuit Synthesis , 1992 .
[6] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[7] Alberto L. Sangiovanni-Vincentelli,et al. MUSTANG: state assignment of finite state machines targeting multilevel logic implementations , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[8] Bernhard Eschermann,et al. State assignment for hardwired VLSI control units , 1993, CSUR.
[9] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .