loading...
BDD Decomposition for Efficient Logic Synthesis
Austin, Texas October 10-October 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.1999.8086071999 IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Congguang Yang, University of Massachusetts at Amherst
Maciej Ciesielski, University of Massachusetts at Amherst
Vigyan Singhal, Cadence Berkeley Laboratory
A unified logic optimization method efficient at handling both AND/OR-intensive and XOR-intensive functions is proposed. The method is based on iterative BDD decomposition using various dominators. Detail analysis of decomposable BDD structures leading to AND/OR, XOR and MUX decompositions are presented. Experiment shows that our synthesis results for AND/OR-intensive functions are comparable to those of SIS, and results for XOR-intensive functions are comparable to those of techniques targeting specifically XOR decomposition.
Index Terms:
BDD, Logic Synthesis, Decomposition, Dominators
Citation:
Congguang Yang, Maciej Ciesielski, Vigyan Singhal, "BDD Decomposition for Efficient Logic Synthesis," iccd, pp.626, 1999 IEEE International Conference on Computer Design (ICCD'99), 1999
Usage of this product signifies your acceptance of the Terms of Use.