ACM Home Page
Please provide us with feedback. Feedback
An efficient approach to simultaneous transistor and interconnect sizing
Full text Publisher SitePublisher Site PdfPdf (544 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 181 - 186  
Year of Publication: 1997
ISBN:0-8186-7597-7
Authors
Jason Cong  Department of Computer Science, University of California, Los Angeles, CA
Lei He  Department of Computer Science, University of California, Los Angeles, CA
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 9,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  

ABSTRACT

In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We define a class of optimization problems as CH-posynomial programs and reveal a general dominance property for all CH-posynomial programs. We show that the STIS problems under a number of transistor delay models are CH-posynomial programs and propose an efficient and near-optimal STIS algorithm based on the dominance property. When used to solve the simultaneous driver/buffer and wire sizing problem for real designs, it reduces the maximum delay by up to 16.1%, and more significantly, reduces the power consumption by a factor of 1.63X, when compared with the original designs. When used to solve the transistor sizing problem, it achieves a smooth area-delay trade-off. Moreover, the algorithm optimizes a clock net of 367 drivers/buffers and 59304 /spl mu/m-long wire in 120 seconds, and a 32-bit adder with 1026 transistors in 66 seconds on a SPARC-5 workstation.


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
3
 
4
C. Chien, P. Yang, E. Cohen, R. Jain, and H. Samueli, "A 12.7Mchip/s All-Digital BPSK Direct Sequence Spread- Spectrum IF Transceiver in 1.2#m CMOS," Proc. IEEE Int'l Solid-State Circuits Conf., 1994, pp. 30-31.
 
5
W. Chuang, S. S. Sapatnekar and I. N. Hajj, "Timing and Area Optimization for Standard-Cell VLSI Circuit Design", IEEE Tran. on CAD, March 1995, pp. 308-320.
6
 
7
J. Cong and L. He, "Simultaneous Transistor and Interconnect Sizing Based on the General Dominance Property", UCLA Computer Science, Technical Report 95-000~6, Dec. 1995 (at http://ballade.cs.ucla.edu/- cong /publications.html).
 
8
 
9
10
 
11
J. Cong and K. S. Leung, "Optimal Wiresizing Under the Distributed Elmore Delay Model", IEEE Trans. on CAD, 14(3), March 1995, pp. 321-336.
 
12
J. Cong and P. H. Madden, "Performance Driven Routing with Multiple Sources," Proc. ISCAS, 1995, pp. 1157-1169.
 
13
J. G. Ecker, "Geometric Programming: Methods, Computations and Appicaltions", SIAM Review, Vol. 22, No. 3, July 1980, pp. 338-362.
 
14
J. P. Fishburn and A. E. Dunlop, "TILOS: A Psoynomial Programming Approach to Transistor Sizing", Proc. ICCAD, 1985, pp. 326-328.
 
15
N. Hedenstierna, and K. O. Jeppson, "CMOS Circuit Speed and Buffer Optimization", IEEE Tran. on CAD, 1987, pp. 270- 281.
 
16
17
 
18
S. S. Sapatnekar, V. B. Rao, P. M. Vaidya, and S. M. Kang, "An Exact Solution to the Transistor Sizing Problem for CMOS Circuits Using Convex Optimization", IEEE Tran. on CAD, November 1993, pp. 1621-1634.
 
19
 
20
 
21
J. K. Ousterhout, "A Switch-Level Timing Verifier for Digital MOS VLSI, " IEEE Trans. on CAD, 4(3)(1983)pp. 336-349.
 
22
D. J. Pilling and J. G. Skalnik, "A Circuit Model for Predicting Transient Delays in LSI Logic Systems", Proc. 6th Asilomar Conf. on Circuits and Systems, 1972, pp. 424-428.
 
23
 
24
J. Rubinstein, P. Penfield, and M. A. Horowitz, "Signal Delay in RC Tree Networks", IEEE Trans. on CAD, 2(3) (1983) pp. 202-211.
 
25

CITED BY  9
 
 
 
 


Peer to Peer - Readers of this Article have also read:
  • LR Parsing ACM Computing Surveys (CSUR)   6, 2
    A. V. Aho ,  S. C. Johnson