论文信息 - Minimal area design of power/ground nets having graph topologies

Minimal area design of power/ground nets having graph topologies

This paper deals with one aspect of routing power and ground nets in integrated circuits composed of modules, where the nets are routed in the channels between the modules. Constraints are assumed on allowable voltage drops for maintaining proper logic levels and switching speed. A procedure for determining the width of routes in power and ground multi-pad distribution systems having graph topologies is presented, where the objective is to minimize the area of the power and ground routes subject to several constraints, such as IR voltage drop and metal migration.

M. Breuer | S. Chowdhury

[1] J. B. Rosen. The gradient projection method for nonlinear programming: Part II , 1961 .

[2] M. Hestenes. Multiplier and gradient methods , 1969 .

[3] J. Black. Electromigration failure modes in aluminum metallization for semiconductor devices , 1969 .

[4] F. d'Heurle. Electromigration and failure in electronics: An introduction , 1971 .

[5] R. Rockafellar. Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming , 1974 .

[6] Lynn Conway,et al. Introduction to VLSI systems , 1978 .

[7] M. S. Bazaraa,et al. Nonlinear Programming , 1979 .

[8] Melvin A. Breuer,et al. On Routing for Custom Integrated Circuits , 1982, DAC 1982.

[9] Margaret Lie,et al. A Bus Router for IC Layout , 1982, DAC 1982.

[10] Anderew S. Moulton. Laying the Power and Ground Wires on a VLSI Chip , 1983, 20th Design Automation Conference Proceedings.

[11] M. A. Breuer,et al. The Construction of Minimal Area Power and Ground Nets for VLSI Circuits , 1985, DAC 1985.

[12] S. Chowdhury,et al. Minimal area sizing of power and ground nets for VLSI circuits , 1986 .