The Community for Technology Leaders
Green Image
Issue No. 02 - Summer (1995 vol. 12)
ISSN: 0740-7475
pp: 24-31
<p>Existing flip-flop selection and test generation methods for partial scan designs assume the use of a separate scan clock. With a separate clock for the scan operation, the states of the non-scan flip-flops can be frozen during the scan operation and any state can be scanned into the scan register without affecting the states of the non-scan flip-flops. Under this assumption, test vectors can be efficiently generated by a sequential circuit test generator. However, this requirement results in the need for multiple clock trees and posts problems in routing of clock signals that, in general, are subject to a tight constraint on clock skew.</p> <p>In this article, we lift this assumption and address the problems of test generation, scan flip-flop selection and ordering of scan registers for partial scan designs that use the system clock for the scan operation. An existing test generation algorithm is modified to incorporate the scan-shifting concept for such designs. This modified test generation scheme also implicitly compacts the test vectors and results in significantly reduction in the length of test vectors as shown by our experimental results on ISCAS89 benchmark circuits. The test vectors generated by this method can be applied at speed and thus can also detect delay faults. We show that cycle breaking remains to be an effective heuristic for scan flip-flop selection for our test generation method. The ordering of scan flip-flops in the scan chain affects the final fault coverage for the new test generation method. We formulate the ordering problem as a combinatorial optimization problem. Experimental results on test generation and ordering of scan flip-flops are presented to show the effectiveness of our approaches.</p>
Sequential circuits, test generation, scan selection and ordering, partial scan designs

K. (. Cheng, "Single-Clock Partial Scan," in IEEE Design & Test of Computers, vol. 12, no. , pp. 24-31, 1995.
90 ms
(Ver 3.3 (11022016))