US20220415421A1

US20220415421A1 - Apparatus and methods for smart verify with neighbor plane disturb detection

Info

Publication number: US20220415421A1
Application number: US17/360,184
Authority: US
Inventors: Xuan Tian; Guanhua Yin; Liang Li
Original assignee: SanDisk Technologies LLC
Current assignee: SanDisk Technologies LLC
Priority date: 2021-06-23
Filing date: 2021-06-28
Publication date: 2022-12-29
Anticipated expiration: 2041-06-28
Also published as: US11538538B1; CN115512747A

Abstract

An apparatus is provided that includes a plurality of non-volatile memory cells and a control circuit coupled to the non-volatile memory cells. The control circuit is configured to perform a first program-verify iteration on a first set of non-volatile memory cells coupled to a first word line to determine a first starting program voltage that programs the first set of the non-volatile memory cells to a first programmed state, and program a second set of non-volatile memory cells coupled to the first word line beginning with the first starting program voltage only if a defect condition does not exist.

Description

CLAIM OF PRIORITY

This application claims priority to Chinese Patent Application No. 202110699678.3, filed on Jun. 23, 2021, entitled “APPARATUS AND METHODS FOR SMART VERIFY WITH NEIGHBOR PLANE DISTURB DETECTION,” which application is incorporated herein by reference in its entirety for all purposes.

BACKGROUND

Semiconductor memory is widely used in various electronic devices such as cellular telephones, digital cameras, personal digital assistants, medical electronics, mobile computing devices, servers, solid state drives, non-mobile computing devices and other devices. Semiconductor memory may comprise non-volatile memory or volatile memory. A non-volatile memory allows information to be stored and retained even when the non-volatile memory is not connected to a source of power (e.g., a battery). Examples of non-volatile memory include flash memory (e.g., NAND-type and NOR-type flash memory).
Memory systems can be used to store data provided by a host device (or other client). However, various challenges are presented in operating such memory systems. In particular, as memory cells decrease in size and memory arrays increase in density, maintaining the integrity of data being stored becomes more challenging.

BRIEF DESCRIPTION OF THE DRAWINGS

Like-numbered elements refer to common components in the different figures.

FIG. 1 is a block diagram depicting one embodiment of a memory system.

FIG. 2 is a block diagram of one embodiment of a memory die.

FIG. 3 is a perspective view of a portion of one embodiment of a three dimensional memory structure.

FIG. 4A is a block diagram of a memory structure having two planes.

FIG. 4B depicts a top view of a portion of a block of memory cells.

FIG. 4C depicts a cross sectional view of a portion of a block of memory cells.

FIG. 4D depicts a view of the select gate layers and word line layers.

FIG. 4E is a cross sectional view of a memory hole of memory cells.

FIG. 4F is a schematic of a plurality of NAND strings.

FIG. 5 depicts threshold voltage distributions.

FIG. 6 is a table describing one example of an assignment of data values to data states.

FIGS. 7A-7E depict various threshold voltage distributions and describe a process for programming non-volatile memory.

FIG. 8 is a flowchart describing an embodiment of a process for programming non-volatile memory.

FIG. 9 depicts a word line voltage during programming and verify operations.

FIG. 10 is a flowchart describing an embodiment of another process for programming non-volatile memory.

FIG. 11 is a block diagram of a memory structure having two planes.

FIGS. 12A-12C depict various threshold voltage distributions.

FIGS. 13A-13C depict various threshold voltage distributions.

FIGS. 14A-14B depict various threshold voltage distributions.

FIG. 15 is a flowchart describing an embodiment of another process for programming non-volatile memory.

DETAILED DESCRIPTION

