Published Articles >> Table of Contents >> Abstract

1999 IEEE International Conference on Computer Design (ICCD'99)   p. 626
BDD Decomposition for Efficient Logic Synthesis
Congguang Yang, University of Massachusetts at Amherst
Maciej Ciesielski, University of Massachusetts at Amherst
Vigyan Singhal, Cadence Berkeley Laboratory

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.1999.808607
Send link to a friend

Abstract
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.
Back to Top Additional Information
Index Terms- BDD, Logic Synthesis, Decomposition, Dominators Citation:  Congguang Yang, Maciej Ciesielski, Vigyan Singhal, "BDD Decomposition for Efficient Logic Synthesis," iccd, p. 626,  1999 IEEE International Conference on Computer Design (ICCD'99),  1999