Charge-Trapping (CT) Flash and 3D NAND Flash - SEMATECH

4. Categories of Semiconductor Memory Volatile. Non-volatile. Semiconductor memory Semiconductor. memory. RAM. DRAM. SRAM. Floating. Gate (FG) NOR, NA...

11 downloads 898 Views 4MB Size
Charge-Trapping (CT) Flash and 3D NAND Flash

Hang-Ting Lue Macronix International Co., Ltd. Hsinchu, Taiwan Email: [email protected] 1

Outline  Introduction  2D Charge-Trapping (CT) NAND  3D CT NAND  Summary 2

Outline  Introduction  2D Charge-Trapping (CT) NAND  3D CT NAND  Summary 3

Categories of Semiconductor Memory Semiconductor Semiconductor memory memory

Volatile

Non-volatile

RAM

NVM (Charge storage MOSFET)

DRAM

SRAM

CT NOR in mass production

Floating Gate (FG) Dominate NVM NOR, NAND

Charge-trapping (CT) NOR, NAND, and CT 3D

for the last 30 year

Emerging

ROM & Fuse

PCM in mass production

FeRAM

MRAM

RRAM High interest recently

 CT NAND are discussed here.

Phase Change

Polymer

4

Flash Memory Applications Flash Memory

NAND (Data)

NOR (Code)

5

NOR and NAND Flash Memory ~10F2

~4F2

Control gate ONO Floating gate

Oxide Source

Drain

Single cell structure

 Due to the excellent scalability and performances, NAND Flash has enjoyed the highest density  NOR Flash scaling is much slower than NAND so far 6

NAND Flash Scaling Roadmap – CT and 3D ITRS 2009

 NAND Flash has been scaled to 25nm (TLC, 3b/c) so far, even faster than ITRS prediction.  3D charge-trapping (CT) device is a possible solution to continue NAND Flash scaling below 1Xnm node.

7

NAND Demand Forecast Source: forward insight

NAND Flash enjoys a ~70% CAGR recently Major driving force: Mobile application, Tablets, and SSD……

8

MLC/TLC/QLC Source: forward insight

It is forecasted that the 16LC (4b/c) will only appear in a short period. TLC (3b/c) and MLC (2b/c) are the major products, while SLC keeps a small portion.

9

Endurance and Retention Forecast Source: forward insight

Endurance and retention continue to degrade. More than 40-bit ECC/page is necessary at 2X node. 10

Will NAND Flash Scale to 1X nm?

IPD ONO thickness scales below 11nm High-K IPD? Tox scales below 7nm? Thinner FG height and STI depth?

11

NAND Flash is going to run out of electrons! Few electron number is the fundamental brick wall, especially for multi level cell

FG interference is huge (>40%) at 20nm node.

12

Source: J. Choi, IMW Short Course

13

Challenge of Cell Uniformity 要讓每一個班兵 在同一時間內, 展現一致的動作 ,需要長時間的 訓練與默契的培 養

班長一個人 踢正步,很 簡單

 Scaling generally makes uniformity very worse  Controlling cell uniformity is critical in overall performances

14

Challenge of Tail Bit

P. Cappelletti, et al., IEDMTech. Dig., p.291, 1994.

 FG always has tail bits……(retention and P/E)  More severe as Tox scales…..  NOR don’t have tolerance  NAND has more tolerance  ECC and many system-level 15 design

Summary of FG Scaling Challenges 1. Geometry difficulty  gap filling and gate leaning 2. Reliability  Retention/endurance, noise…. 3. Interference 4. High voltage and WL-WL breakdown.. *5. Lithography limitations for 1Xnm…… However, scaling efforts never stop…… 16

Outline  Introduction  2D Charge-Trapping (CT) NAND  3D CT NAND  RRAM  Summary 17

Brief Comparison of 2D FG and CT

 CT is simpler in topology  More immunity to tunnel oxide defect and SILC

18

Problem of Conventional SONOS H. T. Lue (Macronix), et al, ICSICT, 2008.

(b) Retention

(a) Erase Speed P+-poly gate

4 3

VFB (V)

VFB (V)

0

-1

-2

Erase field ~11MV/cm for all samples

-3 10-6

BE-SONOS: -18V SONOS (O1=2 nm): -15V SONOS (O1=2.5 nm): -16V 10-5

10-4

10-3

10-2

Erase Time (Sec)

3300 hours

2 0

1 0

150 C Baking BE-SONOS SONOS (O1=2 nm) SONOS (O1=2.5 nm)

