Binary decision diagrams (BDDs) is the most efficient Boolean logic representation found so far. In this dissertation, a new BDD-based logic synthesis system is presented. The system is based on a new BDD decomposition theory which supports both algebraic and Boolean factorization. New techniques, which are crucial to the manipulation of BDDs in a partitioned Boolean network environment, are described in detail. The experimental results show that our logic synthesis system has a capability to handle very large circuits. It offers a superior run-time advantage over the state-of-the-art logic synthesis system, with comparable results in terms of circuit area and often improved delay.
| Identifer | oai:union.ndltd.org:UMASS/oai:scholarworks.umass.edu:dissertations-3338 |
| Date | 01 January 2000 |
| Creators | Yang, Congguang |
| Publisher | ScholarWorks@UMass Amherst |
| Source Sets | University of Massachusetts, Amherst |
| Language | English |
| Detected Language | English |
| Type | text |
| Source | Doctoral Dissertations Available from Proquest |
Page generated in 0.0018 seconds