STACCATO: Disjoint support decompositions from BDDs through symbolic kernels

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 1, Issue , 2005, Pages 276-279

  Plaza, Stephen ^a   Bertacco, Valeria ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISJOINT-SUPPORT DECOMPOSITIONS; NOVEL ALGORITHM;

ALGORITHMS; BOOLEAN FUNCTIONS;

COMPUTER AIDED DESIGN;

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

References (19)

1. Robert L. Ashenhurst. The decomposition of switching functions. In Proceedings of the International Symposium on the Theory of Switching, Part I 29, pages 74-116, 1957.
2. V. Yun-Shen Shen, Archie C. McKellar, and Peter Weiner. A fast algorithm for the disjunctive decomposition of switching functions. IEEE Transactions on Computers, C-20(3): 304-309, 1971.
3. Valeria Bertacco and Maurizio Damiani. The disjunctive decomposition of logic functions. In ICCAD. Proceedings of the International Conference on Computer Aided Design, pages 78-82, November 1997.
4. Valeria Bertacco. Achieving Scalable Hardware Verification with Symbolic Simulation. PhD thesis, Stanford University, 2003.
5. Yusuke Matsunaga. An exact and effi cient algorithm for disjunctive decomposition. In SASIMI, pages 44-50, October 1998.
6. Kevin Karplus. Using if-then-else dags to do technology mapping for fi eld-programmable gate arrays. Technical Report UCSC-CRL-90-43, Baskin Center for Computer Engineering & Information Sciences, 1990.
7. Tsutomu Sasao. Multiple-valued decomposition of generalized boolean functions and the complexity of programmable logic arrays. IEEE Transactions on Computers, C-30(9):635-643, September 1981.
8. Rajeev Murgai, Yoshihito Nishizaki, Narendra V. Shenoy, Robert K. Brayton, and Alberto Sangiovanni-Vincentelli. Logic synthesis for programmable gate arrays. In DAC. Proceedings of Design Automation Conference, pages 620-625, June 1990.
9. Thomas Kutzschebauch and Leon Stok. Layout driven decomposition with congestion consideration. In DATE. Design, Automation and Test in Europe Conference, pages 672-676, March'2002.
10. Valeria Bertacco and Kunle Olukotun. Effi cient-state representation for symbolic simulation. In DAC. Proceedings of Design Automation Conference, June 2002.
11. Gianpiero Cabodi, Paolo Camiirati, Luciano Lavagno, and Stefano Quer. Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits. In DAC. Proceedings of Design Automation Conference, pages 728-733, June 1997.
12. Tsutomu Sasao and Munehiro Matsuura. DECOMPOS: An integrated system for functional decomposition. In International Workshop on Logic Synthesis, pages 471-477, 1998.
13. Robert K. Brayton and Curt McMulIen. The decomposition and factorization of boolean expressions. In ISCAS. Proceedings of the International Symposyium on Circuits and Systems, pages 49-54, 1982.
14. Kevin Karplus, Using if-then-else dags for multi-level logic minimization. In Proceedings of Advanced Research in VLSI, pages 101-118, 1989.
15. Yung-Te Lai, Kuo-Rueih R. Pan, and Massoud Pedram. Obdd-based functional decomposition: algorithms and implementation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(8):977-990, August 1996.
16. Olivier Coudert and Jean Christophe Madre. A unifi ed framework for the formal verifi cation of sequential circuits. In ICCAD. Proceedings of the International Conference on Computer Aided Design, pages 126-129, November 1990.
17. Randal E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
18. Sun Microsystems. PicoJava technology. http://www.sun.com-/ microelectronics/communiiysource/picojava.
19. CUDD 2.3.1. http://vlsi.Colorado.edu/~fabio.