Some non-volatile memory devices are used to store two ranges of charges and, therefore, the memory cells can be programmed/erased between two data states: an erased state and a programmed state (corresponding to data “1” and data “0”). Such a device is referred to as a binary device or a single-level cell (SLC) and the data are binary data.
In contrast, a multi-state flash memory cell (storing multi-state data) is implemented by identifying multiple, distinct allowed threshold voltage ranges. Each distinct threshold voltage range corresponds to a predetermined value for the set of data bits. For example, some memory cells can store two or more bits. The specific relationship between the data programmed into the memory cell and the threshold voltage ranges of the memory cell depends upon the data encoding scheme adopted for the memory cells.
In addition to the gains in capacity resulting from multi-state memory architectures, significant advantages in memory technology have resulted from steadily scaling down the physical dimensions of memory cells. Smaller memory cells can be packed more densely on a given die area, allowing higher memory capacity for the same price as an older memory technology. However, scaling the sizes of memory cells entails certain risks.
Indeed, densely packing such smaller memory cells may result in increased manufacturing defects, such as shorting between adjacent word lines, shorting between word lines and interconnects, shorting between word lines and the substrate, and broken word lines. Such manufacturing defects often result in corruption of data stored on the word lines being programmed and nearby word lines.
In some cases, these manufacturing defects are not realized during tests conducted during manufacturing and prior to packaging and shipping the memory devices. Instead, such latent manufacturing defects may only begin to corrupt data after an end user begins programing and erasing the memory cells in such memory devices.
Some memory technologies seek to combat latent manufacturing defects by reading programmed data after programming or evaluating performance after completing programming. However, by the time programming has completed, the programming process may have already damaged data stored in other nearby memory cells.
In addition, some non-volatile memory devices include a multi-plane memory structure organization, and memory cells in the multiple planes connected to the same word lines may be programmed concurrently. Although multi-plane programming may increase programming speed, any defects such as the word line defects described above on one plane may disturb programming of memory cells on the concurrently programmed planes. One such disturb mechanism causes overprogramming of lower programmed states when implementing certain word line skip smart-verify algorithms.
Technology is described to implement a word line skip smart-verify algorithm that detects during programming if a defect condition exists on one of the planes, and terminates programming on the plane that includes the detected defect to reduce or eliminate program disturb on the other planes.
FIG. 1 is a block diagram of an embodiment of a memory system 100 that implements the described technology. In an embodiment, memory system 100 is a solid state drive (“SSD”). Memory system 100 also can be a memory card, USB drive or other type of storage system. The proposed technology is not limited to any one type of memory system. Memory system 100 is connected to host 102, which can be a computer, server, electronic device (e.g., smart phone, tablet or other mobile device), appliance, or another apparatus that uses memory and has data processing capabilities. In some embodiments, host 102 is separate from, but connected to, memory system 100. In other embodiments, memory system 100 is embedded within host 102.
The components of memory system 100 depicted in FIG. 1 are electrical circuits. Memory system 100 includes a controller 104 connected to one or more memory die 106 and local high speed volatile memory 108 (e.g., DRAM). The one or more memory die 106 each include a plurality of non-volatile memory cells. More information about the structure of each memory die 106 is provided below. Local high speed volatile memory 108 is used by controller 104 to perform certain functions. For example, local high speed volatile memory 108 stores logical to physical address translation tables (“L2P tables”)
Controller 104 includes a host interface 110 that is connected to and in communication with host 102. In one embodiment, host interface 110 provides a PCIe interface. Other interfaces can also be used, such as SCSI, SATA, etc. Host interface 110 is also connected to a network-on-chip (NOC) 112, which is a communication subsystem on an integrated circuit. In other embodiments, NOC 112 can be replaced by a bus.
A NOC can span synchronous and asynchronous clock domains or use unclocked asynchronous logic. NOC technology applies networking theory and methods to on-chip communications and brings notable improvements over conventional bus and crossbar interconnections. NOC improves the scalability of systems on a chip (SoC) and the power efficiency of complex SoCs compared to other designs. In embodiments, the wires and the links of a NOC are shared by many signals. A high level of parallelism is achieved because all links in the NOC can operate simultaneously on different data packets. Therefore, as the complexity of integrated subsystems keep growing, a NOC provides enhanced performance (such as throughput) and scalability in comparison with previous communication architectures (e.g., dedicated point-to-point signal wires, shared buses, or segmented buses with bridges).
Connected to and in communication with NOC 112 is processor 114, ECC engine 116, memory interface 118, and DRAM controller 120. DRAM controller 120 is used to operate and communicate with local high speed volatile memory 108 (e.g., DRAM). In other embodiments, local high speed volatile memory 108 can be SRAM or another type of volatile memory.
ECC engine 116 performs error correction services. For example, ECC engine 116 performs data encoding and decoding, as per the implemented ECC technique. In one embodiment, ECC engine 116 is an electrical circuit programmed by software. For example, ECC engine 116 can be a processor that can be programmed. In other embodiments, ECC engine 116 is a custom and dedicated hardware circuit without any software. In another embodiment, the function of ECC engine 116 is implemented by processor 114.
Processor 114 performs the various controller memory operations, such as programming, erasing, reading, as well as memory management processes. In an embodiment, processor 114 is programmed by firmware. In other embodiments, processor 114 is a custom and dedicated hardware circuit without any software. In an embodiment, processor 114 also implements a translation module, as a software/firmware process or as a dedicated hardware circuit.
In many systems, non-volatile memory is addressed internally to the storage system using physical addresses associated with the one or more memory die. However, the host system will use logical addresses to address the various memory locations. This enables the host to assign data to consecutive logical addresses, while the storage system is free to store the data as it wishes among the locations of the one or more memory die. To enable this system, the controller (e.g., the translation module) performs address translation between the logical addresses used by the host and the physical addresses used by the memory dies.
One example implementation is to maintain tables (e.g., the L2P tables mentioned above) that identify a translation between logical addresses and physical addresses. An entry in the L2P table may include an identification of a logical address and corresponding physical address. Although logical address to physical address tables (or L2P tables) include the word “tables” they need not literally be tables. Rather, the logical address to physical address tables (or L2P tables) can be any type of data structure. In some examples, the memory space of a storage system is so large that local memory 108 cannot hold all of the L2P tables. In such a case, the entire set of L2P tables are stored in a memory die 106 and a subset of the L2P tables are cached (L2P cache) in the local high speed volatile memory 108.
In an embodiment, memory interface 118 communicates with one or more memory die 106. In an embodiment, memory interface 118 provides a Toggle Mode interface. Other interfaces also can be used. In some example implementations, memory interface 118 (or another portion of controller 104) implements a scheduler and buffer for transmitting data to and receiving data from one or more memory die.
FIG. 2 is a functional block diagram of one embodiment of a memory die 200. Each of the one or more memory die 106 of FIG. 1 can be implemented as memory die 200 of FIG. 2 . The components depicted in FIG. 2 are electrical circuits. In an embodiment, each memory die 200 includes a memory structure 202, control circuitry 204, and read/write circuits 206. Memory structure 202 is addressable by word lines via a row decoder 208 and by bit lines via a column decoder 210.
In an embodiment, read/write circuits 206 include multiple sense blocks 212 including SB1, SB2, . . . , SBp (sensing circuitry) and allow a page (or multiple pages) of data in multiple memory cells to be read or programmed (written) in parallel. In an embodiment, each sense block 212 include a sense amplifier and a set of latches connected to the bit line. The latches store data to be written and/or data that has been read. In an embodiment, each sense amplifier 212 includes bit line drivers. In an embodiment, commands and data are transferred between controller 104 and memory die 200 via lines 214. In an embodiment, memory die 200 includes a set of input and/or output (I/O) pins that connect to lines 214.
In an embodiment, control circuitry 204 cooperates with read/write circuits 206 to perform memory operations (e.g., write, read, erase, and others) on memory structure 202. In an embodiment, control circuitry 204 includes a state machine 216, an on-chip address decoder 218, and a power control circuit 220. In an embodiment, state machine 216 provides die-level control of memory operations. In an embodiment, state machine 216 is programmable by software. In other embodiments, state machine 216 does not use software and is completely implemented in hardware (e.g., electrical circuits). In some embodiments, state machine 216 can be replaced by a microcontroller or microprocessor. In an embodiment, control circuitry 204 includes buffers such as registers, ROM fuses and other storage devices for storing default values such as base voltages and other parameters.
On-chip address decoder 218 provides an address interface between addresses used by controller 104 to the hardware address used by row decoder 208 and column decoder 210. Power control module 220 controls the power and voltages supplied to the word lines and bit lines during memory operations. Power control module 220 may include charge pumps for creating voltages.
For purposes of this document, control circuitry 204, read/write circuits 206, row decoder 208 and column decoder 210 comprise a control circuit for memory structure 202. In other embodiments, other circuits that support and operate on memory structure 202 can be referred to as a control circuit. For example, in some embodiments, controller 104 can operate as the control circuit or can be part of the control circuit. The control circuit also can be implemented as a microprocessor or other type of processor that is hardwired or programmed to perform the functions described herein.
For purposes of this document, control circuitry 204, read/write circuits 206, row decoder 208 and column decoder 210 comprise peripheral circuits for memory structure 202, as they are not part of memory structure 202 but are on the same die as memory structure 202 and are used to operate memory structure 202.
In an embodiment, memory structure 202 is a three dimensional memory array of non-volatile memory cells. In an embodiment, memory structure 202 is a monolithic three dimensional memory array in which multiple memory levels are formed above a single substrate, such as a wafer. The memory structure may be any type of non-volatile memory that is formed in one or more physical levels of arrays of memory cells having an active area disposed above a silicon (or other type of) substrate. In one example, the non-volatile memory cells of memory structure 202 include vertical NAND strings with charge-trapping material such as described. A NAND string includes memory cells connected by a channel.
In another embodiment, memory structure 202 includes a two dimensional memory array of non-volatile memory cells. In an example, the non-volatile memory cells are NAND flash memory cells utilizing floating gates. Other types of memory cells (e.g., NOR-type flash memory) also can be used.
The exact type of memory array architecture or memory cell included in memory structure 202 is not limited to the examples above. Many different types of memory array architectures or memory cell technologies can be used to form memory structure 202. No particular non-volatile memory technology is required for purposes of the new technology described herein.
Other examples of suitable technologies for memory cells of the memory structure 202 include ReRAM memories, magnetoresistive memory (MRAM), phase change memory (PCM), and the like. Examples of suitable technologies for architectures of memory structure 202 include two dimensional arrays, three dimensional arrays, cross-point arrays, stacked two dimensional arrays, vertical bit line arrays, and the like.
One example of a cross point memory includes reversible resistance-switching elements arranged in cross point arrays accessed by X lines and Y lines (e.g., word lines and bit lines). In another embodiment, the memory cells may include conductive bridge memory elements. A conductive bridge memory element also may be referred to as a programmable metallization cell.
A conductive bridge memory element may be used as a state change element based on the physical relocation of ions within a solid electrolyte. In some cases, a conductive bridge memory element may include two solid metal electrodes, one relatively inert (e.g., tungsten) and the other electrochemically active (e.g., silver or copper), with a thin film of solid electrolyte between the two electrodes.
MRAM stores data using magnetic storage elements. The magnetic storage elements are formed from two ferromagnetic plates, each of which can hold a magnetization, separated by a thin insulating layer. One of the two plates is a permanent magnet set to a particular polarity; the other plate's magnetization can be changed to match that of an external field to store memory. A memory device is built from a grid of such memory cells. In one embodiment for programming, each memory cell lies between a pair of write lines arranged at right angles to each other, parallel to the cell, one above and one below the cell. When current is passed through them, an induced magnetic field is created.
Phase change memory (PCM) exploits the unique behavior of chalcogenide glass. One embodiment uses a GeTe—Sb₂Te₃super lattice to achieve non-thermal phase changes by simply changing the coordination state of Germanium atoms with a laser pulse (or light pulse from another source). Therefore, the doses of programming are laser pulses. The memory cells can be inhibited from programming by blocking the memory cells from receiving the light.
A person of ordinary skill in the art will recognize that the technology described herein is not limited to a single specific memory structure, but covers many relevant memory structures within the scope of the technology as described herein and as understood by one of ordinary skill in the art.
FIG. 3 is a perspective view of a portion of an embodiment of a three dimensional memory array that includes memory structure 202. In an embodiment, memory structure 202 includes multiple non-volatile memory cells. For example, FIG. 3 shows a portion of one block of memory cells. The structure depicted includes a set of bit lines BL positioned above a stack of alternating dielectric layers and conductive layers. For example purposes, one of the dielectric layers is marked as D and one of the conductive layers (also called word line layers) is marked as W.
The number of alternating dielectric layers and conductive layers can vary based on specific implementation requirements. One set of embodiments includes between 108-300 alternating dielectric layers and conductive layers. One example embodiment includes 96 data word line layers, 8 select layers, 6 dummy word line layers and 110 dielectric layers. More or less than 108-300 layers also can be used. In an embodiment, the alternating dielectric layers and conductive layers are divided into four regions by local interconnects LI. FIG. 3 shows two regions and two local interconnects LI.
A source line layer SL is below the alternating dielectric layers and word line layers. Memory holes are formed in the stack of alternating dielectric layers and conductive layers. For example, one of the memory holes is marked as MH. Note that in FIG. 3 the dielectric layers are depicted as see-through so that the reader can see the memory holes positioned in the stack of alternating dielectric layers and conductive layers.
In an embodiment, NAND strings are formed by filling the memory hole with materials including a charge-trapping material to create a vertical column of memory cells (also referred to as a memory column). In an embodiment, each memory cell can store one or more bits of data. In an embodiment, each memory hole MH is associated with and coupled to a corresponding one of bit lines BL. In an embodiment, each bit line BL is coupled to one or more memory holes MH. More details of a three dimensional memory array that comprises memory structure 202 is provided below with respect to FIG. 4A-4F.
FIG. 4A is a block diagram explaining one example organization of memory structure 202, which is divided into two planes 400 a and 400 b. Both planes are on the same memory die 200 (FIG. 2 ). Each plane is then divided into M blocks. In one example, each plane has about 2000 blocks. However, different numbers of blocks and planes also can be used. A portion 402 of block 2 of memory plane 400 a is shown in dashed line in FIG. 4A.
In an embodiment, a block of memory cells is a unit of erase. That is, all memory cells of a block are erased together. In other embodiments, memory cells can be grouped into blocks for other reasons, such as to organize memory structure 202 to enable the signaling and selection circuits. In some embodiments, a block represents a group of connected memory cells as the memory cells of a block share a common set of word lines. Although FIG. 4A shows two planes on the same die, in other embodiments more than two planes can be implemented. For example, memory structure 202 can include 2-8 (or more) planes.
FIGS. 4B-4F depict an example three dimensional (“3D”) NAND structure that corresponds to the structure of FIG. 3 . FIG. 4B is a block diagram depicting a top view of portion 402 (FIG. 4A) of memory structure 202. As can be seen from FIG. 4B, portion 402 extends in direction 404 and direction 406. In an embodiment, the memory array has many layers, however, FIG. 4B only shows the top layer.
FIG. 4B depicts a plurality of circles that represent the memory holes, which are also referred to as memory columns. For example, FIG. 4B depicts memory holes 408, 410, 412 and 414. Each of the memory holes include multiple select transistors (also referred to as a select gate or selection gate) and multiple memory cells. In an embodiment, each memory hole implements a NAND string. Because portion 402 extends in directions 404 and 406, the block includes more memory holes than depicted in FIG. 4B.
FIG. 4B also depicts a set of bit lines 424, including bit lines 426, 428, 430, 432, . . . 434. In an embodiment, each memory hole is associated with and coupled to a corresponding one of the bit lines. In an embodiment, each bit line is coupled to one or more memory holes. FIG. 4B shows twenty four bit lines because only a portion of the block is depicted. It is contemplated that more than twenty four bit lines are connected to memory holes of the block. Each of the circles representing a memory hole has an “x” to indicate its connection to one bit line. For example, bit line 432 is connected to memory holes 408, 410, 412 and 414.
Portion 402 depicted in FIG. 4B includes a set of local interconnects 436, 438, 440, 442 and 444 that connect the various layers to a source line below the memory holes. Local interconnects 436, 438, 440, 442 and 444 also serve to divide each layer of the block into four regions. For example, the top layer depicted in FIG. 4B is divided into four regions designated as String0, String1, Sting2 and String3. In the layers of the block that implement memory cells, String0, String1, Sting2 and String3 also may be referred to as word line fingers that are separated by the local interconnects.
In an embodiment, the word line fingers on a common level of a block connect together to form a single word line. In another embodiment, the word line fingers on the same level are not connected together. In an example implementation, a bit line connects to a single memory hole in each of String0, String1, Sting2 and String3. In that implementation, each block has sixteen rows of active columns and each bit line connects to four rows in each block.
In an embodiment, all four rows connected to a common bit line are connected to the same word line (via different word line fingers on the same level that are connected together). Therefore, the system uses the source side selection lines and the drain side selection lines to choose one (or another subset) of the four to be subjected to a memory operation (program, verify, read, and/or erase).
Although FIG. 4B shows four regions String0, String1, Sting2 and String3, each having four rows of memory holes, and sixteen rows of memory holes in a block, those exact numbers are an example implementation. Other embodiments may include more or less regions per block, more or less rows of memory holes per region and more or less rows of memory holes per block. FIG. 4B also shows the memory holes being staggered. In other embodiments, different patterns of staggering can be used. In some embodiments, the memory holes are not staggered.
FIG. 4C depicts a portion of one embodiment of a three dimensional memory structure 202 showing a cross-sectional view along line AA of FIG. 4B. This cross sectional view cuts through memory holes 410 and 454 of String1 (see FIG. 4B). The structure of FIG. 4C includes four drain side select layers SGD0, SGD1, SGD2 and SGD3, four source side select layers SGS0, SGS1, SGS2 and SGS3, six dummy word line layers DD0, DD1, DS0, DS1, WLDL, WLDU, and one hundred and twenty eight data word line layers WLL0-WLL127 for connecting to memory cells. Other embodiments can implement more or less than four drain side select layers, more or less than four source side select layers, more or less than six dummy word line layers, and more or less than one hundred and twenty eight word lines.
Memory holes 410 and 454 are depicted protruding through the drain side select layers, source side select layers, dummy word line layers and word line layers. In one embodiment, each memory hole includes a vertical NAND string. Below the memory holes and the layers listed below is substrate 456, an insulating film 458 on the substrate, and source line SL. The NAND string of memory hole 410 has a source end at a bottom of the stack and a drain end at a top of the stack. As in agreement with FIG. 4B, FIG. 4C shows memory hole 410 connected to bit line 432 via connector 460. Local interconnects 438 and 440 also are depicted.
For ease of reference, drain side select layers SGD0, SGD1, SGD2 and SGD3, source side select layers SGS0, SGS1, SGS2 and SGS3, dummy word line layers DD0, DD1, DS0, DS1, WLDL and WLDU, and word line layers WLL0-WLL127 collectively are referred to as the conductive layers. In an embodiment, the conductive layers are made from a combination of TiN and tungsten. In other embodiments, other materials can be used to form the conductive layers, such as doped polysilicon, metal such as tungsten or metal silicide. In some embodiments, different conductive layers can be formed from different materials.
Between conductive layers are dielectric layers DL0-DL143. For example, dielectric layer DL136 is above word line layer WLL126 and below word line layer WLL127. In an embodiment, the dielectric layers are made from SiO₂. In other embodiments, other dielectric materials can be used to form the dielectric layers.
The non-volatile memory cells are formed along memory holes which extend through alternating conductive and dielectric layers in the stack. In an embodiment, the memory cells are arranged in NAND strings. The word line layers WLL0-WLL127 connect to memory cells (also called data memory cells). Dummy word line layers DD0, DD1, DS0, DS1, WLDL and WLDU connect to dummy memory cells. A dummy memory cell does not store and is not eligible to store host data (data provided from the host, such as data from a user of the host), while a data memory cell is eligible to store host data.
In some embodiments, data memory cells and dummy memory cells may have a same structure. A dummy word line is connected to dummy memory cells. Drain side select layers SGD0, SGD1, SGD2 and SGD3 are used to electrically connect and disconnect NAND strings from bit lines. Source side select layers SGS0, SGS1, SGS2 and SGS3 are used to electrically connect and disconnect NAND strings from the source line SL.
FIG. 4C also shows a “Joint Area.” In an embodiment it is expensive and/or challenging to etch one hundred and twenty-eight word line layers intermixed with dielectric layers. To ease this burden, one embodiment includes laying down a first stack of sixty four word line layers alternating with dielectric layers, laying down the Joint Area, and laying down a second stack of sixty four word line layers alternating with dielectric layers. The Joint Area is positioned between the first stack and the second stack. The Joint Area is used to connect the first stack to the second stack.
In FIG. 4C, the first stack is labeled as the “Lower Set of Word Lines” and the second stack is labeled as the “Upper Set of Word Lines.” In an embodiment, the Joint Area is made from the same materials as the word line layers. In one example set of implementations, the plurality of word lines (control lines) comprises a first stack of alternating word line layers and dielectric layers, a second stack of alternating word line layers and dielectric layers, and a joint area between the first stack and the second stack, as depicted in FIG. 4C.
FIG. 4D depicts a logical representation of the conductive layers (SGD0, SGD1, SGD2, SGD3, SGS0, SGS1, SGS2, SGS3, DD0, DD1, DS0, DS1, and WLL0-WLL127) for the block that is partially depicted in FIG. 4C. As mentioned above with respect to FIG. 4B, in an embodiment local interconnects 436, 438, 440, 442 and 444 break up the conductive layers into four regions/fingers.
For example, word line layer WLL126 is divided into regions String0 _W126, String1 _W126, String2 _W126and String3 _W126. In an embodiment, the four word line fingers on a same level are connected together. In another embodiment, each word line finger operates as a separate word line.
Likewise, drain side select gate layer SGD0 (the top layer) is divided into regions Strin0 _SGD0, String1 _SGD0, String2 _SGD0and String3 _SGD0, also known as fingers or select line fingers. In an embodiment, the four select line fingers on a same level are connected together. In another embodiment, each select line finger operates as a separate word line.
FIG. 4E depicts a cross sectional view of String1 of FIG. 4C that includes a portion of memory hole 410. In an embodiment, the memory holes (e.g., memory hole 410) are shaped as cylinders. In other embodiment, however, memory holes may have other shapes. In an embodiment, memory hole 410 includes an inner core layer 480, a channel 482 surrounding inner core layer 480, a tunneling dielectric 484 surrounding channel 482, and a charge trapping layer 486 surrounding tunneling dielectric 484. In an embodiment, inner core layer 480 a dielectric material (e.g., SiO₂), channel 482 is polysilicon, tunneling dielectric 484 has an ONO structure, and charge trapping layer 486 is silicon nitride. Other memory materials and structures can also be used. The technology described herein is not limited to any particular material or structure.
FIG. 4E depicts dielectric layers DLL137, DLL136, DLL135, DLL134 and DLL133, as well as word line layers WLL127, WLL126, WLL125, WLL124, and WLL123. In an embodiment, each of the word line layers includes a word line region 488 surrounded by an aluminum oxide layer 490, which is surrounded by a blocking oxide (SiO₂) layer 492. The physical interaction of the word line layers with the memory hole forms the memory cells. Thus, a memory cell, in an embodiment, includes channel 482, tunneling dielectric 484, charge trapping layer 486, blocking oxide layer 492, aluminum oxide layer 490 and word line region 488.
For example, word line layer WLL127 and a portion of memory hole 410 comprise a memory cell MC1. Word line layer WLL126 and a portion of memory hole 410 comprise a memory cell MC2. Word line layer WLL125 and a portion of memory hole 410 comprise a memory cell MC3. Word line layer WLL124 and a portion of memory hole 410 comprise a memory cell MC4. Word line layer WLL123 and a portion of memory hole 410 comprise a memory cell MC5. In other architectures, a memory cell may have a different structure; however, the memory cell would still be the storage unit.
In an embodiment, when a memory cell is programmed, electrons are stored in a portion of the charge trapping layer 486 which is associated with the memory cell. These electrons are drawn into the charge trapping layer 486 from the channel 482, through the tunneling dielectric 484, in response to an appropriate voltage on word line region 488. The threshold voltage (Vth) of a memory cell is increased in proportion to the amount of stored charge.
In an embodiment, programming a memory cell is achieved through Fowler-Nordheim tunneling of the electrons into charge trapping layer 486. During an erase operation, the electrons return to channel 482 or holes are injected into charge trapping layer 486 to recombine with electrons. In an embodiment, erasing is achieved using hole injection into charge trapping layer 486 via a physical mechanism such as gate induced drain leakage (GIDL).
FIG. 4F is a schematic diagram of corresponding to portion 402 in Block 2 of FIGS. 4A-E, including bit lines 426, 428, 430, 432, . . . 434, and word lines WLL0-WLL127. Within the block, each bit line is connected to four NAND strings. Drain side selection lines SGD0, SGD1, SGD2 and SGD3 are used to determine which of the four NAND strings connect to the associated bit line(s). Source side selection lines SGS0, SGS1, SGS2 and SGS3 are used to determine which of the four NAND strings connect to the common source line.
During any given memory operation, a subset of the memory cells will be identified to be subjected to one or more parts of the memory operation. These memory cells identified to be subjected to the memory operation are referred to as selected memory cells. Memory cells that have not been identified to be subjected to the memory operation are referred to as unselected memory cells. Depending on the memory architecture, the memory type, and the memory operation, unselected memory cells may be actively or passively excluded from being subjected to the memory operation.
During a memory operation some word lines are referred to as selected word lines because they are connected to selected memory cells. Unselected word lines are not connected to selected memory cells. Similarly, selected bit lines are connected to selected memory cells and unselected bit lines are not connected to selected memory cells.
Although the example memory system of FIG. 3 and FIGS. 4A-4F is a three dimensional memory structure that includes vertical NAND strings with charge-trapping material, other (2D and 3D) memory structures also can be used with the technology described herein.
The memory systems discussed above can be erased, programmed and read. At the end of a successful programming process (with verification), the threshold voltages of the memory cells should be within one or more distributions of threshold voltages for programmed memory cells or within a distribution of threshold voltages for erased memory cells, as appropriate. FIG. 5 illustrates example threshold voltage distributions for a memory array when each memory cell stores three bits of data. Other embodiments, however, may use other data capacities per memory cell (e.g., such as one, two, four, or five bits of data per memory cell).
FIG. 5 shows eight threshold voltage distributions, corresponding to eight data states. The first threshold voltage distribution (data state) S0 represents memory cells that are erased. The other seven threshold voltage distributions (data states) S1-S7 represent memory cells that are programmed and, therefore, are also called programmed states.
Each threshold voltage distribution (data state) corresponds to predetermined values for the set of data bits. The specific relationship between the data programmed into a memory cell and the threshold voltage levels of the memory cell depends on the data encoding scheme adopted for the cells. In an embodiment, data values are assigned to the threshold voltage ranges using a Gray code assignment so that if the threshold voltage of a memory cell erroneously shifts to its neighboring physical state, only one bit will be affected.
FIG. 5 shows seven read reference voltages, Vr1, Vr2, Vr3, Vr4, Vr5, Vr6, and Vr7 for reading data from memory cells. By testing (e.g., performing sense operations) whether the threshold voltage of a given memory cell is above or below the seven read reference voltages, the system can determine what data state (S0, S1, S2, S3, . . . , S7) a memory cell is in.
FIG. 5 also shows seven verify reference voltages, Vv1, Vv2, Vv3, Vv4, Vv5, Vv6, and Vv7. When programming memory cells to data state S1, the system will test whether those memory cells have a threshold voltage greater than or equal to Vv1. When programming memory cells to data state S2, the system will test whether the memory cells have threshold voltages greater than or equal to Vv2. When programming memory cells to data state S3, the system will determine whether memory cells have their threshold voltage greater than or equal to Vv3. When programming memory cells to data state S4, the system will test whether those memory cells have a threshold voltage greater than or equal to Vv4. When programming memory cells to data state S5, the system will test whether those memory cells have a threshold voltage greater than or equal to Vv5. When programming memory cells to data state S6, the system will test whether those memory cells have a threshold voltage greater than or equal to Vv6. When programming memory cells to data state S7, the system will test whether those memory cells have a threshold voltage greater than or equal to Vv7.
In an embodiment, known as full sequence programming, memory cells can be programmed from the erased data state S0 directly to any of the programmed states S1-S7. For example, a population of memory cells to be programmed may first be erased so that all memory cells in the population are in erased data state S0. Then, a programming process is used to program memory cells directly into data states S1, S2, S3, S4, S5, S6, and/or S7. For example, while some memory cells are being programmed from data state S0 to data state S1, other memory cells are being programmed from data state S0 to data state S2 and/or from data state S0 to data state S3, and so on. The arrows of FIG. 5 represent full sequence programming.
The technology described herein also can be used with other types of programming in addition to full sequence programming (including, but not limited to, multiple stage/phase programming). In some embodiments, programmed states S1-S7 can overlap, with controller 104 (FIG. 1 ) relying on error correction to identify the correct data being stored.
FIG. 6 is a table describing an example assignment of data values to data states. In the table of FIG. 6 , S0=111, S1=110, S2=100, S3=000, S4=010, S5=011, S6=001 and S7=101. Other encodings of data also can be used. No particular data encoding is required by the technology disclosed herein. In an embodiment, when a block is subjected to an erase operation, all memory cells are moved to data state S0, the erased state. In the embodiment of FIG. 6 , all bits stored in a memory cell are “1” when the memory cell is erased (e.g., in data state S0).
FIGS. 7A-7E illustrate a multi-phase programming approach. In this embodiment, the programming process includes three phases. Prior to programming, the memory cells are erased so that all memory cells connected to a common word line are in an erased threshold voltage distribution E, as depicted in FIG. 7A.
During the first programming phase, those memory cells whose targets (due to the data to be stored in those memory cells) are data states S4, S5, S6 or S7 are programmed to an intermediate threshold voltage distribution IM. Those memory cells are targeted for data states S0, S1, S2 or S3 remain in the erased threshold voltage distribution E. The first phase is graphically depicted in FIG. 7B. Memory cells being programmed to intermediate threshold voltage distribution IM are programmed to a target threshold voltage of VvIM.
During the second programming phase, those memory cells that are in the erased threshold voltage distribution E are programmed to their target data states. For example, those memory cells to be programmed to data state S3 are programmed from erased threshold voltage distribution E to data state S3, those memory cells to be programmed to data state S2 are programmed from erased threshold voltage distribution E to data state S2, those memory cells to be programmed to data state S1 are programmed from erase threshold voltage distribution E to data state S1, and those memory cells to be in data state S0 are not programmed during the second phase of the programming process. Thus, erased threshold voltage distribution E becomes data state S0.
Also, during the second programming phase, those memory cells that are in the intermediate state threshold voltage distribution IM are programmed to their target data states. For example, those memory cells to be programmed to data state S7 are programmed from intermediate threshold voltage distribution IM to data state S7, those memory cells to be programmed to data state S6 are programmed from intermediate threshold voltage distribution IM to data state S6, those memory cells to be programmed to data state S5 are programmed from intermediate threshold voltage distribution IM to data state S5, and those memory cells to be in data state S4 are programmed from intermediate threshold voltage distribution IM to data state S4. This second programming phase is illustrated in FIG. 7C.
As can be seen in FIG. 7C, at the end of the second programming phase data states S1-S7 overlap with neighboring data states. For example, data state S1 overlaps with data state S2, data state S2 overlaps with data states S1 and S3, data state S3 overlaps with data states S2 and S4, data state S4 overlaps with data states S3 and S5, data state S5 overlaps with data states S4 and S6, and data state S6 overlaps with data states S5 and S7. In some embodiments, all or some of the data states do not overlap.
In the third programming phase, each of data states S1-S7 are tightened so that they no longer overlap with neighboring states. This is depicted graphically by FIG. 7D. The final result of the three phrase programming process is depicted in FIG. 7E, which shows data states S0-S7. In some embodiments, data state S0 is wider than data states S1-S7. In an embodiment, the data states of FIGS. 7A-7E may be encoded according to the table of FIG. 6 .
In some embodiments, those memory cells to be programmed to data state S4 are not programmed during the second phase and, therefore, remain in intermediate threshold voltage distribution IM. During the third programming phase, the memory cells are programmed from intermediate threshold voltage distribution IM to S4. In other embodiments, memory cells destined for other states can also remain in intermediate threshold voltage distribution IM or erase threshold voltage distribution E during the second phase.
FIG. 8 is a flowchart describing an embodiment of a process 800 for programming a memory cell. In an example embodiment, process 800 is performed on memory die 106 (FIG. 1 ) using the control circuits discussed above. For example, process 800 can be performed at the direction of state machine 216 (FIG. 2 ). Process 800 also can be used to implement the full sequence programming discussed above. Additionally, process 800 can be used to implement each phase of a multi-phase programming process.
Typically, a program voltage is applied to the control gates (via a selected word line) during a program operation as a series of program pulses. Between programming pulses are a set of verify pulses to perform verification. In many implementations, the magnitude of the program pulses increase with each successive program pulse by a predetermined program step size. In step 802 of process 800, a programming voltage (V_P) is initialized to a starting program voltage V_Pinit(e.g., between about 12V to about 16V, or some other value) and a program counter PC maintained by state machine 216 is initialized at 1.
In step 804, a program pulse having a magnitude V_Pis applied to the selected word line (the word line selected for programming). In an embodiment, the group of memory cells being concurrently programmed are all connected to the same word line (the selected word line). If a memory cell is to be programmed, then the corresponding bit line coupled to the memory cell is grounded. If a memory cell should remain at its current threshold voltage, then the corresponding bit line coupled to the memory cell is connected to Vdd to inhibit programming. In an embodiment, the unselected word lines receive one or more boosting voltages (e.g., between about 7V to about 11V, or some other value) to perform boosting schemes known in the art.
In step 804, the program pulse is applied to all memory cells connected to the selected word line so that all of the connected memory cells are programmed concurrently. That is, they are programmed at the same time or during overlapping times (both of which are considered concurrent). In this manner all of the memory cells connected to the selected word line will concurrently have their threshold voltage change, unless they have been locked out from programming.
In step 806, the memory cells are verified using the appropriate set of verify reference voltages to perform one or more verify operations. In an embodiment, the verification process is performed by testing whether the threshold voltages of the memory cells selected for programming have reached the appropriate verify reference voltage.
In step 808, the memory system counts the number of memory cells that have not yet reached their respective target threshold voltage distribution. That is, the system counts the number of memory cells that have so far failed the verify process. This counting can be done by state machine 216 (FIG. 2 ), controller 104 (FIG. 1 ), or other logic. In the remaining discussion, the term “Controller Device” may be one or more of controller 104 of FIG. 1 , control circuitry 204 of FIG. 2 , state machine 216 of FIG. 2 , or other similar controller device.
In an embodiment, each of sense blocks 212 (FIG. 2 ) stores the status (pass/fail) of their respective memory cells. In an embodiment, one total count reflects the total number of memory cells currently being programmed that have failed the last verify step. In another embodiment, separate counts are kept for each data state.
In step 810, a determination is made whether the count from step 808 is less than or equal to a predetermined limit. In an embodiment, the predetermined limit is the number of bits that can be corrected by error correction codes (ECC) during a read process for the page of memory cells. If the number of failed cells is less than or equal to the predetermined limit, than the programming process can stop and a status of “PASS” is reported in step 812. In this situation, enough memory cells programmed correctly such that the few remaining memory cells that have not been completely programmed can be corrected using ECC during the read process.
In some embodiments, the predetermined limit used in step 810 is below the number of bits that can be corrected by error correction codes (ECC) during a read process to allow for future/additional errors. When programming less than all of the memory cells for a page, or comparing a count for only one data state (or less than all states), then the predetermined limit can be a portion (pro-rata or not pro-rata) of the number of bits that can be corrected by ECC during a read process for the page of memory cells. In some embodiments, the limit is not predetermined. Instead, the limit changes based on the number of errors already counted for the page, the number of program-erase cycles performed or other criteria.
If the number of failed memory cells is not less than the predetermined limit, then the programming process continues at step 814 and the program counter PC is checked against a program limit value (PLV). Examples of program limit values include 6, 12, 16, 20 and 30, although other values can be used. If the program counter PC is greater than or equal to program limit value PLV, then the program process is considered to have failed and a status of FAIL is reported in step 816.
If the program counter PC is not greater than or equal to program limit value PLV, then the process continues at step 820 in which the Program Counter PC is incremented by 1 and program voltage V_Pis stepped up to the next magnitude. For example, the next program pulse will have a magnitude greater than the previous pulse by a program step size ΔV_P(e.g., a step size of between about 0.1V to about 1.0V, or some other value). The process loops back to step 804 and another program pulse is applied to the selected word line so that another iteration (steps 804-818) of programming process 800 is performed. Each pass through steps 804-818 is referred to herein as a “program loop.”
In general, during verify operations and read operations, the selected word line is connected to a voltage (one example of a reference signal), a level of which is specified for each read operation (e.g., read compare levels Vr1, Vr2, Vr3, Vr4, Vr5, Vr6, and Vr7, of FIG. 5 ) or verify operation (e.g. verify target levels Vv1, Vv2, Vv3, Vv4, Vv5, Vv6, and Vv7 of FIG. 5 ) to determine whether a threshold voltage of the selected memory cell has reached such level.
In an embodiment, after an appropriate read or verify voltage is applied to a selected word line, a conduction current of the memory cell is measured to determine whether the memory cell turned ON (conducts current) in response to the voltage applied to the word line. If the conduction current is measured to be greater than a certain value, then it is assumed that the memory cell turned ON and the voltage applied to the word line is greater than the threshold voltage of the memory cell.
If the conduction current is measured to be not greater than the certain value, then the memory cell did not turn ON, and the voltage applied to the word line is not greater than the threshold voltage of the memory cell. During a read or verify process, the unselected memory cells are provided with one or more read pass voltages (also referred to as bypass voltages) at their control gates so that these memory cells will operate as pass gates (e.g., conducting current regardless of whether they are programmed or erased).
There are many ways to measure the conduction current of a memory cell during a read or verify operation. In one example, the conduction current of a memory cell is measured by the rate at which the memory cell discharges or charges a dedicated capacitor in a sense amplifier. In another example, the conduction current of the selected memory cell allows (or fails to allow) the NAND string that includes the memory cell to discharge a corresponding bit line. The voltage on the bit line is measured after a period of time to see whether or not the bit line has been discharged. Note that the technology described herein can be used with different methods known in the art for verifying/reading. Other read and verify techniques known in the art also can be used.
As described above, at step 804 a program pulse is applied to the selected word line, and at step 806 memory cells coupled to the selected word line are verified using an appropriate set of verify reference voltages to perform one or more verify operations. Steps 804 and 806 are part of an iterative loop in which program pulses are applied as a series of program pulses that step up in magnitude, with intervening verify reference pulses between consecutive program pulses. Such an iterative loop is referred to herein as a “program-verify iteration.”
FIG. 9 illustrates an example of such program-verify pulses applied to a selected word line. In particular, FIG. 9 depicts program pulses 900, 902 and 904 applied to the selected word line during three successive iterations of step 804 of FIG. 8 . Between program pulses 900, 902 and 904 verify pulses are applied to the selected word line during three successive program-verify iterations of steps 804-806 of FIG. 8 to determine whether threshold voltages of the memory cells are greater than the respective verify reference voltages.
FIG. 9 shows a verify pulse for each of the programmed states S1-S7 between each of program pulses 900, 902 and 904. These verify pulses consume a significant portion of a program operation. As the number of programmed states stored per memory cell increases, this situation becomes worse, limiting programming speed. FIG. 9 corresponds to memory cells that store 3-bits per cell and require 7 verify levels. In a 4-bit per cell embodiment, a verify of all non-erased states would need 15 verify operations between program pulses.
To improve performance, some verify operations can be omitted during the programming operation through use of smart-verify algorithms to reduce programming time. For example, an embodiment a smart-verify operation for word line WLn performs a program-verify iteration on memory cells of String0 coupled to word line WLn.
In an embodiment, the program-verify iteration determines a minimum number of program loops (referred to herein as “smart-verify loop count”) needed to program memory cells of String0 to a particular programmed state (e.g., the lowest programmed state S1 in FIG. 5 or 7E). The process of determining a smart-verify loop count is also referred to herein as “smart-verify acquisition,” and the determined smart-verify loop count is also referred to herein as the acquired smart-verify loop count.
The acquired smart-verify loop count is then used to determine a smart-verify starting program voltage for programming memory cells of String1-String3 coupled to word line WLn. In particular, the smart-verify starting program voltage V_PSnfor memory cells of String1-String3 coupled to word line WLn is:
V _PS =V _Pinit +SVloop_n ×ΔV _PS (1)
where SVloop_nis the acquired smart-verify loop count for word line WLn, and ΔV_PSis a program step size for smart-verify (e.g., a step size of between about 0.1V to about 1.0V, or some other value). That is, the determined smart-verify starting program voltage V_PSnfor memory cells of String1-String3 coupled to word line WLn is initial program voltage V_Pinitplus the acquired smart-verify loop count multiplied by program step size for smart-verify ΔV_PS. In some embodiments, program step size for smart-verify ΔV_PSmay have a same or a different value than program step size ΔV_P. For example, in an embodiment program step size for smart-verify ΔV_PSis less than program step size ΔV_P.
This same process is repeated for each subsequent word line (e.g., word lines WLn+1, WLn+2, . . . ), first performing a program-verify iteration on memory cells of String0 coupled to the word line to acquire a smart-verify loop count for those memory cells, and then using the acquired smart-verify loop count to determine a smart-verify starting program voltage V_PSnfor programming memory cells of String1-String3 coupled to the word line.
Because adjacent word lines are physically located close to one another on a memory die, memory cells on adjacent word lines often have similar programming characteristics. Accordingly, additional program time reduction may be achieved by performing a smart-verify operation for 1 of every k word lines, skipping smart-verify operations on the next k−1 consecutive word lines, and instead using the acquired smart-verify loop count for one word line to determine a smart-verify starting program voltage for programming memory cells coupled to the next k−1 consecutive word lines. Such techniques are referred to herein as “WLk skip smart-verify.”
For example, if k=4, a smart-verify operation is performed for 1 of every 4 word lines. That is, smart verify operations are performed on word lines WL0, WL4, WL8, . . . , and smart-verify operations are skipped on word lines WL1, WL2, WL3, WL5, WL6, WL7, WL9, WL10, WL11, and so on.
In particular, the acquired smart-verify loop count SVloop₀for word line WL0 is used to determine a smart-verify starting program voltage V_PS0for programming memory cells of String1-String3 coupled to word line WL0 and memory cells of String0-String3 coupled to word lines WL1, WL2 and WL3. Similarly, the acquired smart-verify loop count SVloop₄for word line WL4 are used to determine a smart-verify starting program voltage V_PS4for programming memory cells of String1-String3 coupled to word line WL4 and memory cells of String0-String3 coupled to word lines WL5, WL6 and WL7. Likewise, the acquired smart-verify loop count SVloop₈for word line WL8 are used to determine a smart-verify starting program voltage V_PS8for programming memory cells of String1-String3 coupled to word line WL8 and memory cells of String0-String3 coupled word lines WL9, WL10 and WL11, and so on.
FIG. 10 is a flowchart describing an embodiment of a process 1000 for programming memory cells using a WL_kskip smart-verify algorithm. In an example embodiment, process 1000 is performed on memory die 106 (FIG. 1 ) using the Controller Device described above. For example, process 1000 can be performed at the direction of state machine 216 (FIG. 2 ).
Beginning at step 1002, a word line WLn is selected for programming, where n is an integer word line counter (e.g., n=0, 1, 2, . . . ). For example, if word line counter n=0, word line WL0 is selected for programming.
At step 1004, a skip counter j is set equal to word line counter n, and a value k is selected, where k is an integer number of word lines that are skipped from performing smart-verify operations (e.g., k=2, 3, 4, . . . ). In the example above, if word line counter n=0, skip counter j=0. If k=4, smart-verify operations will be performed once for every four word lines (e.g., word lines WL0, WL4, WL8, . . . ). At step 1006, program voltage V_Pis set to an initial value V_Pinit(e.g., between about 12V to about 16V, or some other value).
At step 1008, a program-verify iteration is performed on memory cells of String0 coupled to word line WLn. The program-verify operation includes applying program voltage V_Pto the memory cells of String0 coupled to word line WLn and applying a verification signal (e.g., a voltage waveform) to those memory cells while performing verify steps for one or more data states. For example, verify steps may be performed for the lowest programmed state (e.g., programmed state S1 in FIG. 5 or 7E).
At step 1010, based on the results of the verify tests of step 1008 a determination is made whether a smart-verify loop count has been acquired. In an embodiment, smart-verify acquisition is complete if all or nearly all of the memory cells of String0 coupled to word line WLn have reached a target threshold voltage (e.g., the verify voltage of the lowest programmed state). Other target threshold voltages also may be used.
If at step 1010 a determination is made that not all or nearly all of the memory cells of String0 coupled to word line WLn have reached a target threshold voltage, then at step 1012 program voltage V_Pis stepped up to the next magnitude by program step size ΔV_P. For example, program step size ΔV_Pmay be between about 0.1V to about 1.0V, or some other value. Next, the programming operation returns to step 1008 to perform the next program-verify iteration. This loop of steps 1008-1012 continues until a determination is made at step 1010 that smart-verify acquisition is complete.
If at step 1010 a determination is made that smart-verify acquisition is complete (e.g., all or nearly all of the memory cells of String0 coupled to word line WLn have reached a target threshold voltage), then at step 1014 the acquired smart-verify loop count SVloop_nfor word line WLn is used to determine a smart-verify starting program voltage V_PSjfor word line WLn.
At step 1016, the memory cells of String1-String3 coupled to word line WLn are programmed beginning with the determined smart-verify starting program voltage V_PSj. So for example, if word line counter n=0, skip counter j=0, the memory cells of String1-String3 coupled to word line WL0 are programmed beginning with the determined smart-verify starting voltage V_PS0.
At step 1018, a determination is made whether any additional word lines are to be programmed. If a determination is made at step 1018 that no additional word lines are to be programmed, then at step 1020 process 1000 completes. If, however, a determination is made at step 1018 that additional word lines are to be programmed, then at step 1022 word line counter n is incremented by 1. So continuing with the previous example, word line counter n=1.
At step 1024, a determination is made whether a difference between word line counter n and skip counter j equals skip value k. If a determination is made that a difference between word line counter n and skip counter j does not equal skip value k, at step 1026 the memory cells of String0-String3 coupled to word line WLn are programmed beginning with the determined smart-verify starting voltage V_PSj. So for example, if word line counter n=1, skip counter j=0, and skip value k=4, the memory cells of String0-String3 coupled to word line WL1 are programmed beginning with the determined smart-verify starting voltage V_PS0.
Process 1000 then loops back to step 1018 to determine whether any additional word lines are to be programmed. If there are additional word lines to be programmed, steps 1018-1026 repeat until the difference (n−j) equals skip value k. Thus, continuing the previous example, the memory cells of String0-String3 coupled to word lines WL2 and WL3 are programmed beginning with the determined smart-verify starting voltage V_PS0. Because smart-verify acquisition is avoided for word lines WL1, WL2 and WL3, the time required to program the memory cells coupled to word lines WL1, WL2 and WL3 is reduced.
If at step 1024 a determination is made that the difference between word line counter n and skip counter j equals skip value k, then at step 1028 program voltage V_Pis set to the determined starting program voltage V_PSjminus program step size ΔV_P, and skip counter j is set equal to word line counter n. Process 1000 then loops back to step 1008 to perform a program-verify on memory cells of String0 coupled to word line WLn.
For example, if word line counter n=4, program voltage V_Pis set to the determined starting voltage V_PS0minus program step size ΔV_P, skip counter j=4, and at step 1008 a program-verify is performed on memory cells of String0 coupled to word line WL4. In this regard, the programming of memory cells of String0 coupled to word line WL4 may begin using a program voltage V_Pjust below the determined smart-verify starting program voltage V_PS0. Alternatively, at step 1028 program voltage V_Pmay be reset to initial value V_Pinit.
The loop including steps 1008-1012 repeats until at step 1010 a determination is made that smart-verify acquisition is complete (e.g., all or nearly all of the memory cells of String0 coupled to word line WL4 have reached a target threshold voltage), and at step 1014 the acquired smart-verify loop count SVloop₄for word line WL4 is used to determine a smart-verify starting program voltage V_PS4for word line WL4.
Process 1000 continues in this manner until at step 1016 there are no more word lines to program, performing smart-verify operations for 1 of every k word lines, and skipping smart-verify operations on the next k−1 consecutive word lines. Table 1, below, depicts the programming operations of ten consecutive word lines beginning with word line WL0, with k=4:

