MBIST

ALGORITHM
FAULTS SAF AF TF CF COMPLEX
ALGOTITH
M
MATS D X X X 4N

MATS2 D 1/2 1/2 X 4N

MATS+ D D 1/2 X 5N

MATS++ D D D X 6N

MARCHX D D D CIN 6N
Algorithm Name Complexity Targeted Faults

march1 (MarchC-) 10n AF, SAF, TF, CFin, CFid, and CFst

march2 (MarchC+) 14n AF, SAF, TF, SOF, CFin, and CFid

march3 10n AF, SAF, SOF, and TF

col_march1 (MarchC-) 10n AF, SAF, TF, CFin, CFid, and CFst

unique 5n SAF

checkerBoard
4n BF
(topChecker)
 MATS
SAF AF TF CF COMPLEX
D X X X 4N

W1 R1

W0 R0 W1 R0
W0 R0
S@0 S@1

0 0 1 1 1 0
0 1 1 0
0 1 1
0 0 0
0 1
0 1 1 1
0 1
0 1 1 0
0 1
 MATS2

W0 R0 W1 R1 W1 R1 W0 R0
ADDRESS FAULT
AND TYPE A B
OR TYPE G B GB
GOOD BAD 0 0
OR TYPE
00 01 11 11
0 GOOD BAD
1 0 1 AND TYPE 00 00 10 11
A 0 1 0
1 1 0
1 1

B 1 0 W1 R1

W0 R0
 MATS2
SAF AF TF CF COMPLEX
D 1/2 1/2 X 4N

W0 R0 W1 R0 W1 R1 W0 R0

W1 R1
0 0 W1 R1 1 1
W0 R1
0 W0 R0
1
0 1
0 1
0 1
0 0 1 1 1 0
0 0 1 1 1 0
 MATS+
SAF AF TF CF COMPLEX
D D 1/2 X 5N

W0 R0 W1 R1 W0

W1 R1

W0 R0
 MATS++
SAF AF TF CF COMPLEX
D D D X 4N

W0 R0 W1 R1 W0 R0

W0 R0

W0 R0
W0 R0
 MARCH X
SAF AF TF CF COMPLEX
•D• D D Cin 6N

W0 R0 W1 R1 W0 R0
FAULT GOOD FAULT GOOD
0 0 1 1 0 0
W1 R1
1
W0 R0
W0 R0 0 1 1
0 1 1 0
0
0 1 0 0
0 1
0 1 1 0
0 0
 Marchc algorithm
• The MarchC algorithm detects address decoder faults (AF), stuck at faults (SAF), transition
faults (TF), idempotent coupling faults (CFid), and inversion coupling faults (CFin).
This algorithm, which consists of 11 operations (11n), writes and reads words of 0s, followed
by writing/reading words of 1s, in both descending and ascending address spaces
 MODIFIED MARCH C ALGORITHM
• The MarchC+ (March2) algorithm detects address decoder faults (AF), stuck at
faults (SAF),
transition faults (TF), stuck open faults (SOF), inversion coupling faults (CFin), and
linked
idempotent coupling faults (CFid)
 Checkerboard (TopChecker)

The checkerboard algorithm divides the cells into two groups (cells_1 and cells_2),
such that every neighboring cell is in a different group. Figure 4-17 shows how this
process forms the memory cells into a checkerboard pattern. The algorithm then
writes (and reads) 0s into all cells in the cells_1 group and 1s into all cells in the cells_2
group. The algorithm repeats this process by writing (reading) 1s into cells_1 cells and
0s into cells_2 cells.

1 0 1 0 cells_1 = 0
0 1 0 1 cells_2 = 1
1 0 1 0

0 1 0 1