| An automated design of minimum-area IC power/ground nets |
| Full text |
Pdf
(823 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: 223 - 229
Year of Publication: 1987
ISBN:0-8186-0781-5
|
|
Author
|
|
S. Chowdhury
|
Department of Electrical & Computer Engineering, The University of Iowa, Iowa City, IA
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 11, Citation Count: 8
|
|
|
ABSTRACT
Given tree topologies for routing power/ground (p/g) nets in integrated circuits, this paper formulates and solves the problem of determining the widths of the branches of the trees. Constraints are developed in order to maintain proper logic levels and switching speed, to prevent electromigration, and to satisfy certain design rule and regularity requirements. The area required by the p/g distribution system is minimized subject to these constraints. Some case studies are also presented.
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
|
M.S. Bazaraa and C.M. Shetty, Nonlinear Programming, John Wiley & Sons, 1979.
|
| |
2
|
J. R. Black, "Electromigration failure modes in aluminium metalization for semiconductor devices," Proc. IEEE, vol. 57, pp. 1587-1594, Sept., 1969.
|
 |
3
|
|
| |
4
|
|
| |
5
|
F.M. D'Heurle, "Electromigration and failure in electronics: An introduction," Proc. IEEE, vol. 597 no. 10, pp. 1409-1418~ October, 1971.
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
W.S. Song and L.A. Glosser, "Power distribution techniques for VLSI circuits," Journal of Solid State Circuits, Feb., 1986.
|
| |
11
|
Z.A. Syed and A. El Gamal, "Single layer routing of power and ground networks in integrated circuits," Journal of Digital Systems, vol. 6, no. 1, pp. 53-63, 1982.
|
| |
12
|
D.M. Topkis and A.F. Veinott, "On the convergence of some feasible direction algorithms for nonlinear programming," SIAM J. Control, 5, pp. 268- 279, 1967.
|
| |
13
|
G. Zoutendijk, "Methods of feasible directions," Elsevier, Amsterdam, 1960.
|
CITED BY 8
|
|
|
|
|
|
Thorsten Adler , Hiltrud Brocke , Lars Hedrich , Erich Barke, A current driven routing and verification methodology for analog applications, Proceedings of the 37th conference on Design automation, p.385-389, June 05-09, 2000, Los Angeles, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|