How many decomposition types do we need ?

Proceedings of the 1995 European Conference on Design and Test, EDTC 1995

Volumn , Issue , 1995, Pages 438-443

  Becker, Bernd ^a   Drechsler, Rolf ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION DIAGRAM;

COMPUTER AIDED DESIGN;

EID: 0348022804     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. P. Ashar, A. Ghosh, S. Devadas, and A.R. Newton. Combinational and sequential logic verific-ation using general binary decision diagrams. In Int'l Workshop on Logic Synth., 1991.
2. B. Becker and R. Drechsler. Synthesis for testability: Circuits derived from ordered kronecker functional decision diagrams. In European Conf. on Design Automation, 1995.
3. B. Becker, R. Drechsler, and R. Werchner. On the relation between bdds and fdds. In LATIN95, LNCS, 1995.
4. K.S. Brace, R.L. Rudell, and R.E. Bryant. Efficient implementation of a BDD package. In Design Automation Conf., pages 40-45, 1990.
5. R.E. Bryant. Graph - based algorithms for Boolean function manipulation. IEEE Trans, on Comp., 8:677-691, 1986.
6. 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.
7. R.E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM, Comp. Surveys, 24:293-318, 1992.
8. J.R. Burch. Using BDDs to verify multipliers. In Design Automation Conf., pages 408-412, 1991.
9. R. Drechsler and B. Becker. Sympathy. Fast exact minimization of fixed polarity reed-muller expressions for symmetric functions. In European Conf. on Design Automation, 1995.
10. R. Drechsler, A. Sarabi, M. Theobald, B. Becker, and M.A. Perkowski. Efficient representation and manipulation of switching functions based on ordered kronecker functional decision diagrams. In Design Automation Conf., pages 415419, 1994.
11. R. Drechsler, M. Theobald, and B. Becker. Fast OFDD based minimization of fixed polarity reed- muller expressions. In European Design Automation Conf, pages 2-7, 1994.
12. S. J. Friedman. Efficient Data Structures for Boolean Function Representation. PhD thesis, Dept. of Comput. Sciences, Princeton University, 1990.
13. J. Jain, M. Abadir, J. Bitner, D. Fussell, and J. Abraham. IBDDs: An efficient functional rep-resentation for digital circuits. In European Conf. on Design Automation, pages 441-446, 1992.
14. S.-W. Jeong, B. Plessier, G. Hachtel, and F. Somenzi. Extended BDD's: Trading of ca- nonicity for structure in verification algorithms. In Int'l Conf. on CAD, pages 464-467, 1991.
15. U. Kebschull. Die Aquivalenz-Expansion Booles- cher Funktionen. Technical report, WSI-93-15, Universitat Tubingen, 1993.
16. U. Kebschull, E. Schubert, and W. Rosenstiel. Multilevel logic synthesis based on functional decision diagrams. In European Conf. on Design Automation, pages 43-47, 1992.
17. 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 Int'l Conf. on CAD, pages 6-9, 1988.
18. M.A. Perkowski. The generalized orthonormal expansion of functions with multiple-valued inputs and some of its application. In Int'l Symp. on multi-valued Logic, pages 442-450, 1992.
19. M.A. Perkowski. A fundamental theorem for exor circuits. IFIP WG 10.5 Workshop on Applic-ations of the Reed-Muller Expansion in Circuit Design, Hamburg, pages 52-60, 1993.
20. M.A. Perkowski, A. Sarabi, and F. Beyl. XOR canonical forms of switching functions. IFIP WG 10.5 Workshop on Applications of the Reed- Muller Expansion in Circuit Design, Hamburg, pages 27-32, 1993.
21. Richard Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42-47, 1993.
22. 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:621632, 1993.
23. T. Sasao. Logic Synthesis and Optimization. Kluwer Academic Publisher, 1993.
24. C.C. Tsai and M. Marek-Sadowska. Boolean matching using generalized Reed-Muller forms. In Design Automation Conf, pages 339-344, 1994.
25. I. Wegener. On the complexity of branching programs and decision trees for clique functions. Journal of the ACM, 35(2):461-471, 1988.