Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-7918
|Title:||An analytical approach to the partial scan problem|
|metadata.ubs.publikation.source:||Journal of electronic testing 1 (1990), S. 163-174. URL http://dx.doi.org./10.1007/BF00137392|
|Abstract:||The scan design is the most widely used technique used to ensure the testability of sequential circuits. In this article it is shown that testability is still guaranteed, even if only a small part of the flipflops is integrated into a scan path. An algorithm is presented for selecting a minimal number of flipflops, which must be directly accessible. The direct accessibility ensures that, for each fault, the necessary test sequence is bounded linearly in the circuit size. Since the underlying problem is NP-complete, efficient heuristics are implemented to compute suboptimal solutions. Moreover, a new algorithm is presented to map a sequential circuit into a minimal combinational one, such that test pattern generation for both circuit representations is equivalent and the fast combinational ATPG methods can be applied. For all benchmark circuits investigated, this approach results in a significant reduction of the hardware overhead, and additionally a complete fault coverage is still obtained. Amazingly the overall test application time decreases in comparison with a complete scan path, since the width of the shifted patterns is shorter, and the number of patterns increase only to a small extent.|
|Appears in Collections:||15 Fakultätsübergreifend / Sonstige Einrichtung|
Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.