ACM Home Page
Please provide us with feedback. Feedback
Aesop: a tool for automated transistor sizing
Full text PdfPdf (795 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 24th ACM/IEEE Design Automation Conference table of contents
Miami Beach, Florida, United States
Pages: 114 - 120  
Year of Publication: 1987
ISBN:0-8186-0781-5
Author
K. S. Hedlund  Department of Computer Science, University of North Carolina, Chapel Hill, NC
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Citation Count: 15
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/37888.37905
What is a DOI?

ABSTRACT

This work addresses the problem of automating the electrical optimization of combinatorial MOS circuits. Improvements to a circuit's speed, area and power consumption are sought through modifications to the transistor sizes in the circuit; no changes in the circuit structure, number of gates or clocking are introduced. Linear algorithms are presented for computing optimal transistor sizes to minimize delay, area or power. These algorithms are implemented in an interactive tool, Aesop. Aesop is a powerful and fast “what-if” tool that allows the designer to explore the space of designs having optimal transistor sizes. When compared to manual designs, the circuits produced by Aesop are typically faster or have substantially lower area and power consumption. Compared to untuned circuits, Aesop typically increases circuit speed by a factor of 2 to 4. Alternatively, power consumption and transistor area can be reduced by 25 — 50% with no sacrifice in circuit speed. These improvements are computed interactively on a professional workstation for circuits containing thousands of transistors.


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.

 
Agul77
 
Crad86
Craddock, R. "Using Aesop for VLSI Circuit Optimization,= unpublished tutorial from the University of Nbrth Carolina. Available from Kye S. Hedlund.
 
Fish85
Fishburn, $. mad Dunlop, A. "TILOS: A Posynomial Ap* proach to Transistor Sizing,~ Internation Conf. on Computer Aided Design (1985).
 
Gill81
Gill, P.E., Murray, W. and Wright, M.H. Practical Optimization, Academic Press (1981).
 
Glas84
 
Hedl87
Hedlund, K.S. "Algorithms and Models for Automated 'transistor Sizing," (in preparation).
Hedl85
 
Hedl84
Hedlund, K.S. "Models and Algorithms for Transistor Sizing in MOS Circuits,~ IEEE International Conf. on Computer Aided Design (Oct. 1984) 12-14.
 
Joup83
 
Lee84
Lee, C.M. and Soukup, H. "An Algorithm for CMOS Timing and Area Optimization,~ J. of Solid-State Circuits, SC- 19, 5 (Oct. 1984), 781-787.
 
Marp86
 
Mats85a
Matson, M.D. "Optimization of Digital MOS VLSI Circuits," 1985 Chapel Hilt Conf. on VLSI (May 1985).
 
Nye81
Nye, W., et al. ~DELIGHT: An Optimization-Based Computer-Aided Design System,~ Proc. IEEE international Symp. on Circuits and Systems, (April 1981), 851- 855.
 
Oust83
OusterhonL J.K. "Crystal: A Timing Analyzer for nMOS VLSI Circuits,~ Third Caltech Conf. on Very Large ~cale Integration, (Jan. 1983), 57-70.
 
Oust84
 
Rueh77
 
Aubr84
Subramaniam, P. "Table Methods for Timing Simulation,= Custom Integrated Circuits Conf. (1984), 310-314.
 
Toku83
Tokuda, T. et.al. "Delay-Time Modeling for ED MOS Logic LSI,~ IEEE Trans. on Computer-Aided Desigr#, CAD-2, 3 (July 1983), 129-134.
 
Trim83
2Xrimberger, S.M. "Automated Performance Optimization of Custom Integrated Circuits,~ VLSI 83, (Aug. 1983), 99-- 108.

CITED BY  15