ACM Home Page
Please provide us with feedback. Feedback
MINFLOTRANSIT: min-cost flow based transistor sizing tool
Full text PdfPdf (222 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 37th Annual Design Automation Conference table of contents
Los Angeles, California, United States
Pages: 649 - 664  
Year of Publication: 2000
ISBN:1-58113-187-9
Authors
Vijay Sundararajan  Dept. of ECE, University of Minnesota, Minneapolis, MN
Sachin S. Sapatnekar  Dept. of ECE, University of Minnesota, Minneapolis, MN
Keshab K. Parhi  Dept. of ECE, University of Minnesota, Minneapolis, MN
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   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/337292.337606
What is a DOI?

ABSTRACT

This paper presents MINFLOTRANSIT, a new transistor sizing tool for fast sizing of combinational circuits with minimal cost. MINFLOTRANSIT is an iterative relaxation based tool that has two alternating phases. For a circuit with |V| transistors and |E| wires, the first phase (D-phase)) is based on minimum cost network flow, which in our application, has a worst-case complexity of O(|V||E|log(log(|V|))). The second phase W-phase has a worst case complexity of O(|V||E|). In practice, during our simulations both the D-phase and W-phase show a near linear run-time dependence on the size of the circuit, comparable to TILOS. Simulation results show excellent run-time behavior for MINFLOTRANSIT on all the ISCAS85 benchmark circuits. For reasonable delay targets MINFLOTRANSIT shows up to 16.5% area savings over a circuit sized using a TILOS-like algorithm.


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
J. P. Fishburn and A. E. Dunlop, "TILOS: A Posynomial Programming Approach to Transistor Sizing," in Proceedings of the 1985 International Conference on Computer-Aided Design, pp. 326-328, November 1985.
 
2
S. Sapatnekar, V. Rao, E Vaidya, and S. Kang, "An Exact Solution to the Transistor Sizing Problem for CMOS Circuits Using Convex Optimization.," IEEE Transactions on Computer- Aided Design, vol. 12, pp. 1621-1634, November 1993.
 
3
J.-M. Shyu, A. L. Sangiovanni-Vincentelli, J. Fishburn, and A. Dunlop, "Optimization-based Transistor Sizing," IEEE Journal on Solid State Circuits, vol. 23, no. 2, pp. 400-409, 1988.
 
4
D. Marple, "Performance Optimization of Digital VLSI Circuits," Technical Report CSL-TR-86-308, Stanford University, October 1986.
5
 
6
 
7
Z. Dai and K. Asada, "MOSIZ: A Two-Step Transistor Sizing Algorithm based on Optimal Timing Assignment Method for Multi-Stage Complex Gates," in Proceedings of the 1989 Custom Integrated Circuits Conference, pp. 17.3.1-17.3.4, May 1989.
8
 
9
10
 
11
 
12
G. Strang, Linear Algebra and its Applications. Harcourt Brace Jovanovich, Publishers, San Diego, CA, 1988.
 
13
 
14
V. Chvatal, Linear Programming. W. H. Freeman and Company, New York, NY, 1983.
 
15
A. E. Dunlop, J. E Fishburn, D. D. Hill, and D. D. Shugard, "Experiments Using Automatic Physical Design Techniques for Optimizing Circuit Performance," in Proceedings of the 32nd Midwest Symposium on Circuits and Systems, (Urbana, IL), pp. 216-220, August 1989.
 
16
J. Cong, "Challenges and Opportunities for Design Innovations in Nanometer Technologies," Technical Report, Semiconductor Research Corporation, 1997.

Collaborative Colleagues:
Vijay Sundararajan: colleagues
Sachin S. Sapatnekar: colleagues
Keshab K. Parhi: colleagues