This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
27th ACM/IEEE Design Automation Conference (DAC '90)
Orlando, FL, USA
June 24-June 28
ISBN: 0-89791-363-9
Chan, Comput. Eng.., California Univ., Santa Cruz, CA, USA
Examined is a problem of choosing the proper sizes from a cell library for the logic elements of a Boolean network to meet timing constraints on the propagation delay along every path from the primary input to the primary output. It is shown that, if the Boolean network has a tree topology, there exists a pseudo-polynomial time algorithm for finding the optimal solution to this problem. A backtracking-based algorithm for finding feasible solutions for networks that are not trees is also suggested and evaluated.
Index Terms:
library-specific sizing, combinational logic, cell library, logic elements, Boolean network, timing constraints, propagation delay, tree topology, pseudo-polynomial time algorithm, backtracking-based algorithm
Citation:
Chan, "Algorithms for library-specific sizing of combinational logic," dac, pp.353-356, 27th ACM/IEEE Design Automation Conference (DAC '90), 1990
Usage of this product signifies your acceptance of the Terms of Use.