ACM Home Page
Please provide us with feedback. Feedback
Delay and area optimization in standard-cell design
Full text PdfPdf (498 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 27th ACM/IEEE Design Automation Conference table of contents
Orlando, Florida, United States
Pages: 349 - 352  
Year of Publication: 1991
ISBN:0-89791-363-9
Authors
Shen Lin  Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA
M. Marek-Sadowska  Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA
Ernest S. Kuh  Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 42,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/123186.123301
What is a DOI?

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]


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
J. Shyu, A. Sangiovanni-Vincentelli, J. Fishburn, and A. Dunlop, " Optimization-Based Transistor Sizing," IEEE Journal of Solid-State Circuit, SG-~$, No. 2, pp. 400-409, Apr. 1988.
 
3
David P. Marple and Abbas E. Gamai, "Optimal Selection of Transistor Sizes in Digital VLSI Circuits," P'roc. of the 1987 Conf. Advanced Research in VLSI, pp. 151-172, 1987.
4
5
6
7
 
8
Mark Matson, and Lance Gla~ser, "Macromodeling and Optimization of Digital MOS VLSI Circuits," IEEE Trans. on CAD (~):~59.67s, 19s6.
 
9
S. Trimberger, "Automated Performance Optimization of Custom Integrated Circuits~" Proc. Intl. Syrup. on Circuits and Systems, pp. 194-197, 1983.
 
10
J.P. Fishburn and A. E. Dunlop, "TILOS: A Posynomial Programming Approach to Transistor Sizing," Proc. IEEE IC. CAD, pp. 326-328, 1985.
 
11
Zhi-jian Dai and Kunihiro Asada, "MOSIZ: A Two-Step Transistor Sizing Algorithm based on Optimal Timing Assignment Method for Multi-staKe Complex Gates," P~oc. IEEE Custom integrated Circuits Conf. pp. 17.3.1-17.3.4, 1989.
 
12
 
13
M. Marek-Sadowskaand Shen Lin, "Timing Driven Placement," Proc. IEEE ICCAD, 1989.
 
14
 
15
E. Detjens~ G. Gannot, 1~. l=tudell, A. Sangiovanni-Vincentelli, and A. Wang, "Technology Mapping in MIS," Proc. IEEE IC. CAD, pp. 116-119, 1987.

CITED BY  14

Collaborative Colleagues:
Shen Lin: colleagues
M. Marek-Sadowska: colleagues
Ernest S. Kuh: colleagues