Mbist Summary
Mbist Summary
#
# MBIST
#
################################################
Challenge:
it requires test logic to multiplex and route memory pins to external pins
requires very large external pattern sets for acceptable test coverage due to
the size and density of the cell array-and its associated faults
MBIST:
self-testing and repair mechanism
set of algorithms to detect possibly all the faults
stuck-at (SAF),
transition delay faults (TDF),
coupling (CF) or
neighborhood pattern sensitive faults (NPSF)
Address decoder faults
row and address decoders determine the cell address that needs to be accessed
corresponding row and column get selected
which then get connected to sense amplifier
sense amplifier amplifies and sends out the data
write:
can access the required cell where the data needs to be written
Special circuitry is used to write values in the cell from the data bus
For the decoders, we test the soc verification functionality
whether they can access the desired cells based on the address in the
address bus
For the amplifier and the driver, check if they can pass the values to
and from the cells correctly
Testing:
implements a finite state machine (FSM)
to generate stimulus and
analyze the response coming out of memories
This extra self-testing circuitry
acts as the interface between high-level system and memory
MBIST Algorithms:
Checkerboard :
1s and 0s are written into alternate memory locations
checkerboard pattern is mainly used for activating failures resulting from
leakage,
shorts between cells,
and SAF
Steps:
Write checkerboard with up addressing order
Read checkerboard with up addressing order
Write inverse checkerboard with up addressing order
Read inverse checkerboard with up addressing order
March :
various types of March tests with different fault coverages
applies patterns that “march” up and down the memory address
while writing values to and reading values from known memory locations
retrive proper parameters from the memory model,
also determine the size and the word length of memory
targets faults like
Stuck-At,
Transition,
Address faults,
Inversion, and
Idempotent coupling faults
Steps:
increasing address:
write 0s with up addressing order (to initialize)
Read 0s, write 1s with up addressing order
Read 1s, write 0s with up addressing order
decreasing address:
Read 0s, write 1s with down addressing order
Read 1s, write 0s with down addressing order
Read 0s with down addressing order
BISR:
Memories occupy a large area
but have a smaller feature size
=> memories have a significant impact on yield
redundant or spare rows and columns to avoid yield loss
row repair and column repair
Memory repair:
1.analyze the failures diagnosed by the MBIST Controller
(during the test for repairable memories)
2.determine the repair signature to repair the memories
(All repairable memories have repair registers which hold the repair
signature)
BIRA:
to calculate the repair signature based on
memory failure data
and implemented memory redundancy scheme
also determines if memory is repairable in production testing environments
On-chip reset,
the repair information from the eFuse is automatically loaded
and decompressed in the repair registers,
which are directly connected to the memories
BIST is run on the repaired memories which verify the correctness of memories