Don't Care Sequences and the Optimization of Interacting Finite State Machines

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

Volumn 13, Issue 7, 1994, Pages 865-874

  Rho, June Kyung ^a   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CASCADE CONNECTIONS; COMBINATORIAL CIRCUITS; COMPUTER SOFTWARE; CONTROLLABILITY; DELAY CIRCUITS; ELECTRIC NETWORK ANALYSIS; HIERARCHICAL SYSTEMS; OBSERVABILITY; OPTIMIZATION; SEQUENTIAL CIRCUITS;

DONT CARE SEQUENCE; FINITE STATE MACHINES; INFORMATION LOSSYNESS;

FINITE AUTOMATA;

EID: 0028461389     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.293943     Document Type: Article

References (25)

1. E. J. McCloskey, Jr., “Minimization of boolean functions,” Bell Syst. Tech. J., vol. 35, pp. 1417–1444, Nov. 1956.
2. K. A. Bartlett, R. Brayton, G. Hachtel, R. Jacoby, C. Morrison, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, “Multilevel logic minimization using implicit don't cares,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 723–740, June 1988.
3. R. K. Brayton and F. Somenzi, “An exact minimizer for boolean relations,” in Proc. IEEE Int. Conf. on Computer Aided Design, Nov. 1989, Santa Clara, CA, pp. 316–319.
4. B. Lin and F. Somenzi, “Minimization of symbolic relations,” in Proc. IEEE Int. Conf. on Computer Aided Design, Nov. 1990, Santa Clara, CA, pp. 88–91.
5. S. Muroga, Y. Kambayashi, H. C. Lai, and J. N. Culliney, “The transduction method—design of logic networks based on permissible functions,” IEEE Trans. Comput., vol. 38, pp. 1404–1424, Oct. 1989.
6. F. C. Hennie, Finite-State Models for Logical Machines. New York: John Wiley, 1968.
7. M. Damiani and G. D. Micheli, “Synchronous logic synthesis: Circuit specifications and optimization algorithms,” in Proc. IEEE Int. Symposium on Circuits and Systems, May 1990, New Orleans, LA, pp. 2566–2570.
8. S. Malik, E. M. Sentovich, R. K. Brayton, and A. Sangiovanni-Vincentelli, Vincentelli, “Retiming and resynthesis: Optimizing sequential networks with combinational techniques,” IEEE Trans. Computer-Aided Design, vol. 10, pp. 74–84, Jan. 1991.
9. G. D. Micheli, “Synchronous logic synthesis: Algorithms for cycle-time minimization,” IEEE Trans. Computer-Aided Design, vol. 10, pp. 63–73, Jan. 1991.
10. L. Trevillyan, W. Joyner, and L. Berman, “Global flow analysis in automatic logic design,” IEEE Trans. Comput., vol. 35, pp. 77–81, Jan. 1986.
11. R. Brayton, E. Sentovich, and F. Somenzi, “Don’t-cares and global flow analysis of boolean networks,” in Proc. IEEE Int. Conf. on Computer Aided Design, Nov. 1988, Santa Clara, CA, pp. 98–101.
12. E. Cerny and M. A. Marin, “An approach to unified methodology of combinational switching circuits,” IEEE Trans. Comput., vol. 26, pp. 745–756, Aug. 1977.
13. E. J. McCluskey, “Minimum state sequential circuits for a restricted class of incompletely specified flow tables,” Bell Syst. Tech. J., vol. 41, pp. 1759–1768, Dec. 1962.
14. S. H. Unger, “Flow table simplification—some useful aids,” IEEE Trans. Electron. Comput., vol. 14, pp. 472–475, June 1965.
15. S. H. Unger, Asynchronous Sequential Switching Circuits. New York: John Wiley, 1969.
16. S. Devadas, “Approaches to Multilevel sequential logic synthesis,” in Proc. 26th Design Autmation Conf., June 1989, Las Vegas, NV, pp. 270–276.
17. S. Devadas, H. K. T. Ma, and A. R. Newton, “Redundancies and don't cares in sequential log i c synthesis,” in Proc. Int. Test Conf., (Washington, DC), pp. 491–500, Aug. 1989.
18. J. Kim and M. M. Newborn, “The simplification of sequential machines with input restrictions,” IEEE Trans. Comput., vol. 21, pp. 1440–1443, Dec. 1972.
19. S. Yang, “Logic synthesis and optimization benchmarks user guide version 3.0,” Tech. Rep., Microelectronics Center of North Carolina, Research Triangle Park, NC, Jan. 1991.
20. X. Du, G. D. Hachtel, B. Lin, and A. R. Newton, “MUSE: A MUltilevel level Symbolic Encoding algorithm for state assignment,” IEEE Trans. Computer-Aided Design, vol. 10, pp. 28–38, Jan. 1991.
21. R. K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. R. Wang, “MIS: A multiple-level interactive logic optimization system,” IEEE Trans. Computer-Aided Design, vol. 6, pp. 1062–1081, Nov. 1987.
22. W. Wolf, “An algorithm for nearly-minimal collapsing of finite-state machine networks,” in Proc. IEEE Int. Conf. on Computer Aided Design, Nov. 1990, Santa Clara, CA, pp. 80–83.
23. G. D. Hachtel, J.K. Rho, F. Somenzi, and R. Jacoby, “Exact and heuristic algorithms for the minimization of incompletely specified state machines,” in Proc. European Design Automation Conf., Feb. 1991, Amsterdam, The Netherlands, pp. 184–191.
24. R. E. Bryant, “Graph-based algorithms for boolean function manipulation,” IEEE Trans. Comput., vol. 35, pp. 677–691, Aug. 1986.
25. K. S. Brace, R. L. Rudell, and R. E. Bryant, “Efficient implementation of a BDD package,” in Proc. 27th Design Automation Conf. pp. 40–45, June 1990.