Fast exact minimization of BDD's

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

Volumn 19, Issue 3, 2000, Pages 384-389

  Drechsler, Rolf ^a   Drechsler, Nicole ^a   Günther, Wolfgang ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADDERS; ALGORITHMS; BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; SET THEORY; VLSI CIRCUITS;

BINARY DECISION DIAGRAMS; EXACT MINIMIZATION; LOWER BOUND TECHNIQUE;

INTEGRATED CIRCUIT LAYOUT;

EID: 0034156689     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.833206     Document Type: Article

References (16)

1. P. Ashar, S. Devadas, and K. Keutzer, "Path-delay-fault testability properties of multiplexor-based networks," INTEGRATION, the VLSIJ.. vol. 15, no. l,pp. 1-23, 1993.
2. B. Becker, "Synthesis for testability: Binary decision diagrams," in STACS, volume 577ofLNCS. Berlin, Germany: Springer-Verlag, Feb. 1992, pp. 501-512.
3. V. Bertacco, S. Minato, P. Verplaetse, L. Benini, and G. De Micheli, "Decision diagrams and pass transistor logic synthesis," in Proc. Int. Workshop Logic Synth., June 1997.
4. B. Bollig and I. Wegener, "Improving the variable ordering of OBDD's is NP-complete," IEEE Trans. CompuL. vol. 45, pp. 993-1002, Sept. 1996.
5. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Comput.. vol. C-35, pp. 677-691, Aug. 1986.
6. R. E. Bryant, "On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication," IEEE Trans. CompuL. vol. 40, pp. 205-213, Feb. 1991.
7. P. Buch, A. Narayan, A. R. Newton, and A. L. Sangiovanni-Vincentelli, "Logic synthesis for large pass transistor circuits," in Proc. Int. Conf. Computer-Aided Design, Nov. 1997, pp. 663-670.
8. S. J. Friedman and K. J. Supowit, "Finding the optimal variable ordering for binary decision diagrams," in Proc. Design Automation Conf., June 1987, pp. 348-356.
9. N. Ishiura, H. Sawada, and S. Yajima, "Minimization of binary decision diagrams based on exchange of variables," in Proc. Int. Conf.ComputerAided Design, Nov. 1991, pp. 472-175.
10. S.-W. Jeong, T.-S. Kim, and F. Somenzi, "An efficient method for optimal BDD ordering computation," in Proc. Int. Conf. VLSI and CAD, 1993.
11. L. Lavagno, P. McGeer, A. Saldanha, and A. L. Sangiovanni-Vincentelli, "Timed shannon circuits: A power-efficient design style and synthesis tool.," in Proc. Design Automation Conf., June 1995, pp. 254-260.
12. D. Möller, P. Molitor, and R. Drechsler, "Symmetry based variable ordering for ROBDDs," in Proc. IFIP Workshop Logic and Architecture Synthesis, Grenoble, France, Dec. 1994, pp. 47-53.
13. S. Panda, F. Somenzi, and B. F. Plessier, "Symmetry detection and dynamic variaable ordering of decision diagrams," in Proc. Int. Conf. Computer-Aided Design, Nov. 1994, pp. 628-631.
14. D. Sieling, "Variable orderings and the size of OBDD's for partially symmetric Boolean functions," in SASIMI, 1996, pp. 189-196.
15. F Somenzi, CUDD: CU Decision Diagram Package Relase 2.1.2, Univ. Colorado, Boulder, 1997.
16. K. Yano, Y. Sasaki, K. Rikino, and K. Seki, "Top-down pass-transistor logic design," IEEE J. Solid-State Circuits, vol. 31, pp. 792-803, June 1996.