2009 Asian Test Symposium 2009
DOI: 10.1109/ats.2009.87
|View full text |Cite
|
Sign up to set email alerts
|

New Algorithms for Address Decoder Delay Faults and Bit Line Imbalance Faults

Abstract: Due to the rapid decrease of technology feature size speed related faults, such as Address Decoder Delay Faults (ADDFs), are becoming very important. In addition, increased leakage currents demand for improved tests for Bit Line Imbalance Faults (BLIFs)(caused by memory cell pass transistor leakage). This paper contributes to new and improved algorithms for detecting these faults. First it provides an improved version of existing GalPat algorithm and introduces two new algorithms to detect ADDFs; the paper als… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…E.g., for N =3 there are 6 CMs: 012, 021, 102, 120, 210, and 201. For memory testing, the AG has to generate several CMs, since each CM has its own fault detection capability [3], [6], [8], [9], [11], [20]. For this paper, the most common, and important, CMs will be considered; they are explained next.…”
Section: Address Generator Requirementsmentioning
confidence: 99%
See 1 more Smart Citation
“…E.g., for N =3 there are 6 CMs: 012, 021, 102, 120, 210, and 201. For memory testing, the AG has to generate several CMs, since each CM has its own fault detection capability [3], [6], [8], [9], [11], [20]. For this paper, the most common, and important, CMs will be considered; they are explained next.…”
Section: Address Generator Requirementsmentioning
confidence: 99%
“…In the world of MBIST, memory accesses have to be applied at-speed, using Back-to-Back (BtB) memory cycles [2]- [5], [7]- [9]. Systems require large, high speed memories, while current technology exhibits a large spread in implementation parameters, resulting in speed-related (i.e., delay) faults [3], [8], [11], [19]. Their detection is mandatory in today's industry [2], [4], [6], [20], and requires non-linear algorithms such as GalPat, GalRow and GalColumn, and a special Address Generator (AG).…”
Section: Introductionmentioning
confidence: 99%
“…Sequences constituting of SIC pairs have been also applied to the testing of RAMs, to test either for address decoder faults [33], [34], or for pattern sensitive faults in memory cells [35], [36]. Due to the fact that only one bit changes between two consecutive vectors-therefore reducing the consumed energy-SIC sequences have been also utilized in low-power testing [37], [38], [39].…”
Section: Introductionmentioning
confidence: 99%
“…In addition, memories are more susceptible to defects, and hence, to faults due to that they are designed with minimal design rule tolerances. In memory BIST, accesses are performed at-speed [2]- [5], [7]- [9], while the technology (45 nm and beyond) results in speed-related faults [3,8,11,19]. Therefore low-cost, memory BIST schemes should support a variety of algorithms, while allowing for a simple implementation.…”
Section: Introductionmentioning
confidence: 99%
“…Hence, the detection of different memory fault classes requires different address generators [3,6,8,9,11,20]. Table 1 highlights two of the most well-established counting methods by giving an example for a memory with N=4 words.…”
Section: Introductionmentioning
confidence: 99%