Optimal State Assignment for Finite State Machines

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 4, Issue 3, 1985, Pages 269-285

  Micheli, Giovanni De ^a   Brayton, Robert K ^a   Sangiovanni Vincentelli, Alberto ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84893561614     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/TCAD.1985.1270123     Document Type: Article

References (36)

1. [1] D. B. Armstrong, “A programmed algorithm for assigning internal codes to sequential machines,” IRE Trans. Electron. Comput., vol. EC-11, pp. 466–472, Aug. 1962.
2. [2] D. B. Armstrong, “On the efficient assignment of internal codes to sequential machines,” IRE Trans. Electron. Comput., vol. EC-11, pp. 611–622, Oct. 1962.
3. [3] R. Brayton, G. D. Hachtel, C. McMullen, and A. L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis. Hingham, MA: Kluwer Academic, 1984.
4. [4] D. W. Brown, “A State-Machine Synthesizer—SMS,” in Des. Autom. Conf., pp. 301–304, Nashville, TN, Jun. 1981.
5. [5] H. A. Curtis, “Systematic procedures for realizing synchronous sequential machines using flip-flop memory: Part 1,” IEEE Trans. Computer., vol. C-18, pp. 1121–1127, Dec. 1969.
6. [6] H. A. Curtis, “Systematic procedures for realizing synchronous sequential machines using flip-flop memory: Part 2,” IEEE Trans. Computer, vol. C-19, pp. 66–73, Jan. 1970.
7. [7] G. De Micheli and A. L. Sangiovanni-Vincentelli, “Multiple contrained folding of programmable logic arrays: Theory and applications,” IEEE Trans. Computer Aided Design, vol. CAD-2, pp. 167–180, 180, Jul. 1983.
8. [8] G. De Micheli and M. Santomauro, “SMILE: A computer program for partitioning of programmed logic array,” Computer Aided Design, no. 2, pp. 89–97, Mar. 1983; Also, Memo UCB/ERL No. 82/74, Univ. California, Berkeley.
9. [9] G. De Micheli, A. Sangiovanni-Vincentelli, and T. Villa, “Computer-aided aided synthesis of PLA-based finite state machines,” in Int. Conf. on Comp. Aid. Des., Santa Clara, CA, pp. 154–157, Sept. 1983.
10. [10] G. De Micheli, “Computer-aided synthesis of PLA-based systems,” Ph.D. dissertation, Univ. California, Berkeley, 1983.
11. [11] G. De Micheli, M. Hoffman, A. R. Newton, and A. L. Sangiovanni-Vincentelli, “A design system for PLA-based digital circuits,” in Advances in Computer Engineering Design, Jai Press, 1984 (in print).
12. [12] G. De Micheli, “Optimal encoding of control logic,” in Int. Conf. on Circ. and Comp Des., Rye, NY, Sept. 1984.
13. [13] D. L. Dietmeyer and M. H. Doshi, “Automated PLA synthesis of the combinational logic of a DDL description,” J. Des. Aut. Fault. Tol. Comput., vol. 3, no. 3–4, pp. 241-257,1979.
14. [14] T. A. Dolotta and E. J. McCluskey, “The coding of internal states of sequential machines,” IEEE Trans. Electron. Comput., vol. EC-13, pp. 549–562, Oct. 1964.
15. [15] G. D. Hachtel, A. R. Newton, and A. L. Sangiovanni-Vincentelli, “An algorithm for optimal PLA folding,” IEEE Trans. Computer-Aided Aided Design, vol. CAD-1, pp. 63–77, Apr. 1982.
16. [16] J. Hartmanis, “On the state assignment problem for sequential machines 1,” IRE Trans. Electron. Comput., vol. EC-10, pp. 157–165, Jun. 1961.
17. [17] J. Hartmanis and R. E. Stearns, Algebraic Structure Theory of Sequential Machines. Prentice-Hall, 1966.
18. [18] F. Hill and G. Peterson, Introduction to Switching Theory and Logical Design. New York: Wiley, 1981.
19. [19] S. J. Hong, R. G. Cain and D. L. Ostapko, “MINI: A heuristic approach for logic minimization,” IBM J. Res. Develop., vol. 18, pp. 443–458, Sep. 1974.
20. [20] J. Hoperoft and J. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979.
21. [21] S. K. Hurst, “Multiple-valed logic- its status and its future,” IEEE Trans. Computer, vol. C-33, no 12, pp. 1160–1179, Dec. 1984.
22. [22] R. Karp, “Some techniques for state assignment for synchronous sequential machines,” IEEE Trans. Electron. Comput., vol. EC-13, pp. 507–518, Oct. 1964.
23. [23] Z. Kohavi, “Secondary state assignment for sequential machines,” IEEE Trans. Electron. Comput., pp. 193–203, Jun. 1964.
24. [24] C. McMullen, private communication.
25. [25] E. L. Post, “Introduction to a general theory of elementary propositions,” Amer. J. Math., vol. 43, pp. 163-185,1921.
26. [26] D. Rine, Computer Science and Multiple-Valued Logic. Amsterdam, The Netherlands: North Holland, 1977.
27. [27] R. Rudell, private communication.
28. [28] R. Rudell and A. Sangiovanni-Vincentelli, “ESPRESSO-MV: Algorithms for multi-valued logic minimization,” in Proc. Custom Int. Circ. Conf., Portland, OR, May 1985.
29. [29] R. Rudell, A Sangiovanni-Vincentelli, and G. De Micheli, “A FSM synthesis system,” in Proc. Int. Symp. Circ, and Syst., Kyoto, Japan, June 1985.
30. [30] G. Saucier, “State assignment of asynchronous sequential machines using graph techniques,” IEEE Trans. Comput., vol. C-21, pp. 282–288, 288, Mar. 1972.
31. [31] R. E. Stearns and J. Hartmanis, “On the state assignment problem for sequential machines 2,” IRE Trans. Electron. Comput., vol. EC-10, pp. 593–603, Dec. 1961.
32. [32] J. R. Story, H. J. Harrison, and E. A. Reinhard, “Optimum state assignment for synchronous sequential circuits,” IEEE Trans. Comput., put., vol. C-21, pp. 1365–1373, Dec. 1972.
33. [33] S. Y. H. Su and P. T. Cheung, “Computer minimization of multivalued valued switching functions,” IEEE Trans. Comput., vol. 21, pp. 995–1003, 1003, Dec. 1972.
34. [34] H. C. Torng, “An Algorithm for finding secondary assignments of synchronous sequential circuits,” IEEE Trans. Comput., vol. C-17, pp. 416–469, May 1968.
35. [35] J. H. Tracey, “Internal state assignment for asynchronous sequential machines,” IEEE Trans. Electron. Comput., vol. EC-15, pp. 551–560, Aug. 1966.
36. [36] P. Weiner and E. J. Smith, “Optimization of reduced dependencies for synchronous sequential machines,” IEEE Trans. Electron. Comput., put., vol. EC-16, pp. 835–847, Dec. 1967.