Embedded Memory Array Testing Using a Scannable Configuration (Special Section on VLSI Design and CAD Algorithms)
スポンサーリンク
概要
- 論文の詳細を見る
We have previously proposed a scannable memory configuration which is useful in testing logic blocks around memory arrays. Although the configuration is supposed to be effective in testing the memory array itself by its frequent read/write access during the scan operation, it has not been theoretically shown what types of faults can be detected. In this paper, from a viewpoint of memory testing, we investigate the testability of the scannable memory configuration and propose a memory array test using the scan path. It is shown that we can detect (1) all stuck-at faults in memory cells, (2) all stuck-at faults in address decoders, (3) all stuck-at faults in read/write logic, (4) static, dynamic and 2-coupling faults between memory cells of adjacent words, and (5) static coupling faults between memory cells in the same word. The test can be accomplished simply by comparing scan-in data and scan-out data. The test vector is 20×m + s bit long, where m is the number of words of the memory array under test and s is the total scan path length.
- 社団法人電子情報通信学会の論文
- 1997-10-25
著者
-
Ishiura Nagisa
The Department Information Systems Engineering Osaka University
-
Ishiura Nagisa
The Department Of Information Systems Engineering Osaka University
-
YANO Seiken
1st Computers Operations Unit, NEC Corp.
-
Yano S
Nagaoka Univ. Technol. Nagaoka‐shi Jpn
-
Yano Seiken
1st Computers Operations Unit Nec Corp.
関連論文
- Embedded Memory Array Testing Using a Scannable Configuration (Special Section on VLSI Design and CAD Algorithms)
- Application of Full Scan Design to Embedded Memory Arrays (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
- Architecture Evaluation Based on the Datapath Structure and Parallel Constraint (Special Section on VLSI Design and CAD Algorithms)
- Research Topics and Results on Simulation for VLSI (Special Section on Surveys of Reserches in CAS Fields in the Last Two Decadeses, I)