ACM Home Page
Please provide us with feedback. Feedback
An efficient transistor folding algorithm for row-based CMOS layout design
Full text PdfPdf (246 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 34th annual Design Automation Conference table of contents
Anaheim, California, United States
Pages: 456 - 459  
Year of Publication: 1997
ISBN:0-89791-920-3
Authors
Jaewon Kim  Quickturn Design Systems, Inc., 440 Clyde Av., Mountain View, CA
S. M. Kang  Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 20,   Citation Count: 0
Additional Information:

abstract   references   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/266021.266199
What is a DOI?

ABSTRACT

In timing-driven layout synthesis, transistor sizes tend to besignificantly different from each other and thus the use of conventionallayout approaches can cause inefficient area utilization.We propose an efficient algorithm to find the optimaltransistor folding sizes in row-based designs.Our algorithmfinds optimal folding sizes given a CMOS circuit with m pairsof pMOS and nMOS transistors in O(m{2} log m) time complexitywith the effective reduction of the solution space.MCNCbenchmark circuits are used to demonstrate the area-efficiencyof the physical layouts with optimal folding sizes.


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
S. S. Sapatnekar et al., "An exact solution to the transistor sizing problem for CMOS circuits using convex optimization," IEEE Trans. CAD, pp. 1621-1634, Nov. 1993.
 
2
J. P. Fishburn and A. E. Dunlop, "TILOS: A posynomial programming approach to transistor sizing," Proc. 1985 1CCAD, pp. 326-328, 1985.
 
3
J. Shyu et al., "Opt!mization-based transistor sizing," IEEE J. Solid-State C'ircuits, pp. 400-409, Apr. 1988.
 
4
Z. Dai and K. Asada, "MOSIZ: A two-step transistor sizing algorithm based on optimal timing assingment method for multi-stage complex gates," Proc. 1989 CICC, pp. 17.3.1-17.3.4, May 1989.
5
 
6
T. W. Her and D. F. Wong, "Cell Area Minimization by Transistor Folding," Proc. 1993 Euro-DAC, pp.172-177, 1993.
 
7
T. Uehara and W. M. VanCleemput. "Optimal layout of CMOS functional arrays," Proc. IEEE Transactions of Computers, vol. 30, pp. 305-312, May 1981.
 
8
J. Kim and S. M. Kang, "High Performance CMOS Macromodule Layout Synthesis," Proc 199~ ISCAS, 1994.