Bdd minimization using symmetries

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

Volumn 18, Issue 2, 1999, Pages 81-100

  Scholl, Christoph ^a   Möller, Dirk ^b   Molitor, Paul ^c   Drechsler, Rolf ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

^b BNeD GmbH   (Germany)

^c MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Binary decision trees (BDD); Incompletely specified functions; Sifting; Symmetry; Symmetry detection

Indexed keywords

BINARY CODES; BOOLEAN FUNCTIONS; DECISION THEORY; OPTIMIZATION; STATISTICAL METHODS; TREES (MATHEMATICS);

DYNAMIC VARIABLE ORDERING; INCOMPLETE SPECIFIED FUNCTIONS; PARTIAL SYMMETRIES; REDUCED ORDER BINARY DECISION DIAGRAMS (ROBDD); SYMMETRY DETECTION;

COMPUTER AIDED LOGIC DESIGN;

EID: 0033078737     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.743706     Document Type: Article

References (50)

1. S. B. Akers, “Binary decision diagrams,” IEEE Trans. Comput., vol. C-27, pp. 509-516, 1978.
2. B. Bollig, M. Löbbing, and I. Wegener, “Simulated annealing to improve variable orderings for OBDD’s,” in Int. Workshop on Logic Synthesis, May 1995, pp. 5b:5.1-5.10.
3. K. S. Brace, R. L. Rudell, and R. E. Bryant, “Efficient implementation of a BDD package,” in Proc. Design Automation Conf., June 1990, pp. 40-45.
4. D. Brélaz, “New methods to color vertices of a graph,” Commun. ACM, vol. 22, pp. 251-256, 1979.
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, “Symbolic Boolean manipulation with ordered binary decision diagrams,” ACM, Comp. Surveys, vol. 24, pp. 293-318, 1992.
7. P. Buch, A. Narayan, A. R. Newton, and A. L. Sangiovanni-Vincentelli, “Logic synthesis for large pass transistor circuits,” in Proc. Int. Conf. CAD, Nov. 1997, pp. 663-670.
8. S. Chang, D. Cheng, and M. Marek-Sadowska, “Minimizing ROBDD size of incompletely specified multiple output functions,” in Proc. European Design & Test Conf., Mar. 1994, pp. 620-624.
9. D. I. Cheng and M. Marek-Sadowska, “Verifying equivalence of functions with unknown input correspondence,” in Proc. European Conf. on Design Automation, Feb. 1993, pp. 81-85.
10. O. Coudert, C. Berthet, and J. C. Madre, “Verification of sequential machines based on symbolic execution,” in Proc. Automatic Verification Methods for Finite State Systems, LNCS 407, 1989, pp. 365-373.
11. O. Coudert, C. Berthet, and J. C. Madre, “Verification of sequential machines using Boolean functional vectors,” in Proc. IFIP Int. Workshop on Applied Formal Methods for Correct VLSI Design, 1989, pp. 111-128.
12. D. L. Dietmeyer and P. R. Schneider, “Identification of symmetry, redundancy and equivalence of Boolean functions,” IEEE Trans. Electron. Comput., vol. EC-16, pp. 804-817, 1967.
13. R. Drechsler and B. Becker, “Sympathy: Fast exact minimization of fixed polarity reed-muller expressions for symmetric functions,” in Proc. European Design & Test Conf., Mar. 1995, pp. 91-97.
14. R. Drechsler, B. Becker, and N. Göckel, “A genetic algorithm for variable ordering of OBDD’s,” in Int. Workshop on Logic Synthesis, May 1995, pp. 5c:5.55-5.64.
15. R. Drechsler and N. Göckel, “Minimization of BDD’s by evolutionary algorithms,” presented at Int. Workshop on Logic Synthesis, May 1997.
16. C. R. Edwards and S. L. Hurst, “A digital synthesis procedure under function symmetries and mapping methods,” IEEE Trans. Comput., vol. C-27, pp. 985-997, 1978.
17. E. Felt, G. York, R. Brayton, and A. Sangiovanni-Vincentelli, “Dynamic variable reordering for BDD minimization,” in Proc. European Design Automation Conf., Sept. 1993, pp. 130-135.
18. 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 Proc. Int. Conf. CAD, Nov. 1998, pp. 235-241.
19. H. Fujii, G. Ootomo, and C. Hori, “Interleaving based variable ordering methods for ordered binary decision diagrams,” in Proc. Int. Conf. CAD, Nov. 1993, pp. 38-41.
20. M. Fujita, H. Fujisawa, and N. Kawato, “Evaluation and improvements of Boolean comparison method based on binary decision diagrams,” in Proc. Int. Conf. CAD, Nov. 1988, pp. 2-5.
21. M. Fujita, Y. Matsunaga, and T. Kakuda, “On variable ordering of binary decision diagrams for the application of multi-level synthesis,” in Proc. European Conf. Design Automation, Feb. 1991, pp. 50-54.
22. M. R. Garey and D. S. Johnson, Computers and Intractability—A Guide to NP-Completeness. San Francisco: Freemann, 1979.
23. J. Gergov and C. Meinel, “Analysis and manipulation of Boolean functions in terms of decision graphs,” in WG’92, LNCS, pp. 310-320, 1992.
24. M. Heap, “On the exact ordered binary decision diagram size of totally symmetric functions,” J. Electron. Testing: Theory and Applicat., vol. 4, pp. 191-195, 1993.
25. S. L. Hurst, “Detection of symmetries in combinatorial functions by spectral means,” IEE Electron. Circuits Syst., vol. 5, pp. 173-180, 1977.
26. N. Ishiura, H. Sawada, and S. Yajima, “Minimization of binary decision diagrams based on exchange of variables,” in Proc. Int. Conf. CAD, Nov. 1991, pp. 472-475.
27. B.-G. Kim and D. L. Dietmeyer, “Multilevel logic synthesis of symmetric switching functions,” IEEE Trans. Computer-Aided Design, vol. 10, no. 4, 1991.
28. Y.-T. Lai, M. Pedram, and S. B. K. Vrudhula, “EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition,” IEEE Trans. Computer-Aided Design, vol. 13, no. 8, pp. 959-975, 1994.
29. Y.-T. Lai, S. Sastry, and M. Pedram, “Boolean matching using binary decision diagrams with applications to logic synthesis and verification,” in Proc. Int. Conf. CAD, Nov. 1992, pp. 452-458.
30. C. Y. Lee, “Representation of switching circuits by binary decision diagrams,” Bell Syst. Tech. J., vol. 38, pp. 985-999, 1959.
31. L. Litan, P. Molitor, and D. Möller, “Least upper bounds on the sizes of symmetric variable order based OBDD’s,” in Proc. Great Lakes Symp. VLSI, 1996, pp. 126-129.
32. F. Mailhot and G. De Micheli, “Technology mapping using Boolean matching and don’t care sets,” in Proc. European Conf. Design Automation, Feb. 1990, pp. 212-216.
33. S. Malik, A. R. Wang, R. K. Brayton, and A. L. Sangiovanni-Vincentelli, “Logic verification using binary decision diagrams in a logic synthesis environment,” in Proc. Int. Conf. CAD, Nov. 1988, pp. 6-9.
34. J. Mohnke and S. Malik, “Permutation and phase independent Boolean comparison,” in Proc. European Conf. Design Automation, Feb. 1993, pp. 86-92.
35. J. Mohnke, P. Molitor, and S. Malik, “Limits of using signatures for permutation independent Boolean comparison,” in Proc. ASP Design Automation Conf., Aug. 1995, pp. 459-464.
36. D. Möller, J. Mohnke, and M. Weber, “Detection of symmetry of Boolean functions represented as ROBDD’s,” in Proc. Int. Conf. CAD, Nov. 1993, pp. 680-684.
37. D. Möller, P. Molitor, and R. Drechsler, “Symmetry based variable ordering for ROBDD’s,” in Proc. IFIP Workshop on Logic and Architecture Synthesis, Dec. 1994, pp. 47-53.
38. B. M. E. Moret, “Decision trees and diagrams,” in Comput. Surveys, vol. 14, pp. 593-623, 1982.
39. C. Morgenstern, “A new backtracking heuristic for rapidly four-coloring large planar graphs,” Tech. Rep. CoSc-1992-2, Texas Christian Univ., Fort Worth, TX, 1992.
40. S. Panda and F. Somenzi, “Who are the variables in your neighborhood,” in Proc. Int. Conf. CAD, Nov. 1995, pp. 74-77.
41. S. Panda, F. Somenzi, and B. F. Plessier, “Symmetry detection and dynamic variable ordering of decision diagrams,” in Proc. Int. Conf. CAD, Nov. 1994, pp. 628-631.
42. I. Pomeranz and S. M. Reddy, “On determining symmetries in inputs of logic circuits,” in VLSI Design Conf., Jan. 1994, pp. 255-260.
43. R. Rudell, “Dynamic variable ordering for ordered binary decision diagrams,” in Proc. Int. Conf. CAD, Nov. 1993, pp. 42-47.
44. C. Scholl, S. Melchior, G. Hotz, and P. Molitor, “Minimizing ROBDD sizes of incompletely specified functions by exploiting strong symmetries,” in Proc. European Design & Test Conf., Mar. 1997, pp. 229-234.
45. C. Scholl and P. Molitor, “Communication based FPGA synthesis for multi-output Boolean functions,” in Proc. ASP Design Automation Conf., Aug. 1995, pp. 279-287.
46. E. Sentovich, K. Singh, L. Lavagno, Ch. Moon, R. Murgai, A. Saldanha, H. Savoj, P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli, “SIS: A system for sequential circuit synthesis,” Tech. Rep., Univ. Berkeley, Berkeley, CA, 1992.
47. T. R. Shiple, R. Hojati, A. L. Sangiovanni-Vincentelli, and R. K. Brayton, “Heuristic minimization of BDD’s using don’t cares,” in Proc. Design Automation Conf., June 1994, pp. 225-231.
48. D. Sieling, “Variable orderings and the size of OBDD’s for partially symmetric Boolean functions,” in SASIMI, pp. 189-196, Nov. 1996.
49. I. Wegener, “Optimal decision trees and one-time-only branching programs for symmetric Boolean functions,” Inform., Contr., vol. 62, pp. 129-143, 1984.
50. B. Wurth, K. Eckl, and K. Antreich, “Functional multiple-output decomposition: Theory and implicit algorithm,” in Proc. Design Automation Conf., June 1995, pp. 54-59.