Since semiconductor memory chip has been growing rapidly in its capacity, memory testing has become a crucial problem in RAMs. This paper proposes a new RAM test algorithm, called generalized marching test (GMT), which detects static and dynamic pattern sensitive faults (PSF) in RAM chips. The memory array with N cells is partitioned into B sets in which every two cells has a cell-distance of at least d. The proposed GMT performs the ordinary marching test in each set and finally detects PSF having cell-distance d. By changing the number of partitions B, the GMT includes the ordinary marching test for B
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Masahiro HASHIMOTO, Eiji FUJIWARA, "Generalized Marching Test for Detecting Pattern Sensitive Faults in RAMs" in IEICE TRANSACTIONS on Information,
vol. E76-D, no. 7, pp. 809-816, July 1993, doi: .
Abstract: Since semiconductor memory chip has been growing rapidly in its capacity, memory testing has become a crucial problem in RAMs. This paper proposes a new RAM test algorithm, called generalized marching test (GMT), which detects static and dynamic pattern sensitive faults (PSF) in RAM chips. The memory array with N cells is partitioned into B sets in which every two cells has a cell-distance of at least d. The proposed GMT performs the ordinary marching test in each set and finally detects PSF having cell-distance d. By changing the number of partitions B, the GMT includes the ordinary marching test for B
URL: https://globals.ieice.org/en_transactions/information/10.1587/e76-d_7_809/_p
Copy
@ARTICLE{e76-d_7_809,
author={Masahiro HASHIMOTO, Eiji FUJIWARA, },
journal={IEICE TRANSACTIONS on Information},
title={Generalized Marching Test for Detecting Pattern Sensitive Faults in RAMs},
year={1993},
volume={E76-D},
number={7},
pages={809-816},
abstract={Since semiconductor memory chip has been growing rapidly in its capacity, memory testing has become a crucial problem in RAMs. This paper proposes a new RAM test algorithm, called generalized marching test (GMT), which detects static and dynamic pattern sensitive faults (PSF) in RAM chips. The memory array with N cells is partitioned into B sets in which every two cells has a cell-distance of at least d. The proposed GMT performs the ordinary marching test in each set and finally detects PSF having cell-distance d. By changing the number of partitions B, the GMT includes the ordinary marching test for B
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Generalized Marching Test for Detecting Pattern Sensitive Faults in RAMs
T2 - IEICE TRANSACTIONS on Information
SP - 809
EP - 816
AU - Masahiro HASHIMOTO
AU - Eiji FUJIWARA
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E76-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 1993
AB - Since semiconductor memory chip has been growing rapidly in its capacity, memory testing has become a crucial problem in RAMs. This paper proposes a new RAM test algorithm, called generalized marching test (GMT), which detects static and dynamic pattern sensitive faults (PSF) in RAM chips. The memory array with N cells is partitioned into B sets in which every two cells has a cell-distance of at least d. The proposed GMT performs the ordinary marching test in each set and finally detects PSF having cell-distance d. By changing the number of partitions B, the GMT includes the ordinary marching test for B
ER -