ALGORITHM FOR WIRE SIZING OF POWER AND GROUND NETWORKS IN VLSI DESIGNS

1992 ◽  
Vol 02 (02) ◽  
pp. 141-157 ◽  
Author(s):  
ROBI DUTTA ◽  
MALGORZATA MAREK-SADOWSKA

Distributing power and ground to the elements present in a VLSI chip is a very crucial task in the design process. Power networks carry substantial currents and wires carrying them have to be carefully designed to avoid damage caused by electromigration and should not experience significant voltage drops. This paper presents a fast and efficient method for sizing power/ground networks. No restrictions on network topology or the number of supplying pads are imposed. Wire widths are calculated such that the weighted area of wire segments is minimized while electromigration and voltage drops constraints are fulfilled. The algorithm proposed here runs 50% faster for unrestricted topologies than the best methods reported in literature for tree type networks.


Author(s):  
Pedro C. Santana-Mancilla ◽  
Luis E. Anido-Rifón ◽  
Juan Contreras-Castillo ◽  
Raymundo Buenrostro-Mariscal

This paper presents the usability assessment of the design of an Internet of Medical Things (IoMT) system for older adults; the evaluation, using heuristics, was held early on the design process to assess potential problems with the system and was found to be an efficient method to find issues with the application design and led to significant usability improvements on the IoMT platform.



2012 ◽  
Vol 22 (10) ◽  
pp. 1250236 ◽  
Author(s):  
LIANG HUANG ◽  
YING-CHENG LAI ◽  
MARY ANN F. HARRISON

We propose a method to detect nodes of relative importance, e.g. hubs, in an unknown network based on a set of measured time series. The idea is to construct a matrix characterizing the synchronization probabilities between various pairs of time series and examine the components of the principal eigenvector. We provide a heuristic argument indicating the existence of an approximate one-to-one correspondence between the components and the degrees of the nodes from which measurements are obtained. The striking finding is that such a correspondence appears to be quite robust, which holds regardless of the detailed node dynamics and of the network topology. Our computationally efficient method thus provides a general means to address the important problem of network detection, with potential applications in a number of fields.



Author(s):  
Reza Razzaghi ◽  
Gaspard Lugrin ◽  
Hossein Mahmoudimanesh ◽  
Carlos Romero ◽  
Mario Paolone ◽  
...  


2003 ◽  
Vol 142 (4) ◽  
pp. 34-44
Author(s):  
Koji Hosaka ◽  
Takeshi Goya ◽  
Daisuke Umehara ◽  
Makoto Kawai


2013 ◽  
Vol 28 (3) ◽  
pp. 1663-1673 ◽  
Author(s):  
R. Razzaghi ◽  
G. Lugrin ◽  
H. M. Manesh ◽  
C. Romero ◽  
M. Paolone ◽  
...  


2018 ◽  
Vol 45 (12) ◽  
pp. 1319-1328
Author(s):  
Jinsoo Kim ◽  
Haengrok Oh


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 2032-2041 ◽  
Author(s):  
Claudia Caro-Ruiz ◽  
Ameena Saad Al-Sumaiti ◽  
Sergio Rivera ◽  
Eduardo Mojica-Nava


2002 ◽  
Vol 122 (2) ◽  
pp. 208-216
Author(s):  
Koji Hosaka ◽  
Takeshi Goya ◽  
Daisuke Umehara ◽  
Makoto Kawai


Sign in / Sign up

Export Citation Format

Share Document