Principles of CMOS VLSI design: a systems perspective
Principles of CMOS VLSI design: a systems perspective
Minimal area sizing of power and ground nets for VLSI circuits
Proceedings of the fourth MIT conference on Advanced research in VLSI
An automated design of minimum-area IC power/ground nets
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Hierarchical design based on a calculus of nets
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
The construction of minimal area power and ground nets for VLSI circuits
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Power distribution topology design
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
A graphical system for hierarchical specifications and checkups of VLSI circuits
EURO-DAC '90 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
We present a simple dynamic programming approach to find minimum area sizings of power supply nets in VLSI circuits in time O((ΔA)2n), where n is the number of modules and ΔA is the difference between an upper bound of the area and the lower bound resulting from minimum feature size and electromigration constraints. In opposition to known algorithms from literature ([2,3,4]), this algorithm determines an integer solution and has time and space bounds which can be predicted before running the algorithm. Some heuristics for computing upper bounds and reducing time and space requirements as well as first experimental experiences are included.