On methods to match a test pattern generator to a circuit-under-test

  • Authors:
  • Irith Pomeranz;Sudhakar M. Reddy

  • Affiliations:
  • Electrical and Computer Engineering Department, University of Iowa, Iowa City, IA;Electrical and Computer Engineering Department, University of Iowa, Iowa City, IA

  • Venue:
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Autonomous circuits such as linear feedback shift registers (LFSR's) and cellular automata are used as low-cost test pattern generators for circuits testable by pseudo-random patterns. We demonstrate that different LFSR's of the same degree, started from different initial states, may yield significantly different fault coverages and test lengths when used as test pattern generators for a given circuit, especially when the circuit has faults which are hard to detect by a practical number of pseudo-random patterns. Methods to tailor an LFSR to a circuitunder-test are proposed, that attempt to select the most effective LFSR and initial state for the circuit. The first method is based on a learning process that can be applied directly to certain types of circuits. The learning process is also used to establish a collection of (primitive and nonprimitive) LFSR's and initial states, effective for arbitrary circuits. This collection can then be used as a starting point for a genetic optimization procedure aimed at improving the selected LFSR and initial state. The use of an LFSR that can apply complemented as well as uncomplemented test patterns is shown to significantly improve the fault coverage, at the cost of a small area overhead. Experimental results demonstrate the applicability of the proposed approaches to stuck-at faults and to transition faults.