Delay and area optimization in standard-cell design

  • Authors:
  • Shen Lin;M. Marek-Sadowska;Ernest S. Kuh

  • Affiliations:
  • Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA;Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA;Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA

  • Venue:
  • DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a heuristic approach to the optimal selection of standard cells in VLSI circuit design. We are considering a cell library composed of several templates (3-5) for each type of cell. These templates differ in area, driving capabilities, intrinsic delay, and capacitive loading. When realizing a logically synthesized circuit, we select the best templates from the cell library to minimize the total area of the cells under delay constraints. We have found a very successful heuristic approach to attack this discrete optimization problem.Experimental results show that this approach runs very fast, with the complexity of &Ogr;(n2), and improves the results obtained from the technology mapping of misII. [15]