Beruflich Dokumente
Kultur Dokumente
Abstract
A word oriented memory Built-In Self-Repair methodology is described without modifying the memory module. Faulty addresses and its data will
be stored in the redundancy logic immediately
after its detection during test. Fuse boxes can be
connected via scan registers to the redundancy
logic.
Keywords
0-7803-7169-0/01
$10.00 0 2001 IEEE
Paper 35.3
995
Data
Paper 35.3
996
The redundancy logic consists of two basic components. Spare memory words and logic to
program the address decoding. This is done by
overwriting defective memory locations while
enabling spare memory words. For the access to
a memory with redundancy two possibilities exist.
Usually, the access to memory locations is done
as an EXCLUSIVE OR operation. With one
memory address only one memory word is
accessed. Hence, the address comparison with
faulty addresses has to be completed before the
access to the memory array starts by proper
address decoding. This will reduce the access
time of the memory and is necessary while using
spare rows and columns.
In this paper a parallel access to the memory and
the redundancy logic is proposed. The address
comparison is done in the redundancy logic. The
address is compared to the addresses that are
stored in the redundancy word lines. A
multiplexer at the output of the memory and the
redundancy logic decides where to take the data
from. This is possible because wrapper logic can
be designed that is guaranteed to be faster than
a memory array access.
More than one redundant word can be placed in
the redundancy logic. The data comes from
MBIST controller during test for each failing word
individually. An overflow bit identifies that there
are more failing addresses than possible repair
cells. If an address is stored in a register the FA
register is set to 1 to activate the spare word.
Then, the data register is used to read and write
instead of the memory array. The programming
of the faulty addresses is done during the memory BlST or from the fuse box during memory
setup. The failing addresses can be read out
after the memory test to program fuse boxes. In
addition, already identified failures can be written
Fail
TDI
Overflow
TDO
Data out
0
Fail
Fail-address
R WR
DI Expected-data
The logic of the fuse box has to be tested before packaging to reduce defect probability of
fuse boxes.
An easy way to set fuse values from external
source without blowing the fuse is helpful.
This allows a pre fuse test and a proof of the
determined faulty memory locations for
reliability tests, Yield improvements and
diagnosis capabilities.
A possibilityto read the fuse values directly
after the fuse blowing process to enhance
observabilityof the fuse process.
Fail
Fail-address
Expected-data,
DO
Data output.
Fig. 3: Redundancy word line
TDI
FReset
TDO
Fout
FRead
FGND
3.Fuse Boxes
Fuse boxes can be used on or off chip to store
identified failures after memory test. Fuses on
chip are state of the art. They are blown after
production test. One fuse carries one address bit.
Feedback structure stores the fuse values after
probing the fuse (similar to a dynamic logic). The
fuse itself is nothing more than a polysilicon or
Paper 35.3
997
FReset
FRead
Paper 35.3
998
0
0
0
Data out
f
fail. Fail-address RAM Data
Fig. 9: MBlST structure with its interface to the
redundancy logic
Paper 35.3
999
5. Example
A SRAM with 32 bit data and 8k addresses is
used. 1 MBit is placed in 4 arrays. A wrapper
structure has been configured with 8 redundant
words for 4 arrays. Infineons design flow was
used for the implementation.This includes the
MBIST generation that is done by a generator.
Manual adaptations between MBIST and wrapper
logic are processed before synthesis. The next
step was done with Synopsys design compiler.
The target frequency was 100 MHz. Simulation
techniques proved that the redundancy activation
will be done properly. A scan based ATPG
approach with sequential scan mode on module
level to test the memory interface was performed.
The Fault Coverage is 99,13% for stuck-at faults.
IDDQ test can be identified accordingly. The last
step, Place and Route, was done with Apollo
from Avant. As you see in Tab. 1, the results
show the low area overhead of the logic. Most of
the area around the memory arrays has been
consumed for wiring of the memory buses.
To calculate the area for the redundancy a
formula for this memory can be given without
taking the wiring impact into account. Please
Paper 35.3
1000
Fig.12 presents the schematic view of the memory configuration including, MBIST, redundancy
wrapper and fuse boxes. The boxes surrounded
by lines show the borders of the logic areas of
the MBlSR modules and the memory arrays. It is
expected that a distributed approach of the logic
6. Conclusion
A new memory Built-In Self-Repair concept has
been presented that uses spare words instead of
spare columns and rows. It allows to perform a
software repair before and also after fuses of a
redundancy wrapper are blown. In addition, the
results of a software repair can be used to blow
on-chip fuses. This allows to use the MBlSR
during wafer and package test. Because of its
open architecture it is capable to read out all
necessary diagnostic information. In addition, it
allows a software repair in the field as long as
spare words are available when a MBlSR test
finds failures. Permanent storage of those failing
addresses in the field is only possible with electrical or field programmable fuses.
The word redundancy can be programmed at
speed of the memory BIST. There will be no
additional delay for the redundancy wrapper
because the redundancy is implemented in logic
that is faster than the memory access. The
redundancy and MBlST logic can be tested with
a traditional scan based ATPG approach together
with the embedded logic of the chip. The implementation of the BIST is based on RTL code and
can be used together with standard memories
that do not have any redundancy capabilities.
The number of the spare words for the redundancy wrapper is scalable in the RTL code.
A memory design benefits from the following
advantages:
0
0
7. Literature
[85Day]: J. R. Day, ,,A Fault-Driven
Comprehensive Redundancy Algorithm,
IEEE Design & Test of Computers, pp.35-44,
June 1985.
Paper 35.3
1001