The following 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.
For a non-volatile memory having a plurality of blocks formed according to a NAND type architecture in which memory cells of a block are formed along multiple word lines, and in which the word lines of a block are written sequentially from a first end to a second end, a method is present to determine the last written word line in a partially written block. A sensing operation is performed on a first word line of the partially written block, where the sensing operation includes: applying a first sensing voltage along the first word line; applying a first non-selected word line read voltage along word lines between the first word line and the first end of the partially written block; and applying a second non-selected word line read voltage along one or more word lines between the first word line and the second end of the partially written block. The first non-selected word line read voltage is sufficient to allow the memory cells to conduct independently of their data state programmed and the second non-selected word line read voltage is less than the first non-selected word line read voltage. Based on the result of the sensing operation on the first word line, it is determined whether the first word line has been written.
In a non-volatile memory having a plurality of blocks formed according to a NAND type architecture in which memory cells of a block are formed along a plurality of word lines, and in which the word lines of a block are written sequentially from a first end to a second end of a block, a method is presented for determining the last written word line in a partially written block. The method includes performing a sensing operation on a first word line of the partially written block and, based on the result of the sensing operation on the first word line, determining whether the first word line has been written. The sensing operation includes: settling a voltage on the bit lines corresponding to the memory cells to be sensed, wherein the settling a voltage as used in the determination of the last written word line uses a shorter settling time than a standard sensing operation; and subsequently applying a first sensing voltage along the first word line.
A method is described to perform a read operation of a non-volatile memory system, where the non-volatile memory system includes an array of non-volatile memory cells having a plurality of blocks formed according to a NAND type architecture in which memory cells of a block are formed along a plurality of word lines, including the first word line, and in which the word lines of a block are written sequentially from a first end to a second end of the block. The method includes determining whether the read operation includes a page of data stored on a first word line that belongs to a partially written block. In response to determining that the first word line belongs to a partially written block, a modified read operation is performed for the first word line. The modified read operation applies a first sensing voltage along the first word line; applies a first non-selected word line read voltage along word lines between the first word line and the first end of the partially written block; and applies a second non-selected word line read voltage along one or more word lines between the first word line and the second end of the partially written block. The first non-selected word line read voltage is sufficient to allow the memory cells to conduct independent of a data state programmed in the cells. The second non-selected word line read voltage is less than the first non-selected word line read voltage.
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.
Memory System
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
Reducing Read Disturb in Partially Written Blocks
Performing an operation, such as a read, write or erase, on one location of a memory like those described above can affect the quality of data stored on another location of the memory, an effect called a “disturb”. For example, due to capacitive coupling between memory cells on adjacent word line (or “Yupin-effect”), a voltage applied along one word line can affect the state of the memory cells on adjacent word lines. In the case of NAND memory, whether of the 2D or 3D variety, when reading a selected word line, non-selected word lines along shared NAND strings must also be biased. Referring back to
Word lines are typically written sequentially starting from one end, such as with the source end with WL0 in
One way of doing last written page detection is with a binary scan to search for first page which reads ALL FF (fully erased). The last written page is the one before the first page which reads ALLFF. The scanning algorithm and pattern detection is typically done off-chip with a discrete controller chip. This incurs overhead associated with commands and data transfers. In multi-die systems, the scan times scale with the number of NAND chips per controller and can run into timeout constraints.
During these binary scans, the high bias VREAD is applied on drain side relative to the word lines being read. (In this example, the word lines are written in sequence from the source to the drain side.) The more the number of times last written page detection is done, the more drain side word lines are subjected to the high bias VREAD. As exposure to the high bias VREAD increases, drain side word lines can accumulate significant amount of disturb. Hence, when the system comes back and writes the previously unwritten drain side word lines, high bit error rate (BER) can be seen on drain side word lines. This situation is similar to read disturb on partial written blocks that happens on erased, un-written word lines when reading written word lines several times. In the case of LWPD, the boundary page (last written word line) is not yet known, so that it is not possible to apply methods which have a priori knowledge of the partial block boundary page.
The combination of NAND and the sequential writing of data pages onto word lines leads to a much higher level of read disturb on partially written blocks relative to fully written blocks. The reasons for the high bit error rate (BER) for the partially written block case can be explained by considering the partially written block case relative to the fully written block. In the case of a partially written block, only a few word lines may be written in a block, with the higher word lines in the write sequence still being erased. Some of the written word lines are read multiple times, with the higher word lines, that are erased, seeing the high VREAD bias that causes accumulated disturb. When the system comes back and writes the remaining word lines of the block higher word lines see read disturb followed by Yupin-effect word line to word line capacitive coupling during programming. For the fully written case, were all of the word lines have been written, some of the written word lines may also be read multiple times; but for the higher word lines that are already written, they see the high VREAD after Yupin-effect in the write process.
The higher BER is seen for the partially written block case since the higher, unwritten word lines see the read disturb first, while still erased, followed by the Yupin-effect during the subsequent write. (More detail on, and techniques related to, error arising from partial block reads is discussed in U.S. patent application Ser. No. 14/526,870 filed on Oct. 29, 2014.) For the fully written block, the latter word lines see the program related Yupin-effect first, followed by the read disturb. Since the amount of disturb is independent of initial erase depth, the erased state shifts up more when Yupin-effect is seen after disturb, i.e. for partial block case, resulting in a high BER. As a consequence, when doing binary search for last written page detection or reading data from the written pages, the system can expect a high BER on erased/un-written word lines after the whole block is written.
As noted above, one way to find the last written page of a block is to perform a binary search of the block's word lines, a technique that can lead to a large number of reads, and corresponding bit error rates, on partially written blocks. To reduce the bit error rate, the following describes the use of a reduced VREAD level for some of the non-selected word lines, a technique that can be extended to data reads. When doing a last written page search, the reduced VREAD technique can also be used to intelligently skip word lines when searching through a block from one end to the other. Further, to improve performance during a last written page search, whether in a binary search or when searching from the end, reduced settling times can be used.
To determine the last written of a sequentially written set of word line, it is not necessarily provide an accurate read of the data along the word line, but just to determine whether it has been written or is still in an erased state. The described techniques can be implemented as an on-chip, auto-scan feature for last written page detection. When performing the sensing operation, a lower VREAD (or VREAD_PARTIAL) is applied to drain side word lines (that is, the word lines written latter in the write sequence order). The sensing operation with the reduced VREAD_PARTIAL can also be used to determine how many word lines to skip in the process based on how may bits are read as a “1”.
Considering these in turn and looking at the lowered VREAD level, in a standard sensing operation for a NAND type memory the non-selected word lines need to biased to a level that allows them to conduct for any programmed data state; however, for an unwritten word line, the erased memory cells will turn on at a lower voltage, the using of which will result less disturb on the unprogrammed cells. Consequently, when searching for the last written word line, when performing a read some or all of the word lines later in the write order than the word can have applied the lower VREAD_PARTIAL; using the example where word lines are written in order from the source end of the NAND strings, VREAD_PARTIAL can be applied to all word lines on the drain side of the selected word line. This can be illustrated with respect to
The left-most column in
The use of the lower VREAD_PARTIAL can help to reduce the disturb accumulated on drain side erased word lines, thereby reducing bit error rates. This is shown in the plot of
In the embodiment illustrated with respect to
The use of the reduced VREAD_PARTIAL when searching for the last written page can be used for a binary search as well as other algorithms. For instance, the search can be made by progressing from the source end to drain end, skipping word lines along the way where, as alluded to above, the result of reading a written word line with the lowered VREAD_PARTIAL can be used as part of an intelligent algorithm to decide how many word lines to skip.
The Last Written Page Detection (LWPD) can be sped up by skipping some number of word lines, but still having some or all of the drain side word lines at a lower bias VREAD_PARTIAL. Due to the NAND structure, the number of “1”s in the pattern will be a logical “AND” of all the word lines at VREAD_PARTIAL. As the number of word lines at VREAD_PARTIAL decreases, the number of “1's” decreases; and as level of VREAD_PARTIAL decreases, the number of “1”s decreases. So measuring the number of “1”s at a given voltage can provide an estimate of the distance to the true boundary. Consequently, an exemplary scan algorithm can base the number of skipped word lines on the number of “1” bits read after the scan: if “1” bits are less than a criterion, then the presumption is that it is far from the boundary and the algorithm can do a big step for skipped number of word lines; otherwise, a smaller step of fewer word lines is used. Depending upon the VREAD_PARTIAL bias, the criteria for skipping WLs can be set.
This is illustrated in the plot of
Say, for example, the algorithm starts with VREAD_PARTIAL close to VRB (i.e., all cells with B-state/C-state on drain side WLs will cut-off the NAND string and hence, will make threshold voltages on selected word lines appear high, i.e. as a 0-bit) due to an increase in NAND string resistances. If the algorithm uses can a criterion of, say, 16 bits, then it can step ˜8 word lines without having to worry about over-stepping past the last written word line. Then, switching to a VREAD_PARTIAL to close to VRA, it can step ˜4 word lines until the time criteria of 16 bits is reached. Finally, it can switch to 1 word line at a time until getting an ALL FF result.
The flow of
For any of the LWPD algorithms, whether using a reduced VREAD_PARTIAL or not, the process can be accelerated by performing the ALL-FF detection with smaller bit line settling times. In a sensing operation, before the sensing voltage is applied to the selected word line, it is usual to settle some voltage level on the bit lines in order accurately read the page. As a LWPD need not read the data as accurately, this is one reason why the settling time can be shorted. Another reason is that the bit lines should also settle more quickly in a partially written block since all of the unwritten bit lines will have the same data (namely, all in an erased state), reducing the effect of differing states on different bit lines has on how quickly settling can occur. This effect is illustrated in
These various aspects can all help to accelerate the LWPD process so that a process that previously would need to involve the controller can now be done by the memory chip itself. In such a last page to be written search, it is not known up front which pages are not written, but many these aspects described above can also be applied to reading partially written blocks in a data read operation when there is prior knowledge of which pages are unwritten.
When performing a read to extract a page of data along a word line of NAND memory, the non-selected word lines are biased so that they will conduct independently of the stored data. For the standard VREAD, this needs to be a level above the threshold of the highest states. If the memory system knows that a block is only partially written, and knows which of the word lines are unwritten, a lower VREAD_PARTIAL can be used on some or all of these unwritten word lines, reducing their disturb level while still allowing them to conduct. This lower VREAD_PARTIAL can be used on all of the unwritten word lines, even where these are not written sequentially, or a subset, such as when word lines are organized as zones and only fully unwritten zones use the lowered value.
In one implementation, when sending the read command from the controller 1811 to the memory 1803, the logic circuitry/firmware 1813 can send an additional prefix command with, say, 1 byte address to the NAND memory 1803 indicating where the written/unwritten word line boundary is. Once the boundary in known by the NAND, it can setup the voltages on the word lines beyond the written area accordingly. Similarly, for multi-plane operation, a prefix can be issued separately for each plane, as the open block may be written up to a different page (n−1) on different planes. The word line/page information can be used to approximate the boundary if a group of word lines are part of the same driver circuit. In this case the exact boundary need not be used, but set at the edge of the zone.
In the preceding, the read was initiated by the host, but this technique can also be applied to reads originating on the memory circuit itself, such as arise is data relocation or data scrub operations. The read can be for user data or for system data reads, where the latter more typically have partially written blocks (and often more sensitive data) due to its nature.
Conclusion
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 |
---|---|---|---|
4139911 | Sciulli et al. | Feb 1979 | A |
4218764 | Furuta et al. | Aug 1980 | A |
4253059 | Bell et al. | Feb 1981 | A |
4460982 | Gee et al. | Jul 1984 | A |
4612630 | Rosier | Sep 1986 | A |
4694454 | Matsuura | Sep 1987 | A |
4703196 | Arakawa | Oct 1987 | A |
4703453 | Shinoda et al. | Oct 1987 | A |
4733394 | Giebel | Mar 1988 | A |
4763305 | Kuo | Aug 1988 | A |
4779272 | Kohda et al. | Oct 1988 | A |
4799195 | Iwahashi et al. | Jan 1989 | A |
4809231 | Shannon et al. | Feb 1989 | A |
4827450 | Kowalski | May 1989 | A |
4937787 | Kobatake | Jun 1990 | A |
4962322 | Chapman | Oct 1990 | A |
4964079 | Devin | Oct 1990 | A |
4975883 | Baker et al. | Dec 1990 | A |
4980859 | Guterman et al. | Dec 1990 | A |
5043940 | Harari | Aug 1991 | A |
5052002 | Tanagawa | Sep 1991 | A |
5065364 | Atwood et al. | Nov 1991 | A |
5070032 | Yuan et al. | Dec 1991 | A |
5095344 | Harari | Mar 1992 | A |
5119330 | Tanagawa | Jun 1992 | A |
5122985 | Santin | Jun 1992 | A |
5132928 | Hayashikoshi et al. | Jul 1992 | A |
5132935 | Ashmore, Jr. | Jul 1992 | A |
5151906 | Sawada | Sep 1992 | A |
5157629 | Sato et al. | Oct 1992 | A |
5172338 | Mehrotra et al. | Dec 1992 | A |
5172339 | Noguchi et al. | Dec 1992 | A |
5200922 | Rao | Apr 1993 | A |
5200959 | Gross et al. | Apr 1993 | A |
5239505 | Fazio et al. | Aug 1993 | A |
5262984 | Noguchi et al. | Nov 1993 | A |
5263032 | Porter et al. | Nov 1993 | A |
5270551 | Kamimura et al. | Dec 1993 | A |
5270979 | Harari et al. | Dec 1993 | A |
5278794 | Tanaka et al. | Jan 1994 | A |
5313421 | Guterman et al. | May 1994 | A |
5313427 | Schreck et al. | May 1994 | A |
5315541 | Harari et al. | May 1994 | A |
5321655 | Iwahashi et al. | Jun 1994 | A |
5327383 | Merchant et al. | Jul 1994 | A |
5335198 | Van Buskirk et al. | Aug 1994 | A |
5341334 | Maruyama | Aug 1994 | A |
5343063 | Yuan et al. | Aug 1994 | A |
5347489 | Mechant et al. | Sep 1994 | A |
5365486 | Schreck | Nov 1994 | A |
5377147 | Merchant et al. | Dec 1994 | A |
5394359 | Kowalski | Feb 1995 | A |
5404485 | Ban | Apr 1995 | A |
5450363 | Christopherson et al. | Sep 1995 | A |
5465236 | Naruke | Nov 1995 | A |
5475693 | Christopherson et al. | Dec 1995 | A |
5504760 | Harari et al. | Apr 1996 | A |
5523972 | Rashid et al. | Jun 1996 | A |
5530705 | Malone, Sr. | Jun 1996 | A |
5532962 | Auclair et al. | Jul 1996 | A |
5570315 | Tanaka et al. | Oct 1996 | A |
5583812 | Harari | Dec 1996 | A |
5621682 | Tanzawa et al. | Apr 1997 | A |
5648934 | O'Toole | Jul 1997 | A |
5652720 | Aulas et al. | Jul 1997 | A |
5657332 | Auclair et al. | Aug 1997 | A |
5661053 | Yuan | Aug 1997 | A |
5675537 | Bill et al. | Oct 1997 | A |
5689465 | Sukegawa et al. | Nov 1997 | A |
5699297 | Yamazaki et al. | Dec 1997 | A |
5703506 | Shook et al. | Dec 1997 | A |
5712815 | Bill et al. | Jan 1998 | A |
5715193 | Norman | Feb 1998 | A |
5717632 | Richart et al. | Feb 1998 | A |
5751639 | Ohsawa | May 1998 | A |
5761125 | Himeno | Jun 1998 | A |
5774397 | Endoh et al. | Jun 1998 | A |
5798968 | Lee et al. | Aug 1998 | A |
5835413 | Hurter et al. | Nov 1998 | A |
5889698 | Miwa et al. | Mar 1999 | A |
5890192 | Lee et al. | Mar 1999 | A |
5905673 | Khan | May 1999 | A |
5909449 | So et al. | Jun 1999 | A |
5930167 | Lee et al. | Jul 1999 | A |
5937425 | Ban | Aug 1999 | A |
5963473 | Norman | Oct 1999 | A |
6046935 | Takeuchi et al. | Apr 2000 | A |
6145051 | Estakhri et al. | Nov 2000 | A |
6151246 | So et al. | Nov 2000 | A |
6199139 | Katayama et al. | Mar 2001 | B1 |
6215697 | Lu et al. | Apr 2001 | B1 |
6222762 | Guterman et al. | Apr 2001 | B1 |
6222768 | Hollmer et al. | Apr 2001 | B1 |
6339546 | Katayama et al. | Jan 2002 | B1 |
6345001 | Mokhlesi | Feb 2002 | B1 |
6415352 | Asami et al. | Jul 2002 | B1 |
6426893 | Conley et al. | Jul 2002 | B1 |
6456528 | Chen | Sep 2002 | B1 |
6522580 | Chen et al. | Feb 2003 | B2 |
6560152 | Cernea | May 2003 | B1 |
6567307 | Estakhri | May 2003 | B1 |
6678785 | Lasser | Jan 2004 | B2 |
6728134 | Ooishi | Apr 2004 | B2 |
6760255 | Conley et al. | Jul 2004 | B2 |
6763424 | Conley | Jul 2004 | B2 |
6771530 | Kato et al. | Aug 2004 | B2 |
6772274 | Estakhri | Aug 2004 | B1 |
6807101 | Ooishi et al. | Oct 2004 | B2 |
6839281 | Chen et al. | Jan 2005 | B2 |
6912160 | Yamada | Jun 2005 | B2 |
6925007 | Harari et al. | Aug 2005 | B2 |
6963505 | Cohen | Nov 2005 | B2 |
7012835 | Gonzalez et al. | Mar 2006 | B2 |
7076598 | Wang | Jul 2006 | B2 |
7224607 | Gonzalez et al. | May 2007 | B2 |
7224611 | Yamamoto et al. | May 2007 | B2 |
7242618 | Shappir et al. | Jul 2007 | B2 |
7254071 | Tu et al. | Aug 2007 | B2 |
7257025 | Maayan et al. | Aug 2007 | B2 |
7286412 | Chen | Oct 2007 | B1 |
7330376 | Chen et al. | Feb 2008 | B1 |
7440327 | Sekar | Oct 2008 | B1 |
7450425 | Aritome | Nov 2008 | B2 |
7489549 | Mokhlesi | Feb 2009 | B2 |
7518919 | Gonzalez et al. | Apr 2009 | B2 |
7613043 | Cornwell et al. | Nov 2009 | B2 |
7630254 | Lutze | Dec 2009 | B2 |
7631245 | Lasser | Dec 2009 | B2 |
7716538 | Gonzalez et al. | May 2010 | B2 |
7835209 | Park et al. | Nov 2010 | B2 |
7843727 | Cho et al. | Nov 2010 | B2 |
8014201 | Park | Sep 2011 | B2 |
8259506 | Sommer et al. | Sep 2012 | B1 |
20020048202 | Higuchi | Apr 2002 | A1 |
20030002348 | Chen | Jan 2003 | A1 |
20030086293 | Gongwer et al. | May 2003 | A1 |
20030109093 | Harari et al. | Jun 2003 | A1 |
20050073884 | Gonzalez et al. | Apr 2005 | A1 |
20050231999 | Moriyama | Oct 2005 | A1 |
20060039196 | Gorobets et al. | Feb 2006 | A1 |
20060062048 | Gonzalez et al. | Mar 2006 | A1 |
20060233023 | Lin et al. | Oct 2006 | A1 |
20070174740 | Kanno | Jul 2007 | A1 |
20070211532 | Gonzalez et al. | Sep 2007 | A1 |
20070279985 | Hemink | Dec 2007 | A1 |
20070279989 | Aritome | Dec 2007 | A1 |
20080071511 | Lin | Mar 2008 | A1 |
20080123420 | Brandman et al. | May 2008 | A1 |
20080158968 | Moogat et al. | Jul 2008 | A1 |
20080158969 | Moogat et al. | Jul 2008 | A1 |
20090003058 | Kang | Jan 2009 | A1 |
20090187785 | Gonzalez et al. | Jul 2009 | A1 |
20130073786 | Belgal | Mar 2013 | A1 |
20140003147 | Dutta | Jan 2014 | A1 |
20140247663 | Yuan et al. | Sep 2014 | A1 |
20150380095 | Wakchaure | Dec 2015 | A1 |
Number | Date | Country |
---|---|---|
97460009 | Feb 1997 | EP |
0791933 | Aug 1997 | EP |
2289779 | Nov 1995 | GB |
8-077785 | Mar 1996 | JP |
8-147988 | Jun 1996 | JP |
8-279295 | Oct 1996 | JP |
8-297987 | Nov 1996 | JP |
09-128165 | May 1997 | JP |
9-306182 | Nov 1997 | JP |
2000-187992 | Jul 2000 | JP |
2002-318729 | Oct 2002 | JP |
2003-058432 | Feb 2003 | JP |
WO 9012400 | Oct 1999 | WO |
WO 01008015 | Feb 2001 | WO |
WO 0122232 | Mar 2001 | WO |
WO 02058074 | Jul 2002 | WO |
WO2005036401 | Apr 2005 | WO |
WO2005041107 | May 2005 | WO |
WO 2011024015 | Mar 2011 | WO |
Entry |
---|
Lee et al., “Error Correction Technique for Multivalued MOS Memory,” Electronic Letters, vol. 27, No. 15, Jul. 18, 1991, pp. 1321-1323. |
U.S. Appl. No. 13/925,662 entitled High Capacity Select Switches for Three-Dimensional Structures, filed Jun. 24, 2013, 37 pages. |
U.S. Appl. No. 14/526,870 entitled “Read Scrub With Adaptive Counter Management”, filed Oct. 29, 2014, 49 pages. |
Number | Date | Country | |
---|---|---|---|
20160141046 A1 | May 2016 | US |