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

Efficient DC fault simulation of nonlinear analog circuits: one-step relaxation and adaptive simulation continuation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 16 publications
0
10
0
Order By: Relevance
“…The runs are unrelated, i.e., every fault transient run simulates the entire time interval without any reuse of the knowledge obtained from the golden and previous fault runs. One ingredient of our fast fault simulation is the reuse of the already obtained simulation data, especially from the golden run (see also Shi et al, 2006), where this was applied for DC fault simulation). Topological differences between a fault and the golden circuit description are minor and local (one resistor of difference only).…”
Section: Simultaneous Fault Simulationmentioning
confidence: 99%
See 1 more Smart Citation
“…The runs are unrelated, i.e., every fault transient run simulates the entire time interval without any reuse of the knowledge obtained from the golden and previous fault runs. One ingredient of our fast fault simulation is the reuse of the already obtained simulation data, especially from the golden run (see also Shi et al, 2006), where this was applied for DC fault simulation). Topological differences between a fault and the golden circuit description are minor and local (one resistor of difference only).…”
Section: Simultaneous Fault Simulationmentioning
confidence: 99%
“…At a particular time point we can reuse generated matrices and even their decomposed versions for all circuit models whose signals do not differ much from the golden run. We can apply the Sherman-Morrison-Woodbury formula (Householder, 1957) to update the inverse matrix, which improves the efficiency of the solver (Shi et al, 2006). Ideally, if a particular fault result is almost the same as the golden run, we could obtain the solution almost instantly (almost no additional efforts are required).…”
Section: Simultaneous Fault Simulationmentioning
confidence: 99%
“…In this method, a circuit netlist is abstracted to a gate-level or a RTL (Register-TransferLevel) model, and faults are injected structurally at the abstract model. The advantage of this approach is that it can predict faulty behaviors effectively using a structural fault model [9]. However, as explained in the previous section, the defect-based fault simulation of analog circuits requires long simulation time due to the difficulty in abstracting the fault model to higher level.…”
Section: Previous Workmentioning
confidence: 99%
“…To resolve this issue, there have been various studies to reduce the analog fault simulation time by reducing the complexity of the simulation algorithm. In [9], the authors present the method to speed up the DC fault simulation time of nonlinear analog circuits by reducing the complexity of Newton-Raphson iteration and fault ordering. Recently, Liu et al [2] proposed an hierarchical process variability analysis technique with information reuse to reduce the time required to perform fault simulation and test selection.…”
Section: Previous Workmentioning
confidence: 99%
“…It uses March algorithms with a ( 2 ) complexity. Was proposed Simulation Fault methods, like Distributed Fault Simulation [14], z-Diagnostic [15], Dynamic Fault Clustering [16], One-Step Relaxation and Adaptive Simulation Continuation [17]. All these simulation programs require prior knowledge of hardware description languages such HDL, proprietary scripts or C code to develop their functions.…”
Section: Introductionmentioning
confidence: 99%