2007
DOI: 10.1109/mdt.2007.144
|View full text |Cite
|
Sign up to set email alerts
|

Raisin: Redundancy Analysis Algorithm Simulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 26 publications
(10 citation statements)
references
References 11 publications
0
10
0
Order By: Relevance
“…When the detected number of faults is equal to the number of faults stored in the first test, the test is stopped to reduce test time while the test algorithm is being completed in the second serial test. The test time is greatly reduced because most of the faults are detected by the first few read operations of a March test [21]. When the post-share redundancy scheme is adopted, the number of available redundancies is always equal to or larger than the number of spares for post-bond test-repair.…”
Section: B Test-repair Flow Of 3d Memoriesmentioning
confidence: 99%
“…When the detected number of faults is equal to the number of faults stored in the first test, the test is stopped to reduce test time while the test algorithm is being completed in the second serial test. The test time is greatly reduced because most of the faults are detected by the first few read operations of a March test [21]. When the post-share redundancy scheme is adopted, the number of available redundancies is always equal to or larger than the number of spares for post-bond test-repair.…”
Section: B Test-repair Flow Of 3d Memoriesmentioning
confidence: 99%
“…For ease of comparison, we assume the defects only result in single-cell failures, i.e., in the failure distribution, the per centages of row, column, and cluster failures are all 0, which is the same as in [33]. Note that if row, column, and cluster failures do exist in the stacking process, then we can adopt the configurable spare scheme [18] to increase the spare flexibil ity, which is beyond the scope of this paper.…”
Section: Die Matching Algorithmmentioning
confidence: 99%
“…When a circuit block incorporates redundancy and/or ECCs, the relationship between yield and defect density is not straightforward, and hence specialized software has been developed to analyze the yield of memories with redundancy and ECCs [34], [35]. Let's consider a simple example with just redundant word lines and single bit ECC correction on the word lines.…”
Section: B Memory Yield Modelingmentioning
confidence: 99%