-1 -2

10-1

10-4 10-3 10-2 10-1 100 101 102 103 104

Baking Time (Hour)

 When O1> 25A, the erase becomes too slow (gate injection current is larger!)  When O1< 25A, data retention is too poor!  Erase and retention dilemma is the general issue

19

Charge-Trapping Devices Need BE Tox or High-K Top Dielectric C. H. Lee, IEDM 2003.

H. T. Lue, IEDM 2005.

gate

gate

gate Gate injection

Top oxide SiN trap layer Bottom oxide

S

BE-SONOS

MANOS

SONOS

-

e de-trapping

D

EO2=EO1, and gate injection is larger than electron de-trapping  no memory window for erase

Gate injection Top oxide

High-K SiN trap layer Bottom oxide

S

-

e de-trapping

D

By higher-K top oxide, EO2 is smaller, leading to smaller gate injection during erase.

SiN trap layer BE Tox

S

Gate injection

hole injection

D

EO2=EO1, but BE Tox has larger hole injection than gate injection

 Unlike FG, CT device is designed in a planar structure without GCR design.  Bottom tunnel oxide (EO1) has the same E field with top oxide (EO2), leading to small memory window during the erase.  High-K top dielectric can reduce the gate injection 20  BE Tox can improve the hole injection for faster erase

Glance over various CT Devices H. T. Lue et al (Macronix), IEEE TDMR 2010.

Theoretically the highest performance

Best reported reliability

 No new materials, fast learning time

 High-K CT devices (such TANOS) requires 21 more learning time in reliability

BE-SONOS NAND Flash

H. T. Lue et al (Macronix), IMW, 2010.

 A 75nm BE-SONOS NAND Flash test chip has been demonstrated.  Near planar STI. Conventional materials (oxide, nitride, poly)  A highly reliable 38nm node BE-SONOS NAND will be published at 22 IEDM 2010.

BE-SONOS NAND Performances H. T. Lue, (Macronix), IMW short course

75nm BE-SONOS NAND

75nm FG NAND Program (+20V, 200usec) 75nm BE-SONOS NAND Program (+20V, 200usec)

105

105

104

Bit Counts

