About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Paper
Pad Minimization for Planar Routing of Multiple Power Nets
Abstract
This paper discusses the problem of minimizing the number of power pads, in order to guarantee the existence of a planar routing of multiple power nets. We derive a general lower bound and discuss an heuristic for the general problem. We examine several important special cases, including the case of three power nets, and present optimal strategies for pad placement. We also show that the general pad minimization problem is NP-complete. © 1990 IEEE