A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
BDS: a BDD-based logic optimization system
2002
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
This paper describes a novel logic decomposition theory and a practical logic synthesis system, BDS. It is based on a new binary decision diagrams (BDD) decomposition technique which supports all types of decomposition structures, including AND, OR, XOR, and complex MUX, both algebraic and Boolean. As a result, the method is very efficient in synthesizing both AND/OR and XOR-intensive functions. It also has a capability to handle very large circuits, as it employs the BDD decomposition in the
doi:10.1109/tcad.2002.1013899
fatcat:cp37ulznrfd6xgrbx4cfzblluy