1991
DOI: 10.1007/978-1-4615-3958-2
|View full text |Cite
|
Sign up to set email alerts
|

Neural Models and Algorithms for Digital Testing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0
12

Year Published

1991
1991
2024
2024

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(33 citation statements)
references
References 0 publications
0
21
0
12
Order By: Relevance
“…This expression has the same form as the energy function of a neural network. We recently presented energy minimization solutions of the test generation problem [13]. By combining these results, in the future, it may become possible to establish equivalence between direct-search (e.g., D-algorithm, Podem), energy minimization (including simulated annealing), and logic transformation (as presented in this paper) methods.…”
Section: Resultsmentioning
confidence: 94%
See 1 more Smart Citation
“…This expression has the same form as the energy function of a neural network. We recently presented energy minimization solutions of the test generation problem [13]. By combining these results, in the future, it may become possible to establish equivalence between direct-search (e.g., D-algorithm, Podem), energy minimization (including simulated annealing), and logic transformation (as presented in this paper) methods.…”
Section: Resultsmentioning
confidence: 94%
“…Model for a Boolean Gate: The energy function for an AND gate with input signals 2 1 and 2 2 , and output signal 2 3 is given by [13]: N D ( 2 3 7 2 1 , 2 and 23 can assume only binary values. All operations are arithmetic and not Boolean.…”
Section: Conflict Graphs Of Boolean Gatesmentioning
confidence: 99%
“…The term combinational circuits is used for circuits with only Boolean logic gates. Methods using energy minimization [9], [10], Boolean satisfiability [11], and binary decision diagrams [12], [13] have been recently proposed for generating tests for large combinational circuits. These methods are fast and practical, and share the following similarities: 1) they represent logic values on signals by Boolean variables, 2) they construct energy functions or satisfiability expressions using these Boolean variables, and 3) they solve the energy minimization or the satisfiability problem to obtain a set of Boolean values for the variables, and this set corresponds to a test for the fault.…”
Section: Introductionmentioning
confidence: 99%
“…The logical implications are expressed as edges. The binary relationships obtained from Equation 1 can be represented in the implication graph of directed edges as shown in Figure 1 [1,3,7]. An enhanced implication graph (EIG) was proposed by Henftling et al [18,37].…”
Section: Prior Workmentioning
confidence: 99%
“…Faultdependent techniques are mainly ATPG based methods [4,8,12,15,21,22,31,32,33,36], which target a particular fault at a time. Larrabee [23,24], starting with the Boolean difference and Chakradhar et al [5,7,9], with the neural network model, arrived at the satisfiability formulation of the ATPG problem. Both solved the problem with the help of implication graphs.…”
Section: Introductionmentioning
confidence: 99%