TABLE 1

Word	Smart-
Line	Verify	String0	String1	String2	String3

WL0	Yes	Acquire SVloop₀	Use V_PS0	Use V_PS0	Use V_PS0
		Determine V_PS0
WL1	Skip	Use V_PS0	Use V_PS0	Use V_PS0	Use V_PS0
WL2	Skip	Use V_PS0	Use V_PS0	Use V_PS0	Use V_PS0
WL3	Skip	Use V_PS0	Use V_PS0	Use V_PS0	Use V_PS0
WL4	Yes	Acquire SVloop₄	Use V_PS4	Use V_PS4	Use V_PS4
		Determine V_PS4
WL5	Skip	Use V_PS4	Use V_PS4	Use V_PS4	Use V_PS4
WL6	Skip	Use V_PS4	Use V_PS4	Use V_PS4	Use V_PS4
WL7	Skip	Use V_PS4	Use V_PS4	Use V_PS4	Use V_PS4
WL8	Yes	Acquire SVloop₈	Use V_PS8	Use V_PS8	Use V_PS8
		Determine V_PS8
WL9	Skip	Use V_PS8	Use V_PS8	Use V_PS8	Use V_PS8

In some embodiments, particular word lines may be “special” word lines that are always subject to program-verify operations and are not included in the WL_kskip smart-verify algorithm. For example, in some implementations word line WL0 is a special word line, and is not included in the skip smart-verify process. Instead, in such implementations the skip smart-verify process begins with word line WL1. Table 2, below, depicts the programming operations of ten consecutive word lines beginning with word line WL0, with k=4, with WL0 being a special word line:

