Check nearby libraries
Buy this book
The past decade of logic synthesis research has looked at using Binary Decision Diagrams (BDDs) as an alternative to the traditional sum-of-product representation of logic functions. When compared to the later, logic synthesis algorithms using BDDs have been shown to have significantly better scalability, however, the area quality produced has been poor. This thesis describes two new improvements to BDD-based logic synthesis. The first is a sharing extraction algorithm to improve area. The second is a logic folding approach, where equivalent logic transformations are shared to improve runtime.The algorithms are evaluated in a new logic synthesis tool called FBDD. Experimental results on the MCNC benchmarks show an average area savings of 21% and runtime improvements of 3 times, when compared to a state-of-the-art BDD based logic synthesis system.
Check nearby libraries
Buy this book
Showing 2 featured editions. View all 2 editions?
Edition | Availability |
---|---|
1 |
aaaa
Libraries near you:
WorldCat
|
2 |
zzzz
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Source: Masters Abstracts International, Volume: 44-01, page: 0497.
Thesis (M.Sc.)--University of Toronto, 2005.
Electronic version licensed for access by U. of T. users.
ROBARTS MICROTEXT copy on microfiche.
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?January 24, 2010 | Edited by WorkBot | add more information to works |
December 11, 2009 | Created by WorkBot | add works page |