ACM Home Page
Please provide us with feedback. Feedback
Coupling aware timing optimization and antenna avoidance in layer assignment
Full text PdfPdf (558 KB)
Source International Symposium on Physical Design archive
Proceedings of the 2005 international symposium on Physical design table of contents
San Francisco, California, USA
SESSION: Routing techniques table of contents
Pages: 20 - 27  
Year of Publication: 2005
ISBN:1-59593-021-3
Authors
Di Wu  Texas A&M University, College Station, TX
Jiang Hu  Texas A&M University, College Station, TX
Rabi Mahapatra  Texas A&M University, College Station, TX
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 30,   Citation Count: 8
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/1055137.1055144
What is a DOI?

ABSTRACT

The sustained progress of VLSI technology has altered the landscape of routing which is a major physical design stage. For timing driven routings, traditional approaches which consider only wire self capacitance become inadequate since the wire delay is affected more by coupling capacitance in ultra-deep submicron designs. Furthermore, the technology scaling dramatically increases the likelihood of the antenna problem in manufacturing and requests corresponding considerations in the routing stage. In this paper, we propose techniques that can be applied to handle the coupling aware timing and the antenna problem simultaneously during layer assignment which is an important step between global routing and detailed routing. An improved probabilistic coupling capacitance model is suggested for coupling aware timing optimization without performing track assignment. The antenna avoidance problem is modeled as a tree partitioning problem with a linear time optimal algorithm solution. This algorithm is customized to guide antenna avoidance in layer assignment. A linear time optimal jumper insertion algorithm is also derived. Experimental results on benchmark circuits show that the proposed techniques can lead to an average of 270ps timing slack improvement validated by track assignment, 76% antenna violation reduction and 99% via violation reduction.


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
ITRS. Semiconductor Industry Association, 2003.
 
2
3
4
5
 
6
K. D. Boese, A. B. Kahng, B. A. McCoy, and G. Robins. Near-optimal critical sink routing tree constructions. IEEE Tran. on CAD, 14(12):1417--1436, Dec. 1995.
 
7
C.-C. Chang and J. Cong. An efficient approach to multilayer layer assignment with an application to via minimization. IEEE Tran. on CAD, 18(5):608--620, May. 1999.
 
8
C.-C. Chang and J. Cong. Pseudopin assignment with crosstalk noise control. IEEE Tran. on CAD, 20(5):598--611, May. 2001.
 
9
 
10
 
11
J. Cong, L. He, C.-K. Koh, and Z. Pan. Interconnect sizing and spacing with consideration of coupling capacitance. IEEE Tran. on CAD, 20(9):1164--1169, Sep. 2001.
 
12
T. Gao and C. L. Liu. Minimum crosstalk channel routing. IEEE Tran. on CAD, 15(5):465--474, May. 1996.
13
 
14
 
15
J. Hu and S. S. Sapatnekar. A timing-constrained simultaneous global routing algorithm. IEEE Tran. on CAD, 21(9):1025--1036, Sep. 2002.
 
16
L.-D. Huang, X. Tang, H. Xiang, D. Wong, and I.-M. Liu;. A polynomial time-optimal diode insertion/routing algorithm for fixing antenna problem. IEEE Tran. on CAD, 23(1):141--147, Jan. 2004.
 
17
 
18
 
19
S. Kundu and J. Misra. A linear tree partitioning algorithm. SIAM J. of Computing, 6(1):151--154, Mar. 1977.
 
20
R. Nair. A simple yet effective technique for global wiring. IEEE Tran. on CAD, 6(2):165--172, Mar. 1987.
 
21
P. Saxena and S. Gupta. On integrating power and signal routing for shield count minimization in congested regions. IEEE Tran. on CAD, 22(4):437--445, Apr. 2003.
 
22
H. Shirota, T. Sadakane, M. Terai, and K. Okazaki. A new router for reducing antenna effect in asic design. Proc. of CICC, pages 601--604, 1998.
 
23
S. Thakur, K.-Y. Chao, and D. F. Wong. An optimal layer assignment algorithm for minimizing crosstalk for three layer VHV channel routing. Proc. of ISCAS, 1:207--210, 1995.
 
24
H.-P. Tseng, L. Sheffer, and C. Sechen. Timing- and crosstalk- driven area routing. IEEE Tran. on CAD, 20(4):528--544, Apr. 2001.
 
25
A. Vittal and M. Marek-Sadowska. Crosstalk reduction for VLSI. IEEE Tran. on CAD, 16(3):290--298, Mar. 1997.
 
26
 
27
28
29
 
30
T. Xue, E. S. Kuh, and D. Wang. Post global routing crosstalk synthesis. IEEE Tran. on CAD, 16(12):1418--1430, Dec. 1997.
 
31
H. Zhou and D. F. Wong. Global routing with crosstalk constraints. IEEE Tran. on CAD, 18(11):1683--1688, Nov. 1999.

CITED BY  8

Collaborative Colleagues:
Di Wu: colleagues
Jiang Hu: colleagues
Rabi Mahapatra: colleagues