Optimizing Interacting Finite State Machines Using Sequential Don’t Cares

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

Volumn 10, Issue 12, 1991, Pages 1473-1484

  Devadas, Srinivas ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY--FINITE AUTOMATA; OPTIMIZATION--APPLICATIONS; SWITCHING THEORY--SEQUENTIAL SWITCHING;

FINITE STATE MACHINES (FSM); OPTIMIZATION ALGORITHMS;

LOGIC CIRCUITS;

EID: 0026403450     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.103497     Document Type: Article

References (15)

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. R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, “MIS: A multiple-level logic optimization system,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 1062-1081, Nov. 1987.
3. S. Devadas, H-K. T. Ma, A. R. Newton, and A. Sangiovanni-Vincentelli, “MUSTANG: State assignment of finite state machines targeting multi-level logic implementations,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 1290-1300, Dec. 1988.
4. S. Devadas and A. R. Newton, “Decomposition and factorization of sequential finite state machines,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 1206-1217, Nov. 1989.
5. G. Hachtel and F. Somenzi, personal communication, 1990.
6. J. Hartmanis and R. E. Stearns, Algebraic Structure Theory of Sequential Machines. Englewood Cliffs, NJ: Prentice-Hall, 1966.
7. F. C. Hennie, Finite State Models for Logical Machines, in New York: Wiley, 1968.
8. J. Kim and M. M. Newborn, “The simplification of sequential machines with input restrictions,” IEEE Trans. Comput., vol. C-20, pp. 1440-1443, Dec. 1972.
9. C. E. Leiserson, F. M. Rose, and J. B. Saxe, “Optimizing synchronous circuitry by retiming,” in Proc. 3rd CalTech Conf. VLSI, Mar. 1983.
10. G. De Micheli, “Symbolic design of combinational and sequential logic circuits implemented by two-level macros,” IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 597-616, Sept. 1986.
11. G. De Micheli, R. K. Brayton, and A. Sangiovanni-Vincentelli, “Optimal state assignment of finite state machines,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 269-285, July 1985.
12. M. C. Paull and S. H. Unger, “Minimizing the number of states in incompletely specified sequential circuits,” IRE Trans. Electron. Comput., vol. EC-8, pp. 356-357, Sept. 1959.
13. S. H. Unger, Asynchronous Sequential Switching Theory. New York: Wiley, 1969.
14. M. Yoeli, “The cascade decomposition of sequential machines,” IRE Trans. Electron. Comput., vol. EC-10, pp. 587-592, Apr. 1961.
15. H. P. Zeiger, “Loop-free synthesis of finite-state machines,” Ph.D. thesis, Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, MA, Sept. 1964.