2011
DOI: 10.1109/tcad.2011.2158433
|View full text |Cite
|
Sign up to set email alerts
|

Dual Algorithms for Vectorless Power Grid Verification Under Linear Current Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
14
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(14 citation statements)
references
References 15 publications
0
14
0
Order By: Relevance
“…For each node 1 ≤ j ≤ n I: Compute c j,k = v(k t)| I( t)=e j , I(p t)=0,∀2≤p≤k , (14) ∀1 ≤ k ≤ N ts ; Moreover, the optimization problem (7) can also be decomposed similarly by using (13) as the objective function. For each node 1 ≤ j ≤ n I: Compute c j,k =v(k t)| I(p t)=e j ,∀1≤p≤k ,∀1≤k≤N ts ;…”
Section: Problem Decompositionmentioning
confidence: 99%
See 1 more Smart Citation
“…For each node 1 ≤ j ≤ n I: Compute c j,k = v(k t)| I( t)=e j , I(p t)=0,∀2≤p≤k , (14) ∀1 ≤ k ≤ N ts ; Moreover, the optimization problem (7) can also be decomposed similarly by using (13) as the objective function. For each node 1 ≤ j ≤ n I: Compute c j,k =v(k t)| I(p t)=e j ,∀1≤p≤k ,∀1≤k≤N ts ;…”
Section: Problem Decompositionmentioning
confidence: 99%
“…For efficient verification of power grids, [11] uses an approximate inverse technique to generate a reduced-size LP problem for each node, [12] designs a hierarchical matrix inversion algorithm to compute the inverse of the power grid matrix, [13] and [14] propose convex dual algorithms to solve the LP problem fast, [15] exploits the dominance relations among node voltage noises to reduce the number of LP problems, and [16] proposes a fast approach to compute the bounds of voltage noises in an RLC power grid. Moreover, it is proposed in [17] that the VDD network and the GND network of the power grid should be verified together, because their voltage noises have mutual effect through the decoupling capacitors.…”
mentioning
confidence: 99%
“…The initial study [13] considered the DC analysis model, and it was extended to verify RC power grids in [8]. Since solving the linear programs is very expensive, [3] proposed to generate a reduced-size linear program for each node by using an approximate inverse technique; [17] and [19] designed convex dual algorithms to solve the linear programs efficiently; [1] utilized the dominance relations among nodal voltage drops to reduce the number of linear programs to be solved; [12] and [5] used macromodeling technique to simplify the linear programs for efficient incremental verification. Besides, [6] proposed to verify VDD network and ground network together with additional current conservation constraints in order to consider the mutual effects in between.…”
Section: Introductionmentioning
confidence: 99%
“…To enable early power grid verification, vectorless verification approaches have been proposed [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17]. These approaches use linear current constraints to restrict the feasible set of all possible current waveforms, then solve linear programming (LP) problems to evaluate the worst-case voltage noise.…”
Section: Introductionmentioning
confidence: 99%
“…The initial vectorless approach [7] considers the DC analysis model, and it is extended to handle RC and RLC power grids in [8] and [9], respectively. Reference [10] uses an approximate inverse technique to generate a reduced-size LP problem for each node, [11] designs a hierarchical matrix inversion algorithm to compute the inverse of the power grid matrix, [12] and [13] propose convex dual algorithms to solve the LP problem fast. Besides, wavelet analysis is employed in [14] to characterize current excitations in order to identify the worst-case voltage fluctuations.…”
Section: Introductionmentioning
confidence: 99%