TABLE 2

Word	Smart-
Line	Verify	String0	String1	String2	String3

WL0	Yes	Acquire SVloop₀	Use V_PS0	Use V_PS0	Use V_PS0
		Determine V_PS0
WL1	Yes	Acquire SVloop₁	Use V_PS1	Use V_PS1	Use V_PS1
		Determine V_PS1
WL2	Skip	Use V_PS1	Use V_PS1	Use V_PS1	Use V_PS1
WL3	Skip	Use V_PS1	Use V_PS1	Use V_PS1	Use V_PS1
WL4	Yes	Acquire SVloop₄	Use V_PS4	Use V_PS4	Use V_PS4
		Determine V_PS4
WL5	Skip	Use V_PS4	Use V_PS4	Use V_PS4	Use V_PS4
WL6	Skip	Use V_PS4	Use V_PS4	Use V_PS4	Use V_PS4
WL7	Skip	Use V_PS4	Use V_PS4	Use V_PS4	Use V_PS4
WL8	Yes	Acquire SVloop₈	Use V_PS8	Use V_PS8	Use V_PS8
		Determine V_PS8
WL9	Skip	Use V_PS8	Use V_PS8	Use V_PS8	Use V_PS8

As described above, significant advances in memory technology have resulted from steadily reducing the physical dimensions of memory cells, which in turn can be packed more densely on a given die area. Doing so, however, may result in a greater number of manufacturing defects, such as shorting between word lines and other components (such as shorting between adjacent word lines, shorting between word lines and interconnects, shorting between word lines and the substrate) as well as broken word lines.
In many instances, such manufacturing defects do not affect performance of the memory system until the memory system has been used for one or more program-erase cycles, and may only begin to corrupt data after an end user begins programing and erasing memory cells in such memory devices. One technique for addressing such latent manufacturing defects is referred to herein as early program termination (EPT).
In particular, a Controller Device implementing EPT terminates a programming process early when a defect condition exists. Rather than wait until a programming process ends to determine whether a defect condition exists, the Controller Device tests for the defect condition during the programming process. If a defect condition is identified (referred to herein as an “EPT status failure,” the Controller Device stops the programming process prior to completing programming. A Controller Device may implement an embodiment of EPT during “multi-plane programming,” in which a memory structure is divided into multiple planes, and memory cells in the multiple planes connected to the same word lines may be programmed concurrently.
FIG. 11 is a block diagram depicting a simplified multi-plane organization of memory structure 202 (FIG. 2 ), which is divided into a first plane 1100 ₀and a second plane 1100 ₁located on the same memory die 200 (FIG. 2 ). First plane 1100 ₀includes eight word lines WL0 ₀, WL1 ₀, WL2 ₀, . . . , WL7 ₀, and second plane 1100 ₁includes eight word lines WL0 ₁, WL1 ₁, WL2 ₁, . . . , WL7 ₁. In other embodiments, first plane 1100 ₀and second plane 1100 ₁each may include more or fewer than eight word lines.
Switches S₀, S₁, . . . , S₇may be used to selectively couple word lines WL0 ₀, WL1 ₀, . . . , WL7 ₀on first plane 1100 ₀to corresponding word line WL0 ₁, WL2 ₁, . . . , WL7 ₁on second plane 1100 ₁. In multi-plane programming switch S₀closes to couple word lines WL0 ₀and WL0 ₁, switch S₁closes to couple word lines WL1 ₀and WL1 ₁, switch S₂closes to selectively couple word lines WL2 ₀and WL2 ₁, and so on.
In the illustrated example, as a result of a manufacturing defect, a first word line-to-word line short 1104 exists between word line WL0 ₀and word line WL1 ₀, and a second word line-to-word line short 1106 exists between word line WL1 ₀and word line WL2 ₀. In this example, the manufacturing defects are only on word lines in first plane 1100 ₀. No word line-to-word line shorts exist on second plane 1100 ₁. In other instances, manufacturing defects may exist only in second plane 1100 ₁, or in both first plane 1100 ₀and second plane 1100 ₁.
During programming, one or more programming pulses are applied to word lines WL0 ₀and WL0 ₁, one or more programming pulses are applied to word lines WL1 ₀and WL1 ₁, one or more programming pulses are applied to word lines WL2 ₀and WL2 ₁, and so on. As a result of first word line-to word line short 1104 and second word line-to word line short 1106, programming of memory cells coupled to word line WL0 ₀fails because the voltage of word line WL0 ₀is pulled down by shorted word lines WL1 ₀and WL2 ₀.
In particular, word line WL0 ₀is unable to reach a high enough voltage level to successfully program memory cells coupled to word line WLO₀before the maximum number of program loops is reached (e.g., step 816=YES in FIG. 8 ). First word line-to word line short 1104 and second word line-to word line short 1106 cause the same failure to occur while attempting to program memory cells coupled to word lines WL1 ₀and WL2 ₀.
Although no word line-to-word line shorts exist in second plane 1100 ₁, switches S₀, S₁, . . . , S₇, couple corresponding word lines on first plane 1100 ₀and second plane 1100 ₁. Accordingly, because the voltage of WL0 ₀is pulled down by shorted word lines WL1 ₀and WL2 ₀, coupled word line WL0 ₁also is unable to reach a high enough voltage level to successfully program memory cells coupled to word line WL0 ₁before the maximum number of program loops is reached (e.g., step 816=YES in FIG. 8 ). Likewise, the same failure occurs while attempting to program memory cells coupled to word lines WL1 ₁and WL2 ₁.
This phenomenon is sometimes referred to as “neighbor plane disturb,” or “NPD.” In such a scenario, first plane 1100 ₀is sometimes referred to as the “attacker block,” and second plane 1100 ₁is sometimes referred to as the “victim block” because word line defects on first plane 1100 ₀disturb programming of coupled word lines of second plane 1100 ₁. EPT techniques, such as those described above, may be used to mitigate the impact of NPD. Accordingly, EPT techniques are sometimes referred to as “NPD countermeasures.”
FIGS. 12A-12C depict example threshold voltage distributions of programmed states S1-S7 on word lines WL0 ₁, WL1 ₁and WL2 ₁of second plane 1100 ₁. In particular, the solid curve in each figure depicts example threshold voltage distributions when programming first plane 1100 ₀and second plane 1100 ₁in two-plane mode, with shorted word lines WL1 ₀and WL2 ₀on first plane 1100 ₀. The dashed curve in each figure depicts example threshold voltage distributions when programming second plane 1100 ₁in single-plane mode (that is, without the impact of shorted word lines WL1 ₀and WL2 ₀on first plane 1100 ₀).
In the illustrated examples of FIGS. 12A-12C, although pulled down by shorted word lines WL1 ₀and WL2 ₀on first plane 1100 ₀, the voltage of each of word lines WL0 ₁, WL1 ₁, and WL2 ₁in two-plane mode is high enough to program lower programmed states S1-S4 before the maximum number of program loops is reached. In contrast, the pulled down voltage of each of word lines WL0 ₁, WL1 ₁, and WL2 ₁in two-plane mode is too low to correctly program higher programmed states S5-S7 before the maximum number of program loops is reached. As a result, in two-plane mode programming of memory cells coupled to word lines WLO₁, WL1 ₁and WL2 ₁fails.
As described above, a Controller Device may implement an embodiment of EPT in multi-plane programming mode (referred to herein as “EPT enabled”), such as the two-plane programming process described above and illustrated in FIGS. 11 and 12A-12C. In an example embodiment, the Controller Device determines a difference between a number of program loops required to complete programming for a particular programmed state (e.g., programmed state S1 or other programmed state) for the two planes. If the determined difference exceeds a predetermined amount (e.g., 4 loops), the Controller Device determines that an EPT status failure has occurred and that a defect exists on the slower plane. The Controller then terminates programming of the slower plane, and continues programming the remaining programmed states (e.g., programmed states S2-S7) on the faster plane in single plane programming mode.
FIGS. 13A-13C depict example threshold voltage distributions of programmed states S1-S7 on word lines WL0 ₁, WL1 ₁and WL2 ₁of second plane 1100 ₁with EPT enabled. In particular, after determining that a difference in the number of program loops between first plane 1100 ₀and second plane 1100 ₁for programmed state S1 exceeds a particular amount, the Controller Device determines that an EPT status failure has occurred, terminates programming of first plane 1100 ₀, and continues programming the remaining programmed states S2-S7 on second plane 1100 ₁in single plane programming mode.
The solid curve in each figure depicts example threshold voltage distributions when programming first plane 1100 ₀and second plane 1100 ₁began in two-plane mode, but switched to single-plane mode when the Controller Device detected the EPT status failure. The dashed curve in each figure depicts example threshold voltage distributions when programming second plane 1100 ₁solely in single-plane mode. As can be seen in FIGS. 13A-13C, the threshold voltage distributions are almost indistinguishable in the two different scenarios, and EPT resulted in successful programming of memory cells coupled to word lines WL0 ₁, WL1 ₁and WL2 ₁of second plane 1100 ₁.
Although EPT techniques such as described above can mitigate the impact of NPD for higher programmed states S5-S7 on word lines WL0 ₁, WL1 ₁and WL2 ₁of second plane 1100 ₁, EPT techniques alone do not mitigate the impact of a problem resulting from word line defects, such as shorted word lines WL1 ₀and WL2 ₀on first plane 1100 ₀, that occurs when the Controller Device uses a WL_kskip smart-verify algorithm to reduce programming time.
In particular, when using a WL_kskip smart-verify algorithm with k=4 in accordance with the example of Table 1, above, a program-verify iteration is performed on memory cells of String0 coupled to word line WL0 ₀of first plane 1100 ₀(or String0 of word line WL0 ₁of second plane 1100 ₁) for the lowest programmed state (e.g., programmed state S1) to acquire smart-verify loop count SVloop₀, which is then used to determine a smart-verify starting program voltage V_PS0. If the Controller Device detects an EPT status failure caused by shorted word lines WL1 ₀and WL2 ₀on first plane 1100 ₀, the Controller Device terminates programming of first plane 1100 ₀and continues programming second plane 1100 ₁in single plane programming mode.
In particular, the Controller Device programs memory cells of String1-String3 coupled to word line WL0 ₁and memory cells of String0-String3 coupled to word lines WL1 ₁-WL3 ₁on second plane 1100 ₁beginning with the determined smart-verify starting program voltage V_PS0. The determined smart-verify starting program voltage V_PS0, however, may cause over-programming of lower programmed states (e.g., programmed states S1 and S2) of memory cells of String1-String3 coupled to word line WL0 ₁and memory cells of String0-String3 coupled to word lines WL1 ₁-WL3 ₁on second plane 1100 ₁.
In particular, the above-described WL_kskip smart-verify algorithm determines a smart-verify starting program voltage V_PS0based on program-verify iterations performed on memory cells of String0 coupled to word line WL0 ₀before the controller detected the EPT status failure. Because shorted word lines WL1 ₀and WL2 ₀pull down the voltage of word line WL0 ₀, higher program loop counts and higher program voltages V_Pare needed to program memory cells of String0 coupled to word line WL0 ₀for programmed state S1. As a result, the determined smart-verify starting program voltage V_PS0is higher than it would be in the absence of word line-to word line shorts.
When the Controller Device detects the EPT status failure and switches to single-plane mode and continues programming memory cells of String1-String3 coupled to word line WL0 ₁and memory cells of String0-String3 coupled to word lines WL1 ₁-WL3 ₁on second plane 1100 ₁, the programming begins with the higher-than-usual determined smart-verify starting program voltage V_PS0to program these memory cells (see Table 1, above). As a result, the determined smart-verify starting program voltage V_PS0may cause over-programming of lower programmed states (e.g., programmed states S1-S3) of memory cells of String1-String3 coupled to word line WL0 ₁and memory cells of String0-String3 coupled to word lines WL1 ₁-WL3 ₁on second plane 1100 ₁.
For example, FIG. 14A depicts example threshold voltage distributions of programmed states S1-S7 on word line WL1 ₁of second plane 1100 ₁. In particular, the solid curve depicts example threshold voltage distributions that result when the Controller Device uses a WL_kskip smart-verify algorithm with k=4 in accordance with the example of Table 1 and with EPT enabled. The dashed curve depicts example threshold voltage distributions when programming second plane 1100 ₁in single-plane mode (that is, without the impact of shorted word lines WL1 ₀and WL2 ₀on first plane 1100 ₀). As can be seen in FIG. 14A, the higher-than-usual determined smart-verify starting program voltage V_P0results in overprogramming lower programmed states S1-S3.
Technology is described to implement a WL_kskip smart-verify algorithm that prevents or reduces such overprogramming of lower programmed states as a result of NPD. In particular, a modified WL_kskip smart-verify algorithm is described which combines with an EPT function to avoid data loss for NPD countermeasures.
FIG. 15 is a flowchart describing an embodiment of a process 1500 for programming memory cells on multiple planes using a WL_kskip smart-verify algorithm. In an example embodiment, process 1500 is performed on memory die 106 (FIG. 1 ) using the Controller Device described above. For example, process 1500 can be performed at the direction of state machine 216 (FIG. 2 ). For simplicity, the following describes an embodiment for concurrently programming first plane 1100 ₀and second plane 1100 ₁of FIG. 11 in two-plane mode.
Beginning at step 1502, a word line WLn is selected for programming, where n is an integer word line counter (e.g., n=0, 1, 2, . . . ). For example, if word line counter n=0, word line WL0 ₀of first plane and word line WL0 ₁of second plane 1100 ₁are selected for programming.
At step 1504, a skip counter j is set equal to word line counter n, and a value k is selected, where k is an integer number of word lines that are skipped from performing smart-verify operations (e.g., k=2, 3, 4, . . . ). In the example above, if word line counter n=0, skip counter j=0. If k=4, smart-verify operations will be performed once for every four word lines (e.g., word lines WL0, WL4, WL8, . . . ). At step 1506, program voltage V_Pis set to an initial value V_Pinit(e.g., between about 12V to about 16V, or some other value).
At step 1508, a program-verify iteration is performed on a first set of memory cells (e.g., memory cells of String0) coupled to word line WLn. The program-verify operation includes applying program voltage V_Pto the first set of memory cells coupled to word line WLn and applying a verification signal (e.g., a voltage waveform) to those memory cells while performing verify steps for one or more data states. For example, verify steps may be performed for the lowest programmed state (e.g., programmed state S1 in FIG. 5 or 7E).
At step 1510, based on the results of the verify tests of step 1508 a determination is made whether a smart-verify loop count has been acquired. In an embodiment, smart-verify acquisition is complete if all or nearly all of the first set of memory cells coupled to word line WLn have reached a target threshold voltage (e.g., the verify voltage of the lowest programmed state). Other target threshold voltages also may be used.
If at step 1510 a determination is made that not all or nearly all of the first set of memory cells coupled to word line WLn have reached a target threshold voltage, then at step 1512 program voltage V_Pis stepped up to the next magnitude by program step size ΔV_P. For example, program step size ΔV_P. may be between about 0.1V to about 1.0V, or some other value. Next, the programming operation returns to step 1508 to perform the next program-verify iteration. This loop of steps 1508-1512 continues until a determination is made at step 1510 that smart-verify acquisition is complete.
If at step 1510 a determination is made that smart-verify acquisition is complete (e.g., all or nearly all of the first set of memory cells coupled to word line WLn have reached a target threshold voltage), at step 1514 a determination is made whether an EPT status failure has occurred.
For example, as described above, if the Controller Device determines that a difference between a number of program loops required to complete programming for a particular programmed state (e.g., programmed state S1 or other programmed state) for the two planes exceeds a particular amount (e.g., 4 loops), the Controller Device determines that an EPT status failure has occurred and that a defect exists on the slower plane (e.g., first plane 1100 ₀of FIG. 11 ).
If at step 1514 a determination is made that an EPT status failure has occurred, then at step 1516 programming of the slower plane terminates and switches to single plane programming on the faster plane (e.g., second plane 1100 ₁of FIG. 11 ). In addition, program voltage V_Pis reset to initial value V_Pinit.
At step 1518, a program-verify iteration is performed on a second set of memory cells (e.g., memory cells of String1) coupled to word line WLn. The program-verify operation includes applying program voltage V_Pto the second set of memory cells coupled to word line WLn and applying a verification signal (e.g., a voltage waveform) to those memory cells while performing verify steps for one or more data states. For example, verify steps may be performed for the lowest programmed state (e.g., programmed state S1 in FIG. 5 or 7E).
At step 1520, based on the results of the verify tests of step 1518 a determination is made whether smart-verify acquisition is complete. For example, smart-verify acquisition may be completed if all or nearly all of the second set of memory cells coupled to word line WLn have reached a target threshold voltage (e.g., the verify voltage of the lowest programmed state). Other target threshold voltages also may be used.
If at step 1520 a determination is made that smart-verify acquisition is not complete (e.g., not all or nearly all of the second set of memory cells coupled to word line WLn have reached a target threshold voltage), then at step 1522 program voltage V_Pis stepped up to the next magnitude by a program step size ΔV_P. For example, program step size ΔV_P. may be between about 0.1V to about 1.0V, or some other value. Next, the programming operation returns to step 1518 to perform the next program-verify iteration. This loop of steps 1518-1522 continues until a determination is made at step 1520 that smart-verify acquisition is complete.
If at step 1520 a determination is made that smart-verify acquisition is complete (e.g., all or nearly all of the second set of memory cells coupled to word line WLn have reached a target threshold voltage), then at step 1524 the acquired smart-verify loop count SVloop_nfor word line WLn is used to determine a smart-verify starting program voltage V_PSj. For example, V_PS0is the determined smart-verify starting program voltage for word line WL0. In this instance, the determined smart-verify starting program voltage V_PSjis based on a program-verify iteration performed on the second set of memory cells coupled to word line WLn.
Referring back to step 1514, if a determination is made that an EPT status failure has not occurred, then at step 1524 acquired smart-verify loop count SVloop_nfor word line WLn is used to determine a smart-verify starting program voltage V_PSj. That is, the determined smart-verify starting program voltage V_PSjis based on a program-verify iteration performed on the first set memory cells coupled to word line WLn only if an EPT status failure has not occurred.
At step 1526 memory cells of String1-String3 coupled to word line WLn are programmed beginning with the determined smart-verify starting program voltage V_PSj. So for example, if word line counter n=0, skip counter j=0, the memory cells of String1-String3 coupled to word line WL0 are programmed beginning with the determined smart-verify starting program voltage V_PS0.
If an EPT status failure had not been detected at step 1514, then the programming operation at step 1526 is two plane programming (e.g., first plane 1100 ₀and second plane 1100 ₁of FIG. 11 ). If an EPT status failure had been detected at step 1514, then the programming operation at step 1526 is single plane programming of the faster plane (e.g., second plane 1100 ₁of FIG. 11 ).
At step 1528, a determination is made whether any additional word lines are to be programmed. If a determination is made at step 1528 that no additional word lines are to be programmed, then at step 1530 process 1500 completes. If, however, a determination is made at step 1528 that additional word lines are to be programmed, then at step 1532 word line counter n is incremented by 1. So continuing with the previous example, word line counter n=1. In addition, if programming had switched to single plane mode at step 1516, at step 1532 programming optionally may resume in two-plane mode.
At step 1534, a determination is made whether a difference between word line counter n and skip counter j equals skip value k. If a determination is made that a difference between word line counter n and skip counter j does not equal skip value k, at step 1536 the memory cells of String0-String3 coupled to word line WLn are programmed using the determined smart-verify starting program voltage V_PSj.
For example, if word line counter n=1 skip counter j=0, and skip value k=4, then the difference (n−j) does not equal skip value k. Accordingly, at step 1536, the memory cells of String0-String3 coupled to word line WL1 are programmed beginning with the determined smart-verify starting program voltage V_PS0. Process 1500 then loops back to step 1528 to determine whether any additional word lines are to be programmed. If there are additional word lines to be programmed, steps 1528-1536 repeat until the difference (n−j) equals skip value k. Thus, continuing the previous example, the memory cells of String0-String3 coupled to word lines WL2 and WL3 are programmed beginning with the determined smart-verify starting program voltage V_PS0.
If at step 1534 a determination is made that the difference between word line counter n and skip counter j equals skip value k, then at step 1538 program voltage V_Pis set to the determined smart-verify starting program voltage V_PSjminus program step size ΔV_P, and skip counter j is set equal to word line counter n. Process 1500 then loops back to step 1508 to perform a program-verify on memory cells of String0 coupled to word line WLn.
For example, if word line counter n=4, program voltage V_Pis set to the determined smart-verify starting program voltage V_PS0minus program step size ΔV_P, skip counter j=4, and at step 1508 a program-verify is performed on memory cells of String0 coupled to word line WL4. In this regard, the programming of memory cells of String0 coupled to word line WL4 may begin using a program voltage V_Pjust below the determined smart-verify starting program voltage V_PS0. Alternatively, at step 1538 program voltage V_Pmay be reset to initial value V_Pinit.
Process 1500 continues in this manner until at step 1528 there are no more word lines to program. In this regard, process 1500 performs smart-verify operations for 1 of every k word lines, and skips smart-verify operations on the next k−1 consecutive word lines. In addition, process 1500 monitors EPT status failures. Only if an EPT status failure has not occurred, process 1500 determines a smart-verify starting program voltage V_PSjbased on a program-verify iteration performed on memory cells of String0 coupled to word line WLn. If, however, an EPT status failure has occurred, process 1500 reacquires smart-verify loop count SVloop_nand determines smart-verify starting program voltage V_PSjbased on a program-verify iteration performed on memory cells of String1 coupled to word line WLn.
FIG. 14B depicts example threshold voltage distributions of programmed states S1-S7 on word line WL1 ₁of second plane 1100 ₁following programming according to example process 1500 of FIG. 15 . In particular, after determining that an EPT status failure had occurred (as a result of shorted word lines WL1 ₀and WL2 ₀on first plane 1100 ₁of FIG. 11 ), process 1500 reacquired smart-verify loop count SVloop₀and determined a starting smart-verify program voltage V_PS0based on a program-verify iteration performed on memory cells of String1 coupled to word line WL0, and programmed memory cells of String0-String3 coupled to word line WL1 using the determined smart-verify starting program voltage V_PS0in single-plane mode. Comparing FIGS. 14A and 14B, example WL_kskip smart-verify process 1500 eliminates or substantially reduces overprogramming of lower programmed states S1-S3.
One embodiment includes an apparatus that includes a plurality of non-volatile memory cells and a control circuit coupled to the non-volatile memory cells. The control circuit is configured to perform a first program-verify iteration on a first set of non-volatile memory cells coupled to a first word line to determine a first starting program voltage that programs the first set of the non-volatile memory cells to a first programmed state, and program a second set of non-volatile memory cells coupled to the first word line beginning with the first starting program voltage only if a defect condition does not exist.
One embodiment includes an apparatus that includes a plurality of non-volatile memory cells and a control circuit coupled to the non-volatile memory cells. The control circuit is configured to program and verify a first set of the memory cells coupled to a first word line on a first plane and a second plane to determine a first starting program voltage needed to program the first set of memory cells to a particular programmed state, determine that the first plane programs more slowly than the second plane by a predetermined amount, program and verify a second set of the memory cells coupled to the first word line on the second plane to determine a second starting program voltage needed to program the second set of memory cells to the particular programmed state, terminate programming memory cells coupled to the first word line on the first plane, and program a third set of the memory cells coupled to the first word line on the second plane beginning with the second program voltage.
One embodiment includes a method including concurrently programming non- volatile memory cells coupled to a first word line on a first plane and a second plane, determining that the first plane programs more slowly than the second plane by a predetermined amount, terminating programming the non-volatile memory cells coupled to the first word line on the first plane, and performing program-verify iteration on a first set of the non-volatile memory cells coupled to the first word line on the second plane to determine a starting program voltage that programs the first set of the non-volatile memory cells to a first programmed state.
For purposes of this document, reference in the specification to “an embodiment,” “one embodiment,” “some embodiments,” or “another embodiment” may be used to describe different embodiments or the same embodiment.
For purposes of this document, a connection may be a direct connection or an indirect connection (e.g., via one or more other parts). In some cases, when an element is referred to as being connected or coupled to another element, the element may be directly connected to the other element or indirectly connected to the other element via intervening elements. When an element is referred to as being directly connected to another element, then there are no intervening elements between the element and the other element. Two devices are “in communication” if they are directly or indirectly connected so that they can communicate electronic signals between them.
For purposes of this document, the term “based on” may be read as “based at least in part on.”
For purposes of this document, without additional context, use of numerical terms such as a “first” object, a “second” object, and a “third” object may not imply an ordering of objects, but may instead be used for identification purposes to identify different objects.
For purposes of this document, the term “set” of objects may refer to a “set” of one or more of the objects.
The foregoing detailed description has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. The described embodiments were chosen in order to best explain the principles of the proposed technology and its practical application, to thereby enable others skilled in the art to best utilize it in various embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope be defined by the claims appended hereto.

Claims

1. An apparatus comprising:

a plurality of non-volatile memory cells; and

a control circuit coupled to the non-volatile memory cells, the control circuit configured to:

perform a first program-verify iteration on a first set of non-volatile memory cells coupled to a first word line to determine a first starting program voltage that programs the first set of the non-volatile memory cells to a first programmed state; and

program a second set of non-volatile memory cells coupled to the first word line beginning with the first starting program voltage only if a defect condition does not exist.

2. The apparatus of claim 1, wherein the control circuit is further configured to determine if the defect condition exists.

3. The apparatus of claim 1, wherein the control circuit is further configured to terminate programming of the non-volatile memory cells prior to completing programming of the non-volatile memory cells if the defect condition exists.

4. The apparatus of claim 1, wherein the control circuit is further configured to:

program a first plane and a second plane of the non-volatile memory cells; and

determine that the defect condition exists if the first plane programs slower than the second plane by a first amount.

5. The apparatus of claim 4, wherein the first amount is a predetermined number of iterations of a programming process.

6. The apparatus of claim 4, wherein the control circuit is further configured to terminate programming of the first plane prior to completing programming of the first plane after determining that the defect condition exists.

7. The apparatus of claim 4, wherein the control circuit is further configured to continue programming the second plane after determining that the defect condition exists.

8. The apparatus of claim 1, wherein the control circuit is further configured to program a third set of non-volatile memory cells coupled to a second word line beginning with the first starting program voltage only if the defect condition does not exist.

9. The apparatus of claim 1, wherein the control circuit is further configured to:

perform a second program-verify iteration on a third set of the non-volatile memory cells coupled to the first word line to determine a second starting program voltage that programs the third set of the non-volatile memory cells to the first programmed state; and

program the second set of the non-volatile memory cells coupled to the first word line beginning with the starting second program voltage if the defect condition exists.

10. The apparatus of claim 9, wherein the control circuit is further configured to program a fourth set of non-volatile memory cells coupled to a second word line beginning with the second program voltage if the defect condition exists.

11. The apparatus of claim 9, wherein the control circuit is further configured to:

program a first plane and a second plane of the non-volatile memory cells;

determine that the defect condition exists if the first plane programs slower than the second plane by a first amount;

terminate programming of the first plane prior to completing programming of the first plane after determining that the defect condition exists; and

resume programming of the first plane and the second plane after programming the second set of the non-volatile memory cells coupled to the first word line beginning with the second program voltage.

12. The apparatus of claim 1, wherein the plurality of non-volatile memory cells are arranged in a three dimensional structure.

13. An apparatus comprising:

a plurality of non-volatile memory cells; and

program and verify a first set of the memory cells coupled to a first word line on a first plane and a second plane to determine a first starting program voltage needed to program the first set of memory cells to a particular programmed state;

determine that the first plane programs more slowly than the second plane by a predetermined amount;

program and verify a second set of the memory cells coupled to the first word line on the second plane to determine a second starting program voltage needed to program the second set of memory cells to the particular programmed state;

terminate programming memory cells coupled to the first word line on the first plane; and

program a third set of the memory cells coupled to the first word line on the second plane beginning with the second starting program voltage.

14. The apparatus of claim 13, wherein a defect on the first word line on the first plane causes the first plane to program more slowly than the second plane by the predetermined amount.

15. The apparatus of claim 13, wherein a short between the first word line and a second word line on the first plane causes the first plane to program more slowly than the second plane by the predetermined amount.

16. The apparatus of claim 13, wherein the controller terminates programming of the first plane prior to completing programming of the first plane.

17. The apparatus of claim 13, wherein the controller is further configured to program a fourth set of the memory cells coupled to a second word line on the first plane and the second plane beginning with the second starting program voltage.

18. The apparatus of claim 13, wherein the plurality of non-volatile memory cells are arranged in a three dimensional structure.

19. A method comprising:

concurrently programming non-volatile memory cells coupled to a first word line on a first plane and a second plane;

determining that the first plane programs more slowly than the second plane by a predetermined amount;

terminating programming the non-volatile memory cells coupled to the first word line on the first plane; and

performing program-verify iteration on a first set of the non-volatile memory cells coupled to the first word line on the second plane to determine a starting program voltage that programs the first set of the non-volatile memory cells to a first programmed state.

20. The method of claim 19, further comprising concurrently programming a second set of non-volatile memory cells coupled to a second word line on the first plane and the second plane beginning with the determined starting program voltage.