Power/ground networks in VLSI: are general graphs better than trees?

Abstract Power/ground nets in VLSI usually cover a large portion of chip area due to a considerable power consumption of the chips. For multi-layer power/ground networks containing either trees or general graphs, it is an important question whether trees or general graphs can be realized with less total routing area while satisfying identical reliability constraints. In this paper we prove that a general graph (containing at least one loop) can always be replaced by a set of trees with the same or less total routing area, when imposing voltage drop and current density constraints on the power/ground nets and modeling these nets by a resistive network. Moreover every tree with several pads can be replaced by a set of trees, each having only one pad, with the same or less total routing area. Among the trees with only one pad, those trees are area-minimal which have an optimal sizing and contain only tree components with homogeneous current densities. All these statements cannot be generalized to the case of considering minimum width constraints in addition to the voltage drop and current density constraints. To prove the main theorems of the paper, we apply constructive methods, which can be used in CAD tools to optimize given power/ground networks.

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

[2]  Dieter A. Mlynski,et al.  Computation of Power Supply Nets in VLSI Layout , 1981, 18th Design Automation Conference.

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

[4]  M. Breuer,et al.  Minimal area design of power/ground nets having graph topologies , 1987 .

[5]  Christian Masson,et al.  Object oriented lisp implementation of the CHEOPS VLSI floor planning and routing system , 1991, 28th ACM/IEEE Design Automation Conference.

[6]  Donald S. Fussell,et al.  NEW AREA-EFFICIENT POWER ROUTING ALGORITHM FOR VLSI LAYOUT. , 1987 .

[7]  K.-H. Erhard,et al.  Topology optimization techniques for power/ground networks in VLSI , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

[8]  Malgorzata Marek-Sadowska,et al.  Automatic Sizing of Power/Ground (P/G) Networks in VLSI , 1989, 26th ACM/IEEE Design Automation Conference.

[9]  H. Cai.  Multi-pads, single layer power net routing in VLSI circuits , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[10]  Chak-Kuen Wong,et al.  Planar topological routing of pad nets , 1991, Integr..

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

[12]  Melvin A. Breuer,et al.  Optimum design of IC power/ground nets subject to reliability constraints , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  S. Chowdhury.  An Automated Design of Minimum-Area IC Power/Ground Nets , 1987, 24th ACM/IEEE Design Automation Conference.

[14]  Reiner Kolla.  Minimal Area Sizing of Power Supply Nets in VLSI Circuits , 1990, J. Inf. Process. Cybern..

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

[16]  S. Chowdhury.  Optimum Design of Reliable IC Power Networks Having General Graph Topologies , 1989, 26th ACM/IEEE Design Automation Conference.