Gate Sizing: A General Purpose Optimization Approach

  • Authors:
  • Olivier Coudert

  • Affiliations:
  • Synopsys, Inc., 700 East Middlefield Rd., Mountain View, CA

  • Venue:
  • EDTC '96 Proceedings of the 1996 European conference on Design and Test
  • Year:
  • 1996

Quantified Score

Hi-index 0.02

Visualization

Abstract

Gate sizing consists of choosing for each node of a mapped network a gate implementation in the library so that some cost function is optimized under some constraints. This has a significant impact on the delay, power dissipation, and area of the final circuit. The gate sizing methods previously proposed suffer from problems that make them difficult to apply on real-life large circuits. This paper presents GS, a gate sizing based general purpose optimization algorithm, which has the following characteristics: it can optimize the power or/and area under some delay constraints, or the delay under some power or/and area constraints; it can take into account user defined or library dependent design rules; as opposed to greedy approaches, it addresses non-linear, non-unimodal, constrained optimization, in order to handle complex cost models (e.g., delay and power); it can be applied on large circuits within a reasonable CPU time, e.g., 10000 nodes in 2 hours for power optimization under delay constraints.