TEUBNER-TEXTE zur Informatik Volume 1, 1992, pp 185-208

Performance Optimization of Combinational Circuits

* Final gross prices may vary according to local VAT.

Get Access


Performance optimization, i.e. the problem of finding an optimal investment of transistor area which meets given delay constraints, is considered from an abstract, cell based point of view which allows only solutions within a discrete solution space of coarse granularity. The main advantages of this problem formulation are the independence of the methods from concrete delay modelling (and thus from technology) and the applicability to even very restrictive design styles (as for example gate arrays or sea of gates). Our approach can be considered as a discrete version of the transistor sizing problem on one hand and generalizes to the library mapping problem on the other hand. The paper presents optimal dynamic programming algorithms for trees and heuristics together with first experimental results for general combinational circuits.