Afficher la notice abrégée
dc.creator | Karampatzakis, D. P. | en |
dc.creator | Evmorfopoulos, N. E. | en |
dc.creator | Stamoulis, G. I. | en |
dc.date.accessioned | 2015-11-23T10:33:15Z | |
dc.date.available | 2015-11-23T10:33:15Z | |
dc.date.issued | 2005 | |
dc.identifier | 10.1109/RME.2005.1542934 | |
dc.identifier.isbn | 9780780393455 | |
dc.identifier.isbn | 780393457 | |
dc.identifier.uri | http://hdl.handle.net/11615/29022 | |
dc.description.abstract | The problem of optimum design of general (tree or graph-based) power distribution networks with respect to the voltage drop effect is addressed in this paper. A rigorous formulation based on linear circuit theory is established for the relevant constrained optimization problem, so that the resultant network occupies the minimum possible area under specific voltage drop constraints at all IC functional blocks. The necessary maximum current estimates for the optimization procedure are accurately obtained - by statistical means - from recent advances in the field of extreme value theory. Experimental tests include the design of power grid for a choice of different topologies and voltage drop tolerances in a typical benchmark circuit. | en |
dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-33750351928&partnerID=40&md5=fefadd881b29b188d23a6725d3b224b5 | |
dc.subject | Circuit theory | en |
dc.subject | Electric potential | en |
dc.subject | Graph theory | en |
dc.subject | Integrated circuits | en |
dc.subject | Optimization | en |
dc.subject | Statistical methods | en |
dc.subject | Trees (mathematics) | en |
dc.subject | IC functional blocks | en |
dc.subject | Linear circuit theory | en |
dc.subject | Optimum design | en |
dc.subject | Voltage drop effect | en |
dc.subject | Electric power distribution | en |
dc.title | A statistically-based engine for P/G network optimization | en |
dc.type | conferenceItem | en |
Fichier(s) constituant ce document
Il n'y a pas de fichiers associés à ce document.
|
Ce document figure dans la(les) collection(s) suivante(s)
Afficher la notice abrégée