IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.
DOI: 10.1109/iccad.2004.1382626
|View full text |Cite
|
Sign up to set email alerts
|

Fast flip-chip power grid analysis via locality and grid shells

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
93
0

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 110 publications
(95 citation statements)
references
References 6 publications
2
93
0
Order By: Relevance
“…The incremental auxiliary drops caused by a current source keeps on decreasing as we move away from it. This is related to the concept of grid locality, which states that the effect of a current source diminishes as we move away from it [7]. Practically, these drops become so small after a few hops away that there is no point in computing them.…”
Section: Computing Auxiliary Dropsmentioning
confidence: 99%
“…The incremental auxiliary drops caused by a current source keeps on decreasing as we move away from it. This is related to the concept of grid locality, which states that the effect of a current source diminishes as we move away from it [7]. Practically, these drops become so small after a few hops away that there is no point in computing them.…”
Section: Computing Auxiliary Dropsmentioning
confidence: 99%
“…Examples of perturbations to a power network include changes to the wire conductances (e.g., when the length or thickness of the wires change), power pad placement, or current loads. For a small perturbation the solution of the perturbed system is close to the initial solution, meaning that the change in the solution of most of the nodes of the network is insignificant [5].…”
Section: Introductionmentioning
confidence: 99%
“…Even in the case that PCA cost is not acceptable, a region that is modeled at a time is reduced with a sacrifice of accuracy. However, power-voltage variation has a property of locality [17], and the local region is smaller than a chip, and hence the accuracy loss is thought to be limited. On the other hand, the execution time of Box-Cox transformation for 2000 variables each of which has 2000 samples was 37.5 s. The complexity of Box-Cox transformation (O(mn)) is lower than that of PCA (O(n 3 )), and hence the cost of Box-Cox transformation is not dominant even when the number of variables increases.…”
Section: ) Gaussianizationmentioning
confidence: 99%