Gate sizing in MOS digital circuits with linear programming

  • Authors:
  • Michel R. C. M. Berkelaar;Jochen A. G. Jess

  • Affiliations:
  • Eindhoven University of Technology, Eindhoven, The Netherlands;Eindhoven University of Technology, Eindhoven, The Netherlands

  • Venue:
  • EURO-DAC '90 Proceedings of the conference on European design automation
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper a solution is presented to tune the delay of a circuit composed of cells to a prescribed value, while minimizing power consumption. The tuning is performed by adapting the load drive capabilities of the cells. This optimization problem is mapped onto a linear program, which is then solved by the Simplex algorithm. This approach guarantees to find the global optimum, and has proven feasible for circuits of up to several thousand cells. The method can be used with any convex delay model. Results show that circuits can be speeded up by a factor of 2 at a cost of only 10 to 30% of extra power.