Design for Small Delay Test - A Simulation Study

Kampmann, Matthias; Hellebrand, Sybille

doi:10.1016/j.microrel.2017.11.019

Cited by 2 publications

(1 citation statement)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kampmann and Hellebrand proposed a specialized SC con¯guration for FAST. 33 The algorithm relies on graph-based clustering, where the X-pro¯les for the considered FAST frequencies are represented by so-called scan graphs.…”

Section: Design For Fastmentioning

confidence: 99%

Divide and Compact — Stochastic Space Compaction for Faster-than-at-Speed Test

Sprenger

Hellebrand

2019

J CIRCUIT SYST COMP

Self Cite

View full text Add to dashboard Cite

With shrinking feature sizes detecting small delay faults is getting more and more important. But not all small delay faults are detectable during at-speed test. By overclocking the circuit with several different test frequencies faster-than-at-speed test (FAST) is able to detect these hidden delay faults. If the clock frequency is increased, some outputs of the circuit may not have stabilized yet, and these outputs have to be considered as unknown ([Formula: see text]-values). These [Formula: see text]-values impede the test response compaction. In addition, the number and distribution of the [Formula: see text]-values vary with the clock frequency, and thus a very flexible [Formula: see text]-handling is needed for FAST. Most of the state-of-the-art solutions are not designed for these varying [Formula: see text]-profiles. Yet, the stochastic compactor by Mitra et al. can be adjusted to changing environments. It is easily programmable because it is controlled by weighted pseudo-random signals. But an optimal setup cannot be guaranteed in a FAST scenario. By partitioning the compactor into several smaller ones and a proper mapping of the scan outputs to the compactor inputs, the compactor can be better adapted to the varying [Formula: see text]-profiles. Finding the best setup can be formulated as a set partitioning problem. To solve this problem, several algorithms are presented. Experimental results show that independent from the scan chain configuration, the number of [Formula: see text]-values can be reduced significantly while the fault efficiency can be maintained. Additionally, it is shown that [Formula: see text]-reduction and fault efficiency can be adapted to user-defined goals.

show abstract

Section: Design For Fastmentioning

confidence: 99%