International Test Conference 1988 Proceeding@m_New Frontiers in Testing
DOI: 10.1109/test.1988.207820
|View full text |Cite
|
Sign up to set email alerts
|

Fault modeling and test algorithm development for static random access memories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
34
0

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 150 publications
(34 citation statements)
references
References 10 publications
0
34
0
Order By: Relevance
“…Testing them under worst case conditions (called 'burn-in') to accelerate failure is also not very reliable because it is known precisely how chips age under burn-in conditions with regard to static data losses. Dekker [7,8] described how to detect static data losses in SRAMs with 100 GO resistors as pull-up devices. Dekker noticed a broken pull-up resistor to cause a static data loss in about 100 ms.…”
Section: Testing For Static Data Lossmentioning
confidence: 99%
See 1 more Smart Citation
“…Testing them under worst case conditions (called 'burn-in') to accelerate failure is also not very reliable because it is known precisely how chips age under burn-in conditions with regard to static data losses. Dekker [7,8] described how to detect static data losses in SRAMs with 100 GO resistors as pull-up devices. Dekker noticed a broken pull-up resistor to cause a static data loss in about 100 ms.…”
Section: Testing For Static Data Lossmentioning
confidence: 99%
“…Variations in process parameters are seen to result in delay faults. Another peculiar fact observed in GaAs SRAMs is that data retention faults have an entirely new mechanism, apart from the stuck-open mechanism observed in silicon [7,14]. Parametric test procedures for these faults are described shortly.…”
Section: Faults In Gallium Arsenide (Gaas) Srams and Their Testingmentioning
confidence: 99%
“…Several innovative test algorithms for random access memories have been reported [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17]. These algorithms can be categorized into two classes.…”
mentioning
confidence: 99%
“…One set of algorithms is based on the memory fault model as given by Nair, Thatte and Abraham [3]. The representative papers are [3][4][5][6][7][8][9][10][11]. A second class of test algorithms is based on the pattern sensitive neighborhood cell fault model of Hayes [12][13].…”
mentioning
confidence: 99%
“…In addition, tests for NPSFs do not detect many of the classical faults which also apply to SRAMs [3]; e.g., address decoder faults 'AFs', data retention faults 'DRFs' [9], stuck-open faults 'SOFs' [9], and coupling faults. Pseudo-random memory tests [10,11] do not require knowledge of the physical topology of the memory cell array and can be applied to memories with w-bit words (w 2); however, they have the disadvantage that their fault coverage is probabilistic.…”
Section: Introductionmentioning
confidence: 99%