2006
DOI: 10.1016/j.micpro.2005.12.002
|View full text |Cite
|
Sign up to set email alerts
|

Verification and fault synthesis algorithm at switch-level

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
4
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 25 publications
0
4
0
Order By: Relevance
“…In previous research, [32] a novel fault synthesis algorithm for modelling CMOS circuits with an arithmetic solution for circuit verification and fault synthesis was introduced. This new approach is capable of simulating multiple fault injections into the circuit and speeds up switchlevel simulation.…”
Section: A Quick Review Of Fault Propagation In Transistor-levelmentioning
confidence: 99%
See 1 more Smart Citation
“…In previous research, [32] a novel fault synthesis algorithm for modelling CMOS circuits with an arithmetic solution for circuit verification and fault synthesis was introduced. This new approach is capable of simulating multiple fault injections into the circuit and speeds up switchlevel simulation.…”
Section: A Quick Review Of Fault Propagation In Transistor-levelmentioning
confidence: 99%
“…In the algorithm presented here, a graph model converts a transistor level model to a graph and is independent of circuit complexity. This graph model simplifies the use of the algorithm and fault injection[32][43][44]. In the graph model, nodes represent a transistor or a connection and the edges represent wires.…”
mentioning
confidence: 99%
“…In previous research, [32] a novel fault synthesis algorithm for modelling CMOS circuits with an arithmetic solution for circuit verification and fault synthesis was introduced. This new approach is capable of simulating multiple fault injections into the circuit and speeds up switchlevel simulation.…”
Section: A Quick Review Of Fault Propagation In Transistor-levelmentioning
confidence: 99%
“…In the algorithm presented here, a graph model converts a transistor level model to a graph and is independent of circuit complexity. This graph model simplifies the use of the algorithm and fault injection[32][43][44]. In the graph model, nodes represent a transistor or a connection and the edges represent wires.…”
mentioning
confidence: 99%