This research explores a new delay test set, called a delay- verification test set, which detects the presence of any path delay faults that can affect the timing of the circuit. The approach is to find necessary and sufficient conditions for delay verifiability; i.e., the existence of a complete delay-verification test set. Algorithms for the synthesis of area-efficient, delay- verifiable circuits and the generation of delay verification test sets are being developed. A second topic being explored is a design and test methodology for sequential circuits without scan latches in functional paths. A method, based on clock suppression, is being used to generate transitions on state variables for delay testing. State assignment techniques to improve delay-fault testability without scan and clock suppression are being investigated.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9320886
Program Officer
Robert B Grafton
Project Start
Project End
Budget Start
1994-06-01
Budget End
1997-11-30
Support Year
Fiscal Year
1993
Total Cost
$89,997
Indirect Cost
Name
University of Massachusetts Amherst
Department
Type
DUNS #
City
Amherst
State
MA
Country
United States
Zip Code
01003