Exploració per tema "Tree-height reduction"
Ara es mostren els items 1-1 de 1
-
Timing-driven logic bi-decomposition
(2003-06)
Article
Accés obertAn approach for logic decomposition that produces circuits with reduced logic depth is presented. It combines two strategies: logic bi-decomposition of Boolean functions and tree-height reduction of Boolean expressions. ...