Module 4 Mbist
Module 4 Mbist
Module 4 Mbist
D.P.Balsubramanian
SEMI-DFT
DEFECT,FAULT,FAILURE
• DEFECT
A defect in an electronic system is the unintended difference between the
implemented hardware and its intended design. Defects can be Process
Defects, Material Defects, Age Defects, and Package Defects.
• FAULT
A representation of a “defect” at the abstracted function level is called a
fault. A fault (or failure) can be either a hardware defect or a
software/programming mistake (bug).
• ERROR
A wrong output signal produced by a defective hardware at module level
is called an error. An error is an “effect” whose cause is some “defect.”
• FAILURE
A wrong output signal produced by a defective hardware at module level
is called an error. An error is an “effect” whose cause is some “defect.”
DEFECTS
Test Approaches
• Ad-hoc testing
• Structured Method
– Scan
– Partial Scan
– Built-in self-test
– Boundary scan
DFT
TESTABILITY:
A fault is testable if there exists a well-specified procedure (e.g., test pattern
generation, evaluation, and application) to expose it, and the procedure is
implementable with a reasonable cost using current technologies
Scan insertion
EDT
ATPG
ScanIn ScanOut
Out
In Combinational Combinational
egister
egister
Logic Logic
R
R
A B
Boundary SCAN
BIST Architecture
Memory model
Fault models
• Address Decoder faults
• Stuck at Faults
• Transition Faults
• Neighbourhood Pattern Sensitive Fault (NPSF)
– Active NPSF (ANPSF)
– Passive NPSF (PNPSF)
– Static NPSF (SNPSF)
• Coupling faults (CF s )
– Different t ypes of CFs
• Inversion CF(Cfin)
• Idempotent CF(Cfid)
• State CF(CFst)
• Dynamic CF(CFd)
Memory Fault models
Memory Fault models
Memory fault Model
Neighbourhood pattern sensitive fault
Address Decoder Fault
MBIST controller
MBIST Architectures
• (1) a hardwired-based
• (2) microcode-based
• (3) processor-based.
Hardwired Based
Micro code Architecture
Processor Based Architecture
Algorithms
• Two types
– Classical tests
– March-based tests
Classical Test Algorithm
• Classical test algorithms
(1) simple, fast but have poor fault coverage,
such as Zero-one, Checkerboard.
(2) have good fault coverage but complex and
slow, such as Walking, GALPAT, Sliding
Diagonal, Butterfly, MOVI.
Walking 1/0
• Writing a 1 at the first memory location and
writing a 0 in all other memory location
• Increment the memory address and shift the 1
by one position and remaining all bits to be 0
• Continue the above process until it reaches
the last memory location.
March-based Test Algorithms
• A March-based test algorithm is a finite
sequence of March elements. A March
element is specified by an address order and a
number of reads and writes.
• Since March-based tests are all simple and
possess good fault coverage, they are the
dominant test algorithms implemented in most
modern memory BIST.
• March-based tests are MATS, MATS+, Marching
1/0, March C-, March Y, March A, March B.
March C-(evolved March C)
• March C- is a classical algorithm which is the
foundation of other algorithms
• {(w0);(r0,w1);(r1,w0);(r0,w1); (r1,w0); (r0)}
• Complexity—5N=>O(N)
• ascending order
• descending order
• r0:read 0
• w1:write 1
• March Element (w0): M0
30
{(w0);(r0,w1);(r1,w0);(r0,w1); (r1,w0); (r0)}
M0 M1 M2 M3 M4 M5
31
{(w0);(r0,w1);(r1,w0);(r0,w1); (r1,w0); (r0)}
M0 M1 M2 M3 M4 M5
33
Test for Stuck-at, Transition and coupling
fault
Tools used commercially
• Mentor graphics –tessent shell
• Cadence
• synopsis
Thank you
wish you all Best luck!