Issue No. 04 - April (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.54847
<p>A method of partial scan design is presented in which the selection of scan flip-flops is aimed at breaking up the cyclic structure of the circuit. Experimental data are given to show that the test generation complexity may grow exponentially with the length of the cycles in the circuit. This complexity grows only linearly with the sequential depth. Graph-theoretic algorithms are presented to select a minimal set of flip-flops for eliminating cycles and reducing the sequential depth. Tests for the resulting circuit are generated by a sequential logic test generator. An independent control of the scan clock allows insertion of scan sequences within the vector sequence produced by the test generator. An independent control of the scan clock allows insertion of scan sequences within the vector sequences produced by the test generator. 98% fault coverage is obtained for a 5000-gate circuit by scanning just 5% of the flip-flops.</p>
graph theoretical algorithms; partial scan method; sequential circuits; feedback; scan flip-flops; sequential logic test generator; feedback; logic testing; sequential circuits.
V. Agrawal and K. Cheng, "A Partial Scan Method for Sequential Circuits with Feedback," in IEEE Transactions on Computers, vol. 39, no. , pp. 544-548, 1990.