Bit Counts (#)

104

Dumb program without verify

103 102 101

MLC , P/E=10 MLC after 1K cycled

disturbed EV

PV1

PV2

PV3

103 102 101

100 VT (V)

100

VT(V)

 Our BE-SONOS NAND programming distribution can be tighter than FG due to simpler topology that minimizes the variation.  Good programming and read performances.  MLC operation of BE-SONOS NAND test chip is successful.

23

Retention of BE-SONOS NAND C. C. Hsieh, (Macronix), IEDM 2010.

75nm BE-SONOS (Non-cut-ONO), P/E=1K 105 Before bake

75nm BE-SONOS (non-cut ONO), P/E=100 105 as cycled

103

10min 120min 1200min 3700min 10080min

102 150C Baking

Disturbed EV

PV state

103

PV

102

101

101

100

100 VT (V)

10min 100min 1100min 5420min 7230min 10080min

104

Bit Counts

Bit Counts

104

Disturbed EV

150C Baking

VT (V)

 Retention is excellent and no single tail bit found.  The best reported CT reliability so far.  No so called charge lateral migration issue (with our optimized SiN trapping layer and process integration)

24

We have developed a successful 2D CT BE-SONOS NAND with excellent reliability

However, current FG NAND has already scaled to ~25nm node with TLC Therefore, CT NAND must look for further scaling below 1X nm node 25

Scaling Challenge of 2D CT NAND Below 20nm Node  Lithography difficulty below 1X nm  Few-electron storage and statistics  RTN (noise)  Interference of CT NAND is still observed  High voltage requirement is approximately the same with FG  2D CT NAND probably has a similar (or a little more) scalability with FG NAND 26

Outline  Introduction  2D Charge-Trapping (CT) NAND  3D CT NAND  RRAM  Summary 27

“Simply Stacked” 3D NAND Flash

3D TANOS devices Samsung: IEDM 2006

3D TFT BE-SONOS devices Macronix: IEDM 2006

 3D stackable NAND Flash using charge-trapping devices were firstly demonstrated in 2006.  Charge-trapping (CT) TANOS and BE-SONOS devices were used.  To stack many layers may linearly increase the cost  Not good when more than 4 layers are used.  However, for <4 layers the cost is reduced. The process seems doable in principle for 2X nm node…. 28

Bit-cost scalable (BiCS) NAND Flash

TOSHIBA: VLSI Symposia 2007

 A break-through concept was proposed by TOSHIBA.  It uses a only one critical contact drill hole for many layers, thus the bit cost is scalable when more than 16 layers are used.  3D NAND is a way to bypass the difficulty in lateral scaling 29  Also keep the electron number……

3D NAND Flash Architectures P-BiCS

TCAT

Ryota K., et. al. 2009 VLSI

Jaehoon J., et. al. 2009 VLSI

VSAT

Jiyoung Kim, et. al. 2009 VLSI

VG

Wonjoo Kim, et. al. 2009 VLSI

30

3D NAND Flash Comparison

[P-BiCS] R. Katsumata, et al, VLSI Symposia, pp. 136-137, 2009. [TCAT] J. Jang, et al, VLSI Symposia, pp. 192-193, 2009. [VSAT] J. Kim, et al, VLSI Symposia, pp. 186-187, 2009. [VG] W. Kim, et al, VLSI Symposia, pp. 188-189, 2009.

31

3D NAND Bit Cost Analysis – More realistic calculation

1 VG possible

PS: Additional processing cost and array efficiency loss when adding one more memory layer are considered….

Log scale

Relative Bit Cost Ref. (25nm MLC FG NAND)

2

F=66nm, 6F 2 F=50nm, 6F 2 F=35nm, 4F 2 F=25nm, 4F 2 F=25nm, 6F

0

5

10

15

20

25

30

Number of Layer for 3D stacks

 If 3D starts from >65nm 6F2 cell size, it is hard to compete with current 25 nm FG NAND  3D NAND is best to have cell size below 3X nm  VG is possible

32

Previous VG NAND Architecture

W. Kim, et al, VLSI Symposia, pp. 188-189, 2009.

 Relative large pitch. (>0.3um)  WL and BL located at the bottom.  The array decoding method (in-layer multiplex decoder) is very complicated, and wastes array efficiency

33

Modified VG NAND Architecture

H. T. Lue, et al (Macronix), VLSI 2010.

 Conventional WL, BL are grouped into “planes”.  One additional SSL’s device also grouped into “planes”.  Three planes select a memory cell.  WL and BL can be at top.

34

Array X-Direction H. T. Lue et al, VLSI 2010.

 75nm half-pitch, 8-layer device is fabricated  Equivalent cell size = 0.001406 um2 (MLC)  Each device is a double-gate TFT BE-SONOS device

35

Device characteristics of VG NAND 6

5

5

4

4

3

3

+16V +17V +18V +19V +20V

1 0 -1

1 -1 -2

10-5

PV1 PV2 PV3

-16V -15V -14V -13V -12V

10-4

2

10-2

10-1

100

Erasing Time (sec)

V PGM (V)

Retention

8th-layer 7th-layer

6

10-8

Solid: P/E=1 Dash: P/E=1K

10-10

3 2 1

0

1

2

3

VT (V)

4

5

6

10-12

150C Baking

4

VT (V)

10-9

PGM from erased state (Vt~ -1V)

-1 10 11 12 13 14 15 16 17 18 19 20

5

(after disturb)

V pass=6V V cc=3.5V 10usec/shot

3

0

10-11

-1

4

A: selected cell B C D E

1

10-3

10-7

ID (A)

Bit Counts (#)

5

Endurance

MLC capability EV

6

2 0

-2 10-8 10-7 10-6 10-5 10-4 10-3 Programming Time (sec)

7

VT shift (V)

6

2

Program inhibit

Erasing

VT (V)

VT (V)

Programming

PGM: P/E=1K ERS: P/E=1K PGM: P/E=1 ERS: P/E=1

0 -3 -2 -1 0

1

2

3

VG (V)

4

5

6

7

8

-1 100 101 102 103 104 105 106 Baking time (sec)

36

Normalized Read Current

Scaling Simulation to 25nm 75nm VG fresh

10-5 10-6 10-7

25nm VG Soild: Fresh Dash: Z Interference

10-8 10-9 10-10 10-11

FZ=30nm

10-12

-1

0

1

2

3

4

VGate (V)

 Scalability to 25nm is feasible based on the simulation. 37

Summary of 3D NAND  Many 3D memory architectures  Still hot topic  Scalability of cell size is important  Keep fewer memory stacks  Basic device physics is mostly known  No new materials except TFT  Decoding methods are key issues  Processing for the deep hole/trench is critical  Variability of TFT

38

Thank You for Your Attention!

39