Compact Test Sequences for Scan-Based Sequential Circuits (Special Section on VLSI Design and CAD Algorithms)
スポンサーリンク
概要
- 論文の詳細を見る
Full scan design of sequential circuits results in greatly reducing the cost of their test generation. However, it introduces the extra expense of many test clocks to control and observe the values of flip-flops because of the need to shift values for the flip-flops into the scan path. In this paper we propose a new method of generating compact test sequences for scan-based sequential circuits on the assumption that the number of shift clocks is allowed to vary for each test vector. The method is based on Boolean function manipulation using a shared binary decision diagram (SBDD). Although the test generation algorithm is basically for general sequential circuits, the computational cost is much lower for scan-based sequential circuits than for non-scan-based sequential circuits because the length of a test sequence for each fault is limited. Experimental results show that, for all the tested circuits, test sequences generated by the method require much smaller number of test clocks than compact or minimum test sets for combinational logic part of scan-based sequential circuits. The reduction rate was 48 on the average in the experiments.
- 社団法人電子情報通信学会の論文
- 1993-10-25
著者
-
Hamaguchi Kiyoharu
The Faculty Of Engineering Kyoto University
-
Yajima Shuzo
The Faculty Of Engineering Kyoto University
-
Higuchi Hiroyuki
the Faculty of Engineering, Kyoto University
-
Higuchi Hiroyuki
The Faculty Of Engineering Kyoto University
関連論文
- Compact Test Sequences for Scan-Based Sequential Circuits (Special Section on VLSI Design and CAD Algorithms)
- Manipulation of Large-Scale Polynomials Using BMDs (Special Section on VLSI Design and CAD Algorithms)
- Computational Power of Memory-Based Parallel Computation Models with Communication