Explicit and implicit algorithms for binate covering problems

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

Volumn 16, Issue 7, 1997, Pages 677-691

  Villa, Tiziano ^a,b,c   Kam, Timothy ^a,b,c   Brayton, Robert K ^a,b,c   Sangiovanni Vincentelli, Alberto L ^a,b,c  

^a PARADES   (Italy)

^b INTEL CORPORATION   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK SYNTHESIS; MINIMIZATION OF SWITCHING NETS; PROBLEM SOLVING;

BINATE COVERING PROBLEMS; LOGIC SYNTHESIS;

COMPUTER AIDED LOGIC DESIGN;

EID: 0031177331     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.644030     Document Type: Article

References (44)

1. K. Brace, R. Rudell, and R. Bryant, "Efficient implementation of a BDD package," Proc. Design Automation Conf., June 1990, pp. 4015.
2. R. Brayton, A. Sangiovanni-Vincentelli, G. Hachtel, and R. Rudell, Multi-Level Logic Synthesis, unpublished book, 1992.
3. R. Brayton and F. Somenzi, "An exact minimizer for Boolean relations," Proc. Int. Conf. Computer-Aided Design, Nov. 1989, pp. 316-319.
4. R. Bryant, "Graph based algorithm for Boolean function manipulation," IEEE Trans. Comput., vol. C-35, pp. 667-691, Aug. 1986.
5. E. Cerny, "Characteristic functions in multivalued logic systems," Digital Processes, vol. 6, pp. 167-174, June 1980.
6. T. H. Cormen, C. E. Leiserson, and R. 1. Rivest, Introduction to Algorithms. MIT Press, McGraw-Hill, 1990.
7. O. Coudert, "Two-level logic minimization: An overview," Integration, vol. 17, pp. 97-140, Oct. 1994.
8. _, "On solving binate covering problems," Proc. Design Automation Conf., June 1996, pp. 197-202.
9. O. Coudert, C. Berthet, and J. C. Madre, "Verification of sequential machines using functional Boolean vectors," Proc. IFIP Int. Workshop, Applied Formal Methods for Correct VLSI Design, Nov. 1989.
10. O. Coudert and J. C. Madre, "Implicit and incremental computation of prime and essential prime implicants of Boolean functions," Proc. Design Automation Conf., June 1992, pp. 36-39.
11. _, "New ideas for solving covering problems," Proc. Design Automation Conf., June 1995, pp. 641-646
12. O. Coudert, J. C. Madre, and H. Fraisse, "A new viewpoint on two-level logic minimization," Proc. Design Automation Conf., June 1993, pp. 625-630.
13. O. Coudert, J. C. Madre, H. Fraisse, and H. Touati, "Implicit prime cover computation: An overview," Proc. SASIMI Conf., 1993, pp. 413122.
14. O. Coudert and C.-J. Shi, "Ze-Dicho: An exact solver for dichotomybased constrained encoding" Proc. Int. Conf. Comput. Design, 1996, pp. 42631
15. S. Devadas and R. Newton, "Exact algorithms for output encoding, state assignment and four-level Boolean minimization," IEEE Trans. Computer-Aided Design, vol. 10, pp. 13-27, Jan. 1991.
16. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.
17. J. Gimpel, "A reduction technique for prime implicant tables," IRE Trans. Electron. Comput., vol. EC-14, pp. 535-541, Aug. 1965.
18. A. Grasselli and F. Luccio, "A method for minimizing the number of internal states in incompletely specified sequential networks," IRE Trans. Electron. Comput., vol. EC-14, pp. 350-359, June 1965.
19. _, "Some covering problems in switching theory," Networks and Switching Theory. New York: Academic, 1968, pp. 536-557.
20. H. Higuchi and Y. Matsunaga, "Implicit prime compatible generation for minimizing incompletely specified finite state machines," Proc. Asia and South Pacific Design Automation Conf., Sept. 1995, pp. 229-234.
21. S.-W. Jeong and F. Somenzi, "A new algorithm for 0-1 programming based on binary decision diagrams," Proc. ISKIT-92, Int. Symp. Logic Synthesis and Microprocessor Architecture, lizuka, Japan, July 1992, pp. 177-184.
22. _, "A new algorithm for the binate covering problem and its application to the minimization of boolean relations," Proc. Int. Conf. Computer-Aided Design, Nov. 1992, pp. 417120.
23. T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli, "A fully implicit algorithm for exact state minimization," Tech. Rep. UCB/ERL M93/79, Nov. 1993.
24. _, "A fully implicit algorithm for exact state minimization," Proc. Design Automation Conf., June 1994, pp. 684-690.
25. _, "Implicit state minimization of nondeterministic FSM's," Proc. Int. Conf. Computer Design, Oct. 1995, pp. 250-257.
26. _, Synthesis of FSMs: Functional Optimization. Boston, MA: Kluwer Academic, 1996.
27. Y.-T. Lai, M. Pedram, and S. B. K. Vrudhula, "FGILP: An integer linear program solver based on function graphs," Proc. Int. Conf. Computer-Aided Design, Nov. 1993, pp. 685-689.
28. _, "EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition," IEEE Trans. Computer-Aided Design, vol. CAD-13, pp. 959-975, Aug. 1994.
29. L. Lavagno, "Heuristic and exact methods for binate covering," EE2901s Rep., May 1989.
30. B. Lin, O. Coudert, and J. C. Madre, "Symbolic prime generation for multiple-valued functions," Proc. Design Automation Conf., June 1992, pp. 40-44.
31. B. Lin and F. Somenzi, "Minimization of symbolic relations," Proc. Int. Conf. Computer-Aided Design, Nov. 1990, pp. 88-91.
32. _, "Minimization of symbolic relations," Proc. Int. Conf. Computer-Aided Design, Nov. 1990.
33. E. McCluskey, "Minimization of Boolean functions," Bell Lab. Tech. J., vol. 35, pp. 1417-1444, Nov. 1956.
34. S. Minato, Binary Decision Diagrams and Applications for VLSI CAD. Boston, MA: Kluwer Academic, 1996.
35. A. L. Oliveira and S. A. Edwards, "Inference of state machines from examples of behavior," UCB/ERL Tech. Rep. M95/12, Berkeley, CA, 1995
36. J.-K. Rho and F. Somenzi, "Stamina," computer program, 1991.
37. S. Robinson, III and R. House, "Gimpel's reduction technique extended to the covering problem with costs," IRE Trans. Electron. Comput., vol. EC-16, pp. 509-514, Aug. 1967.
38. R. Rudell, "Espresso," computer program, 1987.
39. _, "Logic synthesis for VLSI design," Ph.D. dissertation, Univ. California, Berkeley, Apr. 1989; Tech. Rep. UCB/ERL M89/49.
40. A. Saldanha, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli, "A uniform framework for satisfying input and output encoding con-straints," Proc. Design Automation Conf., June 1991, pp. 170-175.
41. F. Somenzi, "Cookie," computer program, 1989.
42. G. Swamy, R. Brayton, and P. McGeer, "A fully implicit QuineMcCluskey procedure using BDD's," Tech. Rep. UCB/ERL M92/127, 1992
43. H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Implicit state enumeration of finite state machines using BDD's," Proc. Int. Conf. Computer-Aided Design, Nov. 1990, pp. 130-133.
44. T. Villa, T. Kam, R. Brayton, and A. Sangiovanni-Vincentelli, Synthesis of FSMs: Logic Optimization. Boston, MA: Kluwer Academic, 1997.