{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}



Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
170 VLSI Test Principles and Architectures TABLE 4.2 ± OR Operation OR 01 D DX 0 0 1 D D X 1 1 1 1 1 1 D D 1 D 1 X D D 1 1 D X X X 1 X X X TABLE 4.3 ± NOT Operation NOT 0 1 1 0 D D D D X X Algorithm 1 Naive ATPG ±C²f ³ 1: while a fault-effect of f has not propagated to a PO and all possible vector combinations have not been tried do 2: pick a vector, v , that has not been tried; 3: fault simulate v on the circuit C with fault f ; 4: end while Note that in an ATPG, the worst-case computational complexity is exponential, as all possible input patterns may have to be tried before a vector is found or that the fault is determined to be undetectable. One may go about line #2 of the algorithm in an intelligent fashion, so a vector is not simply selected indiscriminately. Whether or not intelligence is incorporated, some mechanism is needed to account for those
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
  • Spring '08
  • elbarki
  • Computational complexity theory, search space, input vector, input vectors, primary input, possible input patterns

{[ snackBarMessage ]}

Ask a homework question - tutors are online