Algorithms for Taylor expansion diagrams

Proceedings of The International Symposium on Multiple-Valued Logic

Volumn , Issue , 2004, Pages 235-240

  Fey, Görschwin ^a   Drechsler, Rolf ^a   Ciesielski, Maciej ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; BOOLEAN FUNCTIONS; CACHE MEMORY; DATA STRUCTURES; MATHEMATICAL OPERATORS; NETWORKS (CIRCUITS); OPTIMIZATION; POLYNOMIALS;

BINARY DECISION DIAGRAM (BDD); FACTORIZATION; MULTIPLICATION; TAYLOR EXPANSION DIAGRAMS (TED);

POWER INTEGRATED CIRCUITS;

EID: 3142688443     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. B. Becker, R. Drechsler, and R. Enders. On the computational power of bit-level and word-level decision diagrams. In ASP Design Automation Conf., pages 461-467, 1997.
2. R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 35(8):677-691, 1986.
3. R.E. Bryant and Y.-A. Chen. Verification of arithmetic functions with binary moment diagrams. In Design Automation Conf., pages 535-541, 1995.
4. R.E. Bryant and Y.-A. Chen. Verification of arithmetic circuits using binary moment diagrams. Software Tools for Technology Transfer, 3(2):137-155, 2001.
5. M. Ciesielski, P. Kalla, Z. Zheng, and B. Rouzyere. Taylor expansion diagrams: A compact canonical representation with applications to symbolic verification. In Design, Automation and Test in Europe, pages 285-289, 2002.
6. E.M. Clarke, M. Fujita, and X. Zhao. Application of multiterminal binary decision diagrams. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pages 21-27, 1995.
7. R. Drechsler, B. Becker, and S. Ruppertz. K*BMDs: A new data structure for verification. In European Design & Test Conf., pages 2-8, 1996.
8. 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 415-419, 1994.
9. 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.
10. R. Enders. Note on the complexity of binary moment diagram representations. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pages 191-197, 1995.
11. P. Kalla. An Infrastructure for RTL Validation and Verification. PhD thesis, University of Massachusetts, Amherst (MA), September 2002.
12. P. Kalla, M. Ciesielski, E. Boutillon, and E. Martin. High-level design verification using taylor expansion diagrams: First results. In Int'l Workshop on High Level Design Validation and Test, pages 13-17, 2002.
13. 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.
14. Y.-T. Lai and S. Sastry. Edge-valued binary decision diagrams for multi-level hierarchical verification. In Design Automation Conf., pages 608-613, 1992.
15. C. Scholl, B. Becker, and T. Weis. On WLCDs and the complexity of word-level decision diagrams - a lower bound for division. Formal Methods in System Design: An International Journal, 20(3), 2002.
16. F. Somenzi. Efficient manipulation of decision diagrams. Software Tools for Technology Transfer, 3(2):171-181, 2001.
17. P. Tafertshofer and M. Pedram. Factored edge-valued binary decision diagrams. Formal Methods in System Design: An International Journal, 10(2):243-270, 1997.