PROJECT TITLE :

LFSR-Based Generation of Multi cycle Tests - 2017

ABSTRACT:

This paper describes a procedure for computing a multicycle take a look at set whose scan-in states are compressed into seeds for a linear-feedback shift register, and whose primary input vectors are held constant during the applying of a multicycle test. The goal of computing multicycle tests is to supply check compaction that reduces both the check application time and therefore the test knowledge volume. To avoid sequential take a look at generation, the procedure uses a single-cycle take a look at set to guide the computation of multicycle tests. The procedure optimizes every multicycle check, and increases the quantity of faults it detects, by adjusting its seed, primary input vector, and number of purposeful clock cycles. Optimizing the seed instead of the scan-in state avoids the computation of scan-in states for which seeds don't exist. Experimental results for benchmark circuits are presented to demonstrate the effectiveness of the procedure.