This application relates to the operation of re-programmable non-volatile memory systems such as semiconductor flash memory that record data using charge stored in charge storage elements of memory cells.
Solid-state memory capable of nonvolatile storage of charge, particularly in the form of EEPROM and flash EEPROM packaged as a small form factor card, has recently become the storage of choice in a variety of mobile and handheld devices, notably information appliances and consumer electronics products. Unlike RAM (random access memory) that is also solid-state memory, flash memory is non-volatile, and retains its stored data even after power is turned off. Also, unlike ROM (read only memory), flash memory is rewritable similar to a disk storage device. In spite of the higher cost, flash memory is increasingly being used in mass storage applications.
Flash EEPROM is similar to EEPROM (electrically erasable and programmable read-only memory) in that it is a non-volatile memory that can be erased and have new data written or “programmed” into their memory cells. Both utilize a floating (unconnected) conductive gate, in a field effect transistor structure, positioned over a channel region in a semiconductor substrate, between source and drain regions. A control gate is then provided over the floating gate. The threshold voltage characteristic of the transistor is controlled by the amount of charge that is retained on the floating gate. That is, for a given level of charge on the floating gate, there is a corresponding voltage (threshold) that must be applied to the control gate before the transistor is turned “on” to permit conduction between its source and drain regions. Flash memory such as Flash EEPROM allows entire blocks of memory cells to be erased at the same time.
The floating gate can hold a range of charges and therefore can be programmed to any threshold voltage level within a threshold voltage window. The size of the threshold voltage window is delimited by the minimum and maximum threshold levels of the device, which in turn correspond to the range of the charges that can be programmed onto the floating gate. The threshold window generally depends on the memory device's characteristics, operating conditions and history. Each distinct, resolvable threshold voltage level range within the window may, in principle, be used to designate a definite memory state of the cell.
In order to improve read and program performance, multiple charge storage elements or memory transistors in an array are read or programmed in parallel. Thus, a “page” of memory elements are read or programmed together. In existing memory architectures, a row typically contains several interleaved pages or it may constitute one page. All memory elements of a page are read or programmed together.
Nonvolatile memory devices are also manufactured from memory cells with a dielectric layer for storing charge. Instead of the conductive floating gate elements described earlier, a dielectric layer is used. An ONO dielectric layer extends across the channel between source and drain diffusions. The charge for one data bit is localized in the dielectric layer adjacent to the drain, and the charge for the other data bit is localized in the dielectric layer adjacent to the source. For example, a nonvolatile memory cell may have a trapping dielectric sandwiched between two silicon dioxide layers. Multi-state data storage is implemented by separately reading the binary states of the spatially separated charge storage regions within the dielectric.
Methods are presented for the operating of a non-volatile memory circuit having an array of a plurality of programmable memory cells formed along bit lines and word line, the method including maintaining a record of memory cells of the array that are slow to program and performing a programming operation for memory cells on a selected word line. The programming operation includes determining from the record cells on the selecting word line that are slow to program and applying a pulse on the selected word line. Prior to applying the pulse on the selected word line, the bit lines corresponding to the memory cells along the selected word line are biased, where the biasing including: for memory cells along the selected word line not to be programmed, setting a programming inhibit voltage on the corresponding bit lines; for memory cells along the selected word line that are to be programmed and that are not slow to program memory cells, setting a program enable voltage on the corresponding bit lines; and, for slow to program memory cells along the selected word line that are to be programmed, setting an enhanced program enable voltage on the corresponding bit lines. The program enable voltage is a voltage intermediate to the program inhibit voltage and the enhanced program enable voltage.
Additional methods are presented for operating a non-volatile memory circuit having an array of a plurality of programmable memory cells formed along bit lines and word line, that includes maintaining a record of memory cells of the array that are slow to program and performing a programming operation for memory cells on a selected word line. The programming operation includes determining from the record cells on the selecting word line that are slow to program and biasing the bit lines corresponding to the memory cells along the selected word line, where the biasing includes: for memory cells along the selected word line not to be programmed, setting a programming inhibit voltage on the corresponding bit lines; and, for memory cells along the selected word line that are to be programmed, setting a program enable voltage on the corresponding bit lines. A first pulse on the selected word line, where for slow to program memory cells along the selected word line that are to be programmed, the corresponding bit lines are maintained at the program enable voltage for the duration of the first pulse, and for memory cells along the selected word line that are to be programmed and that are not slow to program memory cells, the corresponding bit lines are switched from the program enable voltage to the program inhibit voltage during the first pulse.
Further of methods are presented for the operation of a non-volatile memory circuit having an array of a plurality of programmable memory cells formed along bit lines and word line that include maintaining a record of memory cells of the array that are slow to program and writing a page of data along a selected word line. The writing of the page of data along the selected word line includes: performing an alternating series pulse and verify operations for the memory cells along the selected word line until the page of data is determined to be successfully written, wherein memory cell along the selected word line that verify as written to a corresponding target state are inhibited from further programming; subsequently determining whether any memory cells along the selected word line that have failed to verify and that are listed in the record as slow to program; and subsequently applying an additional pulse to the selected word line with all of the memory cells inhibited from further programming except the memory cells determined both to be slow to program and to have failed to verify.
In a non-volatile flash memory circuit having an array of memory cells formed according to a NAND type of architecture, a method is presented for determining NAND strings of a block of the array having slow to program memory cells. The memory cells of the NAND strings are formed along word lines and each of the NAND strings of the block connected along a corresponding bit line. A first write operation is performed for memory cells of the block along a first word line corresponding to a first set of a plurality bit lines, but not for memory cells of the block along the first word line corresponding to a second set of one or more bit lines, where the second set of bit lines is distinct from the first set of bit lines. A number of programming pulses used to successfully perform the first write operation is determined. A second write operation is performed for memory cells of the block along the first word line corresponding to the second set of bit lines, but not for memory cells of the block along the first word line corresponding to the first set of bit lines. A number of programming pulses used to successfully the second write operation is determined. A comparison is performed of the number of programming pulses used to successfully perform the first write operation with the number of programming pulses used to successfully perform the second write operation; and based upon the comparison, a determination is performed of whether NAND strings corresponding to the second set of bit lines include memory cells that are slow to program.
In a non-volatile flash memory circuit having an array of memory cells formed according to a NAND type of architecture, a method is presented of determining NAND strings of a block of the array having slow to program memory cells, the memory cells of the NAND strings being formed along word lines and each of the NAND strings of the block connected along a corresponding bit line. A first write operation is performed for a first set of memory cells of the block along a first word line corresponding to a first set of a plurality bit lines, but not for a second set of one or more memory cells of the block along the first word line corresponding to a second set of one or more bit lines, where the second set of bit lines is distinct from the first set of bit lines. An amount of current through the first set of memory cells during the first write operation is determined. A second write operation is performed for the second set of memory cells, but not for the first set of memory cells an amount of current through the second set of memory cells during the second write operation is determined. A comparison is performed of the amount of current through the first set of memory cells during the first write operation with the amount of current through the second set of memory cells during the second write operation; and based upon the comparison, a determination is made of whether NAND strings corresponding to the second set of bit lines include memory cells that are slow to program.
In a non-volatile flash memory circuit having an array of memory cells formed according to a NAND type of architecture, a further method is presented for determining NAND strings of a block of the array having slow to program memory cells, the memory cells of the NAND strings being formed along word lines and each of the NAND strings of the block connected along a corresponding bit line. The memory cells of a first block are programmed and an erase operation is subsequently performed on the first block. A comparison is performed of the level of erasure of memory cells of the first block corresponding to a first set of a plurality bit line relative to the level of erase of memory cells of the first block corresponding to a second set of one or more bit lines, where the second set of bit lines is distinct from the first set of bit lines. Based upon the comparison, a determination is performed of whether NAND strings corresponding to the second set of bit lines include memory cells that are slow to program.
In a non-volatile flash memory circuit having an array of memory cells formed according to a NAND type of architecture, additional methods are described for determining NAND strings of a block of the array having slow to program memory cells, where the memory cells of the NAND strings are formed along word lines and each of the NAND strings of the block is connected along a corresponding bit line. A first number of programming pulses is applied to a first word line of the block with memory cells of the block corresponding to first and second sets of bit lines enabled for programming, the first set of bit lines being a plurality bit lines and the second set of bit lines including one or more bit lines, where the second set of bit lines is distinct from the first set of bit lines. A comparison is subsequently performed of the relative amount of programming of memory cells corresponding to the second set of bit lines with respect to the amount of programming of memory cells corresponding to the first set of bit lines, and, based upon the comparison, a determination is performed of whether NAND strings corresponding to the second set of bit lines include memory cells that are slow to program.
Various aspects, advantages, features and embodiments are included in the following description of exemplary examples thereof, which description should be taken in conjunction with the accompanying drawings. All patents, patent applications, articles, other publications, documents and things referenced herein are hereby incorporated herein by this reference in their entirety for all purposes. To the extent of any inconsistency or conflict in the definition or use of terms between any of the incorporated publications, documents or things and the present application, those of the present application shall prevail.
With respect to the memory section 102, semiconductor memory devices include volatile memory devices, such as dynamic random access memory (“DRAM”) or static random access memory (“SRAM”) devices, non-volatile memory devices, such as resistive random access memory (“ReRAM”), electrically erasable programmable read only memory (“EEPROM”), flash memory (which can also be considered a subset of EEPROM), ferroelectric random access memory (“FRAM”), and magnetoresistive random access memory (“MRAM”), and other semiconductor elements capable of storing information. Each type of memory device may have different configurations. For example, flash memory devices may be configured in a NAND or a NOR configuration.
The memory devices can be formed from passive and/or active elements, in any combinations. By way of non-limiting example, passive semiconductor memory elements include ReRAM device elements, which in some embodiments include a resistivity switching storage element, such as an anti-fuse, phase change material, etc., and optionally a steering element, such as a diode, etc. Further by way of non-limiting example, active semiconductor memory elements include EEPROM and flash memory device elements, which in some embodiments include elements containing a charge storage region, such as a floating gate, conductive nanoparticles, or a charge storage dielectric material.
Multiple memory elements may be configured so that they are connected in series or so that each element is individually accessible. By way of non-limiting example, flash memory devices in a NAND configuration (NAND memory) typically contain memory elements connected in series. A NAND memory array may be configured so that the array is composed of multiple strings of memory in which a string is composed of multiple memory elements sharing a single bit line and accessed as a group. Alternatively, memory elements may be configured so that each element is individually accessible, e.g., a NOR memory array. NAND and NOR memory configurations are exemplary, and memory elements may be otherwise configured.
The semiconductor memory elements located within and/or over a substrate may be arranged in two or three dimensions, such as a two dimensional memory structure or a three dimensional memory structure.
In a two dimensional memory structure, the semiconductor memory elements are arranged in a single plane or a single memory device level. Typically, in a two dimensional memory structure, memory elements are arranged in a plane (e.g., in an x-z direction plane) which extends substantially parallel to a major surface of a substrate that supports the memory elements. The substrate may be a wafer over or in which the layer of the memory elements are formed or it may be a carrier substrate which is attached to the memory elements after they are formed. As a non-limiting example, the substrate may include a semiconductor such as silicon.
The memory elements may be arranged in the single memory device level in an ordered array, such as in a plurality of rows and/or columns. However, the memory elements may be arrayed in non-regular or non-orthogonal configurations. The memory elements may each have two or more electrodes or contact lines, such as bit lines and word lines.
A three dimensional memory array is arranged so that memory elements occupy multiple planes or multiple memory device levels, thereby forming a structure in three dimensions (i.e., in the x, y and z directions, where the y direction is substantially perpendicular and the x and z directions are substantially parallel to the major surface of the substrate).
As a non-limiting example, a three dimensional memory structure may be vertically arranged as a stack of multiple two dimensional memory device levels. As another non-limiting example, a three dimensional memory array may be arranged as multiple vertical columns (e.g., columns extending substantially perpendicular to the major surface of the substrate, i.e., in the y direction) with each column having multiple memory elements in each column. The columns may be arranged in a two dimensional configuration, e.g., in an x-z plane, resulting in a three dimensional arrangement of memory elements with elements on multiple vertically stacked memory planes. Other configurations of memory elements in three dimensions can also constitute a three dimensional memory array.
By way of non-limiting example, in a three dimensional NAND memory array, the memory elements may be coupled together to form a NAND string within a single horizontal (e.g., x-z) memory device levels. Alternatively, the memory elements may be coupled together to form a vertical NAND string that traverses across multiple horizontal memory device levels. Other three dimensional configurations can be envisioned wherein some NAND strings contain memory elements in a single memory level while other strings contain memory elements which span through multiple memory levels. Three dimensional memory arrays may also be designed in a NOR configuration and in a ReRAM configuration.
Typically, in a monolithic three dimensional memory array, one or more memory device levels are formed above a single substrate. Optionally, the monolithic three dimensional memory array may also have one or more memory layers at least partially within the single substrate. As a non-limiting example, the substrate may include a semiconductor such as silicon. In a monolithic three dimensional array, the layers constituting each memory device level of the array are typically formed on the layers of the underlying memory device levels of the array. However, layers of adjacent memory device levels of a monolithic three dimensional memory array may be shared or have intervening layers between memory device levels.
Then again, two dimensional arrays may be formed separately and then packaged together to form a non-monolithic memory device having multiple layers of memory. For example, non-monolithic stacked memories can be constructed by forming memory levels on separate substrates and then stacking the memory levels atop each other. The substrates may be thinned or removed from the memory device levels before stacking, but as the memory device levels are initially formed over separate substrates, the resulting memory arrays are not monolithic three dimensional memory arrays. Further, multiple two dimensional memory arrays or three dimensional memory arrays (monolithic or non-monolithic) may be formed on separate chips and then packaged together to form a stacked-chip memory device.
Associated circuitry is typically required for operation of the memory elements and for communication with the memory elements. As non-limiting examples, memory devices may have circuitry used for controlling and driving memory elements to accomplish functions such as programming and reading. This associated circuitry may be on the same substrate as the memory elements and/or on a separate substrate. For example, a controller for memory read-write operations may be located on a separate controller chip and/or on the same substrate as the memory elements.
It will be recognized that the following is not limited to the two dimensional and three dimensional exemplary structures described but cover all relevant memory structures within the spirit and scope as described herein
Physical Memory Structure
There are many commercially successful non-volatile solid-state memory devices being used today. These memory devices may employ different types of memory cells, each type having one or more charge storage element.
Typical non-volatile memory cells include EEPROM and flash EEPROM: Also, examples of memory devices utilizing dielectric storage elements.
In practice, the memory state of a cell is usually read by sensing the conduction current across the source and drain electrodes of the cell when a reference voltage is applied to the control gate. Thus, for each given charge on the floating gate of a cell, a corresponding conduction current with respect to a fixed reference control gate voltage may be detected. Similarly, the range, of charge programmable onto the floating gate defines a corresponding threshold voltage window or a corresponding conduction current window.
Alternatively, instead of detecting the conduction current among a partitioned current window, it is possible to set the threshold voltage for a given memory state under test at the control gate and detect if the conduction current is lower or higher than a threshold current (cell-read reference current). In one implementation the detection of the conduction current relative to a threshold current is accomplished by examining the rate the conduction current is discharging through the capacitance of the bit line.
As can be seen from the description above, the more states a memory cell is made to store, the more finely divided is its threshold window. For example, a memory device may have memory cells having a threshold window that ranges from −1.5V to 5V. This provides a maximum width of 6.5V. If the memory cell is to store 16 states, each state may occupy from 200 mV to 300 mV in the threshold window. This will require higher precision in programming and reading operations in order to be able to achieve the required resolution.
NAND Structure
When an addressed memory transistor 10 within a NAND string is read or is verified during programming, its control gate 30 is supplied with an appropriate voltage. At the same time, the rest of the non-addressed memory transistors in the NAND string 50 are fully turned on by application of sufficient voltage on their control gates. In this way, a conductive path is effectively created from the source of the individual memory transistor to the source terminal 54 of the NAND string and likewise for the drain of the individual memory transistor to the drain terminal 56 of the cell.
Physical Organization of the Memory
One difference between flash memory and other of types of memory is that a cell must be programmed from the erased state. That is the floating gate must first be emptied of charge. Programming then adds a desired amount of charge back to the floating gate. It does not support removing a portion of the charge from the floating gate to go from a more programmed state to a lesser one. This means that updated data cannot overwrite existing data and must be written to a previous unwritten location.
Furthermore erasing is to empty all the charges from the floating gate and generally takes appreciable time. For that reason, it will be cumbersome and very slow to erase cell by cell or even page by page. In practice, the array of memory cells is divided into a large number of blocks of memory cells. As is common for flash EEPROM systems, the block is the unit of erase. That is, each block contains the minimum number of memory cells that are erased together. While aggregating a large number of cells in a block to be erased in parallel will improve erase performance, a large size block also entails dealing with a larger number of update and obsolete data.
Each block is typically divided into a number of physical pages. A logical page is a unit of programming or reading that contains a number of bits equal to the number of cells in a physical page. In a memory that stores one bit per cell, one physical page stores one logical page of data. In memories that store two bits per cell, a physical page stores two logical pages. The number of logical pages stored in a physical page thus reflects the number of bits stored per cell. In one embodiment, the individual pages may be divided into segments and the segments may contain the fewest number of cells that are written at one time as a basic programming operation. One or more logical pages of data are typically stored in one row of memory cells. A page can store one or more sectors. A sector includes user data and overhead data.
All-Bit, Full-Sequence MLC Programming
A 2-bit code having a lower bit and an upper bit can be used to represent each of the four memory states. For example, the “0”, “1”, “2” and “3” states are respectively represented by “11”, “01”, “00” and ‘10”. The 2-bit data may be read from the memory by sensing in “full-sequence” mode where the two bits are sensed together by sensing relative to the read demarcation threshold values rV1, rV2 and rV3 in three sub-passes respectively.
3-D NAND Structures
An alternative arrangement to a conventional two-dimensional (2-D) NAND array is a three-dimensional (3-D) array. In contrast to 2-D NAND arrays, which are formed along a planar surface of a semiconductor wafer, 3-D arrays extend up from the wafer surface and generally include stacks, or columns, of memory cells extending upwards. Various 3-D arrangements are possible. In one arrangement a NAND string is formed vertically with one end (e.g. source) at the wafer surface and the other end (e.g. drain) on top. In another arrangement a NAND string is formed in a U-shape so that both ends of the NAND string are accessible on top, thus facilitating connections between such strings.
As with planar NAND strings, select gates 705, 707, are located at either end of the string to allow the NAND string to be selectively connected to, or isolated from, external elements 709, 711. Such external elements are generally conductive lines such as common source lines or bit lines that serve large numbers of NAND strings. Vertical NAND strings may be operated in a similar manner to planar NAND strings and both SLC and MLC operation is possible. While
A 3D NAND array can, loosely speaking, be formed tilting up the respective structures 50 and 210 of
To the right of
Detection and Recording of Memory Hole-Interconnect Spacing Defects
Referring back to
Considering the structural background further,
In a first algorithm for identifying slow cells and store the slow to program cells information, the difference in the number of programming pules, or programming loop count, is used. Referring back to bit lines 0-7 in
As slow cells will require more programming loops than normal cells, a NAND string in which defects are present for the top cells (DefOT) will have NPOT>NP1 and for the bottom cells (DefOB) if NPOB>NP1, where a margin of some number of counts (such as NP1+2) can be used. The margin can be a settable parameter. To counter process variations, the comparison reference NP1 can be local, with each column of a finger having its own NP1 or a coarser granularity can be sued for the references: for example, to save test time, the same NP1 can be used for a whole block or set of blocks or for plane.
Note that NP1 can be higher if inner cells are slow to program due to some other defect, which may make it more difficult to distinguish inner from defective outer cells. Because of this, in some embodiments NP1 can be calibrated to a certain number or range in order to distinguish or detect outer bad strings accurately. A value can be calibrated and one reference number be kept in a register to check that NP1 has not drifted too much from block to block.
In order to capture weak strings that may not be detected at time 0, but which can degrade device operation in the field, the memory system to apply stress and then detection method to accelerate weak strings. For example, the stress can be applied with all word lines selected and the LI at 0V, or, alternately, a high voltage on the LI and the word lines on all blocks at 0V, where the well can be floated to avoid overstressing the cells.
Once the slow to program strings are determined, these can be marked down as slow (bad) strings and stored for reference in, for example, a specified area of the non-volatile memory or a fuse memory or other location where they can be maintained and accessed. The result of DefOT or DefOB to mark which strings are defective can then be read out for use during program operations. This defect information can be stored in several formats. In one option, the memory can store block number and string information for only blocks that have at least one of the strings defective for either Outer_Bottom or Outter_Top.
In another arrangement, the string information can be recorded for all blocks without making decision of if that block has any defected string or not, as illustrated schematically in
Another algorithm for determining NAND strings with slow to program cells be based on the cells' current (ICELL), rather than the program loop count, during the verify phase or subsequent sensing operation. In this version, inner cells are again programmed using a 0110110 sequence, but instead of a loop count, the process now measures Icell current for the inner cell programming operation (ICELL1). Only the outer top cells are programmed using a 1011011 sequence and the Icell current for outer top cell programming operation (ICELLOT) is measured; and only the outer bottom cells using a 11011101 sequence is programmed and the Icell current for the outer bottom cell programming operation (ICELLOB) is measured. As slow cells will have a lower ICELL current than normal cells, defective NAND strings can be determined as DefOT=if(ICELLOT<ICELL1) or DefOB=if(ICELLOB<ICELL1), where an off-set can again be included, if desired, to avoid over-characterization. The off-set can be a settable parameter. As with the program loop version, the reference value (here ICELL1) can be maintained for each finger for column or with a coarser granularity, such as an average of several blocks. The result of the determination can then be recorded as discussed above as well.
A third algorithm to determine slow to program NAND strings uses a test sequence to stress and detect weak strings, where after applying a stress slow to erase strings are identified and the information is stored as described above. For the stress phase, a program stress can be applied with all word lines selected and the LI at 0V, or, alternately, a high voltage on the LI and the word lines on all blocks at 0V, where the well can be floated to avoid overstressing the cells. For the detection phase, the defect will cause strings to be resistive and slow to erase. After the die, or a selected set of blocks, is stressed, the detection phase begins with the blocks the blocks being tested. For example, if a flash write mode is available, the blocks can all be written with “00” data, for example. A shallow erase block-by-block test is then performed, after which a read with “FF” (erased) data is performed to determine which strings were slow to erase. Alternately, the decision can be made based on string current measurements. The block numbers and slow strings information can then be recorded as above.
An alternate detection is for the cells on the different NAND strings being tested to be programmed by a fixed number of pulses to, for example, the highest data state (such as “3” in
Methods to Improve Programming of Slow Cells
This section looks at methods to improve the programming of slow cells. Although this will discussed primarily in the context of BiCS types which have defects in tungsten deposition leading to memory hole to LI shorts, such as discussed in the last section, the techniques are generally applicable. In particular, the various techniques described below can be applied to the various 2D and 3D non-volatile memories described in earlier sections as well as for other memories that use similar programming techniques.
As a first step, before doing a program or erase operation, the memory will determine if a selected string in a selected blocks is slow to program. This can be done be reading the listing of these defects, such as described in the last section, and checking the corresponding byte and mark the selected string bits for DefOT or DefOB. In the exemplary embodiments, depending on the defective bit information, either bit lines 1, 5, bit lines 2, 6, or all of bit lines 1, 2, 5 and 6 are applied with countermeasure. If any Def-bits are zero then those cells will be treated as a normal block.
In a first technique, the memory selectively supplies a different bit line bias to selected slow to program cells, such as a negative bias that can be provided from an extra pump, if such voltages are not already available on the device. This manipulation of bit line voltages allows the memory to change effective VPGM voltage for the slow cell. This is illustrated schematically in
Another option for improving the programming rate of slow cell is through use of an elongated programming time for the pulse applied to the slow cells, relative to the pulse length for normal cells. This is illustrated schematically in
For example, suppose the main programming pulse is applied for four clock cycles in a standard write that would not account for the slow cells. Instead, a longer, say 6 cycle, program pulse is used. Then all the faster cells will be cut-off after for cycles, but the slower cells will be applied the programming pulse for all 6 clock cycles in each pulse until the cell verifies (or reaches the maximum number of loops).
A further option is the use of a dummy programming pulse to push slower cells higher. For example, a memory typically will allow for some number of failed bits in a program operation, a normal case Bit Scan Pass Fail criterion BSPF. Base on the presence of slow cells, the DefOT or DefOB value in the exemplary embodiment, if one of these bits is higher the memory can use a new BSPF=N×BSPF, for some factor N, and if both bits are use a new BSPF=2N×BSPF, where N can be determined as part of device characterization. Once the chosen BSPF criteria is passed, the memory can inhibit all cells which passed the corresponding program verify level and then can apply some number of dummy (without verify) program pulses with a higher VPGM or with wider pulse width to push Vt of slow cells higher. This is illustrated with respect to
As shown in the Vt distribution
To improve upon this situation, the BSPF criterion is increased as explained earlier, so the even though many of the programming cells have not passed the actual (non-modified) BSPF criterion, the memory considers the programming algorithm as passed. After this passing the (relaxed) BSPF criterion, the memory can apply one or more dummy programming pulse with higher VPGM value or for a longer duration. An example of this is illustrated by the write waveform of
As shown in the Vt distribution, after two normal programming pulses the P state distribution meets the relaxed BSPF criterion. The slow cell are then given an additional, larger dummy pulse, without a subsequent verify or lockout operation.
The foregoing detailed description has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the above 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 explain the principles involved and its practical application, to thereby enable others to best utilize the 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.
Number | Name | Date | Kind |
---|---|---|---|
3710348 | Craft | Jan 1973 | A |
3895360 | Cricchi et al. | Jul 1975 | A |
4357685 | Daniele et al. | Nov 1982 | A |
4426688 | Moxley | Jan 1984 | A |
4720815 | Ogawa | Jan 1988 | A |
4757477 | Nagayama et al. | Jul 1988 | A |
5070032 | Yuan et al. | Dec 1991 | A |
5095344 | Harari | Mar 1992 | A |
5172338 | Mehrotra et al. | Dec 1992 | A |
5200959 | Gross et al. | Apr 1993 | A |
5270979 | Harari et al. | Dec 1993 | A |
5313421 | Guterman et al. | May 1994 | A |
5315541 | Harari et al. | May 1994 | A |
5343063 | Yuan et al. | Aug 1994 | A |
5380672 | Yuan et al. | Jan 1995 | A |
5386390 | Okitaka | Jan 1995 | A |
5418752 | Harari et al. | May 1995 | A |
5428621 | Mehrotra et al. | Jun 1995 | A |
5430679 | Hiltebeitel et al. | Jul 1995 | A |
5430859 | Norman et al. | Jul 1995 | A |
5442748 | Chang et al. | Aug 1995 | A |
5479370 | Furuyama et al. | Dec 1995 | A |
5485425 | Iwai et al. | Jan 1996 | A |
5570315 | Tanaka et al. | Oct 1996 | A |
5595924 | Yuan et al. | Jan 1997 | A |
5602987 | Harari et al. | Feb 1997 | A |
5642312 | Harari | Jun 1997 | A |
5657332 | Auclair et al. | Aug 1997 | A |
5661053 | Yuan | Aug 1997 | A |
5663901 | Wallace et al. | Sep 1997 | A |
5699300 | Akamatsu et al. | Dec 1997 | A |
5712180 | Guterman et al. | Jan 1998 | A |
5768192 | Eitan | Jun 1998 | A |
5774397 | Endoh et al. | Jun 1998 | A |
5783958 | Lysinger | Jul 1998 | A |
5822245 | Gupta et al. | Oct 1998 | A |
5848009 | Lee et al. | Dec 1998 | A |
5862080 | Harari et al. | Jan 1999 | A |
5890192 | Lee et al. | Mar 1999 | A |
5903495 | Takeuchi et al. | May 1999 | A |
5930167 | Lee et al. | Jul 1999 | A |
5936971 | Harari et al. | Aug 1999 | A |
6011725 | Eitan | Jan 2000 | A |
6021463 | Belser | Feb 2000 | A |
6038167 | Miwa et al. | Mar 2000 | A |
6038184 | Naritake | Mar 2000 | A |
6046935 | Takeuchi et al. | Apr 2000 | A |
6091666 | Arase et al. | Jul 2000 | A |
6134148 | Kawahara et al. | Oct 2000 | A |
6151248 | Harari et al. | Nov 2000 | A |
6222762 | Guterman et al. | Apr 2001 | B1 |
6230233 | Lofgren et al. | May 2001 | B1 |
6252800 | Chida | Jun 2001 | B1 |
6266273 | Conley et al. | Jul 2001 | B1 |
6282624 | Kimura et al. | Aug 2001 | B1 |
6353553 | Tamada et al. | Mar 2002 | B1 |
6426893 | Conley et al. | Jul 2002 | B1 |
6456528 | Chen | Sep 2002 | B1 |
6480423 | Toda et al. | Nov 2002 | B2 |
6510488 | Lasser | Jan 2003 | B2 |
6512263 | Yuan | Jan 2003 | B1 |
6522580 | Chen et al. | Feb 2003 | B2 |
6523132 | Harari et al. | Feb 2003 | B1 |
6560146 | Cernea | May 2003 | B2 |
6581142 | Jacobs | Jun 2003 | B1 |
6594177 | Matarrese et al. | Jul 2003 | B2 |
6657891 | Shibata et al. | Dec 2003 | B1 |
6771536 | Li et al. | Aug 2004 | B2 |
6813184 | Lee | Nov 2004 | B2 |
6853596 | Cheung | Feb 2005 | B2 |
6870768 | Cernea | Mar 2005 | B2 |
6967873 | Hamilton et al. | Nov 2005 | B2 |
6990018 | Tanaka et al. | Jan 2006 | B2 |
6996017 | Scheuerlein et al. | Feb 2006 | B2 |
7027330 | Park | Apr 2006 | B2 |
7039781 | Iwata et al. | May 2006 | B2 |
7057939 | Li et al. | Jun 2006 | B2 |
7058818 | Dariel | Jun 2006 | B2 |
7076611 | Steere et al. | Jul 2006 | B2 |
7110294 | Kawaii | Sep 2006 | B2 |
7158421 | Li et al. | Jan 2007 | B2 |
7170802 | Cernea et al. | Jan 2007 | B2 |
7206230 | Li et al. | Apr 2007 | B2 |
7224605 | Moogat et al. | May 2007 | B1 |
7257689 | Baird | Aug 2007 | B1 |
7299314 | Lin et al. | Nov 2007 | B2 |
7310347 | Lasser | Dec 2007 | B2 |
7345928 | Li | Mar 2008 | B2 |
7405985 | Cernea et al. | Jul 2008 | B2 |
7411846 | Terzioglu | Aug 2008 | B2 |
7420847 | Li | Sep 2008 | B2 |
7426623 | Lasser | Sep 2008 | B2 |
7447070 | Cernea | Nov 2008 | B2 |
7490283 | Gorobets et al. | Feb 2009 | B2 |
7493457 | Murin | Feb 2009 | B2 |
7502254 | Murin et al. | Mar 2009 | B2 |
7502259 | Gorobets | Mar 2009 | B2 |
7961512 | Li et al. | Jun 2011 | B2 |
7986554 | Li | Jul 2011 | B2 |
8027195 | Li et al. | Sep 2011 | B2 |
8040744 | Gorobets et al. | Oct 2011 | B2 |
8054684 | Gorobets et al. | Nov 2011 | B2 |
8094500 | Paley et al. | Jan 2012 | B2 |
8144512 | Huang et al. | Mar 2012 | B2 |
8244960 | Paley et al. | Aug 2012 | B2 |
8379454 | Kochar et al. | Feb 2013 | B2 |
8565019 | Honda et al. | Oct 2013 | B2 |
8700840 | Paley et al. | Apr 2014 | B2 |
8913446 | Harada | Dec 2014 | B2 |
8933516 | Wu et al. | Jan 2015 | B1 |
20010000023 | Kawahara et al. | Mar 2001 | A1 |
20020118574 | Gongwer et al. | Aug 2002 | A1 |
20030182317 | Kahn et al. | Sep 2003 | A1 |
20030223274 | Cernea | Dec 2003 | A1 |
20040060031 | Cernea | Mar 2004 | A1 |
20040109357 | Cernea et al. | Jun 2004 | A1 |
20050073884 | Gonzalez et al. | Apr 2005 | A1 |
20050083735 | Chen | Apr 2005 | A1 |
20050141387 | Cernea et al. | Jun 2005 | A1 |
20050144360 | Bennett et al. | Jun 2005 | A1 |
20050144365 | Gorobets et al. | Jun 2005 | A1 |
20050213393 | Lasser | Sep 2005 | A1 |
20060114726 | Kozakai et al. | Jun 2006 | A1 |
20060126390 | Gorobets et al. | Jun 2006 | A1 |
20060136656 | Conley et al. | Jun 2006 | A1 |
20060161728 | Bennett et al. | Jul 2006 | A1 |
20070061502 | Lasser et al. | Mar 2007 | A1 |
20070065119 | Pomerantz | Mar 2007 | A1 |
20070091677 | Lasser et al. | Apr 2007 | A1 |
20070103977 | Conley et al. | May 2007 | A1 |
20070159652 | Sato | Jul 2007 | A1 |
20070180346 | Murin | Aug 2007 | A1 |
20070186032 | Sinclair et al. | Aug 2007 | A1 |
20070211530 | Nakano | Sep 2007 | A1 |
20070220197 | Lasser | Sep 2007 | A1 |
20070237006 | Murin et al. | Oct 2007 | A1 |
20070260808 | Raines et al. | Nov 2007 | A1 |
20070268745 | Lasser | Nov 2007 | A1 |
20070283081 | Lasser | Dec 2007 | A1 |
20070285980 | Shimizu et al. | Dec 2007 | A1 |
20080002467 | Tsuji | Jan 2008 | A1 |
20080082736 | Chow et al. | Apr 2008 | A1 |
20080104309 | Cheon et al. | May 2008 | A1 |
20080104312 | Lasser | May 2008 | A1 |
20080112238 | Kim et al. | May 2008 | A1 |
20080147996 | Jenkins et al. | Jun 2008 | A1 |
20080159012 | Kim | Jul 2008 | A1 |
20080181000 | Lasser | Jul 2008 | A1 |
20080209112 | Yu et al. | Aug 2008 | A1 |
20080244338 | Mokhlesi et al. | Oct 2008 | A1 |
20080244367 | Chin et al. | Oct 2008 | A1 |
20080250220 | Ito et al. | Oct 2008 | A1 |
20080250300 | Mokhlesi et al. | Oct 2008 | A1 |
20080253181 | Edahiro | Oct 2008 | A1 |
20080279005 | France | Nov 2008 | A1 |
20080294814 | Gorobets | Nov 2008 | A1 |
20080301532 | Uchikawa et al. | Dec 2008 | A1 |
20080307192 | Sinclair et al. | Dec 2008 | A1 |
20080310224 | Roohparvar et al. | Dec 2008 | A1 |
20090067244 | Li et al. | Mar 2009 | A1 |
20090089481 | Kapoor et al. | Apr 2009 | A1 |
20090089482 | Traister | Apr 2009 | A1 |
20090089520 | Saha et al. | Apr 2009 | A1 |
20090094482 | Zilberman | Apr 2009 | A1 |
20090172247 | Bar-Or et al. | Jul 2009 | A1 |
20090172498 | Shlick et al. | Jul 2009 | A1 |
20090310408 | Lee et al. | Dec 2009 | A1 |
20100037012 | Yano et al. | Feb 2010 | A1 |
20100107004 | Bottelli et al. | Apr 2010 | A1 |
20100157641 | Shalvi et al. | Jun 2010 | A1 |
20100172179 | Gorobets et al. | Jul 2010 | A1 |
20100172180 | Paley et al. | Jul 2010 | A1 |
20100174845 | Gorobets et al. | Jul 2010 | A1 |
20100174846 | Paley et al. | Jul 2010 | A1 |
20100174847 | Paley et al. | Jul 2010 | A1 |
20100287217 | Borchers et al. | Nov 2010 | A1 |
20100325351 | Bennett | Dec 2010 | A1 |
20100329007 | Chibvongodze et al. | Dec 2010 | A1 |
20110063909 | Komatsu | Mar 2011 | A1 |
20110096601 | Gavens et al. | Apr 2011 | A1 |
20110099460 | Dusija et al. | Apr 2011 | A1 |
20110153913 | Huang et al. | Jun 2011 | A1 |
20110292724 | Kim | Dec 2011 | A1 |
Number | Date | Country |
---|---|---|
1549133 | Nov 2004 | CN |
101421797 | Apr 2009 | CN |
61-292747 | Dec 1986 | JP |
01-128297 | May 1989 | JP |
06-150666 | May 1994 | JP |
98-44420 | Oct 1998 | WO |
00-49488 | Aug 2000 | WO |
03-025939 | Mar 2003 | WO |
2006-064318 | Jun 2006 | WO |
2007-141783 | Dec 2007 | WO |
Entry |
---|
“Numonyx Sector-Based Compact File System (SCFS) Software is a Feature-Rich Flash Solution,” Numonyx, Nov. 3, 2009, 2 pages. |
“SanDisk, Toshiba Develop 32-Nanometer NAND Flash Technology,” SanDisk Corporation and Toshiba Corporation, Feb. 11, 2009, www.physorg.com/news153597019.html, 9 pages. |
Chang et al., “Real-Time Garbage Collection for Flash-Memory Storage Systems of Real-Time Embedded Systems,” Nov. 2004, ACM, ACM Transactions on Embedded Computing Systems, vol. 3, pp. 837-863. |
Choudhuri et al., “Performance Improvement of Block Based NAND Flash Translation Layer,” Codes + ISSS '07, Salzburg, Austria, Sep. 2007, pp. 257-262. |
Eitan et al., “NROM: A Novel Localized Trapping, 2-Bit Nonvolatile Memory Cell,” IEEE Electron Device Letters, vol. 21, No. 11, Nov. 2000, pp. 543-545. |
Im et al., “Storage Architecture and Software Support for SLC/MLC Combined Flash Memory,” Mar. 2009, ACM, SAC'09, pp. 1664-1669. |
Kang et al., “A Superblock-Based Flash Translation Layer for NAND Flash Memory,” EMSOFT'06, Oct. 2006, pp. 161-170. |
Lee et al., “Block Recycling Schemes and Their Cost-Based Optimization in NAND Flash Memory Based Storage System,” Oct. 2007, ACM., EMSOFT '07, pp. 174-182. |
Raz et al., “Implementing MLC NAND Flash for Cost-Effective, High-Capacity Memory,” Sep. 2003., M-Systems, 13 pages. |