MUST: Multiple-Stem Analysis for Identifying Sequentially Untestable Faults

  • Authors:
  • Qiang Peng;Jacob Savir

  • Affiliations:
  • -;-

  • Venue:
  • ITC '00 Proceedings of the 2000 IEEE International Test Conference
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper we present MUST-a multiple-stem analysis algorithm for identifying untestable faults is the mosttime-consuming part of a sequential ATPG.MUST extends the scope of the single-stem analysis done inthe FIRES algorithmby identifying additional untestablefaults that cannot be found by single-stem analysis.