scispace - formally typeset
Search or ask a question
Topic

Design for testing

About: Design for testing is a research topic. Over the lifetime, 3946 publications have been published within this topic receiving 63049 citations. The topic is also known as: Design for Testability, DFT.


Papers
More filters
Proceedings ArticleDOI
07 Aug 2002
TL;DR: The first report of a design of reconfigurable core wrappers is presented, which admits dynamic reconfiguration of core level scan access structures with little area and delay overhead and the quality of the SOC test schedule can be improved.
Abstract: Testing of embedded core based system-on-chip (SOC) ICs is a well known problem, and the upcoming IEEE P1500 (SECT) standard proposes DfT solutions to alleviate it. One of the proposals is to provide every core in the SOC with test access wrappers. Previous approaches to the problem of wrapper design have proposed static core wrappers, which are designed for a particular test access mechanism (TAM) width. We present the first report of a design of reconfigurable core wrappers. An automatic procedure for the creation of DfT required for reconfiguration using a graph theoretic representation of core wrappers is also presented. Our method is superior to previously published methods as it admits dynamic reconfiguration of core level scan access structures with little area and delay overhead. Using reconfigurable core wrappers the quality of the SOC test schedule can be improved. Theoretical analysis of the corresponding scheduling problem indicates that good approximate schedules can be achieved without significant computational effort.

21 citations

Journal ArticleDOI
TL;DR: Since the problem of test generation is NP-hard, a set of heuristics is introduced to keep the amount of computation reasonable; several implementation issues are finally investigated.
Abstract: The increasing complexity of VLSI systems demands structured approaches to reduce both design time and test generation effort. PLA's and scan paths have both been widely reported to be efficient in this sense. This correspondence presents an easily testable structure and its related testing strategies. The circuits are assumed to be based on the interconnection of combinatorial macros, mostly implemented by PLA's; tests are generated locally, considering the involved macro as an isolated item, and then are expressed in terms of primary inputs and outputs using a topological approach as general strategy and algebraic techniques for the propagation of signals through macros. Propagation is dealt with by new algorithms. Since the problem of test generation is NP-hard, a set of heuristics is introduced to keep the amount of computation reasonable; several implementation issues are finally investigated.

21 citations

Proceedings ArticleDOI
04 Mar 2002
TL;DR: A hierarchical test manager (HTM) is proposed to generate the control signals for these cores, taking into account the IEEE P1500 Standard proposal, and the hierarchical test control scheme has low area anti pin overhead, and high flexibility.
Abstract: System-on-chip (SOC) design methodology is becoming the trend in the IC industry. Integrating reusable cores from multiple sources is essential in SOC design, and different design-for-testability methodologies are usually required for testing different cores. Another issue is test integration. The purpose of this paper is to present a hierarchical test scheme for SOC with heterogeneous core test anti lest access methods. A hierarchical test manager (HTM) is proposed to generate the control signals for these cores, taking into account the IEEE P1500 Standard proposal. A standard memory BIST interface is also presented, linking the HTM and the memory BIST circuit. It can control the BIST circuit with the serial or parallel test access mechanism. The hierarchical test control scheme has low area anti pin overhead, and high flexibility. An industrial case using this scheme has been designed, showing an area overhead of only about 0.63%.

21 citations

Proceedings ArticleDOI
Yotsuyanagi1, Kuchii, Nishikawa, Hashizume, Kinoshita 
08 Dec 2003
TL;DR: Experimental results for benchmark circuits shows this scan method can reduce many scan shifts, and a fully compatible scan tree is configured.
Abstract: In this paper, a new method for reducing scan shifts is presented. Scan design is one of the most popular design for test technologies for sequential circuits. However, it requires much test application time and test data when applied to circuits with many flip-flops. The new scan method utilizes two configurations of scan chains, a folding scan tree and a fully compatible scan tree. A test pattern including many don't care values is used to configure a fully compatible scan tree in order to reduce the scan shift without degrading fault coverage. And then a folding scan tree is configured to reduce the length of the scan chain and thus reduce the scan shift. Experimental results for benchmark circuits shows this scan method can reduce many scan shifts.

21 citations

Proceedings ArticleDOI
07 Oct 1996
TL;DR: Experimental results show that the generated patterns achieve similar fault coverage as pseudo-random sequences and require about the same test length, so instead of adding LFSR-based test registers, arithmetic pattern generators are used and performance degradation is avoided.
Abstract: Adders, subtracters, ALUs, and multipliers, which are available in many data paths, can be utilized to generate test patterns for built-in self-test. In this paper guidelines for the design of arithmetic pattern generators are developed. Experimental results show that the generated patterns achieve similar fault coverage as pseudo-random sequences and require about the same test length. Hence, instead of adding LFSR-based test registers, arithmetic pattern generators can be used and performance degradation is avoided.

21 citations


Network Information
Related Topics (5)
CMOS
81.3K papers, 1.1M citations
85% related
Logic gate
35.7K papers, 488.3K citations
84% related
Integrated circuit
82.7K papers, 1M citations
84% related
Routing (electronic design automation)
41K papers, 566.4K citations
82% related
Benchmark (computing)
19.6K papers, 419.1K citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202314
202232
202119
202022
201945
201859