Gate sizing for constrained delay/power/area optimization

  • Authors:
  • Olivier Coudert

  • Affiliations:
  • Synopsys, Inc., Mountain View, CA

  • Venue:
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low power electronics and design
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Gate sizing has a significant impact on the delay, power dissipation, and area of the final circuit. It consists of choosing for each node of a mapped circuit a gate implementation in the library so that a cost function is optimized under some constraints. For instance, one wants to minimize the power consumption and/or the area of a circuit under some user-defined delay constraints, or to obtain the fastest circuit within a given power budget. Although this technology-dependent optimization has been investigated for years, the proposed approaches sometimes rely on assumptions, cost models, or algorithms that make them unrealistic or impossible to apply on real-life large circuits. We discussed here a gate sizing algorithm (GS), and show how it is used to achieve constrained optimization. It can be applied on large circuits within a reasonable CPU time, e.g., minimizing the power of a 10000 gates circuit under some delay constraint in 2 h.