Advanced BDD optimization

Advanced BDD Optimization

Volumn , Issue , 2005, Pages 1-222

  Ebendt, Rüdiger ^a   Fey, Görschwin ^a   Drechsler, Rolf ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84885808321     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/b107399     Document Type: Book

References (108)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. S.B. Akers. Binary decision diagrams. IEEE Trans. on Comp., 27:509-516, 1978.
3. S.B. Akers. Functional testing with binary decision diagrams. In Eighth Annual Conference on Fault-Tolerant Computing, pages 75-82, 1978.
4. P. Ashar and S. Malik. Fast functional simulation using branching programs. In Int'l Conf. on CAD, pages 408-412, 1995.
5. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1579 of Lecture Notes in Computer Science. Springer Verlag, 1999.
6. B. Becker. Synthesis for testability: Binary decision diagrams. In Symp. on Theoretical Aspects of Comp. Science, volume 577 of LL-NCS, pages 501-512. Springer Verlag, 1992.
7. B. Becker. Testing with decision diagrams. INTEGRATION, the VLSI Jour., 26:5-20, 1998. (Pubitemid 128409231)
8. F. Brglez and H. Fujiwara. A neutral netlist of 10 combinational circuits and a target translator in fortran. In Int'l Symp. Circ. and Systems, Special Sess. on ATPG and Fault Simulation, pages 663-698, 1985.
9. B. Bollig, M. Löbbing, and I. Wegener. Simulated annealing to improve variable orderings for OBDDs. In Int'l Workshop on Logic Synth., pages 5b:5.1-5.10, 1995.
10. B. Bollig, M. Löbbing, and I. Wegener. On the effect of local changes in the variable ordering of ordered decision diagrams. Information Processing Letters, 59:233-239, 1996. (Pubitemid 126392865)
11. L. Benini, E. Macii, and M. Poncino. Telescopic units: Increasing the average throughput of pipelined designs by adaptive latency control. In Design Automation Conf., pages 22-27, 1997.
12. P. Buch, A. Narayan, A. Newton, and A. Sangiovanni-Vincentelli. Logic synthesis for large pass transistor circuits. In Int'l Conf. on CAD, pages 663-670, 1997.
13. K. Brace, R. Rudell, and R.E. Bryant. Efficient implementation of a BDD package. In Design Automation Conf., pages 40-45, 1990. (Pubitemid 21676648)
14. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 35(8):677-691, 1986.
15. R. E. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. on Comp., 40:205-213, 1991.
16. J.R. Burch and V. Singhal. Tight integration of combinational verification methods. In Int'l Conf. on CAD, pages 570-576, 1998.
17. B. Bollig and I. Wegener. Improving the variable ordering of OBDDs in NP-complete. IEEE Trans. on Comp., 45(9):993-1002, 1996. (Pubitemid 126768781)
18. E. Cerny and J. Gecsei. Simulation of mos circuits by decision diagrams. IEEE Trans. on CAD, CAD-4(4):685-693, 1985. (Pubitemid 16524992)
19. R. Chaudhry, T.-H. Liu, A. Aziz, and J.L. Burns. Area-oriented synthesis for pass-transistor logic. In Int'l Conf. on Comp. Design, pages 160-167, 1998.
20. G. Cabodi, S. Nocco, and S. Quer. SAT-based bounded model checking by means of BDD-based approximate traversals. In Design, Automation and Test in Europe, pages 898-903, 2003.
21. Collaborative Benchmarking Laboratory. 1993 LGSynth Benchmarks. North Carolina State University, Department of Computer Science, 1993.
22. R. Drechsler and B. Becker. Binary Decision Diagrams-Theory and Implementation. Kluwer Academic Publishers, 1998.
23. R. Drechsler, N. Drechsler, and W. Günther. Fast exact minimization of BDDs. IEEE Trans. on CAD, 19(3):384-389, 2000.
24. R. Drechsler and N. Göckel. Minimization of BDDs by evolutionary algorithms. In Int'l Workshop on Logic Synth., 1997.
25. R. Drechsler and W. Günther. Towards One-Pass Synthesis. Kluwer Academic Publishers, 2002.
26. R. Drechsler, N. Göckel, and B. Becker. Parallel Problem Solving from Nature, volume 577 of LNCS, chapter Learning heuristics for OBDD minimization by evolutionary algorithms, pages 730-739. Springer Verlag, 1996.
27. R. Drechsler, W. Günther, and F. Somenzi. Using lower bounds during dynamic BDD minimization. IEEE Trans. on CAD, 20(1):51-57, 2001. (Pubitemid 32296863)
28. M. Davis, G. Logeman, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
29. E.V. Dubrova and D.M. Miller. On disjoint covers and ROBDD size. In Pacific Rim Conference on Communications, Computers and Signal Processing, pages 162-164, 1999. (Pubitemid 30547474)
30. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:506-521, 1960.
31. #. Journal of the Association for Computing Machinery, 34(1):1-38, 1987.
32. R. Drechsler, J. Shi, and G. Fey. Synthesis of fully testable circuits from BDDs. IEEE Trans. on CAD, 23(3):440-443, 2004.
33. R. Ebendt. Reducing the number of variable movements in exact BDD minimization. In Int'l Symp. on Circuits and Systems, volume 5, pages 605-608, 2003.
34. R. Ebendt and R. Drechsler. Lower bounds for dynamic BDD reordering. In Asia and South Pacific Design Automation Conf., pages 579-582, 2005.
35. R. Ebendt, W. Günther, and R. Drechsler. Combination of lower bounds in exact BDD minimization. In Design, Automation and Test in Europe, pages 758-763, 2003.
36. R. Ebendt, W. Günther, and R. Drechsler. An improved branch and bound algorithm for exact BDD minimization. IEEE Trans. on CAD, 22(12):1657-1663, 2003.
37. R. Ebendt, W. Günther, and R. Drechsler. Combining ordered bestfirst search with branch and bound for exact BDD minimization. In Asian and South Pacific Design Automation Conf., pages 876-879, 2004.
38. R. Ebendt, W. Günther, and R. Drechsler. Minimization of the expected path length in BDDs based on local changes. In Asian and South Pacific Design Automation Conf., pages 866-871, 2004.
39. R. Ebendt, W. Günther, and R. Drechsler. Combining ordered-best first search with branch and bound for exact BDD minimization. IEEE Trans. on CAD, 2005.
40. B.J. Falkowski. Calculation of Rademacher-Walsh spectral coefficients for systems of completely and incompletely specified boolean functions. In IEEE Proceedings on Circuits, pages 1698-1701, 1993.
41. B.J. Falkowski and C.-H. Chang. Paired Haar spectra computation through operations on disjoint cubes. In IEEE Proceedings on Circuits, Devices and Systems, pages 117-123, 1999.
42. G. Fey and R. Drechsler. Minimizing the number of paths in BDDs. In 15th Symp. on Integrated Circuits and System Design, pages 359-364, 2002.
43. G. Fey and R. Drechsler. Utilizing BDDs for disjoint SOP minimization. In 45th IEEE International Midwest Symp. on Circuits and Systems, pages 306-309, 2002.
44. M. Fujita, Y. Matsunaga, and T. Kakuda. On variable ordering of binary decision diagrams for the application of multilevel synthesis. In European Conf. on Design Automation, pages 50-54, 1991. (Pubitemid 23584321)
45. F. Ferrandi, A. Macii, E. Macii, M. Poncino, R. Scarsi, and F. Somenzi. Symbolic algorithms for layout-oriented synthesis of pass transistor logic circuits. In Int'l Conf. on CAD, pages 235-241, 1998.
46. H. Fujii, G. Ootomo, and C. Hori. Interleaving based variable ordering methods for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 38-41, 1993.
47. S.J. Friedman and K.J. Supowit. Finding the optimal variable ordering for binary decision diagrams. IEEE Trans. on Comp., 39(5):710-713, 1990.
48. B.J. Falkowski, I. Schäfer, and C.-H. Chang. An effective computer algorithm for the calculation of disjoint cube representation of boolean functions. In Midwest Symposium on Circuits and Systems, pages 1308-1311, 1993.
49. G. Fey, J. Shi, and R. Drechsler. BDD circuit optimization for path delay fault testability. In EUROMICRO Symp. on Digital System Design 2004, pages 162-172, 2004.
50. W. Günther and R. Drechsler. Improving EAs for sequencing problems. In Genetic and Evolutionary Computation Conf., pages 175-180, 2000.
51. A. Gupta, M. Ganai, C. Wang, Z. Yang, and P. Ashar. Abstraction and BDDs complement SAT-based BMC in DiVer. In International Conference on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 206-209. Springer-Verlag, 2003.
52. E. Goldberg and Y. Novikov. BerkMin: a fast and robust SAT-solver. In Design, Automation and Test in Europe, pages 142-149, 2002.
53. P. Goel. An implicit enumeration algorithm to generate test for combinational logic. IEEE Trans. on Comp., 30:215-222, 1981. (Pubitemid 11487994)
54. A. Gupta, Z. Yang, P. Ashar, L. Zhang, and S. Malik. Partition-based decision heuristics for image computation using SAT and BDDs. In Int'l Conf. on CAD, pages 286-292, 2001. (Pubitemid 33148972)
55. P.E. Hart, N.J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern., 2:100-107, 1968.
56. Y. Iguchi, T. Sasao, and M. Matsuura. Evaluation of multiple-output logic functions using decision diagrams. In Asian South Pacific Design Automation Conf., pages 312-315, 2003.
57. N. Ishiura, H. Sawada, and S. Yajima. Minimization of binary decision diagrams based on exchange of variables. In Int'l Conf. on CAD, pages 472-475, 1991.
58. Y.-M. Jiang, A. Krstic, K.-T. Cheng, and M. Marek-Sadowska. Postlayout logic restructuring for performance optimization. In Design Automation Conf., pages 662-665, 1997.
59. S.-W. Jeong, T.-S. Kim, and F. Somenzi. An efficient method for optimal BDD ordering computation. In Int'l Conf. on VLSI and CAD, 1993.
60. Y. Jiang, S. Matic, and R.K. Brayton. Generalized cofactoring for logic function evaluation. In Design Automation Conf., pages 155-158, 2003.
61. K. Karplus. Representing boolean functions with if-then-else dags. Computer Engineering UCSC-CRL-88-28, 1988.
62. V. Kumar, K. Ramesh, and V.N. Rao. Parallel best-first search of state-space graphs: A summary of results. In National Conf. on Artificial Intelligence, pages 122-127, 1988.
63. K. Kuroda and T. Sakurai. Overview of low-power ulsi circuit techniques. IEICE Trans. on Information and Systems, E78-C(4):334-343, 1995.
64. T. H. Liu, A. Aziz, and J.L. Burns. Performance driven synthesis for pass-transistor logic. In Int'l Workshop on Logic Synth., pages 255-259, 1998.
65. T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Trans. on CAD, 11:4-15, 1992.
66. C.Y. Lee. Representation of switching circuits by binary decision diagrams. Bell System Technical Jour., 38:985-999, 1959.
67. Y. Luo, T. Wongsonegoro, and A. Aziz. Hybrid techniques for fast functional simulation. In Design Automation Conf., pages 664-667, 1998.
68. Y. Y. Liu, K. H. Wang, T. T. Hwang, and C. L. Liu. Binary decision diagram with minimum expected path length. In Design, Automation and Test in Europe, pages 708-712, 2001.
69. A. Martelli. On the complexity of admissable search algorithms. Artificial Intelligence, 23:1-13, 1977.
70. J.-C. Madre and J.-P. Billon. Proving circuit correctness using formal comparison between expected and extracted behavior. In Design Automation Conf., pages 205-210, 1988.
71. L. Macchiarulo, L. Benini, and E. Macii. On-the-fly layout generation for PTL macrocells. In Design, Automation and Test in Europe, pages 546-551, 2001.
72. R. Murgai, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. Logic Synthesis for Field-Programmable Gate Arrays. Kluwer Academic Publishers, 1995.
73. S. Minato. Binary Decision Diagrams and applications for VLSI CAD. Kluwer Academic Publisher, 1996.
74. S. Minato, N. Ishiura, and S. Yajima. Shared binary decision diagram with attributed edges for efficient function manipulation. In Design Automation Conf., pages 52-57, 1990. (Pubitemid 21676646)
75. P.C. McGeer, K.L. McMillan, A. Saldanha, A.L. Sangiovanni-Vincentelli, and P. Scaglia. Fast discrete function evaluation using decision diagrams. In Int'l Conf. on CAD, pages 402-407, 1995.
76. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conf., pages 530-535, 2001. (Pubitemid 32841010)
77. L. Mérõ. A heuristic search algorithm with modifiable estimate. Artificial Intelligence, 23:13-27, 1984.
78. A. Mishchenko and M. Perkowski. Fast heuristic minimization of exclusive-sums-of-products. In Int'l Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pages 242-250, 2001.
79. C. Meinel and A. Slobodová. Speeding up variable reordering of OBDD. In Int'l Conf. on Comp. Design, pages 338-343, 1997.
80. J.P. Marques-Silva. An overview of backtrack search satisfiability algorithms. In International Symposium on AI and Mathematics, 1998.
81. J.P. Marques-Silva and T. Glass. Combinational equivalence checking using boolean satisfiability and recursive learning. In Design, Automation and Testin Europe, pages 145-149, 1999.
82. A. Mukherjee, R. Sudhakar, M. Marek-Sadowska, and S. Long. Wave steering in YADDs: a novel, non-iterative synthesis and layout technique. In Design Automation Conf., pages 466-471, 1999.
83. J.P. Marques-Silva and K.A. Sakallah. GRASP-a new search algorithm for satisfiability. In Int'l Conf. on CAD, pages 220-227, 1996.
84. N. Nilsson. Principles of Artificial Intelligence. Tioga Publishing Company, Palo Alto, CA, 1980.
85. S. Nagayama, A. Mishchenko, T. Sasao, and J. Butler. Minimization of average path length in BDDs by variable reordering. In Proc. of International Workshop on Logic and Synthesis, 2003.
86. M. Prasad, P. Chong, and K. Keutzer. Why is ATPG easy? In Design Automation Conf., pages 22-28, 1999.
87. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1984.
88. V. Paruthi and A. Kuehlmann. Equivalence checking combining a structural SAT-solver, BDDs, and simulation. In Int'l Conf. on Comp. Design, pages 459-464, 2000.
89. S. Panda and F. Somenzi. Who are the variables in your neighbourhood. In Int'l Conf. on CAD, pages 74-77, 1995.
90. S. Reda, R. Drechsler, and A. Orailoglu. On the relation between SAT and BDDs for equivalence checking. In Int'l Symp. on Quality of Electronic Design, pages 394-399, 2002.
91. E. Rich. Artificial Intelligence. McGraw-Hill, 1988.
92. K. Ravi, K.L. McMillan, T.R. Shiple, and F. Somenzi. Approximation and decomposition of binary decision diagrams. In Design Automation Conf., pages 445-450, 1998.
93. K. Ravi and F. Somenzi. High-density reachability analysis. In Int'l Conf. on CAD, pages 154-158, 1995.
94. S. Reda and A. Salem. Combinational equivalence checking using binary decision diagrams and Boolean satisfiability. In Design, Automation and Test in Europe, pages 122-126, 2001.
95. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42-47, 1993.
96. T. Sasao. EXMIN2: A simplification algorithm for Exclusive-OR-Sum-of products expressions for multiple-valued-input two-valued-output functions. IEEE Trans. on CAD, 12:621-632, 1993. (Pubitemid 23700440)
97. C. Scholl and B. Becker. On the generation of multiplexer circuits for pass transistor logic. In Design, Automation and Test in Europe, pages 372-378, 2000.
98. P. R. Stephan, R. K. Brayton, and A. Sangiovanni-Vincentelli. Combinational test generation using satisfiability. Technical Report UCB/ERL M92/112, Dept. of EECS, Univ. of California, Berkeley, October 1992.
99. C. Scholl, R. Drechsler, and B. Becker. Functional simulation using binary decision diagrams. In Int'l Conf. on CAD, pages 8-12, 1997.
100. C.E. Shannon. A symbolic analysis of relay and switching circuits. Trans. AIEE, 57:713-723, 1938.
101. A. Slobodová and C. Meinel. Sample method for minimization of OBDD. In Int'l Workshop on Logic Synth., pages 311-316, 1998.
102. F. Somenzi. Efficient manipulation of decision diagrams. Software Tools for Technology Transfer, 3(2):171-181, 2001.
103. F. Somenzi. CU Decision Diagram Package Release 2.3.1. University of Colorado at Boulder, 2002.
104. L. Shivakumaraiah and M. Thornton. Computation of disjoint cube representations using a maximal binate variable heuristic. In Southeastern Symposium on System Theory, pages 417-421, 2002.
105. M. Thornton, R. Drechsler, and D.M. Miller. Spectral Techniques in VLSI CAD. Kluwer Academic Publisher, 2001.
106. C. Yang and M.J. Ciesielski. BDS: a BDD-based logic optimization system. IEEE Trans. on CAD, 21(7):866-876, 2002. (Pubitemid 34916038)
107. K. Yano, Y. Sasaki, K. Rikino, and K. Seki. Top-down pass transistor logic design. IEEE Jour. of Solid-State Circ., 31(6):792-803, 1996. (Pubitemid 126543793)
108. H. Zhou and A. Aziz. Buffer minimization in pass transistor logic. IEEE Trans. on CAD, 20(5):693-697, 2001. (Pubitemid 32518581)