US20070109867A1 - Use of Data Latches in Cache Operations of Non-Volatile Memories - Google Patents

Use of Data Latches in Cache Operations of Non-Volatile Memories Download PDF

Info

Publication number
US20070109867A1
US20070109867A1 US11/619,513 US61951307A US2007109867A1 US 20070109867 A1 US20070109867 A1 US 20070109867A1 US 61951307 A US61951307 A US 61951307A US 2007109867 A1 US2007109867 A1 US 2007109867A1
Authority
US
United States
Prior art keywords
data
read
page
write
memory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
US11/619,513
Other versions
US7577037B2 (en
Inventor
Yan Li
Emilio Yero
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SanDisk Technologies LLC
Original Assignee
Yan Li
Emilio Yero
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Yan Li, Emilio Yero filed Critical Yan Li
Priority to US11/619,513 priority Critical patent/US7577037B2/en
Publication of US20070109867A1 publication Critical patent/US20070109867A1/en
Priority to US12/495,200 priority patent/US7936602B2/en
Application granted granted Critical
Publication of US7577037B2 publication Critical patent/US7577037B2/en
Assigned to SANDISK TECHNOLOGIES INC. reassignment SANDISK TECHNOLOGIES INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SANDISK CORPORATION
Assigned to SANDISK TECHNOLOGIES LLC reassignment SANDISK TECHNOLOGIES LLC CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: SANDISK TECHNOLOGIES INC
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C16/00Erasable programmable read-only memories
    • G11C16/02Erasable programmable read-only memories electrically programmable
    • G11C16/06Auxiliary circuits, e.g. for writing into memory
    • G11C16/34Determination of programming status, e.g. threshold voltage, overprogramming or underprogramming, retention
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0893Caches characterised by their organisation or structure
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C16/00Erasable programmable read-only memories
    • G11C16/02Erasable programmable read-only memories electrically programmable
    • G11C16/04Erasable programmable read-only memories electrically programmable using variable threshold transistors, e.g. FAMOS
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C16/00Erasable programmable read-only memories
    • G11C16/02Erasable programmable read-only memories electrically programmable
    • G11C16/06Auxiliary circuits, e.g. for writing into memory
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C16/00Erasable programmable read-only memories
    • G11C16/02Erasable programmable read-only memories electrically programmable
    • G11C16/06Auxiliary circuits, e.g. for writing into memory
    • G11C16/10Programming or data input circuits
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C16/00Erasable programmable read-only memories
    • G11C16/02Erasable programmable read-only memories electrically programmable
    • G11C16/06Auxiliary circuits, e.g. for writing into memory
    • G11C16/26Sensing or reading circuits; Data output circuits
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C7/00Arrangements for writing information into, or reading information out from, a digital store
    • G11C7/22Read-write [R-W] timing or clocking circuits; Read-write [R-W] control signal generators or management 
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/20Employing a main memory using a specific memory technology
    • G06F2212/202Non-volatile memory
    • G06F2212/2022Flash memory
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/30Providing cache or TLB in specific location of a processing system
    • G06F2212/304In main memory subsystem
    • G06F2212/3042In main memory subsystem being part of a memory device, e.g. cache DRAM
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C2207/00Indexing scheme relating to arrangements for writing information into, or reading information out from, a digital store
    • G11C2207/22Control and timing of internal memory operations
    • G11C2207/2245Memory devices with an internal cache buffer
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00Energy efficient computing, e.g. low power processors, power management or thermal management

Definitions

  • This invention relates generally to non-volatile semiconductor memory such as electrically erasable programmable read-only memory (EEPROM) and flash EEPROM, and specifically to cache operations based on shared latch structures allowing overlapping memory operations.
  • EEPROM electrically erasable programmable read-only memory
  • flash EEPROM flash EEPROM
  • 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.
  • RAM random access memory
  • flash memory is non-volatile, retaining its stored data even after power is turned off.
  • flash memory is increasingly being used in mass storage applications.
  • Conventional mass storage, based on rotating magnetic medium such as hard drives and floppy disks, is unsuitable for the mobile and handheld environment. This is because disk drives tend to be bulky, are prone to mechanical failure and have high latency and high power requirements.
  • flash memory both embedded and in the form of a removable card is ideally suited in the mobile and handheld environment because of its small size, low power consumption, high speed and high reliability features.
  • EEPROM and electrically programmable read-only memory are 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.
  • 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.
  • 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.
  • the transistor serving as a memory cell is typically programmed to a “programmed” state by one of two mechanisms.
  • hot electron injection a high voltage applied to the drain accelerates electrons across the substrate channel region.
  • control gate pulls the hot electrons through a thin gate dielectric onto the floating gate.
  • tunnel injection a high voltage is applied to the control gate relative to the substrate. In this way, electrons are pulled from the substrate to the intervening floating gate.
  • the memory device may be erased by a number of mechanisms.
  • EPROM the memory is bulk erasable by removing the charge from the floating gate by ultraviolet radiation.
  • EEPROM a memory cell is electrically erasable, by applying a high voltage to the substrate relative to the control gate so as to induce electrons in the floating gate to tunnel through a thin oxide to the substrate channel region (i.e., Fowler-Nordheim tunneling.)
  • the EEPROM is erasable byte by byte.
  • flash EEPROM the memory is electrically erasable either all at once or one or more blocks at a time, where a block may consist of 512 bytes or more of memory.
  • the memory devices typically comprise one or more memory chips that may be mounted on a card.
  • Each memory chip comprises an array of memory cells supported by peripheral circuits such as decoders and erase, write and read circuits.
  • peripheral circuits such as decoders and erase, write and read circuits.
  • the more sophisticated memory devices also come with a controller that performs intelligent and higher level memory operations and interfacing.
  • non-volatile solid-state memory devices may employ different types of memory cells, each type having one or more charge storage element.
  • FIGS. 1A-1E illustrate schematically different examples of non-volatile memory cells.
  • FIG. 1A illustrates schematically a non-volatile memory in the form of an EEPROM cell with a floating gate for storing charge.
  • An electrically erasable and programmable read-only memory (EEPROM) has a similar structure to EPROM, but additionally provides a mechanism for loading and removing charge electrically from its floating gate upon application of proper voltages without the need for exposure to UV radiation. Examples of such cells and methods of manufacturing them are given in U.S. Pat. No. 5,595,924.
  • FIG. 1B illustrates schematically a flash EEPROM cell having both a select gate and a control or steering gate.
  • the memory cell 10 has a “split-channel” 12 between source 14 and drain 16 diffusions.
  • a cell is formed effectively with two transistors T 1 and T 2 in series.
  • T 1 serves as a memory transistor having a floating gate 20 and a control gate 30 .
  • the floating gate is capable of storing a selectable amount of charge. The amount of current that can flow through the T 1 's portion of the channel depends on the voltage on the control gate 30 and the amount of charge residing on the intervening floating gate 20 .
  • T 2 serves as a select transistor having a select gate 40 .
  • T 2 When T 2 is turned on by a voltage at the select gate 40 , it allows the current in the T 1 's portion of the channel to pass between the source and drain.
  • the select transistor provides a switch along the source-drain channel independent of the voltage at the control gate.
  • One advantage is that it can be used to turn off those cells that are still conducting at zero control gate voltage due to their charge depletion (positive) at their floating gates.
  • the other advantage is that it allows source side injection programming to be more easily implemented.
  • One simple embodiment of the split-channel memory cell is where the select gate and the control gate are connected to the same word line as indicated schematically by a dotted line shown in FIG. 1B .
  • This is accomplished by having a charge storage element (floating gate) positioned over one portion of the channel and a control gate structure (which is part of a word line) positioned over the other channel portion as well as over the charge storage element.
  • This effectively forms a cell with two transistors in series, one (the memory transistor) with a combination of the amount of charge on the charge storage element and the voltage on the word line controlling the amount of current that can flow through its portion of the channel, and the other (the select transistor) having the word line alone serving as its gate. Examples of such cells, their uses in memory systems and methods of manufacturing them are given in U.S. Pat. Nos. 5,070,032, 5,095,344, 5,315,541, 5,343,063, and 5,661,053.
  • a more refined embodiment of the split-channel cell shown in FIG. 1B is when the select gate and the control gate are independent and not connected by the dotted line between them.
  • One implementation has the control gates of one column in an array of cells connected to a control (or steering) line perpendicular to the word line. The effect is to relieve the word line from having to perform two functions at the same time when reading or programming a selected cell. Those two functions are (1) to serve as a gate of a select transistor, thus requiring a proper voltage to turn the select transistor on and off, and (2) to drive the voltage of the charge storage element to a desired level through an electric field (capacitive) coupling between the word line and the charge storage element. It is often difficult to perform both of these functions in an optimum manner with a single voltage.
  • FIG. 1C illustrates schematically another flash EEPROM cell having dual floating gates and independent select and control gates.
  • the memory cell 10 is similar to that of FIG. 1B except it effectively has three transistors in series.
  • two storage elements i.e., that of T 1 —left and T 1 —right
  • the memory transistors have floating gates 20 and 20 ′, and control gates 30 and 30 ′, respectively.
  • the select transistor T 2 is controlled by a select gate 40 . At any one time, only one of the pair of memory transistors is accessed for read or write.
  • both the T 2 and T 1 —right are turned on to allow the current in the T 1 —left's portion of the channel to pass between the source and the drain.
  • T 2 and T 1 —left are turned on.
  • Erase is effected by having a portion of the select gate polysilicon in close proximity to the floating gate and applying a substantial positive voltage (e.g. 20V) to the select gate so that the electrons stored within the floating gate can tunnel to the select gate polysilicon.
  • FIG. 1D illustrates schematically a string of memory cells organized into an NAND cell.
  • a pair of select transistors S 1 , S 2 controls the memory transistors chain's connection to the external via the NAND cell's source terminal 54 and drain terminal 56 .
  • the source select transistor S 1 when the source select transistor S 1 is turned on, the source terminal is coupled to a source line.
  • the drain select transistor S 2 is turned on, the drain terminal of the NAND cell is coupled to a bit line of the memory array.
  • Each memory transistor in the chain has a charge storage element to store a given amount of charge so as to represent an intended memory state.
  • a control gate of each memory transistor provides control over read and write operations.
  • a control gate of each of the select transistors S 1 , S 2 provides control access to the NAND cell via its source terminal 54 and drain terminal 56 respectively.
  • FIG. 1E illustrates schematically a non-volatile memory with a dielectric layer for storing charge.
  • a dielectric layer is used.
  • Such memory devices utilizing dielectric storage element have been described by Eitan et al., “NROM: A Novel Localized Trapping, 2-Bit Nonvolatile Memory Cell,” IEEE Electron Device Letters, vol. 21, no. 11, November 2000, pp. 543-545.
  • 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.
  • U.S. Pat. Nos. 5,768,192 and 6,011,725 disclose a nonvolatile memory cell having 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.
  • a memory device typically comprises of a two-dimensional array of memory cells arranged in rows and columns and addressable by word lines and bit lines.
  • the array can be formed according to an NOR type or an NAND type architecture.
  • FIG. 2 illustrates an example of an NOR array of memory cells.
  • Memory devices with an NOR type architecture have been implemented with cells of the type illustrated in FIGS. 1B or 1 C.
  • Each row of memory cells are connected by their sources and drains in a daisy-chain manner. This design is sometimes referred to as a virtual ground design.
  • Each memory cell 10 has a source 14 , a drain 16 , a control gate 30 and a select gate 40 .
  • the cells in a row have their select gates connected to word line 42 .
  • the cells in a column have their sources and drains respectively connected to selected bit lines 34 and 36 .
  • a steering line 36 also connects the control gates of the cells in a column.
  • FIG. 3 illustrates an example of an NAND array of memory cells, such as that shown in FIG. 1D .
  • a bit line is coupled to the drain terminal 56 of each NAND cell.
  • a source line may connect all their source terminals 54 .
  • the control gates of the NAND cells along a row are connected to a series of corresponding word lines. An entire row of NAND cells can be addressed by turning on the pair of select transistors (see FIG. 1D ) with appropriate voltages on their control gates via the connected word lines.
  • Erase circuits are provided to erase one or more blocks of memory cells.
  • a non-volatile memory such as EEPROM is referred to as a ”Flash” EEPROM when an entire array of cells, or significant groups of cells of the array, is electrically erased together (i.e., in a flash). Once erased, the group of cells can then be reprogrammed.
  • the group of cells erasable together may consist one or more addressable erase unit.
  • the erase unit or block typically stores one or more pages of data, the page being the unit of programming and reading, although more than one page may be programmed or read in a single operation.
  • Each page typically stores one or more sectors of data, the size of the sector being defined by the host system.
  • An example is a sector of 512 bytes of user data, following a standard established with magnetic disk drives, plus some number of bytes of overhead information about the user data and/or the block in with it is stored.
  • At least one current breakpoint level is established so as to partition the conduction window into two regions.
  • a cell is read by applying predetermined, fixed voltages, its source/drain current is resolved into a memory state by comparing with the breakpoint level (or reference current IREF). If the current read is higher than that of the breakpoint level, the cell is determined to be in one logical state (e.g., a “zero” state). On the other hand, if the current is less than that of the breakpoint level, the cell is determined to be in the other logical state (e.g., a “one” state). Thus, such a two-state cell stores one bit of digital information.
  • a reference current source which may be externally programmable, is often provided as part of a memory system to generate the breakpoint level current.
  • flash EEPROM devices are being fabricated with higher and higher density as the state of the semiconductor technology advances.
  • Another method for increasing storage capacity is to have each memory cell store more than two states.
  • the conduction window is partitioned into more than two regions by more than one breakpoint such that each cell is capable of storing more than one bit of data.
  • the information that a given EEPROM array can store is thus increased with the number of states that each cell can store.
  • EEPROM or flash EEPROM with multi-state or multi-level memory cells have been described in U.S. Pat. No. 5,172,338.
  • 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.
  • a corresponding conduction current with respect to a fixed reference control gate voltage may be detected.
  • the range of charge programmable onto the floating gate defines a corresponding threshold voltage window or a corresponding conduction current window.
  • the threshold voltage for a given memory state under test is set at the control gate and detect if the conduction current is lower or higher than a threshold current.
  • 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.
  • FIG. 4 illustrates the relation between the source-drain current I D and the control gate voltage V CG for four different charges Q 1 -Q 4 that the floating gate may be selectively storing at any one time.
  • the four solid I D versus V CG curves represent four possible charge levels that can be programmed on a floating gate of a memory cell, respectively corresponding to four possible memory states.
  • the threshold voltage window of a population of cells may range from 0.5V to 3.5V.
  • Six memory states may be demarcated by partitioning the threshold window into five regions in interval of 0.5V each.
  • Q 4 is in a memory state “5”.
  • U.S. Pat. No. 4,357,685 discloses a method of programming a 2-state EPROM in which when a cell is programmed to a given state, it is subject to successive programming voltage pulses, each time adding incremental charge to the floating gate. In between pulses, the cell is read back or verified to determine its source-drain current relative to the breakpoint level. Programming stops when the current state has been verified to reach the desired state.
  • the programming pulse train used may have increasing period or amplitude.
  • Prior art programming circuits simply apply programming pulses to step through the threshold window from the erased or ground state until the target state is reached. Practically, to allow for adequate resolution, each partitioned or demarcated region would require at least about five programming steps to transverse. The performance is acceptable for 2-state memory cells. However, for multi-state cells, the number of steps required increases with the number of partitions and therefore, the programming precision or resolution must be increased. For example, a 16-state cell may require on average at least 40 programming pulses to program to a target state.
  • FIG. 5 illustrates schematically a memory device with a typical arrangement of a memory array 100 accessible by read/write circuits 170 via row decoder 130 and column decoder 160 .
  • a memory transistor of a memory cell in the memory array 100 is addressable via a set of selected word line(s) and bit line(s).
  • the row decoder 130 selects one or more word lines and the column decoder 160 selects one or more bit lines in order to apply appropriate voltages to the respective gates of the addressed memory transistor.
  • Read/write circuits 170 are provided to read or write (program) the memory states of addressed memory transistors.
  • the read/write circuits 170 comprise a number of read/write modules connectable via bit lines to memory elements in the array.
  • FIG. 6A is a schematic block diagram of an individual read/write module 190 .
  • a sense amplifier determines the current flowing through the drain of an addressed memory transistor connected via a selected bit line. The current depends on the charge stored in the memory transistor and its control gate voltage. For example, in a multi-state EEPROM cell, its floating gate can be charged to one of several different levels. For a 4-level cell, it may be used to store two bits of data. The level detected by the sense amplifier is converted by a level-to-bits conversion logic to a set of data bits to be stored in a data latch.
  • a logical “page” of memory elements are read or programmed together.
  • a row typically contains several interleaved pages. All memory elements of a page will be read or programmed together.
  • the column decoder will selectively connect each one of the interleaved pages to a corresponding number of read/write modules.
  • the memory array is designed to have a page size of 532 bytes (512 bytes plus 20 bytes of overheads.) If each column contains a drain bit line and there are two interleaved pages per row, this amounts to 8512 columns with each page being associated with 4256 columns.
  • the read/write modules forming the read/write circuits 170 can be arranged into various architectures.
  • the read/write circuits 170 is organized into banks of read/write stacks 180 .
  • Each read/write stack 180 is a stack of read/write modules 190 .
  • the column spacing is determined by the size of the one or two transistors that occupy it.
  • the circuitry of a read/write module will likely be implemented with many more transistors and circuit elements and therefore will occupy a space over many columns. In order to service more than one column among the occupied columns, multiple modules are stacked up on top of each other.
  • FIG. 6B shows the read/write stack of FIG. 5 implemented conventionally by a stack of read/write modules 190 .
  • a read/write module may extend over sixteen columns, then a read/write stack 180 with a stack of eight read/write modules can be used to service eight columns in parallel.
  • the read/write stack can be coupled via a column decoder to either the eight odd (1, 3, 5, 7, 9, 11, 13, 15) columns or the eight even (2, 4, 6, 8, 10, 12, 14, 16) columns among the bank.
  • the interleaving page architecture is disadvantageous in at least three respects. First, it requires additional multiplexing circuitry. Secondly, it is slow in performance. To finish read or program of memory cells connected by a word line or in a row, two read or two program operations are required. Thirdly, it is also not optimum in addressing other disturb effects such as field coupling between neighboring charge storage elements at the floating gate level when the two neighbors are programmed at different times, such as separately in odd and even pages.
  • the problem of neighboring field coupling becomes more pronounced with ever closer spacing between memory transistors.
  • a charge storage element is sandwiched between a channel region and a control gate.
  • the current that flows in the channel region is a function of the resultant electric field contributed by the field at the control gate and the charge storage element.
  • memory transistors With ever increasing density, memory transistors are formed closer and closer together.
  • the field from neighboring charge elements then becomes significant contributor to the resultant field of an affected cell.
  • the neighboring field depends on the charge programmed into the charge storage elements of the neighbors. This perturbing field is dynamic in nature as it changes with the programmed states of the neighbors. Thus, an affected cell may read differently at different time depending on the changing states of the neighbors.
  • the conventional architecture of interleaving page exacerbates the error caused by neighboring floating gate coupling. Since the even page and the odd page are programmed and read independently of each other, a page may be programmed under one set of condition but read back under an entirely different set of condition, depending on what has happened to the intervening page in the meantime.
  • the read errors will become more severe with increasing density, requiring a more accurate read operation and coarser partitioning of the threshold window for multi-state implementation. Performance will suffer and the potential capacity in a multi-state implementation is limited.
  • United States Patent Publication No. US-2004-0060031-A1 discloses a high performance yet compact non-volatile memory device having a large block of read/write circuits to read and write a corresponding block of memory cells in parallel.
  • the memory device has an architecture that reduces redundancy in the block of read/write circuits to a minimum.
  • Significant saving in space as well as power is accomplished by redistributing the block of read/write modules into a block read/write module core portions that operate in parallel while interacting with a substantially smaller sets of common portions in a time-multiplexing manner.
  • data processing among read/write circuits between a plurality of sense amplifiers and data latches is performed by a shared processor.
  • cache operations are presented that allow data to be transferred in or out of a memory while the internal memory is engaged in another operation, such as a read, program or erase.
  • another operation such as a read, program or erase.
  • data latches are shared by a number of physical pages.
  • read/write stacks are associated with the bit lines of the memory, which shared by multiple word lines. While one operation is going on in the memory, if any of these latch are free, they can cache data for future operations in the same or another word line, saving transfer time as this can be hidden behind another operation. This can improve performance by increasing the amount of pipelining of different operations or phases of operations.
  • in a cache program operation while programming one page of data another page of data can be loaded in, saving on transfer time.
  • a read operation on one word line is inserted into a write operation on another word line, allowing the data from the read to be transferred out of the memory while the data write continues on.
  • data from another page in the same block, but on a different word line can be toggled out (to, for example, do an ECC operation) while a write or other operation is going on for the first page of data.
  • This inter-phase pipelining of operations allows the time needed for the data transfer to be hidden behind the operation on the first page of data. More generally, this allows a portion of one operation to be inserted between phases of another, typically longer, operation. Another example would be to insert a sensing operation between phases of, say, an erase operation, such as before an erase pulse or before a soft programming phase used as the later part of the erase.
  • a primary aspect will interpose in a quicker operation using the shared latches of the read/write stacks if latches available. For example, a read can be inserted into a program or erase operation, or a binary program can be inserted into an erase.
  • the primary exemplary embodiments will toggle data in and/or out for one page during a program operation for another page that shares the same read write stacks, where, for example, a read of the data to be toggled out and modified is inserted into the verify phase of the data write.
  • n such data latches will be needed for each bit line; however, not all of these latches are needed at all times. For example, in a two-bit per cell memory storing data in an upper page/lower page format, one data latch will be needed while programming the lower page (with another latch used if quick pass write is implemented). Two data latches will be needed while programming the upper page (with a third latch used if quick pass write is implemented)). More generally, for memories storing multiple pages, all of the latches will be needed only when programming the highest page. This leaves the other latches available for cache operations.
  • latches will free up. Specifically, once only the highest state remains to be verified, only a single latch is needed for verification purposes and the others may be used for cache operations.
  • An exemplary embodiment is based on a four state memory storing two-bits per cell and having two latches for data on each bit line and one additional latch for quick pass write.
  • the operations of writing the lower page, or erasing, or doing a post erase soft program are basically a binary operation and have one of the data latches free, which can use it to cache data.
  • the memory can free up a latch that can be used to cache data.
  • An example of how this can be used is that when programming one page, such as in a copy operation, a read of another page that shares the same set of data latches, such as another word line on the same set of bit lines, can be slipped in between program pulse and verifies of the write. The address can then be switched to the page being written, allowing the write process to pick up where it left off without having to restart. While the write continues, the data cached during the interpolated read can be toggled out, checked or modified and transferred back to be present for writing back in once the earlier write operation completes. This sort cache operation allows the toggling out and modification of the second page of data to be hidden behind the programming of the first page.
  • FIGS. 1A-1E illustrate schematically different examples of non-volatile memory cells.
  • FIG. 2 illustrates an example of an NOR array of memory cells.
  • FIG. 3 illustrates an example of an NAND array of memory cells, such as that shown in FIG. 1D .
  • FIG. 4 illustrates the relation between the source-drain current and the control gate voltage for four different charges Q 1 -Q 4 that the floating gate may be storing at any one time.
  • FIG. 5 illustrates schematically a typical arrangement of a memory array accessible by read/write circuits via row and column decoders.
  • FIG. 6A is a schematic block diagram of an individual read/write module.
  • FIG. 6B shows the read/write stack of FIG. 5 implemented conventionally by a stack of read/write modules.
  • FIG. 7A illustrates schematically a compact memory device having a bank of partitioned read/write stacks, in which the improved processor of the present invention is implemented.
  • FIG. 7B illustrates a preferred arrangement of the compact memory device shown in FIG. 7A .
  • FIG. 8 illustrates schematically a general arrangement of the basic components in a read/write stack shown in FIG. 7A .
  • FIG. 9 illustrates one preferred arrangement of the read/write stacks among the read/write circuits shown in FIGS. 7A and 7B .
  • FIG. 10 illustrates an improved embodiment of the common processor shown in FIG. 9 .
  • FIG. 11A illustrates a preferred embodiment of the input logic of the common processor shown in FIG. 10 .
  • FIG. 11B illustrates the truth table of the input logic of FIG. 11A .
  • FIG. 12A illustrates a preferred embodiment of the output logic of the common processor shown in FIG. 10 .
  • FIG. 12B illustrates the truth table of the output logic of FIG. 12A .
  • FIG. 13 is a simplified version of FIG. 10 that shows some specific elements that are relevant to the present discussion in a two-bit embodiment of the present invention
  • FIG. 14 indicates the latch assignment for the same elements as FIG. 13 for upper page program where the lower page data is read in.
  • FIG. 15 illustrates aspects of cache program in the single page mode.
  • FIG. 16 shows a programming waveform that can be used in a lower page to full sequence conversion.
  • FIG. 17 illustrates the relative timing in a cache program operation with a full sequence conversion.
  • FIG. 18 describes the disposition of latches in a cache page copy operation.
  • FIGS. 19A and 19B illustrate the relative timings in cache page copy operations.
  • FIG. 7A illustrates schematically a compact memory device having a bank of partitioned read/write stacks, in which the improved processor of the present invention is implemented.
  • the memory device includes a two-dimensional array of memory cells 300 , control circuitry 310 , and read/write circuits 370 .
  • the memory array 300 is addressable by word lines via a row decoder 330 and by bit lines via a column decoder 360 .
  • the read/write circuits 370 is implemented as a bank of partitioned read/write stacks 400 and allows a block (also referred to as a “page”) of memory cells to be read or programmed in parallel.
  • a page is constituted from a contiguous row of memory cells.
  • a block multiplexer 350 is provided to multiplex the read/write circuits 370 to the individual blocks.
  • the control circuitry 310 cooperates with the read/write circuits 370 to perform memory operations on the memory array 300 .
  • the control circuitry 310 includes a state machine 312 , an on-chip address decoder 314 and a power control module 316 .
  • the state machine 312 provides chip level control of memory operations.
  • the on-chip address decoder 314 provides an address interface between that used by the host or a memory controller to the hardware address used by the decoders 330 and 370 .
  • the power control module 316 controls the power and voltages supplied to the word lines and bit lines during memory operations.
  • FIG. 7B illustrates a preferred arrangement of the compact memory device shown in FIG. 7A .
  • Access to the memory array 300 by the various peripheral circuits is implemented in a symmetric fashion, on opposite sides of the array so that access lines and circuitry on each side are reduced in half.
  • the row decoder is split into row decoders 330 A and 330 B and the column decoder into column decoders 360 A and 360 B.
  • the block multiplexer 350 is split into block multiplexers 350 A and 350 B.
  • the read/write circuits are split into read/write circuits 370 A connecting to bit lines from the bottom and read/write circuits 370 B connecting to bit lines from the top of the array 300 . In this way, the density of the read/write modules, and therefore that of the partitioned read/write stacks 400 , is essentially reduced by one half.
  • FIG. 8 illustrates schematically a general arrangement of the basic components in a read/write stack shown in FIG. 7A .
  • the read/write stack 400 comprises a stack of sense amplifiers 212 for sensing k bit lines, an I/O module 440 for input or output of data via an I/O bus 231 , a stack of data latches 430 for storing input or output data, a common processor 500 to process and store data among the read/write stack 400 , and a stack bus 421 for communication among the stack components.
  • a stack bus controller among the read/write circuits 370 provides control and timing signals via lines 411 for controlling the various components among the read/write stacks.
  • FIG. 9 illustrates one preferred arrangement of the read/write stacks among the read/write circuits shown in FIGS. 7A and 7B .
  • the entire bank of partitioned read/write stacks 400 operating in parallel allows a block (or page) of p cells along a row to be read or programmed in parallel.
  • r the number of stacks in the bank
  • the block is a run of the entire row of cells.
  • the block is a subset of cells in the row.
  • the subset of cells could be one half of the entire row or one quarter of the entire row.
  • the subset of cells could be a run of contiguous cells or one every other cell, or one every predetermined number of cells.
  • Each read/write stack such as 400 - 1 , essentially contains a stack of sense amplifiers 212 - 1 to 212 - k servicing a segment of k memory cells in parallel.
  • a preferred sense amplifier is disclosed in United States Patent Publication No. 2004-0109357-A1, the entire disclosure of which is hereby incorporated herein by reference.
  • the stack bus controller 410 provides control and timing signals to the read/write circuit 370 via lines 411 .
  • the stack bus controller is itself dependent on the memory controller 310 via lines 311 .
  • Communication among each read/write stack 400 is effected by an interconnecting stack bus 431 and controlled by the stack bus controller 410 .
  • Control lines 411 provide control and clock signals from the stack bus controller 410 to the components of the read/write stacks 400 - 1 .
  • the stack bus is partitioned into a SABus 422 for communication between the common processor 500 and the stack of sense amplifiers 212 , and a DBus 423 for communication between the processor and the stack of data latches 430 .
  • the stack of data latches 430 comprises of data latches 430 - 1 to 430 - k, one for each memory cell associated with the stack
  • the I/O module 440 enables the data latches to exchange data with the external via an I/O bus 231 .
  • the common processor also includes an output 507 for output of a status signal indicating a status of the memory operation, such as an error condition.
  • the status signal is used to drive the gate of an n-transistor 550 that is tied to a FLAG BUS 509 in a Wired-Or configuration.
  • the FLAG BUS is preferably precharged by the controller 310 and will be pulled down when a status signal is asserted by any of the read/write stacks.
  • FIG. 10 illustrates an improved embodiment of the common processor shown in FIG. 9 .
  • the common processor 500 comprises a processor bus, PBUS 505 for communication with external circuits, an input logic 510 , a processor latch PLatch 520 and an output logic 530 .
  • the input logic 510 receives data from the PBUS and outputs to a BSI node as a transformed data in one of logical states “1”, “0”, or “Z” (float) depending on the control signals from the stack bus controller 410 via signal lines 411 .
  • a Set/Reset latch, PLatch 520 then latches BSI, resulting in a pair of complementary output signals as MTCH and MTCH*.
  • the output logic 530 receives the MTCH and MTCH* signals and outputs on the PBUS 505 a transformed data in one of logical states “1”, “0”, or “Z” (float) depending on the control signals from the stack bus controller 410 via signal lines 411 .
  • FIG. 10 illustrates the case for the memory cell coupled to bit line 1 .
  • the corresponding sense amplifier 212 - 1 comprises a node where the sense amplifier data appears.
  • the node assumes the form of a SA Latch, 214 - 1 that stores data.
  • the corresponding set of data latches 430 - 1 stores input or output data associated with the memory cell coupled to bit line 1 .
  • the set of data latches 430 - 1 comprises sufficient data latches, 434 - 1 , . . . , 434 - n for storing n-bits of data.
  • the PBUS 505 of the common processor 500 has access to the SA latch 214 - 1 via the SBUS 422 when a transfer gate 501 is enabled by a pair of complementary signals SAP and SAN. Similarly, the PBUS 505 has access to the set of data latches 430 - 1 via the DBUS 423 when a transfer gate 502 is enabled by a pair of complementary signals DTP and DTN.
  • the signals SAP, SAN, DTP and DTN are illustrated explicitly as part of the control signals from the stack bus controller 410 .
  • FIG. 11A illustrates a preferred embodiment of the input logic of the common processor shown in FIG. 10 .
  • the input logic 520 receives the data on the PBUS 505 and depending on the control signals, either has the output BSI being the same, or inverted, or floated.
  • the output BSI node is essentially affected by either the output of a transfer gate 522 or a pull-up circuit comprising p-transistors 524 and 525 in series to Vdd, or a pull-down circuit comprising n-transistors 526 and 527 in series to ground.
  • the pull-up circuit has the gates to the p-transistor 524 and 525 respectively controlled by the signals PBUS and ONE.
  • the pull-down circuit has the gates to the n-transistors 526 and 527 respectively controlled by the signals ONEB ⁇ 1 > and PBUS.
  • FIG. 11B illustrates the truth table of the input logic of FIG. 11A .
  • the logic is controlled by PBUS and the control signals ONE, ONEB ⁇ 0 >, ONEB ⁇ 1 > which are part of the control signals from the stack bus controller 410 .
  • PBUS control signals ONE, ONEB ⁇ 0 >, ONEB ⁇ 1 > which are part of the control signals from the stack bus controller 410 .
  • three transfer modes, PASSTHROUGH, INVERTED, and FLOATED are supported.
  • the signals ONE is at a logical “1”, ONEB ⁇ 0 > at “0” and ONEB ⁇ 1 > at “0”. This will disable the pull-up or pull-down but enable the transfer gate 522 to pass the data on the PBUS 505 to the output 523 .
  • the signals ONE is at “0”, ONEB ⁇ 0 > at “1” and ONE ⁇ 1 >at “1”. This will disable the transfer gate 522 .
  • the pull-down circuit when PBUS is at “0”, the pull-down circuit will be disabled while the pull-up circuit is enabled, resulting in BSI being at “1”. Similarly, when PBUS is at “1”, the pull-up circuit is disabled while the pull-down circuit is enabled, resulting in BSI being at “0”. Finally, in the case of the FLOATED mode, the output BSI can be floated by having the signals ONE at “1”, ONEB ⁇ 0 > at “1” and ONEB ⁇ 1 > at “0”.
  • the FLOATED mode is listed for completeness although in practice, it is not used.
  • FIG. 12A illustrates a preferred embodiment of the output logic of the common processor shown in FIG. 10 .
  • the signal at the BSI node from the input logic 520 is latched in the processor latch, PLatch 520 .
  • the output logic 530 receives the data MTCH and MTCH* from the output of PLatch 520 and depending on the control signals, outputs on the PBUS as either in a PASSTHROUGH, INVERTED OR FLOATED mode.
  • the four branches act as drivers for the PBUS 505 , actively pulling it either to a HIGH, LOW or FLOATED state. This is accomplished by four branch circuits, namely two pull-up and two pull-down circuits for the PBUS 505 .
  • a first pull-up circuit comprises p-transistors 531 and 532 in series to Vdd, and is able to pull up the PBUS when MTCH is at “0”.
  • a second pull-up circuit comprises p-transistors 533 and 534 in series to ground and is able to pull up the PBUS when MTCH is at “1”.
  • a first pull-down circuit comprises n-transistors 535 and 536 in series to Vdd, and is able to pull down the PBUS when MTCH is at “0”.
  • a second pull-up circuit comprises n-transistors 537 and 538 in series to ground and is able to pull up the PBUS when MTCH is at “1”.
  • One feature of the invention is to constitute the pull-up circuits with PMOS transistors and the pull-down circuits with NMOS transistors. Since the pull by the NMOS is much stronger than that of the PMOS, the pull-down will always overcome the pull-up in any contentions. In other words, the node or bus can always default to a pull-up or “1” state, and if desired, can always be flipped to a “0” state by a pull-down.
  • FIG. 12B illustrates the truth table of the output logic of FIG. 12A .
  • the logic is controlled by MTCH, MTCH* latched from the input logic and the control signals PDIR, PINV, NDIR, NINV, which are part of the control signals from the stack bus controller 410 .
  • Four operation modes, PASSTHROUGH, INVERTED, FLOATED, and PRECHARGE are supported.
  • a number of aspects of the present invention make use of the data latches of the read/write stacks described above in FIG. 10 for cache operations that will data in and out while the internal memory is doing other operations such as read, write, or erase.
  • data latches are shared by a number of physical pages. For example, as on the read/write stacks of the bit lines, shared by all of the word lines, so while one operation is going on, if any of these latches are free, they can cache data for future operations in the same or another word line, saving transfer time as this can be hidden behind another operation. This can improve performance by increasing the amount of pipelining of different operations or phases of operations.
  • a read operation on one word line is inserted into a write operation on another word line, allowing the data from the read to be transferred out of the memory while the data write continues on.
  • this allows data from another page in the same block, but on a different word line, to be toggled out (to, for example, do an ECC operation) while the write or other operation is going on for the first page of data.
  • This inter-phase pipelining of operations allows the time needed for the data transfer to be hidden behind the operation on the first page of data. More generally, this allows a portion of one operation to be inserted between phases of another, typically longer, operation. Another example would be to insert a sensing operation between phases of, say, an erase operation, such as before an erase pulse or before a soft programming phase used as the later part of the erase.
  • a set of exemplary time values for the system described above can be take as:
  • n such data latches will be needed for each bit line; however, not all of these latches are needed at all times. For example, in a two-bit per cell memory storing data in an upper page/lower page format, two data latches will be needed while programming the lower page. More generally, for memories storing multiple pages, all of the latches will be needed only when programming the highest page. This leaves the other latches available for cache operations. Further, even while writing the highest page, as the various states are removed from the verify phase of the write operation, latches will free up. Specifically, once only the highest state remains to be verified, only a single latch is needed for verification purposes and the others may be used for cache operations.
  • An example of how this can be used is that when programming one page, such as in a copy operation, a read of another page that shares the same set of data latches, such as another word line on the same set of bit lines, can be slipped in during the verify phase of the write. The address can then be switched to the page being written, allowing the write process to pick up where it left off without having to restart. While the write continues, the data cached during the interpolated read can be toggled out, checked or modified and transferred back to be present for writing back in once the earlier write operation completes. This sort cache operation allows the toggling out and modification of the second page of data to be hidden behind the programming of the first page.
  • FIG. 13 is a simplified version of FIG. 10 that shows some specific elements that are relevant to the present discussion in a two-bit embodiment, the other elements being suppressed to simplify the discussion. These include data latch DL 0 434 - 0 , which is connected Data I/O line 231 , data latch DL 1 434 - 1 , connected to common processor 500 by line 423 , data latch DL 2 434 - 2 , commonly connected with the other data latches by line 435 , and sense amp data latch DLS 214 , which is connected to common processor 500 by line 422 .
  • the latch DL 2 434 - 2 is used for the lower verify (VL) in quick pass write mode, as is described in U.S. patent application entitled “Use of Data Latches in Multi-Phase Programming of Non-Volatile Memories” filed concurrently with the present application; the inclusion of the register, and of using quick pass write when it is included, are optional, but the exemplary embodiment will include this register.
  • the programming of the lower page can include the following steps:
  • the process begins by resetting data latches DL 0 434 - 0 the default value “1”. This convention is used to simplify partial page programming as cells in a selected row that are not to be programmed will be program inhibited.
  • Program data is supplied to DL 0 434 - 0 along I/O line 231 .
  • data latch DL 0 434 - 0 can be reset to “1” and, during program time, the next data page can be loaded to DL 0 434 - 0 along I/O line 231 , allowing the caching of a second page while a first page is being written.
  • DL 1 434 - 1 data is used for lockout of the cell from further programming.
  • DL 2 434 - 2 data is used for the lower verify lockout that governs the transition to the second phase of quick pass write, as described in U.S. patent application entitled “Use of Data Latches in Multi-Phase Programming of Non-Volatile Memories” filed concurrently with the present application.
  • FIG. 14 shows the same elements as FIG. 13 , but indicates the latch assignment for upper page program where the lower page data is read in. (The description again uses conventional coding, so that the programming of the upper page is to the B and C states.)
  • the programming of the upper page can include the following steps:
  • Latch DL 0 434 - 0 (holding the lower page data) is checked as program reference data, but is not updated with the verify results.
  • the data will be updated in DL 2 434 - 2 accordingly, with DL 1 434 - 1 data being updated with the high verify VBH results.
  • the C verify will have corresponding commands to update latches DL 2 434 - 2 and DL 1 434 - 1 with the respective VCL and VCH results.
  • DL 0 434 - 0 is reset to “1” and another page of program data can be loaded in from I/O line 231 and cached in latch DL 0 434 - 0 .
  • the common processor 500 can set an indication that that only the C state is to be verified.
  • both of latches DL 1 434 - 1 and DL 0 434 - 0 are checked. Once the cells being programmed to the B state and only the C state is being verified, only the latch DL 1 434 - 1 data needs to be checked to see if there are any bits not programmed.
  • step 6 the latch DL 0 434 - 0 is no longer required and can be used to cache data for the next programming operation. Additionally, in embodiments using quick pass write, once the second, slowly programming phase is entered, the latch DL 2 434 - 2 could also be made available for caching data, although, in practice, it is often the case that this is only available in this way for a fairly short time period that does not justify the additional overhead that is often required to implement this feature.
  • FIG. 15 can be used to illustrate many of the aspects of cache program in the single page mode that has been described in the last few paragraphs.
  • FIG. 15 shows the relative timing of what events are occurring internally to the memory (the lower “True Busy” line) and as seen from external to the memory (the upper “Cache Busy” line).
  • the lower page to be programmed onto the selected word line (WLn) is loaded into the memory. This assumes the first lower page of data has not been previously cached, as it will be for the subsequent pages.
  • the lower page is finished loading and the memory begins to write it. Since this is equivalent to a binary operation at this point, only the state A needs to be verified (“pvfyA”) and the data latch DL 0 434 - 0 is available to receive the next page of data, here taken as the upper pages to be programmed into WLn, at time t 2 , which is consequently cached in latch DL 0 434 - 0 during the programming of the lower page.
  • the memory must wait from time t 3 to time t 4 before the upper page data can be written, unlike the full sequence embodiment described below.
  • the programming of the upper page begins at time t 4 , where initially only the B state is verified (“pvfyB”), the C state being added at t 5 (“pvfyB/C”). Once the B state is no longer being verified at t 6 , only the C state needs to be verified (“pvfyC”) and the latch DL 0 434 - 0 is freed up. This allows the next data set to be cached while the upper page finishes programming.
  • steps (1)-(4) are as for the lower page process in single page program mode:
  • the process begins by resetting data latches DL 0 434 - 0 the default value “1”. This convention is used to simplify partial page programming as cells in a selected row that are not to be programmed will be program inhibited.
  • Program data is supplied to DL 0 434 - 0 along I/O line 231 .
  • data latch DL 0 434 - 0 can be reset to “1” and, during program time, the next data page can be loaded to DL 0 434 - 0 along I/O line 231 , allowing the caching of a second page while a first page is being written.
  • Some operation parameters will be typically be changed when the program sequence changed from lower page to full sequence.
  • these include:
  • a full sequence read of the current state of the memory cells should be performed to guarantee the right data will be programmed for multi-level coding. This ensures that states that may have formerly locked out in the lower page programming, but which require further programming to take account of their upper page data, are not program inhibited when the full sequence begins.
  • FIG. 17 is a schematic representation of the relative times involved in the lower page to full sequence conversion write process.
  • the process is as described above for the process in FIG. 15 .
  • the verification process is switched to include the B states with the A states. Once all of the A states lock out, the verify process switches to checking for the B and C states at time t 4 .
  • the B states Once the B states have verified at t 5 , only the C state needs to be checked and a register can be freed up to load the next data to be programmed, such as the lower page on the next word line (WL n+1 ) as indicated on the Cache Busy line.
  • this next data set has been cached and one the programming of the C data for the previous set concludes at t 7 , this next data set begins programming. Additionally, while the (here) lower page on word line WL n+1 is programming, the next data (such as the corresponding upper page data) can be loaded into the open latch DL 0 434 - 0 .
  • a status report is implemented in a way that gives lower page and upper page status independently.
  • a scan of physical page can be performed.
  • a first scan can check latch DL 0 434 - 0 for unfinished upper page data
  • a second scan can check DL 1 434 - 1 for unfinished lower page data. Since, the verification of the B state will change both DL 0 434 - 0 and DL 1 434 - 1 data, an A state verification should be performed in the way that DL 1 434 - 1 data “0” will be changed to “1” if the bit's threshold value is higher than the A verify level.
  • This post verify will check on whether any under programmed B levels are passing at the A level; if they are passing at the A level, then the error is only on upper page and not on lower page; if they are not passing at the A level, then both lower and upper pages have error.
  • the C state will be transferred to latch DL 1 434 - 1 to finish programming. In this case, the scan of latch is not necessary for lower page, because the lower page will have already passed program without any failed bits.
  • Another set of exemplary embodiments of the present invention relate to page copy operations, where a data set is relocated from one location to another.
  • Various aspects of data relocation operations are described in U.S. patent applications number U.S. Ser. No. 10/846,289, filed May 13, 2004; Ser. No. 11/022,462, Dec. 21, 2004; and number U.S. Ser. No. 10/915,039, filed Aug. 9, 2004; and U.S. Pat. No. 6,266,273, which are all hereby incorporated by reference, which are all hereby incorporated by reference.
  • the data is often toggled out to be checked (for error, for example), updated (such as updating a header), or both (such correcting detected error).
  • a principal aspect of the present invention allows for a data read to an open register to be interpolated during the verify phase of a write operation, with this cached data then being transferred out of the memory device as the write operation continues, allowing the time for toggling the data out to hide behind the write operation.
  • FIG. 18 indicates the disposition of the exemplary arrangement of latches as the process progresses.
  • the first version of cache page copy will write to a lower page and can include the following steps, where read addresses are labeled M, M+1, . . . , and write addresses are labeled N, N+1, . . . :
  • page M The page to be copied (“page M”) is read into latch DL 1 434 - 1 . This can be either an upper or lower page of data
  • Page M is then transferred into DL 0 434 - 0 .
  • the program sequence can then begin. After data to be written into the lower page N is transferred to DL 1 434 - 1 and DL 2 434 - 2 , the latch DL 0 434 - 0 is ready for cache data. This lower page will be programmed. For this embodiment, the program state machine will stop here.
  • the copy destination page address will determine whether a write is to a lower or an upper page. If the program address is an upper page address, then the programming sequence will not be stopped until the programming finishes and the read of step (5) will be executed after the write is complete.
  • the program/verify process can be paused to insert a read operation and then restart the write operation, picking up at the point where it left off.
  • the data that was read during this interleaved sensing operation can then be toggled out while the resumed write operation continues on.
  • this second process allows for the page copy mechanism to be used in an upper page or full sequence write process once only the C state is being verified and one latch on each bit line opens up.
  • the second cache page copy operation begins with the same first three steps as in the first case, but then differs. It can include the following steps:
  • page M The page to be copied (“page M”) is read into latch DL 1 434 - 1 . This can be either a lower or upper page
  • the state machine program will go to an infinite wait state until the command a read command is entered and then a read of another page, say the next page M+1, to latch DL 0 434 - 0 will begin.
  • step (4) Once the read of step (4) is complete, the address is switched back to word line and block address to program the data in steps (1-3) into page N (here, a lower page) and the programming is resumed.
  • the exemplary embodiments include the latch DL 2 434 - 2 used for the lower verify of the quick pass write technique in addition to the latches DL 0 434 - 0 and DL 1 434 - 1 used in holding the (here, 2 bits) of data that can be programmed into each of the memory cells.
  • the latch DL 2 434 - 2 may also be freed up and used to cache data, although this is not done in the exemplary embodiments.
  • FIGS. 19A and 19B illustrate the relative timing of the second cache page copy method, where FIG. 19B illustrates the algorithm with the full sequence write conversion and FIG. 19A illustrates the algorithm without.
  • FIGS. 19A and 19B are composed of two parts, the first, upper part beginning at the broken vertical line A, corresponding to t 0 , and ending with the broken vertical line B, corresponding to t 5 ; the second, lower part is a continuation of the upper portion and begins with the broken vertical line B, corresponding to t 5 .
  • the line B at time t 5 is same in the upper portion as in the lower portion, being just a seam in two parts allowing it to be displayed on two lines.
  • FIG. 19A shows a process that starts with reading of a first page (page M) that is taken to be a lower page in this example, assumes no data has previously been cached, and operates in single page mode, waiting until the lower page has finished writing before beginning to write the upper page.
  • the process starts at time to with a read of the page M (Sense page M (L)), which here is a lower that is sensed by a read at the A and C levels in this coding.
  • Sense page M (L) is a lower that is sensed by a read at the A and C levels in this coding.
  • the read is complete and page M can be toggled out and checked or modified.
  • a next page here page M+1, the upper page corresponding to the same physical as lower page M
  • a process that finishes at time t 3 .
  • the first page (originating from Page M) (lower) is ready to be programmed back into the memory at page N and the data read from page M+1 is being held in a latch and can be transferred out to be modified/checked. Both of these processes can start at the same time, here t 3 .
  • the data from page M+1 has been toggled out and modified by time t 4 ; however, for the embodiment not implementing a full sequence conversion, the memory will wait until page N finishes at time t 5 to begin writing the second read page of data (originating from Page M+1) into page N+1.
  • page N+1 is an upper page
  • its write begins initially with a verification at the B level, the C level being added at t 6 .
  • the B state verification is dropped.
  • this allows a data latch to be freed up, an ongoing write operation is suspended, a reading operation (at a different address than the suspended program/verify operation) is interposed, the write then resumes where it left off, and the data sensed the interposed write operation can be toggled out while the resumed write operation runs on.
  • the interposed write operation is performed for the, here, lower page M+2.
  • This sensing is finished at time t 8 and the write of page N+1 picks back up and the data from page M+2 is concurrently toggled out and modified.
  • page N+1 finishes programming at time t 9 before page M+2 is finished at time t 10 .
  • a write of the data originating from page M+2 could begin; however, in this embodiment, instead a read of page M+3 is first executed, allowing for this page's data to be toggled out and the modification to be hidden behind the writing of the data originating from page M+2 into page N+2, beginning at time t 1 .
  • the process then continues on as in the earlier parts of the diagram, but with the page numbers shifted, with time t 11 corresponding to time t 3 , time t 12 corresponding to time t 4 , and so on until the copy process is stopped.
  • FIG. 19B again shows a process that starts with reading of a lower page, page M that is taken to be a lower page, and assumes no data has previously been cached.
  • FIG. 19B differs from FIG. 19A by implementing a conversion to full sequence write at time t 4 . This roughly speeds up the process by the time (t 5 -t 4 ) of FIG. 19A .
  • the various changes related to the full sequence conversion are implemented as described previously. Otherwise, the process is similar to that of FIG. 19A , including those aspects of the present invention found between times t 7 and t 12 .
  • the write process can begin verifying only the A level. After ever A verify, it is checked to see whether any bits have passed. If so, the B level can be added to the verify phase. The A level verify will be removed after all storage units with it as their target values verify (or except a maximum count based on a settable parameter). Similarly, after the verifications at the B level, a verify of the C level can be added, with the B level verify being removed after all storage units with it as their target values verify (or except a maximum count based on a settable parameter).

Abstract

Methods and circuitry are present for improving performance in non-volatile memory devices by allowing the inter-phase pipelining of operations with the same memory, allowing, for example, a read operation to be interleaved between the pulse and verify phases of a write operation. In the exemplary embodiment, the two operations share data latches. In specific examples, at the data latches needed for verification in a multi-level write operation free up, they can be used to store data read from another location during a read performed between steps in the multi-level write. In the exemplary embodiment, the multi-level write need only pause, execute the read, and resume the write at the point where it paused.

Description

    CROSS REFERENCE TO RELATED APPLICATIONS
  • This application is a continuation of application Ser. No. 11/097,590, filed on Apr. 1, 2005, which application is incorporated herein in its entirety by this reference.
  • This application is related to the following U.S. patent applications: Ser. No. 11/013,125, filed Dec. 14, 2004, now U.S. Pat. No. 7,120,051; Ser. No. 11/026,536, filed Dec. 29, 2004, now published as US PG Pub 2006/0140007; Ser. No. 11/015,199, filed Dec. 16, 2004, now U.S. Pat. No. 7,046,568; filed Mar. 16, 2005; and Ser. No. 11/097,517, filed Apr. 1, 2005. These applications are incorporated herein by reference in their entirety for all purposes.
  • FIELD OF THE INVENTION
  • This invention relates generally to non-volatile semiconductor memory such as electrically erasable programmable read-only memory (EEPROM) and flash EEPROM, and specifically to cache operations based on shared latch structures allowing overlapping memory operations.
  • BACKGROUND OF THE INVENTION
  • 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, retaining its stored data even after power is turned off. In spite of the higher cost, flash memory is increasingly being used in mass storage applications. Conventional mass storage, based on rotating magnetic medium such as hard drives and floppy disks, is unsuitable for the mobile and handheld environment. This is because disk drives tend to be bulky, are prone to mechanical failure and have high latency and high power requirements. These undesirable attributes make disk-based storage impractical in most mobile and portable applications. On the other hand, flash memory, both embedded and in the form of a removable card is ideally suited in the mobile and handheld environment because of its small size, low power consumption, high speed and high reliability features.
  • EEPROM and electrically programmable read-only memory (EPROM) are 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.
  • 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.
  • The transistor serving as a memory cell is typically programmed to a “programmed” state by one of two mechanisms. In “hot electron injection,” a high voltage applied to the drain accelerates electrons across the substrate channel region. At the same time a high voltage applied to the control gate pulls the hot electrons through a thin gate dielectric onto the floating gate. In “tunneling injection,” a high voltage is applied to the control gate relative to the substrate. In this way, electrons are pulled from the substrate to the intervening floating gate.
  • The memory device may be erased by a number of mechanisms. For EPROM, the memory is bulk erasable by removing the charge from the floating gate by ultraviolet radiation. For EEPROM, a memory cell is electrically erasable, by applying a high voltage to the substrate relative to the control gate so as to induce electrons in the floating gate to tunnel through a thin oxide to the substrate channel region (i.e., Fowler-Nordheim tunneling.) Typically, the EEPROM is erasable byte by byte. For flash EEPROM, the memory is electrically erasable either all at once or one or more blocks at a time, where a block may consist of 512 bytes or more of memory.
  • Examples of Non-Volatile Memory Cells
  • The memory devices typically comprise one or more memory chips that may be mounted on a card. Each memory chip comprises an array of memory cells supported by peripheral circuits such as decoders and erase, write and read circuits. The more sophisticated memory devices also come with a controller that performs intelligent and higher level memory operations and interfacing. 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.
  • FIGS. 1A-1E illustrate schematically different examples of non-volatile memory cells.
  • FIG. 1A illustrates schematically a non-volatile memory in the form of an EEPROM cell with a floating gate for storing charge. An electrically erasable and programmable read-only memory (EEPROM) has a similar structure to EPROM, but additionally provides a mechanism for loading and removing charge electrically from its floating gate upon application of proper voltages without the need for exposure to UV radiation. Examples of such cells and methods of manufacturing them are given in U.S. Pat. No. 5,595,924.
  • FIG. 1B illustrates schematically a flash EEPROM cell having both a select gate and a control or steering gate. The memory cell 10 has a “split-channel” 12 between source 14 and drain 16 diffusions. A cell is formed effectively with two transistors T1 and T2 in series. T1 serves as a memory transistor having a floating gate 20 and a control gate 30. The floating gate is capable of storing a selectable amount of charge. The amount of current that can flow through the T1's portion of the channel depends on the voltage on the control gate 30 and the amount of charge residing on the intervening floating gate 20. T2 serves as a select transistor having a select gate 40. When T2 is turned on by a voltage at the select gate 40, it allows the current in the T1's portion of the channel to pass between the source and drain. The select transistor provides a switch along the source-drain channel independent of the voltage at the control gate. One advantage is that it can be used to turn off those cells that are still conducting at zero control gate voltage due to their charge depletion (positive) at their floating gates. The other advantage is that it allows source side injection programming to be more easily implemented.
  • One simple embodiment of the split-channel memory cell is where the select gate and the control gate are connected to the same word line as indicated schematically by a dotted line shown in FIG. 1B. This is accomplished by having a charge storage element (floating gate) positioned over one portion of the channel and a control gate structure (which is part of a word line) positioned over the other channel portion as well as over the charge storage element. This effectively forms a cell with two transistors in series, one (the memory transistor) with a combination of the amount of charge on the charge storage element and the voltage on the word line controlling the amount of current that can flow through its portion of the channel, and the other (the select transistor) having the word line alone serving as its gate. Examples of such cells, their uses in memory systems and methods of manufacturing them are given in U.S. Pat. Nos. 5,070,032, 5,095,344, 5,315,541, 5,343,063, and 5,661,053.
  • A more refined embodiment of the split-channel cell shown in FIG. 1B is when the select gate and the control gate are independent and not connected by the dotted line between them. One implementation has the control gates of one column in an array of cells connected to a control (or steering) line perpendicular to the word line. The effect is to relieve the word line from having to perform two functions at the same time when reading or programming a selected cell. Those two functions are (1) to serve as a gate of a select transistor, thus requiring a proper voltage to turn the select transistor on and off, and (2) to drive the voltage of the charge storage element to a desired level through an electric field (capacitive) coupling between the word line and the charge storage element. It is often difficult to perform both of these functions in an optimum manner with a single voltage. With the separate control of the control gate and the select gate, the word line need only perform function (1), while the added control line performs function (2). This capability allows for design of higher performance programming where the programming voltage is geared to the targeted data. The use of independent control (or steering) gates in a flash EEPROM array is described, for example, in U.S. Pat. Nos. 5,313,421 and 6,222,762.
  • FIG. 1C illustrates schematically another flash EEPROM cell having dual floating gates and independent select and control gates. The memory cell 10 is similar to that of FIG. 1B except it effectively has three transistors in series. In this type of cell, two storage elements (i.e., that of T1—left and T1—right) are included over its channel between source and drain diffusions with a select transistor T1 in between them. The memory transistors have floating gates 20 and 20′, and control gates 30 and 30′, respectively. The select transistor T2 is controlled by a select gate 40. At any one time, only one of the pair of memory transistors is accessed for read or write. When the storage unit T1—left is being accessed, both the T2 and T1—right are turned on to allow the current in the T1—left's portion of the channel to pass between the source and the drain. Similarly, when the storage unit T1—right is being accessed, T2 and T1—left are turned on. Erase is effected by having a portion of the select gate polysilicon in close proximity to the floating gate and applying a substantial positive voltage (e.g. 20V) to the select gate so that the electrons stored within the floating gate can tunnel to the select gate polysilicon.
  • FIG. 1D illustrates schematically a string of memory cells organized into an NAND cell. An NAND cell 50 consists of a series of memory transistors M1, M2, . . . Mn (n=4, 8, 16 or higher) daisy-chained by their sources and drains. A pair of select transistors S1, S2 controls the memory transistors chain's connection to the external via the NAND cell's source terminal 54 and drain terminal 56. In a memory array, when the source select transistor S1 is turned on, the source terminal is coupled to a source line. Similarly, when the drain select transistor S2 is turned on, the drain terminal of the NAND cell is coupled to a bit line of the memory array. Each memory transistor in the chain has a charge storage element to store a given amount of charge so as to represent an intended memory state. A control gate of each memory transistor provides control over read and write operations. A control gate of each of the select transistors S1, S2 provides control access to the NAND cell via its source terminal 54 and drain terminal 56 respectively.
  • When an addressed memory transistor within an NAND cell is read and verified during programming, its control gate is supplied with an appropriate voltage. At the same time, the rest of the non-addressed memory transistors in the NAND cell 50 are fully turned on by application of sufficient voltage on their control gates. In this way, a conductive path is effective created from the source of the individual memory transistor to the source terminal 54 of the NAND cell and likewise for the drain of the individual memory transistor to the drain terminal 56 of the cell. Memory devices with such NAND cell structures are described in U.S. Pat. Nos. 5,570,315, 5,903,495, 6,046,935.
  • FIG. 1E illustrates schematically a non-volatile memory with a dielectric layer for storing charge. Instead of the conductive floating gate elements described earlier, a dielectric layer is used. Such memory devices utilizing dielectric storage element have been described by Eitan et al., “NROM: A Novel Localized Trapping, 2-Bit Nonvolatile Memory Cell,” IEEE Electron Device Letters, vol. 21, no. 11, November 2000, pp. 543-545. 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, U.S. Pat. Nos. 5,768,192 and 6,011,725 disclose a nonvolatile memory cell having 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.
  • Memory Array
  • A memory device typically comprises of a two-dimensional array of memory cells arranged in rows and columns and addressable by word lines and bit lines. The array can be formed according to an NOR type or an NAND type architecture.
  • NOR Array
  • FIG. 2 illustrates an example of an NOR array of memory cells. Memory devices with an NOR type architecture have been implemented with cells of the type illustrated in FIGS. 1B or 1C. Each row of memory cells are connected by their sources and drains in a daisy-chain manner. This design is sometimes referred to as a virtual ground design. Each memory cell 10 has a source 14, a drain 16, a control gate 30 and a select gate 40. The cells in a row have their select gates connected to word line 42. The cells in a column have their sources and drains respectively connected to selected bit lines 34 and 36. In some embodiments where the memory cells have their control gate and select gate controlled independently, a steering line 36 also connects the control gates of the cells in a column.
  • Many flash EEPROM devices are implemented with memory cells where each is formed with its control gate and select gate connected together. In this case, there is no need for steering lines and a word line simply connects all the control gates and select gates of cells along each row. Examples of these designs are disclosed in U.S. Pat. Nos. 5,172,338 and 5,418,752. In these designs, the word line essentially performed two functions: row selection and supplying control gate voltage to all cells in the row for reading or programming.
  • NAND Array
  • FIG. 3 illustrates an example of an NAND array of memory cells, such as that shown in FIG. 1D. Along each column of NAND cells, a bit line is coupled to the drain terminal 56 of each NAND cell. Along each row of NAND cells, a source line may connect all their source terminals 54. Also the control gates of the NAND cells along a row are connected to a series of corresponding word lines. An entire row of NAND cells can be addressed by turning on the pair of select transistors (see FIG. 1D) with appropriate voltages on their control gates via the connected word lines. When a memory transistor within the chain of a NAND cell is being read, the remaining memory transistors in the chain are turned on hard via their associated word lines so that the current flowing through the chain is essentially dependent upon the level of charge stored in the cell being read. An example of an NAND architecture array and its operation as part of a memory system is found in U.S. Pat. Nos. 5,570,315, 5,774,397 and 6,046,935.
  • Block Erase
  • Programming of charge storage memory devices can only result in adding more charge to its charge storage elements. Therefore, prior to a program operation, existing charge in a charge storage element must be removed (or erased). Erase circuits (not shown) are provided to erase one or more blocks of memory cells. A non-volatile memory such as EEPROM is referred to as a ”Flash” EEPROM when an entire array of cells, or significant groups of cells of the array, is electrically erased together (i.e., in a flash). Once erased, the group of cells can then be reprogrammed. The group of cells erasable together may consist one or more addressable erase unit. The erase unit or block typically stores one or more pages of data, the page being the unit of programming and reading, although more than one page may be programmed or read in a single operation. Each page typically stores one or more sectors of data, the size of the sector being defined by the host system. An example is a sector of 512 bytes of user data, following a standard established with magnetic disk drives, plus some number of bytes of overhead information about the user data and/or the block in with it is stored.
  • Read/Write Circuits
  • In the usual two-state EEPROM cell, at least one current breakpoint level is established so as to partition the conduction window into two regions. When a cell is read by applying predetermined, fixed voltages, its source/drain current is resolved into a memory state by comparing with the breakpoint level (or reference current IREF). If the current read is higher than that of the breakpoint level, the cell is determined to be in one logical state (e.g., a “zero” state). On the other hand, if the current is less than that of the breakpoint level, the cell is determined to be in the other logical state (e.g., a “one” state). Thus, such a two-state cell stores one bit of digital information. A reference current source, which may be externally programmable, is often provided as part of a memory system to generate the breakpoint level current.
  • In order to increase memory capacity, flash EEPROM devices are being fabricated with higher and higher density as the state of the semiconductor technology advances. Another method for increasing storage capacity is to have each memory cell store more than two states.
  • For a multi-state or multi-level EEPROM memory cell, the conduction window is partitioned into more than two regions by more than one breakpoint such that each cell is capable of storing more than one bit of data. The information that a given EEPROM array can store is thus increased with the number of states that each cell can store. EEPROM or flash EEPROM with multi-state or multi-level memory cells have been described in U.S. Pat. No. 5,172,338.
  • 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. 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.
  • FIG. 4 illustrates the relation between the source-drain current ID and the control gate voltage VCG for four different charges Q1-Q4 that the floating gate may be selectively storing at any one time. The four solid ID versus VCG curves represent four possible charge levels that can be programmed on a floating gate of a memory cell, respectively corresponding to four possible memory states. As an example, the threshold voltage window of a population of cells may range from 0.5V to 3.5V. Six memory states may be demarcated by partitioning the threshold window into five regions in interval of 0.5V each. For example, if a reference current, IREF of 2 μA is used as shown, then the cell programmed with Q1 may be considered to be in a memory state “1” since its curve intersects with IREF in the region of the threshold window demarcated by VCG=0.5V and 1.0V. Similarly, Q4 is in a memory state “5”.
  • 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. This will require higher precision in programming and reading operations in order to be able to achieve the required resolution.
  • U.S. Pat. No. 4,357,685 discloses a method of programming a 2-state EPROM in which when a cell is programmed to a given state, it is subject to successive programming voltage pulses, each time adding incremental charge to the floating gate. In between pulses, the cell is read back or verified to determine its source-drain current relative to the breakpoint level. Programming stops when the current state has been verified to reach the desired state. The programming pulse train used may have increasing period or amplitude.
  • Prior art programming circuits simply apply programming pulses to step through the threshold window from the erased or ground state until the target state is reached. Practically, to allow for adequate resolution, each partitioned or demarcated region would require at least about five programming steps to transverse. The performance is acceptable for 2-state memory cells. However, for multi-state cells, the number of steps required increases with the number of partitions and therefore, the programming precision or resolution must be increased. For example, a 16-state cell may require on average at least 40 programming pulses to program to a target state.
  • FIG. 5 illustrates schematically a memory device with a typical arrangement of a memory array 100 accessible by read/write circuits 170 via row decoder 130 and column decoder 160. As described in connection with FIGS. 2 and 3, a memory transistor of a memory cell in the memory array 100 is addressable via a set of selected word line(s) and bit line(s). The row decoder 130 selects one or more word lines and the column decoder 160 selects one or more bit lines in order to apply appropriate voltages to the respective gates of the addressed memory transistor. Read/write circuits 170 are provided to read or write (program) the memory states of addressed memory transistors. The read/write circuits 170 comprise a number of read/write modules connectable via bit lines to memory elements in the array.
  • FIG. 6A is a schematic block diagram of an individual read/write module 190. Essentially, during read or verify, a sense amplifier determines the current flowing through the drain of an addressed memory transistor connected via a selected bit line. The current depends on the charge stored in the memory transistor and its control gate voltage. For example, in a multi-state EEPROM cell, its floating gate can be charged to one of several different levels. For a 4-level cell, it may be used to store two bits of data. The level detected by the sense amplifier is converted by a level-to-bits conversion logic to a set of data bits to be stored in a data latch.
  • Factors Affecting Read/Write Performance and Accuracy
  • 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 logical “page” of memory elements are read or programmed together. In existing memory architectures, a row typically contains several interleaved pages. All memory elements of a page will be read or programmed together. The column decoder will selectively connect each one of the interleaved pages to a corresponding number of read/write modules. For example, in one implementation, the memory array is designed to have a page size of 532 bytes (512 bytes plus 20 bytes of overheads.) If each column contains a drain bit line and there are two interleaved pages per row, this amounts to 8512 columns with each page being associated with 4256 columns. There will be 4256 sense modules connectable to read or write in parallel either all the even bit lines or the odd bit lines. In this way, a page of 4256 bits (i.e., 532 bytes) of data in parallel are read from or programmed into the page of memory elements. The read/write modules forming the read/write circuits 170 can be arranged into various architectures.
  • Referring to FIG. 5, the read/write circuits 170 is organized into banks of read/write stacks 180. Each read/write stack 180 is a stack of read/write modules 190. In a memory array, the column spacing is determined by the size of the one or two transistors that occupy it. However, as can be seen from FIG. 6A, the circuitry of a read/write module will likely be implemented with many more transistors and circuit elements and therefore will occupy a space over many columns. In order to service more than one column among the occupied columns, multiple modules are stacked up on top of each other.
  • FIG. 6B shows the read/write stack of FIG. 5 implemented conventionally by a stack of read/write modules 190. For example, a read/write module may extend over sixteen columns, then a read/write stack 180 with a stack of eight read/write modules can be used to service eight columns in parallel. The read/write stack can be coupled via a column decoder to either the eight odd (1, 3, 5, 7, 9, 11, 13, 15) columns or the eight even (2, 4, 6, 8, 10, 12, 14, 16) columns among the bank.
  • As mentioned before, conventional memory devices improve read/write operations by operating in a massively parallel manner on all even or all odd bit lines at a time. This architecture of a row consisting of two interleaved pages will help to alleviate the problem of fitting the block of read/write circuits. It is also dictated by consideration of controlling bit-line to bit-line capacitive coupling. A block decoder is used to multiplex the set of read/write modules to either the even page or the odd page. In this way, whenever one set of bit lines are being read or programmed, the interleaving set can be grounded to minimize immediate neighbor coupling.
  • However, the interleaving page architecture is disadvantageous in at least three respects. First, it requires additional multiplexing circuitry. Secondly, it is slow in performance. To finish read or program of memory cells connected by a word line or in a row, two read or two program operations are required. Thirdly, it is also not optimum in addressing other disturb effects such as field coupling between neighboring charge storage elements at the floating gate level when the two neighbors are programmed at different times, such as separately in odd and even pages.
  • The problem of neighboring field coupling becomes more pronounced with ever closer spacing between memory transistors. In a memory transistor, a charge storage element is sandwiched between a channel region and a control gate. The current that flows in the channel region is a function of the resultant electric field contributed by the field at the control gate and the charge storage element. With ever increasing density, memory transistors are formed closer and closer together. The field from neighboring charge elements then becomes significant contributor to the resultant field of an affected cell. The neighboring field depends on the charge programmed into the charge storage elements of the neighbors. This perturbing field is dynamic in nature as it changes with the programmed states of the neighbors. Thus, an affected cell may read differently at different time depending on the changing states of the neighbors.
  • The conventional architecture of interleaving page exacerbates the error caused by neighboring floating gate coupling. Since the even page and the odd page are programmed and read independently of each other, a page may be programmed under one set of condition but read back under an entirely different set of condition, depending on what has happened to the intervening page in the meantime. The read errors will become more severe with increasing density, requiring a more accurate read operation and coarser partitioning of the threshold window for multi-state implementation. Performance will suffer and the potential capacity in a multi-state implementation is limited.
  • United States Patent Publication No. US-2004-0060031-A1 discloses a high performance yet compact non-volatile memory device having a large block of read/write circuits to read and write a corresponding block of memory cells in parallel. In particular, the memory device has an architecture that reduces redundancy in the block of read/write circuits to a minimum. Significant saving in space as well as power is accomplished by redistributing the block of read/write modules into a block read/write module core portions that operate in parallel while interacting with a substantially smaller sets of common portions in a time-multiplexing manner. In particular, data processing among read/write circuits between a plurality of sense amplifiers and data latches is performed by a shared processor.
  • Therefore there is a general need for high performance and high capacity non-volatile memory. In particular, there is a need for a compact non-volatile memory with enhanced read and program performance having an improved processor that is compact and efficient, yet highly versatile for processing data among the read/writing circuits.
  • SUMMARY OF INVENTION
  • According to one aspect of the invention, cache operations are presented that allow data to be transferred in or out of a memory while the internal memory is engaged in another operation, such as a read, program or erase. In particular, arrangements of data latches and methods of their use are described which allow such cache operations.
  • Architectures are described where data latches are shared by a number of physical pages. For example, read/write stacks are associated with the bit lines of the memory, which shared by multiple word lines. While one operation is going on in the memory, if any of these latch are free, they can cache data for future operations in the same or another word line, saving transfer time as this can be hidden behind another operation. This can improve performance by increasing the amount of pipelining of different operations or phases of operations. In one example, in a cache program operation, while programming one page of data another page of data can be loaded in, saving on transfer time. For another example, in one exemplary embodiment, a read operation on one word line is inserted into a write operation on another word line, allowing the data from the read to be transferred out of the memory while the data write continues on.
  • According to the various aspects, data from another page in the same block, but on a different word line, can be toggled out (to, for example, do an ECC operation) while a write or other operation is going on for the first page of data. This inter-phase pipelining of operations allows the time needed for the data transfer to be hidden behind the operation on the first page of data. More generally, this allows a portion of one operation to be inserted between phases of another, typically longer, operation. Another example would be to insert a sensing operation between phases of, say, an erase operation, such as before an erase pulse or before a soft programming phase used as the later part of the erase.
  • If a relatively long operation with different phases is being performed, a primary aspect will interpose in a quicker operation using the shared latches of the read/write stacks if latches available. For example, a read can be inserted into a program or erase operation, or a binary program can be inserted into an erase. The primary exemplary embodiments will toggle data in and/or out for one page during a program operation for another page that shares the same read write stacks, where, for example, a read of the data to be toggled out and modified is inserted into the verify phase of the data write.
  • The availability of open data latches can arise in a number of ways. Generally, for a memory storing n bits per cell, n such data latches will be needed for each bit line; however, not all of these latches are needed at all times. For example, in a two-bit per cell memory storing data in an upper page/lower page format, one data latch will be needed while programming the lower page (with another latch used if quick pass write is implemented). Two data latches will be needed while programming the upper page (with a third latch used if quick pass write is implemented)). More generally, for memories storing multiple pages, all of the latches will be needed only when programming the highest page. This leaves the other latches available for cache operations. Further, even while writing the highest page, as the various states are removed from the verify phase of the write operation, latches will free up. Specifically, once only the highest state remains to be verified, only a single latch is needed for verification purposes and the others may be used for cache operations.
  • An exemplary embodiment is based on a four state memory storing two-bits per cell and having two latches for data on each bit line and one additional latch for quick pass write. The operations of writing the lower page, or erasing, or doing a post erase soft program are basically a binary operation and have one of the data latches free, which can use it to cache data. Similarly, where doing an upper page or full sequence write, once all but the highest level has verified, only a single state needs to verify and the memory can free up a latch that can be used to cache data. An example of how this can be used is that when programming one page, such as in a copy operation, a read of another page that shares the same set of data latches, such as another word line on the same set of bit lines, can be slipped in between program pulse and verifies of the write. The address can then be switched to the page being written, allowing the write process to pick up where it left off without having to restart. While the write continues, the data cached during the interpolated read can be toggled out, checked or modified and transferred back to be present for writing back in once the earlier write operation completes. This sort cache operation allows the toggling out and modification of the second page of data to be hidden behind the programming of the first page.
  • Additional features and advantages of the present invention will be understood from the following description of its preferred embodiments, which description should be taken in conjunction with the accompanying drawings.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIGS. 1A-1E illustrate schematically different examples of non-volatile memory cells.
  • FIG. 2 illustrates an example of an NOR array of memory cells.
  • FIG. 3 illustrates an example of an NAND array of memory cells, such as that shown in FIG. 1D.
  • FIG. 4 illustrates the relation between the source-drain current and the control gate voltage for four different charges Q1-Q4 that the floating gate may be storing at any one time.
  • FIG. 5 illustrates schematically a typical arrangement of a memory array accessible by read/write circuits via row and column decoders.
  • FIG. 6A is a schematic block diagram of an individual read/write module.
  • FIG. 6B shows the read/write stack of FIG. 5 implemented conventionally by a stack of read/write modules.
  • FIG. 7A illustrates schematically a compact memory device having a bank of partitioned read/write stacks, in which the improved processor of the present invention is implemented.
  • FIG. 7B illustrates a preferred arrangement of the compact memory device shown in FIG. 7A.
  • FIG. 8 illustrates schematically a general arrangement of the basic components in a read/write stack shown in FIG. 7A.
  • FIG. 9 illustrates one preferred arrangement of the read/write stacks among the read/write circuits shown in FIGS. 7A and 7B.
  • FIG. 10 illustrates an improved embodiment of the common processor shown in FIG. 9.
  • FIG. 11A illustrates a preferred embodiment of the input logic of the common processor shown in FIG. 10.
  • FIG. 11B illustrates the truth table of the input logic of FIG. 11A.
  • FIG. 12A illustrates a preferred embodiment of the output logic of the common processor shown in FIG. 10.
  • FIG. 12B illustrates the truth table of the output logic of FIG. 12A.
  • FIG. 13 is a simplified version of FIG. 10 that shows some specific elements that are relevant to the present discussion in a two-bit embodiment of the present invention
  • FIG. 14 indicates the latch assignment for the same elements as FIG. 13 for upper page program where the lower page data is read in.
  • FIG. 15 illustrates aspects of cache program in the single page mode.
  • FIG. 16 shows a programming waveform that can be used in a lower page to full sequence conversion.
  • FIG. 17 illustrates the relative timing in a cache program operation with a full sequence conversion.
  • FIG. 18 describes the disposition of latches in a cache page copy operation.
  • FIGS. 19A and 19B illustrate the relative timings in cache page copy operations.
  • DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
  • FIG. 7A illustrates schematically a compact memory device having a bank of partitioned read/write stacks, in which the improved processor of the present invention is implemented. The memory device includes a two-dimensional array of memory cells 300, control circuitry 310, and read/write circuits 370. The memory array 300 is addressable by word lines via a row decoder 330 and by bit lines via a column decoder 360. The read/write circuits 370 is implemented as a bank of partitioned read/write stacks 400 and allows a block (also referred to as a “page”) of memory cells to be read or programmed in parallel. In a preferred embodiment, a page is constituted from a contiguous row of memory cells. In another embodiment, where a row of memory cells are partitioned into multiple blocks or pages, a block multiplexer 350 is provided to multiplex the read/write circuits 370 to the individual blocks.
  • The control circuitry 310 cooperates with the read/write circuits 370 to perform memory operations on the memory array 300. The control circuitry 310 includes a state machine 312, an on-chip address decoder 314 and a power control module 316. The state machine 312 provides chip level control of memory operations. The on-chip address decoder 314 provides an address interface between that used by the host or a memory controller to the hardware address used by the decoders 330 and 370. The power control module 316 controls the power and voltages supplied to the word lines and bit lines during memory operations.
  • FIG. 7B illustrates a preferred arrangement of the compact memory device shown in FIG. 7A. Access to the memory array 300 by the various peripheral circuits is implemented in a symmetric fashion, on opposite sides of the array so that access lines and circuitry on each side are reduced in half. Thus, the row decoder is split into row decoders 330A and 330B and the column decoder into column decoders 360A and 360B. In the embodiment where a row of memory cells are partitioned into multiple blocks, the block multiplexer 350 is split into block multiplexers 350A and 350B. Similarly, the read/write circuits are split into read/write circuits 370A connecting to bit lines from the bottom and read/write circuits 370B connecting to bit lines from the top of the array 300. In this way, the density of the read/write modules, and therefore that of the partitioned read/write stacks 400, is essentially reduced by one half.
  • FIG. 8 illustrates schematically a general arrangement of the basic components in a read/write stack shown in FIG. 7A. According to a general architecture of the invention, the read/write stack 400 comprises a stack of sense amplifiers 212 for sensing k bit lines, an I/O module 440 for input or output of data via an I/O bus 231, a stack of data latches 430 for storing input or output data, a common processor 500 to process and store data among the read/write stack 400, and a stack bus 421 for communication among the stack components. A stack bus controller among the read/write circuits 370 provides control and timing signals via lines 411 for controlling the various components among the read/write stacks.
  • FIG. 9 illustrates one preferred arrangement of the read/write stacks among the read/write circuits shown in FIGS. 7A and 7B. Each read/write stack 400 operates on a group of k bit lines in parallel. If a page has p=r*k bit lines, there will be r read/write stacks, 400-1, . . . , 400-r.
  • The entire bank of partitioned read/write stacks 400 operating in parallel allows a block (or page) of p cells along a row to be read or programmed in parallel. Thus, there will be p read/write modules for the entire row of cells. As each stack is serving k memory cells, the total number of read/write stacks in the bank is therefore given by r=p/k. For example, if r is the number of stacks in the bank, then p=r*k. One example memory array may have p=512 bytes (512×8 bits), k=8, and therefore r=512. In the preferred embodiment, the block is a run of the entire row of cells. In another embodiment, the block is a subset of cells in the row. For example, the subset of cells could be one half of the entire row or one quarter of the entire row. The subset of cells could be a run of contiguous cells or one every other cell, or one every predetermined number of cells.
  • Each read/write stack, such as 400-1, essentially contains a stack of sense amplifiers 212-1 to 212-k servicing a segment of k memory cells in parallel. A preferred sense amplifier is disclosed in United States Patent Publication No. 2004-0109357-A1, the entire disclosure of which is hereby incorporated herein by reference.
  • The stack bus controller 410 provides control and timing signals to the read/write circuit 370 via lines 411. The stack bus controller is itself dependent on the memory controller 310 via lines 311. Communication among each read/write stack 400 is effected by an interconnecting stack bus 431 and controlled by the stack bus controller 410. Control lines 411 provide control and clock signals from the stack bus controller 410 to the components of the read/write stacks 400-1.
  • In the preferred arrangement, the stack bus is partitioned into a SABus 422 for communication between the common processor 500 and the stack of sense amplifiers 212, and a DBus 423 for communication between the processor and the stack of data latches 430.
  • The stack of data latches 430 comprises of data latches 430-1 to 430-k, one for each memory cell associated with the stack The I/O module 440 enables the data latches to exchange data with the external via an I/O bus 231.
  • The common processor also includes an output 507 for output of a status signal indicating a status of the memory operation, such as an error condition. The status signal is used to drive the gate of an n-transistor 550 that is tied to a FLAG BUS 509 in a Wired-Or configuration. The FLAG BUS is preferably precharged by the controller 310 and will be pulled down when a status signal is asserted by any of the read/write stacks.
  • FIG. 10 illustrates an improved embodiment of the common processor shown in FIG. 9. The common processor 500 comprises a processor bus, PBUS 505 for communication with external circuits, an input logic 510, a processor latch PLatch 520 and an output logic 530.
  • The input logic 510 receives data from the PBUS and outputs to a BSI node as a transformed data in one of logical states “1”, “0”, or “Z” (float) depending on the control signals from the stack bus controller 410 via signal lines 411. A Set/Reset latch, PLatch 520 then latches BSI, resulting in a pair of complementary output signals as MTCH and MTCH*.
  • The output logic 530 receives the MTCH and MTCH* signals and outputs on the PBUS 505 a transformed data in one of logical states “1”, “0”, or “Z” (float) depending on the control signals from the stack bus controller 410 via signal lines 411.
  • At any one time the common processor 500 processes the data related to a given memory cell. For example, FIG. 10 illustrates the case for the memory cell coupled to bit line 1. The corresponding sense amplifier 212-1 comprises a node where the sense amplifier data appears. In the preferred embodiment, the node assumes the form of a SA Latch, 214-1 that stores data. Similarly, the corresponding set of data latches 430-1 stores input or output data associated with the memory cell coupled to bit line 1. In the preferred embodiment, the set of data latches 430-1 comprises sufficient data latches, 434-1, . . . , 434-n for storing n-bits of data.
  • The PBUS 505 of the common processor 500 has access to the SA latch 214-1 via the SBUS 422 when a transfer gate 501 is enabled by a pair of complementary signals SAP and SAN. Similarly, the PBUS 505 has access to the set of data latches 430-1 via the DBUS 423 when a transfer gate 502 is enabled by a pair of complementary signals DTP and DTN. The signals SAP, SAN, DTP and DTN are illustrated explicitly as part of the control signals from the stack bus controller 410.
  • FIG. 11A illustrates a preferred embodiment of the input logic of the common processor shown in FIG. 10. The input logic 520 receives the data on the PBUS 505 and depending on the control signals, either has the output BSI being the same, or inverted, or floated. The output BSI node is essentially affected by either the output of a transfer gate 522 or a pull-up circuit comprising p- transistors 524 and 525 in series to Vdd, or a pull-down circuit comprising n- transistors 526 and 527 in series to ground. The pull-up circuit has the gates to the p- transistor 524 and 525 respectively controlled by the signals PBUS and ONE. The pull-down circuit has the gates to the n- transistors 526 and 527 respectively controlled by the signals ONEB<1> and PBUS.
  • FIG. 11B illustrates the truth table of the input logic of FIG. 11A. The logic is controlled by PBUS and the control signals ONE, ONEB<0>, ONEB<1> which are part of the control signals from the stack bus controller 410. Essentially, three transfer modes, PASSTHROUGH, INVERTED, and FLOATED, are supported.
  • In the case of the PASSTHROUGH mode where BSI is the same as the input data, the signals ONE is at a logical “1”, ONEB<0> at “0” and ONEB<1> at “0”. This will disable the pull-up or pull-down but enable the transfer gate 522 to pass the data on the PBUS 505 to the output 523. In the case of the INVERTED mode where BSI is the invert of the input data, the signals ONE is at “0”, ONEB<0> at “1” and ONE<1>at “1”. This will disable the transfer gate 522. Also, when PBUS is at “0”, the pull-down circuit will be disabled while the pull-up circuit is enabled, resulting in BSI being at “1”. Similarly, when PBUS is at “1”, the pull-up circuit is disabled while the pull-down circuit is enabled, resulting in BSI being at “0”. Finally, in the case of the FLOATED mode, the output BSI can be floated by having the signals ONE at “1”, ONEB<0> at “1” and ONEB<1> at “0”. The FLOATED mode is listed for completeness although in practice, it is not used.
  • FIG. 12A illustrates a preferred embodiment of the output logic of the common processor shown in FIG. 10. The signal at the BSI node from the input logic 520 is latched in the processor latch, PLatch 520. The output logic 530 receives the data MTCH and MTCH* from the output of PLatch 520 and depending on the control signals, outputs on the PBUS as either in a PASSTHROUGH, INVERTED OR FLOATED mode. In other words, the four branches act as drivers for the PBUS 505, actively pulling it either to a HIGH, LOW or FLOATED state. This is accomplished by four branch circuits, namely two pull-up and two pull-down circuits for the PBUS 505. A first pull-up circuit comprises p- transistors 531 and 532 in series to Vdd, and is able to pull up the PBUS when MTCH is at “0”. A second pull-up circuit comprises p- transistors 533 and 534 in series to ground and is able to pull up the PBUS when MTCH is at “1”. Similarly, a first pull-down circuit comprises n- transistors 535 and 536 in series to Vdd, and is able to pull down the PBUS when MTCH is at “0”. A second pull-up circuit comprises n- transistors 537 and 538 in series to ground and is able to pull up the PBUS when MTCH is at “1”.
  • One feature of the invention is to constitute the pull-up circuits with PMOS transistors and the pull-down circuits with NMOS transistors. Since the pull by the NMOS is much stronger than that of the PMOS, the pull-down will always overcome the pull-up in any contentions. In other words, the node or bus can always default to a pull-up or “1” state, and if desired, can always be flipped to a “0” state by a pull-down.
  • FIG. 12B illustrates the truth table of the output logic of FIG. 12A. The logic is controlled by MTCH, MTCH* latched from the input logic and the control signals PDIR, PINV, NDIR, NINV, which are part of the control signals from the stack bus controller 410. Four operation modes, PASSTHROUGH, INVERTED, FLOATED, and PRECHARGE are supported.
  • In the FLOATED mode, all four branches are disabled. This is accomplished by having the signals PINV=1, NINV=0, PDIR=1, NDIR=0, which are also the default values. In the PASSTHROUGH mode, when MTCH=0, it will require PBUS=0. This is accomplished by only enabling the pull-down branch with n- transistors 535 and 536, with all control signals at their default values except for NDIR=1. When MTCH=1, it will require PBUS=1. This is accomplished by only enabling the pull-up branch with p- transistors 533 and 534, with all control signals at their default values except for PINV=0. In the INVERTED mode, when MTCH=0, it will require PBUS=1. This is accomplished by only enabling the pull-up branch with p- transistors 531 and 532, with all control signals at their default values except for PDIR=0. When MTCH=1, it will require PBUS=0. This is accomplished by only enabling the pull-down branch with n- transistors 537 and 538, with all control signals at their default values except for NINV=1. In the PRECHARGE mode, the control signals settings of PDIR=0 and PINV=0 will either enable the pull-up branch with p- transistors 531 and 531 when MTCH=1 or the pull-up branch with p- transistors 533 and 534 when MTCH=0.
  • Common processor operations are developed more fully in U.S. patent application Ser. No. 11/026,536, Dec. 29, 2004, which is hereby incorporated in its entirety by this reference.
  • Use of Data Latches in Cache Operations
  • A number of aspects of the present invention make use of the data latches of the read/write stacks described above in FIG. 10 for cache operations that will data in and out while the internal memory is doing other operations such as read, write, or erase. In the above-described architectures, data latches are shared by a number of physical pages. For example, as on the read/write stacks of the bit lines, shared by all of the word lines, so while one operation is going on, if any of these latches are free, they can cache data for future operations in the same or another word line, saving transfer time as this can be hidden behind another operation. This can improve performance by increasing the amount of pipelining of different operations or phases of operations. In one example, in a cache program operation, while programming one page of data another page of data can be loaded in, saving on transfer time. For another example, in one exemplary embodiment, a read operation on one word line is inserted into a write operation on another word line, allowing the data from the read to be transferred out of the memory while the data write continues on.
  • Note that this allows data from another page in the same block, but on a different word line, to be toggled out (to, for example, do an ECC operation) while the write or other operation is going on for the first page of data. This inter-phase pipelining of operations allows the time needed for the data transfer to be hidden behind the operation on the first page of data. More generally, this allows a portion of one operation to be inserted between phases of another, typically longer, operation. Another example would be to insert a sensing operation between phases of, say, an erase operation, such as before an erase pulse or before a soft programming phase used as the later part of the erase.
  • To make the relative times needed for some of the operations discussed, a set of exemplary time values for the system described above can be take as:
      • Data write: ˜700 μs (lower page˜600 μs, upper page 800 μs)
      • Binary data write: ˜200 μs
      • Erase: ˜2,500 μs
      • Read: ˜20-40 μs
      • Read and toggle out data: 2 KB data, ˜80 μs; 4 KB ˜160 μs; 8 KB ˜320 μs
        These values can be used for reference to give an idea of the relative times involved for the timing diagrams below. If have a long operation with different phases, a primary aspect will interpose in a quicker operation using the shared latches of the read/write stacks if latches available. For example, a read can be inserted into a program or erase operation, or a binary program can be inserted into an erase. The primary exemplary embodiments will toggle data in and/or out for one page during a program operation for another page that shares the same read write stacks, where, for example, a read of the data to be toggled out and modified is inserted into the verify phase of the data write.
  • The availability of open data latches can arise in a number of ways. Generally, for a memory storing n bits per cell, n such data latches will be needed for each bit line; however, not all of these latches are needed at all times. For example, in a two-bit per cell memory storing data in an upper page/lower page format, two data latches will be needed while programming the lower page. More generally, for memories storing multiple pages, all of the latches will be needed only when programming the highest page. This leaves the other latches available for cache operations. Further, even while writing the highest page, as the various states are removed from the verify phase of the write operation, latches will free up. Specifically, once only the highest state remains to be verified, only a single latch is needed for verification purposes and the others may be used for cache operations.
  • The following discussion will be based on a four state memory storing two-bits per cell and having two latches for data on each bit line and one additional latch for quick pass write, as described in U.S. patent application entitled “Use of Data Latches in Multi-Phase Programming of Non-Volatile Memories” filed concurrently with the present application that was incorporated above. The operations of writing the lower page, or erasing, or doing a post erase soft program are basically a binary operation and have one of the data latches free, which can use it to cache data. Similarly, where doing an upper page or fall sequence write, once all but the highest level has verified, only a single state needs to verify and the memory can free up a latch that can be used to cache data. An example of how this can be used is that when programming one page, such as in a copy operation, a read of another page that shares the same set of data latches, such as another word line on the same set of bit lines, can be slipped in during the verify phase of the write. The address can then be switched to the page being written, allowing the write process to pick up where it left off without having to restart. While the write continues, the data cached during the interpolated read can be toggled out, checked or modified and transferred back to be present for writing back in once the earlier write operation completes. This sort cache operation allows the toggling out and modification of the second page of data to be hidden behind the programming of the first page.
  • As a first example, a cache program operation for a two-bit memory operating in single page (lower page/upper page format) program mode. FIG. 13 is a simplified version of FIG. 10 that shows some specific elements that are relevant to the present discussion in a two-bit embodiment, the other elements being suppressed to simplify the discussion. These include data latch DL0 434-0, which is connected Data I/O line 231, data latch DL1 434-1, connected to common processor 500 by line 423, data latch DL2 434-2, commonly connected with the other data latches by line 435, and sense amp data latch DLS 214, which is connected to common processor 500 by line 422. The various elements of FIG. 13 are labeled according to their disposition during the programming of the lower page. The latch DL2 434-2 is used for the lower verify (VL) in quick pass write mode, as is described in U.S. patent application entitled “Use of Data Latches in Multi-Phase Programming of Non-Volatile Memories” filed concurrently with the present application; the inclusion of the register, and of using quick pass write when it is included, are optional, but the exemplary embodiment will include this register.
  • The programming of the lower page can include the following steps:
  • (1) The process begins by resetting data latches DL0 434-0 the default value “1”. This convention is used to simplify partial page programming as cells in a selected row that are not to be programmed will be program inhibited.
  • (2) Program data is supplied to DL0 434-0 along I/O line 231.
  • (3) The program data will be transferred to DL1 434-1 and DL2 434-2 (if this latch is included and quick pass write is implemented).
  • (4) Once the program data is transferred to DL 1 434-1, data latch DL0 434-0 can be reset to “1” and, during program time, the next data page can be loaded to DL0 434-0 along I/O line 231, allowing the caching of a second page while a first page is being written.
  • (5) Once the first page is loaded into DL1 434-1, programming can begin. DL1 434-1 data is used for lockout of the cell from further programming. DL2 434-2 data is used for the lower verify lockout that governs the transition to the second phase of quick pass write, as described in U.S. patent application entitled “Use of Data Latches in Multi-Phase Programming of Non-Volatile Memories” filed concurrently with the present application.
  • (6) Once programming begins, after a programming pulse, the result of the lower verify is used to update DL2 434-2; the result of the higher verify is used to update DL1 434-1. (This discussion is based on the “conventional” coding, where the lower page programming is to the A state. This, and other codings are discussed further in U.S. patent applications entitled “Use of Data Latches in Multi-Phase Programming of Non-Volatile Memories” filed concurrently with the present application and entitled “Non-Volatile Memory and Method with Power-Saving Read and Program-Verify Operations”, filed Mar. 16, 2005. The extension of the present discussion to other codings follows readily.)
  • (7) In determining of whether programming is complete, only the DL1 434-1 registers of the cells of row (or appropriate physical unit of program) are checked.
  • Once the lower page is written, the upper page can be programmed. FIG. 14 shows the same elements as FIG. 13, but indicates the latch assignment for upper page program where the lower page data is read in. (The description again uses conventional coding, so that the programming of the upper page is to the B and C states.) The programming of the upper page can include the following steps:
  • (1) Once the lower page finishes programming, the upper page (or next page) write will begin with a signal from the state machine controller where the (unexecuted) cache program commands are kept.
  • (2) The program data will be transferred from DL0 434-0 (where it was loaded into in step (4) during lower page write) to DL1 434-1 and DL2 434-2.
  • (3) The lower page data will be read in from the array and placed into DL0 434-0.
  • (4) DL1 434-1 and DL2 434-2 are again respectively used for the verify high and verify low lockout data. Latch DL0 434-0 (holding the lower page data) is checked as program reference data, but is not updated with the verify results.
  • (5) As part of verifying the B state, after sensing at the lower verify VBL, the data will be updated in DL2 434-2 accordingly, with DL1 434-1 data being updated with the high verify VBH results. Similarly, the C verify will have corresponding commands to update latches DL2 434-2 and DL1 434-1 with the respective VCL and VCH results.
  • (6) Once the B data is completed, then the lower page data (held in DL0 434-0 for reference) is not needed as only the verify for the C state needs to be performed. DL0 434-0 is reset to “1” and another page of program data can be loaded in from I/O line 231 and cached in latch DL0 434-0. The common processor 500 can set an indication that that only the C state is to be verified.
  • (7) In determining of whether upper page programming is completed, for the B state, both of latches DL1 434-1 and DL0 434-0 are checked. Once the cells being programmed to the B state and only the C state is being verified, only the latch DL1 434-1 data needs to be checked to see if there are any bits not programmed.
  • Note that under this arrangement, in step 6, the latch DL0 434-0 is no longer required and can be used to cache data for the next programming operation. Additionally, in embodiments using quick pass write, once the second, slowly programming phase is entered, the latch DL2 434-2 could also be made available for caching data, although, in practice, it is often the case that this is only available in this way for a fairly short time period that does not justify the additional overhead that is often required to implement this feature.
  • FIG. 15 can be used to illustrate many of the aspects of cache program in the single page mode that has been described in the last few paragraphs. FIG. 15 shows the relative timing of what events are occurring internally to the memory (the lower “True Busy” line) and as seen from external to the memory (the upper “Cache Busy” line).
  • At time t0 the lower page to be programmed onto the selected word line (WLn) is loaded into the memory. This assumes the first lower page of data has not been previously cached, as it will be for the subsequent pages. At time t1 the lower page is finished loading and the memory begins to write it. Since this is equivalent to a binary operation at this point, only the state A needs to be verified (“pvfyA”) and the data latch DL0 434-0 is available to receive the next page of data, here taken as the upper pages to be programmed into WLn, at time t2, which is consequently cached in latch DL0 434-0 during the programming of the lower page. The upper page finishes loading at time t3 and can be programmed as soon as the lower page finishes at t4. Under this arrangement, although all of the data (lower and upper page) to be written into physical unit of programming (here, word line WLn), the memory must wait from time t3 to time t4 before the upper page data can be written, unlike the full sequence embodiment described below.
  • The programming of the upper page begins at time t4, where initially only the B state is verified (“pvfyB”), the C state being added at t5 (“pvfyB/C”). Once the B state is no longer being verified at t6, only the C state needs to be verified (“pvfyC”) and the latch DL0 434-0 is freed up. This allows the next data set to be cached while the upper page finishes programming.
  • As noted, according to the single page algorithm with cache program, as shown in FIG. 15, even though the upper page data may be available at time t3, the memory will wait until time t4 before starting to write this data. In a conversion to a full sequence program operation, such as is developed more fully in U.S. patent application Ser. No. 11/013,125, once the upper page is available the upper and lower page data can be programmed concurrently.
  • The algorithm for cache program in full sequence (low to full conversion) write begins with lower page program as above. Consequently, steps (1)-(4) are as for the lower page process in single page program mode:
  • (1) The process begins by resetting data latches DL0 434-0 the default value “1”. This convention is used to simplify partial page programming as cells in a selected row that are not to be programmed will be program inhibited.
  • (2) Program data is supplied to DL0 434-0 along I/O line 231.
  • (3) The program data will be transferred to DL1 434-1 and DL2 434-2 (if this latch is included and quick pass write is implemented).
  • (4) Once the program data is transferred to DL 1 434-1, data latch DL0 434-0 can be reset to “1” and, during program time, the next data page can be loaded to DL0 434-0 along I/O line 231, allowing the caching of a second page while a first page is being written.
  • Once the second page of data is loaded, if correspond to the upper of the lower page being written and the lower page is not yet finished programming, the conversion to full sequence write can be implemented. This discussion focuses on the use of the data latches in such an algorithm, with many of the other details being developed more full in co-pending, commonly assigned U.S. patent application Ser. No. 11/013,125.
  • (5) After the upper page data is loaded into latch DL0 434-0, a judgment will be done in the address block to check if the 2 pages are on the same word line and the same block, with one page is the lower page and one is upper page. If so, then the program state machine will trigger a lower page program to full sequence program conversion if this is allowed. After any pending verify is complete, the transition is then effected.
  • (6) Some operation parameters will be typically be changed when the program sequence changed from lower page to full sequence. In the exemplary embodiment these include:
      • (i) Maximum program loop for the number of pulse verify cycles will be changed from that of the lower page algorithm to that of the full sequence if the lower page data has not been locked out, but the number of program loops completed will not be reset by the conversion.
      • (ii) As shown in FIG. 16, the programming waveform starts with the value VPGM_L used in the lower page programming process. If the programming waveform has progressed to where it exceeds the beginning value VPGM_U used in the upper page process, at conversion to fall sequence, the staircase will drop back down to VPGM_U prior to continuing up the staircase.
      • (iii) The parameters determining the step size and maximum value of the program pulse are not changed.
  • (7) A full sequence read of the current state of the memory cells should be performed to guarantee the right data will be programmed for multi-level coding. This ensures that states that may have formerly locked out in the lower page programming, but which require further programming to take account of their upper page data, are not program inhibited when the full sequence begins.
  • (8) If quick pass write is activated, the data of latch DL2 434-2 will be updated as well to reflect the upper page program data, since this was formerly based on the lower verify for only the A state.
  • (9) The programming then resumes with the multi-level, full sequence program algorithm. If the program waveform in the lower page process has increased beyond the upper page starting level, the waveform is stepped back to this level at conversion time, as shown in FIG. 16.
  • FIG. 17 is a schematic representation of the relative times involved in the lower page to full sequence conversion write process. Up until time t3, the process is as described above for the process in FIG. 15. At t3 the upper page of data has been loaded and the transition is made to the full sequence algorithm the verification process is switched to include the B states with the A states. Once all of the A states lock out, the verify process switches to checking for the B and C states at time t4. Once the B states have verified at t5, only the C state needs to be checked and a register can be freed up to load the next data to be programmed, such as the lower page on the next word line (WLn+1) as indicated on the Cache Busy line. At time t6 this next data set has been cached and one the programming of the C data for the previous set concludes at t7, this next data set begins programming. Additionally, while the (here) lower page on word line WLn+1 is programming, the next data (such as the corresponding upper page data) can be loaded into the open latch DL0 434-0.
  • During the full sequence write, a status report is implemented in a way that gives lower page and upper page status independently. At the end of the program sequence, if there are unfinished bits, a scan of physical page can be performed. A first scan can check latch DL0 434-0 for unfinished upper page data, a second scan can check DL1 434-1 for unfinished lower page data. Since, the verification of the B state will change both DL0 434-0 and DL1 434-1 data, an A state verification should be performed in the way that DL1 434-1 data “0” will be changed to “1” if the bit's threshold value is higher than the A verify level. This post verify will check on whether any under programmed B levels are passing at the A level; if they are passing at the A level, then the error is only on upper page and not on lower page; if they are not passing at the A level, then both lower and upper pages have error.
  • If the cache program algorithm is used, after the A and B data are programmed, the C state will be transferred to latch DL1 434-1 to finish programming. In this case, the scan of latch is not necessary for lower page, because the lower page will have already passed program without any failed bits.
  • Another set of exemplary embodiments of the present invention relate to page copy operations, where a data set is relocated from one location to another. Various aspects of data relocation operations are described in U.S. patent applications number U.S. Ser. No. 10/846,289, filed May 13, 2004; Ser. No. 11/022,462, Dec. 21, 2004; and number U.S. Ser. No. 10/915,039, filed Aug. 9, 2004; and U.S. Pat. No. 6,266,273, which are all hereby incorporated by reference, which are all hereby incorporated by reference. When data is copied from one location to another, the data is often toggled out to be checked (for error, for example), updated (such as updating a header), or both (such correcting detected error). Such transfers are also to consolidate date in garbage collection operations. A principal aspect of the present invention allows for a data read to an open register to be interpolated during the verify phase of a write operation, with this cached data then being transferred out of the memory device as the write operation continues, allowing the time for toggling the data out to hide behind the write operation.
  • The following presents two exemplary embodiments of a cache page copy operation. In both cases, an implementation that uses a quick pass write implementation is described. FIG. 18 indicates the disposition of the exemplary arrangement of latches as the process progresses.
  • The first version of cache page copy will write to a lower page and can include the following steps, where read addresses are labeled M, M+1, . . . , and write addresses are labeled N, N+1, . . . :
  • (1) The page to be copied (“page M”) is read into latch DL1 434-1. This can be either an upper or lower page of data
  • (2) Page M is then transferred into DL0 434-0.
  • (3) The data in DL0 434-0 is then toggle out and modified, after which it is transferred back into the latch.
  • (4) The program sequence can then begin. After data to be written into the lower page N is transferred to DL1 434-1 and DL2 434-2, the latch DL0 434-0 is ready for cache data. This lower page will be programmed. For this embodiment, the program state machine will stop here.
  • (5) The next page to be copied is then read into DL0 434-0. Programming can then resume. The state machine, stopped at the end of step (4), will restart the program sequence from the beginning.
  • (6) Programming continues until the lower page finishes.
  • The copy destination page address will determine whether a write is to a lower or an upper page. If the program address is an upper page address, then the programming sequence will not be stopped until the programming finishes and the read of step (5) will be executed after the write is complete.
  • In a second cache page copy method, the program/verify process can be paused to insert a read operation and then restart the write operation, picking up at the point where it left off. The data that was read during this interleaved sensing operation can then be toggled out while the resumed write operation continues on. Also, this second process allows for the page copy mechanism to be used in an upper page or full sequence write process once only the C state is being verified and one latch on each bit line opens up. The second cache page copy operation begins with the same first three steps as in the first case, but then differs. It can include the following steps:
  • (1) The page to be copied (“page M”) is read into latch DL1 434-1. This can be either a lower or upper page
  • (2) The data from page M is then transferred into DL0 434-0. (As before, N, etc. will denote a write address, M, etc., for a read address.)
  • (3) The data in DL0 434-0 is then toggled out, modified, and then transferred back to the latch.
  • (4) The state machine program will go to an infinite wait state until the command a read command is entered and then a read of another page, say the next page M+1, to latch DL0 434-0 will begin.
  • (5) Once the read of step (4) is complete, the address is switched back to word line and block address to program the data in steps (1-3) into page N (here, a lower page) and the programming is resumed.
  • (6) After the read of page M+1 is finished, the data can be toggled out, modified, and returned. Once the process is complete, the write can be converted to a full sequence operation if the two pages are the corresponding upper and lower pages on the same WL.
  • (7) Once the A and B levels are done in the full sequence write, the data in DL0 434-0 will be transferred to DL1 434-1, as in the normal cache program described earlier, and a read command for another page (e.g., page M+2) can be issued. If there is not a single page to full sequence conversion, the lower page will finish the writing and then the upper page will start. After the B level state is done completely, the same DL0 434-0 to DL1 434-1 data transfer will occur, and the state machine will go into state of waiting for the read command for page M+2.
  • (8) Once the read command arrives, the address is switched to the read address and the next page (page M+2) is read out.
  • (9) Once the read is complete, the address will be switched back to previous upper page address (program address N+1) until the write finishes.
  • As noted above, the exemplary embodiments include the latch DL2 434-2 used for the lower verify of the quick pass write technique in addition to the latches DL0 434-0 and DL1 434-1 used in holding the (here, 2 bits) of data that can be programmed into each of the memory cells. Once the lower verify is passed, the latch DL2 434-2 may also be freed up and used to cache data, although this is not done in the exemplary embodiments.
  • FIGS. 19A and 19B illustrate the relative timing of the second cache page copy method, where FIG. 19B illustrates the algorithm with the full sequence write conversion and FIG. 19A illustrates the algorithm without. (Both FIGS. 19A and 19B are composed of two parts, the first, upper part beginning at the broken vertical line A, corresponding to t0, and ending with the broken vertical line B, corresponding to t5; the second, lower part is a continuation of the upper portion and begins with the broken vertical line B, corresponding to t5. In both cases the line B at time t5 is same in the upper portion as in the lower portion, being just a seam in two parts allowing it to be displayed on two lines.)
  • FIG. 19A shows a process that starts with reading of a first page (page M) that is taken to be a lower page in this example, assumes no data has previously been cached, and operates in single page mode, waiting until the lower page has finished writing before beginning to write the upper page. The process starts at time to with a read of the page M (Sense page M (L)), which here is a lower that is sensed by a read at the A and C levels in this coding. At time at time t1 the read is complete and page M can be toggled out and checked or modified. Beginning at time t2 a next page (here page M+1, the upper page corresponding to the same physical as lower page M) is sensed by reading at the B level, a process that finishes at time t3. At this point, the first page (originating from Page M) (lower) is ready to be programmed back into the memory at page N and the data read from page M+1 is being held in a latch and can be transferred out to be modified/checked. Both of these processes can start at the same time, here t3. Using the typical time values described above, the data from page M+1 has been toggled out and modified by time t4; however, for the embodiment not implementing a full sequence conversion, the memory will wait until page N finishes at time t5 to begin writing the second read page of data (originating from Page M+1) into page N+1.
  • As page N+1 is an upper page, its write begins initially with a verification at the B level, the C level being added at t6. Once the storage elements having a target state B all lock out (or the maximum count is reached) at time t7, the B state verification is dropped. As described above, according to several principal aspects of the present invention, this allows a data latch to be freed up, an ongoing write operation is suspended, a reading operation (at a different address than the suspended program/verify operation) is interposed, the write then resumes where it left off, and the data sensed the interposed write operation can be toggled out while the resumed write operation runs on.
  • At time t7 the interposed write operation is performed for the, here, lower page M+2. This sensing is finished at time t8 and the write of page N+1 picks back up and the data from page M+2 is concurrently toggled out and modified. In this example, page N+1 finishes programming at time t9 before page M+2 is finished at time t10. At time t10 a write of the data originating from page M+2 could begin; however, in this embodiment, instead a read of page M+3 is first executed, allowing for this page's data to be toggled out and the modification to be hidden behind the writing of the data originating from page M+2 into page N+2, beginning at time t1. The process then continues on as in the earlier parts of the diagram, but with the page numbers shifted, with time t11 corresponding to time t3, time t12 corresponding to time t4, and so on until the copy process is stopped.
  • FIG. 19B again shows a process that starts with reading of a lower page, page M that is taken to be a lower page, and assumes no data has previously been cached. FIG. 19B differs from FIG. 19A by implementing a conversion to full sequence write at time t4. This roughly speeds up the process by the time (t5-t4) of FIG. 19A. At time t4 (=t5 in FIG. 19A), the various changes related to the full sequence conversion are implemented as described previously. Otherwise, the process is similar to that of FIG. 19A, including those aspects of the present invention found between times t7 and t12.
  • In both the page copy processes and the other techniques described here that involve writing data, which states are verified at a given time can be selected intelligently, along the lines describe in U.S. patent application Ser. No. 10/314,055, filed Dec. 5, 2002, which is hereby incorporated by reference. For example, in the full sequence write, the write process can begin verifying only the A level. After ever A verify, it is checked to see whether any bits have passed. If so, the B level can be added to the verify phase. The A level verify will be removed after all storage units with it as their target values verify (or except a maximum count based on a settable parameter). Similarly, after the verifications at the B level, a verify of the C level can be added, with the B level verify being removed after all storage units with it as their target values verify (or except a maximum count based on a settable parameter).
  • Although the various aspects of the present invention have been described with respect to certain embodiments, it is understood that the invention is entitled to protection within the full scope of the appended claims.

Claims (12)

1. A method of operating a non-volatile memory device which includes an array of memory cells and a set of read/write circuits for operating on a group of memory cells of said array in parallel, each read/write circuits having a set of data latches for latching input and/or output data of a corresponding one of said group of memory cells, the method comprising:
performing a first operation on a first group of memory cells using a first data set stored in a first plurality of the sets of data latches; and
during said first operation, caching a second data set for a second operation in said first plurality of the sets of data latches.
2. The method of claim 1, wherein said second data set is supplied from external to the memory device.
3. The method of claim 1, wherein the first operation includes multiple phases and said second data set is read from a second group of memory cells distinct from the first group of memory cells, the second data set being read between phases of the first operation.
4. The method of claim 3, wherein the first operation is a write operation having alternating program and verify phases and the first set of data is the data to be written into the first group of memory cells.
5. The method of claim 4, wherein the cached data set is subsequently transferred out of said first plurality of the sets of data latches during the write operation.
6. The method of claim 4, wherein the alternating program and verify phases resume where write process was paused while the second data set was read.
7. The method of claim 4, wherein said memory cells are multi-level memory cells storing N bits of data, where N is greater than one, and wherein each of said sets of data latches includes N data latches and said first data set is N bit data.
8. The method of claim 3, wherein the first and second data sets correspond to distinct first and second word lines of the memory.
9. The method of claim 1, wherein each of said sets of latches is associated with a distinct bit line of the memory.
10. A method of operating a non-volatile memory device which includes an array of memory cells and a set of read/write circuits for operating on a group of memory cells of said array in parallel, each read/write circuits having a set of data latches for latching input and/or output data of a corresponding one of said group of memory cells, the method comprising:
storing a first set of data for a first group of the memory cells into the corresponding sets of data latches;
writing the first set of data into said first group of memory cells, wherein the writing includes alternating program and verify phases;
pausing said writing between one of the program phases and one of the verify phases;
subsequent to said pausing, reading a second set of data from a second group of the memory cells into latches of said corresponding sets of data latches; and
subsequent to said reading, resuming the paused writing.
11. The method of claim 10, wherein the writing is managed by a state machine, said pausing is in response to receiving a command for said reading, and the resuming is in response to completing the reading.
12. The method of claim 10, further comprising:
subsequent to said reading, transferred the second set of data out of the memory during the resumed writing.
US11/619,513 2005-04-01 2007-01-03 Use of data latches in cache operations of non-volatile memories Active 2025-07-20 US7577037B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US11/619,513 US7577037B2 (en) 2005-04-01 2007-01-03 Use of data latches in cache operations of non-volatile memories
US12/495,200 US7936602B2 (en) 2005-04-01 2009-06-30 Use of data latches in cache operations of non-volatile memories

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US11/097,590 US7206230B2 (en) 2005-04-01 2005-04-01 Use of data latches in cache operations of non-volatile memories
US11/619,513 US7577037B2 (en) 2005-04-01 2007-01-03 Use of data latches in cache operations of non-volatile memories

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US11/097,590 Continuation US7206230B2 (en) 2005-04-01 2005-04-01 Use of data latches in cache operations of non-volatile memories

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/495,200 Continuation US7936602B2 (en) 2005-04-01 2009-06-30 Use of data latches in cache operations of non-volatile memories

Publications (2)

Publication Number Publication Date
US20070109867A1 true US20070109867A1 (en) 2007-05-17
US7577037B2 US7577037B2 (en) 2009-08-18

Family

ID=36636435

Family Applications (13)

Application Number Title Priority Date Filing Date
US11/097,590 Active 2025-04-07 US7206230B2 (en) 2005-04-01 2005-04-01 Use of data latches in cache operations of non-volatile memories
US11/382,000 Active 2025-09-05 US7486558B2 (en) 2005-04-01 2006-05-05 Non-volatile memory with managed execution of cached data
US11/381,998 Active 2025-06-27 US7609552B2 (en) 2005-04-01 2006-05-05 Non-volatile memory with background data latch caching during erase operations
US11/382,006 Active 2025-09-12 US7505320B2 (en) 2005-04-01 2006-05-05 Non-volatile memory with background data latch caching during program operations
US11/381,997 Active 2025-11-03 US7480181B2 (en) 2005-04-01 2006-05-05 Non-volatile memory with background data latch caching during read operations
US11/381,995 Active 2025-09-12 US7502260B2 (en) 2005-04-01 2006-05-05 Method for non-volatile memory with background data latch caching during program operations
US11/382,001 Active 2025-06-23 US7619922B2 (en) 2005-04-01 2006-05-05 Method for non-volatile memory with background data latch caching during erase operations
US11/619,513 Active 2025-07-20 US7577037B2 (en) 2005-04-01 2007-01-03 Use of data latches in cache operations of non-volatile memories
US12/263,658 Active 2025-04-03 US7733703B2 (en) 2005-04-01 2008-11-03 Method for non-volatile memory with background data latch caching during read operations
US12/495,200 Expired - Fee Related US7936602B2 (en) 2005-04-01 2009-06-30 Use of data latches in cache operations of non-volatile memories
US12/782,503 Active US8036041B2 (en) 2005-04-01 2010-05-18 Method for non-volatile memory with background data latch caching during read operations
US13/267,689 Active US8351269B2 (en) 2005-04-01 2011-10-06 Method for non-volatile memory with background data latch caching during read operations
US13/735,878 Active US8705286B2 (en) 2005-04-01 2013-01-07 Method for non-volatile memory with background data latch caching during read operations

Family Applications Before (7)

Application Number Title Priority Date Filing Date
US11/097,590 Active 2025-04-07 US7206230B2 (en) 2005-04-01 2005-04-01 Use of data latches in cache operations of non-volatile memories
US11/382,000 Active 2025-09-05 US7486558B2 (en) 2005-04-01 2006-05-05 Non-volatile memory with managed execution of cached data
US11/381,998 Active 2025-06-27 US7609552B2 (en) 2005-04-01 2006-05-05 Non-volatile memory with background data latch caching during erase operations
US11/382,006 Active 2025-09-12 US7505320B2 (en) 2005-04-01 2006-05-05 Non-volatile memory with background data latch caching during program operations
US11/381,997 Active 2025-11-03 US7480181B2 (en) 2005-04-01 2006-05-05 Non-volatile memory with background data latch caching during read operations
US11/381,995 Active 2025-09-12 US7502260B2 (en) 2005-04-01 2006-05-05 Method for non-volatile memory with background data latch caching during program operations
US11/382,001 Active 2025-06-23 US7619922B2 (en) 2005-04-01 2006-05-05 Method for non-volatile memory with background data latch caching during erase operations

Family Applications After (5)

Application Number Title Priority Date Filing Date
US12/263,658 Active 2025-04-03 US7733703B2 (en) 2005-04-01 2008-11-03 Method for non-volatile memory with background data latch caching during read operations
US12/495,200 Expired - Fee Related US7936602B2 (en) 2005-04-01 2009-06-30 Use of data latches in cache operations of non-volatile memories
US12/782,503 Active US8036041B2 (en) 2005-04-01 2010-05-18 Method for non-volatile memory with background data latch caching during read operations
US13/267,689 Active US8351269B2 (en) 2005-04-01 2011-10-06 Method for non-volatile memory with background data latch caching during read operations
US13/735,878 Active US8705286B2 (en) 2005-04-01 2013-01-07 Method for non-volatile memory with background data latch caching during read operations

Country Status (9)

Country Link
US (13) US7206230B2 (en)
EP (1) EP1864289B1 (en)
JP (1) JP5038292B2 (en)
KR (1) KR101106977B1 (en)
CN (1) CN101171641B (en)
AT (1) ATE458248T1 (en)
DE (1) DE602006012293D1 (en)
TW (1) TWI396199B (en)
WO (1) WO2006107654A1 (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060221696A1 (en) * 2005-04-01 2006-10-05 Yan Li Method for Non-Volatile Memory with Background Data Latch Caching During Read Operations
US20060233026A1 (en) * 2005-04-01 2006-10-19 Yan Li Method for Non-Volatile Memory with Background Data Latch Caching During Program Operations
US20060239080A1 (en) * 2005-04-01 2006-10-26 Yan Li Method for Non-Volatile Memory with Managed Execution of Cached Data
US20070097744A1 (en) * 2005-04-01 2007-05-03 Yan Li Use of Data Latches in Multi-Phase Programming of Non-Volatile Memories
US20080219057A1 (en) * 2007-03-07 2008-09-11 Yan Li Non-Volatile Memory With Cache Page Copy
US20080219059A1 (en) * 2007-03-07 2008-09-11 Yan Li Method for Cache Page Copy in a Non-Volatile Memory
US20090237998A1 (en) * 2008-03-19 2009-09-24 Yan Li Adaptive Algorithm in Cache Operation with Dynamic Data Latch Requirements
US7986554B2 (en) 2008-03-19 2011-07-26 Sandisk Technologies Inc. Different combinations of wordline order and look-ahead read to improve non-volatile memory performance
US20110208905A1 (en) * 2008-12-09 2011-08-25 Rambus Inc. Non-Volatile Memory Device For Concurrent And Pipelined Memory Operations
US8472280B2 (en) 2010-12-21 2013-06-25 Sandisk Technologies Inc. Alternate page by page programming scheme

Families Citing this family (278)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5657332A (en) 1992-05-20 1997-08-12 Sandisk Corporation Soft errors handling in EEPROM devices
US7012835B2 (en) 2003-10-03 2006-03-14 Sandisk Corporation Flash memory data correction and scrub techniques
US7490283B2 (en) 2004-05-13 2009-02-10 Sandisk Corporation Pipelined data relocation and improved chip architectures
KR101051703B1 (en) 2004-08-09 2011-07-25 삼성전자주식회사 Integrated circuit card and integrated circuit card system with suspend / reset function
US7849381B2 (en) 2004-12-21 2010-12-07 Sandisk Corporation Method for copying data in reprogrammable non-volatile memory
US7251160B2 (en) * 2005-03-16 2007-07-31 Sandisk Corporation Non-volatile memory and method with power-saving read and program-verify operations
US7564713B2 (en) * 2005-04-28 2009-07-21 Kabushiki Kaisha Toshiba Semiconductor integrated circuit device wherein during data write a potential transferred to each bit line is changed in accordance with program order of program data
EP1750278B1 (en) * 2005-07-28 2009-11-11 STMicroelectronics S.r.l. Method of programming a four-level flash memory device and a related page buffer
JP5162846B2 (en) * 2005-07-29 2013-03-13 ソニー株式会社 Storage device, computer system, and storage system
US20100302919A1 (en) * 2005-10-27 2010-12-02 Mediatek Inc. Optical Recording Method and Apparatus
EP1850347A1 (en) * 2006-04-28 2007-10-31 Deutsche Thomson-Brandt Gmbh Method and device for writing to a flash memory
US7917685B2 (en) 2006-05-04 2011-03-29 Micron Technology, Inc. Method for reading a multilevel cell in a non-volatile memory device
WO2007131059A2 (en) * 2006-05-05 2007-11-15 Sandisk Corporation Non-volatile memory with background data latch caching during erase operations and methods therefor
WO2007130976A2 (en) * 2006-05-05 2007-11-15 Sandisk Corporation Non-volatile memory with background data latch caching during program operations and methods therefor
US7355892B2 (en) * 2006-06-30 2008-04-08 Sandisk Corporation Partial page fail bit detection in flash memory devices
US7734861B2 (en) 2006-09-08 2010-06-08 Sandisk Corporation Pseudo random and command driven bit compensation for the cycling effects in flash memory
US7885112B2 (en) 2007-09-07 2011-02-08 Sandisk Corporation Nonvolatile memory and method for on-chip pseudo-randomization of data within a page and between pages
US7606966B2 (en) * 2006-09-08 2009-10-20 Sandisk Corporation Methods in a pseudo random and command driven bit compensation for the cycling effects in flash memory
US7716538B2 (en) * 2006-09-27 2010-05-11 Sandisk Corporation Memory with cell population distribution assisted read margining
US7886204B2 (en) 2006-09-27 2011-02-08 Sandisk Corporation Methods of cell population distribution assisted read margining
US7809900B2 (en) * 2006-11-24 2010-10-05 Sandforce, Inc. System, method, and computer program product for delaying an operation that reduces a lifetime of memory
US7747813B2 (en) * 2006-11-24 2010-06-29 Sandforce, Inc. Multi-memory device system and method for managing a lifetime thereof
US7904619B2 (en) 2006-11-24 2011-03-08 Sandforce, Inc. System, method, and computer program product for reducing memory write operations using difference information
US7904672B2 (en) 2006-12-08 2011-03-08 Sandforce, Inc. System and method for providing data redundancy after reducing memory writes
US7616505B2 (en) * 2006-12-28 2009-11-10 Sandisk Corporation Complete word line look ahead with efficient data latch assignment in non-volatile memory read operations
US7616506B2 (en) * 2006-12-28 2009-11-10 Sandisk Corporation Systems for complete word line look ahead with efficient data latch assignment in non-volatile memory read operations
KR100813631B1 (en) * 2007-03-19 2008-03-14 삼성전자주식회사 Flash memory device capable of improving read performance
US7573773B2 (en) * 2007-03-28 2009-08-11 Sandisk Corporation Flash memory with data refresh triggered by controlled scrub data reads
US7477547B2 (en) 2007-03-28 2009-01-13 Sandisk Corporation Flash memory refresh techniques triggered by controlled scrub data reads
US7606071B2 (en) * 2007-04-24 2009-10-20 Sandisk Corporation Compensating source voltage drop in non-volatile storage
US7606072B2 (en) * 2007-04-24 2009-10-20 Sandisk Corporation Non-volatile storage with compensation for source voltage drop
KR100927119B1 (en) * 2007-05-10 2009-11-18 삼성전자주식회사 Nonvolatile Semiconductor Memory Device And Its Programming Method
JP2008310841A (en) * 2007-06-12 2008-12-25 Panasonic Corp Semiconductor memory device and electronic device
WO2009095902A2 (en) 2008-01-31 2009-08-06 Densbits Technologies Ltd. Systems and methods for handling immediate data errors in flash memory
US8694715B2 (en) 2007-10-22 2014-04-08 Densbits Technologies Ltd. Methods for adaptively programming flash memory devices and flash memory systems incorporating same
US7903486B2 (en) 2007-11-19 2011-03-08 Sandforce, Inc. System, method, and computer program product for increasing a lifetime of a plurality of blocks of memory
US7849275B2 (en) 2007-11-19 2010-12-07 Sandforce, Inc. System, method and a computer program product for writing data to different storage devices based on write frequency
US8453022B2 (en) 2007-12-05 2013-05-28 Densbits Technologies Ltd. Apparatus and methods for generating row-specific reading thresholds in flash memory
US8359516B2 (en) 2007-12-12 2013-01-22 Densbits Technologies Ltd. Systems and methods for error correction and decoding on multi-level physical media
US8307180B2 (en) 2008-02-28 2012-11-06 Nokia Corporation Extended utilization area for a memory device
US8972472B2 (en) 2008-03-25 2015-03-03 Densbits Technologies Ltd. Apparatus and methods for hardware-efficient unbiased rounding
WO2009140112A1 (en) * 2008-05-13 2009-11-19 Rambus Inc. Fractional program commands for memory devices
US8130576B2 (en) * 2008-06-30 2012-03-06 Intel Corporation Memory throughput increase via fine granularity of precharge management
US7729166B2 (en) * 2008-07-02 2010-06-01 Mosaid Technologies Incorporated Multiple-bit per cell (MBC) non-volatile memory apparatus and system having polarity control and method of programming same
KR101395152B1 (en) * 2008-07-18 2014-05-15 삼성전자주식회사 Non-Volatile memory cell, non-volatile memory device and method of programming the same
US7852671B2 (en) * 2008-10-30 2010-12-14 Micron Technology, Inc. Data path for multi-level cell memory, methods for storing and methods for utilizing a memory array
US8458574B2 (en) 2009-04-06 2013-06-04 Densbits Technologies Ltd. Compact chien-search based decoding apparatus and method
US8819385B2 (en) 2009-04-06 2014-08-26 Densbits Technologies Ltd. Device and method for managing a flash memory
US8832353B2 (en) * 2009-04-07 2014-09-09 Sandisk Technologies Inc. Host stop-transmission handling
JP5532671B2 (en) * 2009-05-08 2014-06-25 ソニー株式会社 Data storage system and data storage method, execution device and control method, and control device and control method
US8874824B2 (en) 2009-06-04 2014-10-28 Memory Technologies, LLC Apparatus and method to share host system RAM with mass storage memory RAM
US8102705B2 (en) 2009-06-05 2012-01-24 Sandisk Technologies Inc. Structure and method for shuffling data within non-volatile memory devices
US8027195B2 (en) * 2009-06-05 2011-09-27 SanDisk Technologies, Inc. Folding data stored in binary format into multi-state format within non-volatile memory devices
US8132045B2 (en) * 2009-06-16 2012-03-06 SanDisk Technologies, Inc. Program failure handling in nonvolatile memory
US8307241B2 (en) * 2009-06-16 2012-11-06 Sandisk Technologies Inc. Data recovery in multi-level cell nonvolatile memory
US20110002169A1 (en) 2009-07-06 2011-01-06 Yan Li Bad Column Management with Bit Information in Non-Volatile Memory Systems
US8180994B2 (en) 2009-07-08 2012-05-15 Sandisk Technologies Inc. Optimized page programming order for non-volatile memory
CN102473149B (en) 2009-07-20 2015-02-04 飞思卡尔半导体公司 Signal processing system, integrated circuit comprising buffer control logic and method therefor
US8516166B2 (en) * 2009-07-20 2013-08-20 Lsi Corporation System, method, and computer program product for reducing a rate of data transfer to at least a portion of memory
JP5316299B2 (en) * 2009-08-07 2013-10-16 富士通セミコンダクター株式会社 Semiconductor memory, system, and operation method of semiconductor memory
US9330767B1 (en) 2009-08-26 2016-05-03 Avago Technologies General Ip (Singapore) Pte. Ltd. Flash memory module and method for programming a page of flash memory cells
US8995197B1 (en) 2009-08-26 2015-03-31 Densbits Technologies Ltd. System and methods for dynamic erase and program control for flash memory device memories
US8730729B2 (en) 2009-10-15 2014-05-20 Densbits Technologies Ltd. Systems and methods for averaging error rates in non-volatile devices and storage systems
US8724387B2 (en) 2009-10-22 2014-05-13 Densbits Technologies Ltd. Method, system, and computer readable medium for reading and programming flash memory cells using multiple bias voltages
CN102612714B (en) 2009-11-13 2016-06-29 株式会社半导体能源研究所 Semiconductor device and driving method thereof
KR101636248B1 (en) * 2009-12-10 2016-07-06 삼성전자주식회사 Flash memory device, flash memory system, and method of programming the flash memory device
US8213243B2 (en) * 2009-12-15 2012-07-03 Sandisk 3D Llc Program cycle skip
JP2011129176A (en) * 2009-12-15 2011-06-30 Toshiba Corp Nonvolatile semiconductor memory device
US8144512B2 (en) 2009-12-18 2012-03-27 Sandisk Technologies Inc. Data transfer flows for on-chip folding
US8468294B2 (en) * 2009-12-18 2013-06-18 Sandisk Technologies Inc. Non-volatile memory with multi-gear control using on-chip folding of data
US8725935B2 (en) 2009-12-18 2014-05-13 Sandisk Technologies Inc. Balanced performance for on-chip folding of non-volatile memories
US9092340B2 (en) * 2009-12-18 2015-07-28 Sandisk Technologies Inc. Method and system for achieving die parallelism through block interleaving
US9037777B2 (en) 2009-12-22 2015-05-19 Densbits Technologies Ltd. Device, system, and method for reducing program/read disturb in flash arrays
US8248850B2 (en) * 2010-01-28 2012-08-21 Sandisk Technologies Inc. Data recovery for non-volatile memory based on count of data state-specific fails
US8107298B2 (en) * 2010-01-29 2012-01-31 Sandisk Technologies Inc. Non-volatile memory with fast binary programming and reduced power consumption
JP2011187141A (en) 2010-03-10 2011-09-22 Toshiba Corp Transfer circuit and nonvolatile semiconductor memory device using the same
US8745317B2 (en) 2010-04-07 2014-06-03 Densbits Technologies Ltd. System and method for storing information in a multi-level cell memory
US20110252185A1 (en) * 2010-04-08 2011-10-13 Silicon Storage Technology, Inc. Method Of Operating A NAND Memory Controller To Minimize Read Latency Time
US8416624B2 (en) 2010-05-21 2013-04-09 SanDisk Technologies, Inc. Erase and programming techniques to reduce the widening of state distributions in non-volatile memories
TW201212018A (en) * 2010-06-24 2012-03-16 Mediatek Inc Optical recording method and system
US8621321B2 (en) 2010-07-01 2013-12-31 Densbits Technologies Ltd. System and method for multi-dimensional encoding and decoding
US8305807B2 (en) 2010-07-09 2012-11-06 Sandisk Technologies Inc. Detection of broken word-lines in memory arrays
US8432732B2 (en) 2010-07-09 2013-04-30 Sandisk Technologies Inc. Detection of word-line leakage in memory arrays
US8514630B2 (en) 2010-07-09 2013-08-20 Sandisk Technologies Inc. Detection of word-line leakage in memory arrays: current based approach
US8310870B2 (en) * 2010-08-03 2012-11-13 Sandisk Technologies Inc. Natural threshold voltage distribution compaction in non-volatile memory
WO2012021379A2 (en) * 2010-08-10 2012-02-16 Rambus Inc. Verify before program resume for memory devices
US8964464B2 (en) 2010-08-24 2015-02-24 Densbits Technologies Ltd. System and method for accelerated sampling
US8675418B2 (en) * 2010-08-31 2014-03-18 Taiwan Semiconductor Manufacturing Company, Ltd. Memory write assist
US8595414B2 (en) * 2010-09-30 2013-11-26 Apple Inc. Selectively combining commands for a system having non-volatile memory
US9063878B2 (en) 2010-11-03 2015-06-23 Densbits Technologies Ltd. Method, system and computer readable medium for copy back
US8850100B2 (en) 2010-12-07 2014-09-30 Densbits Technologies Ltd. Interleaving codeword portions between multiple planes and/or dies of a flash memory device
KR20120066347A (en) * 2010-12-14 2012-06-22 삼성전자주식회사 Non-volatile memory device and method for operating the device
KR101212739B1 (en) 2010-12-21 2012-12-14 에스케이하이닉스 주식회사 Non-volatile memory device and cache program method of the same
US8819328B2 (en) 2010-12-30 2014-08-26 Sandisk Technologies Inc. Controller and method for performing background operations
KR101861739B1 (en) * 2011-01-03 2018-05-29 삼성전자주식회사 Output driver and apparatus having the same
KR20120091648A (en) * 2011-02-09 2012-08-20 삼성전자주식회사 Non-volatile memory, system having the same, and method of programming the same
US8631288B2 (en) 2011-03-14 2014-01-14 Micron Technology, Inc. Methods, devices, and systems for data sensing in a memory system
US8693258B2 (en) * 2011-03-17 2014-04-08 Densbits Technologies Ltd. Obtaining soft information using a hard interface
US9342446B2 (en) 2011-03-29 2016-05-17 SanDisk Technologies, Inc. Non-volatile memory system allowing reverse eviction of data updates to non-volatile binary cache
US8990665B1 (en) 2011-04-06 2015-03-24 Densbits Technologies Ltd. System, method and computer program product for joint search of a read threshold and soft decoding
US8379454B2 (en) 2011-05-05 2013-02-19 Sandisk Technologies Inc. Detection of broken word-lines in memory arrays
US9372792B1 (en) 2011-05-12 2016-06-21 Avago Technologies General Ip (Singapore) Pte. Ltd. Advanced management of a non-volatile memory
US9501392B1 (en) 2011-05-12 2016-11-22 Avago Technologies General Ip (Singapore) Pte. Ltd. Management of a non-volatile memory module
US9195592B1 (en) 2011-05-12 2015-11-24 Densbits Technologies Ltd. Advanced management of a non-volatile memory
US9396106B2 (en) 2011-05-12 2016-07-19 Avago Technologies General Ip (Singapore) Pte. Ltd. Advanced management of a non-volatile memory
US9110785B1 (en) 2011-05-12 2015-08-18 Densbits Technologies Ltd. Ordered merge of data sectors that belong to memory space portions
US8996790B1 (en) 2011-05-12 2015-03-31 Densbits Technologies Ltd. System and method for flash memory management
US8843693B2 (en) 2011-05-17 2014-09-23 SanDisk Technologies, Inc. Non-volatile memory and method with improved data scrambling
US8432740B2 (en) 2011-07-21 2013-04-30 Sandisk Technologies Inc. Program algorithm with staircase waveform decomposed into multiple passes
US8750042B2 (en) 2011-07-28 2014-06-10 Sandisk Technologies Inc. Combined simultaneous sensing of multiple wordlines in a post-write read (PWR) and detection of NAND failures
US20130031431A1 (en) * 2011-07-28 2013-01-31 Eran Sharon Post-Write Read in Non-Volatile Memories Using Comparison of Data as Written in Binary and Multi-State Formats
US8726104B2 (en) 2011-07-28 2014-05-13 Sandisk Technologies Inc. Non-volatile memory and method with accelerated post-write read using combined verification of multiple pages
US8775901B2 (en) 2011-07-28 2014-07-08 SanDisk Technologies, Inc. Data recovery for defective word lines during programming of non-volatile memory arrays
US8630118B2 (en) 2011-11-09 2014-01-14 Sandisk Technologies Inc. Defective word line detection
US8842476B2 (en) 2011-11-09 2014-09-23 Sandisk Technologies Inc. Erratic program detection for non-volatile storage
US8687421B2 (en) 2011-11-21 2014-04-01 Sandisk Technologies Inc. Scrub techniques for use with dynamic read
US9286205B2 (en) 2011-12-20 2016-03-15 Intel Corporation Apparatus and method for phase change memory drift management
US8488382B1 (en) * 2011-12-21 2013-07-16 Sandisk Technologies Inc. Erase inhibit for 3D non-volatile memory
US8996788B2 (en) 2012-02-09 2015-03-31 Densbits Technologies Ltd. Configurable flash interface
US8947941B2 (en) 2012-02-09 2015-02-03 Densbits Technologies Ltd. State responsive operations relating to flash memory cells
US8730722B2 (en) 2012-03-02 2014-05-20 Sandisk Technologies Inc. Saving of data in cases of word-line to word-line short in memory arrays
US8842473B2 (en) 2012-03-15 2014-09-23 Sandisk Technologies Inc. Techniques for accessing column selecting shift register with skipped entries in non-volatile memories
US8817569B2 (en) 2012-03-19 2014-08-26 Sandisk Technologies Inc. Immunity against temporary and short power drops in non-volatile memory
US9135192B2 (en) 2012-03-30 2015-09-15 Sandisk Technologies Inc. Memory system with command queue reordering
US9311226B2 (en) 2012-04-20 2016-04-12 Memory Technologies Llc Managing operational state data of a memory module using host memory in association with state change
US8996793B1 (en) 2012-04-24 2015-03-31 Densbits Technologies Ltd. System, method and computer readable medium for generating soft information
EP2842036B1 (en) 2012-04-27 2019-07-03 Hewlett-Packard Enterprise Development LP Local checkpointing using a multi-level cell
US8681548B2 (en) 2012-05-03 2014-03-25 Sandisk Technologies Inc. Column redundancy circuitry for non-volatile memory
US8838937B1 (en) 2012-05-23 2014-09-16 Densbits Technologies Ltd. Methods, systems and computer readable medium for writing and reading data
US8879325B1 (en) 2012-05-30 2014-11-04 Densbits Technologies Ltd. System, method and computer program product for processing read threshold information and for reading a flash memory module
US9075727B2 (en) 2012-06-14 2015-07-07 International Business Machines Corporation Reducing penalties for cache accessing operations
US9015423B2 (en) * 2012-06-14 2015-04-21 International Business Machines Corporation Reducing store operation busy times
US8750045B2 (en) 2012-07-27 2014-06-10 Sandisk Technologies Inc. Experience count dependent program algorithm for flash memory
US8755226B2 (en) * 2012-08-07 2014-06-17 Kabushiki Kaisha Toshiba Storage device and control method of nonvolatile memory
US9921954B1 (en) 2012-08-27 2018-03-20 Avago Technologies General Ip (Singapore) Pte. Ltd. Method and system for split flash memory management between host and storage controller
US9135989B2 (en) 2012-09-06 2015-09-15 Sandisk Technologies Inc. Write data preservation for non-volatile storage
US9329986B2 (en) 2012-09-10 2016-05-03 Sandisk Technologies Inc. Peak current management in multi-die non-volatile memory devices
US9164526B2 (en) 2012-09-27 2015-10-20 Sandisk Technologies Inc. Sigma delta over-sampling charge pump analog-to-digital converter
US9810723B2 (en) 2012-09-27 2017-11-07 Sandisk Technologies Llc Charge pump based over-sampling ADC for current detection
US9490035B2 (en) 2012-09-28 2016-11-08 SanDisk Technologies, Inc. Centralized variable rate serializer and deserializer for bad column management
US8897080B2 (en) 2012-09-28 2014-11-25 Sandisk Technologies Inc. Variable rate serial to parallel shift register
US9076506B2 (en) 2012-09-28 2015-07-07 Sandisk Technologies Inc. Variable rate parallel to serial shift register
US8780633B2 (en) 2012-11-09 2014-07-15 SanDisk Technologies, Inc. De-duplication system using NAND flash based content addressable memory
US8780634B2 (en) 2012-11-09 2014-07-15 Sandisk Technologies Inc. CAM NAND with OR function and full chip search capability
US9116796B2 (en) 2012-11-09 2015-08-25 Sandisk Technologies Inc. Key-value addressed storage drive using NAND flash based content addressable memory
US8780635B2 (en) 2012-11-09 2014-07-15 Sandisk Technologies Inc. Use of bloom filter and improved program algorithm for increased data protection in CAM NAND memory
US8792279B2 (en) 2012-11-09 2014-07-29 Sandisk Technologies Inc. Architectures for data analytics using computational NAND memory
WO2014074496A2 (en) 2012-11-09 2014-05-15 Sandisk Technologies Inc. Cam nand with or function and full chip search capability
US8811085B2 (en) 2012-11-09 2014-08-19 Sandisk Technologies Inc. On-device data analytics using NAND flash based intelligent memory
US8634248B1 (en) 2012-11-09 2014-01-21 Sandisk Technologies Inc. On-device data analytics using NAND flash based intelligent memory
US8773909B2 (en) 2012-11-09 2014-07-08 Sandisk Technologies Inc. CAM NAND with or function and full chip search capability
WO2014074483A2 (en) 2012-11-09 2014-05-15 Sandisk Technologies Inc. On-device data analytics using nand flash based intelligent memory
US8780632B2 (en) 2012-11-09 2014-07-15 Sandisk Technologies Inc. De-duplication techniques using NAND flash based content addressable memory
US8817541B2 (en) 2012-11-09 2014-08-26 Sandisk Technologies Inc. Data search using bloom filters and NAND based content addressable memory
US9368225B1 (en) 2012-11-21 2016-06-14 Avago Technologies General Ip (Singapore) Pte. Ltd. Determining read thresholds based upon read error direction statistics
US9171620B2 (en) * 2012-11-29 2015-10-27 Sandisk Technologies Inc. Weighted read scrub for nonvolatile memory
KR20150098649A (en) 2012-12-22 2015-08-28 퀄컴 인코포레이티드 Reducing power consumption of volatile memory via use of non-volatile memory
US9069659B1 (en) 2013-01-03 2015-06-30 Densbits Technologies Ltd. Read threshold determination using reference read threshold
US8710914B1 (en) 2013-02-08 2014-04-29 Sandisk Technologies Inc. Voltage regulators with improved wake-up response
US8928367B2 (en) 2013-02-28 2015-01-06 Sandisk Technologies Inc. Pre-charge circuit with reduced process dependence
US9075424B2 (en) 2013-03-06 2015-07-07 Sandisk Technologies Inc. Compensation scheme to improve the stability of the operational amplifiers
US9384839B2 (en) 2013-03-07 2016-07-05 Sandisk Technologies Llc Write sequence providing write abort protection
US9142270B2 (en) * 2013-03-08 2015-09-22 Cypress Semiconductor Corporation Pipelining in a memory
US8947972B2 (en) 2013-03-15 2015-02-03 Sandisk 3D Llc Dynamic address grouping for parallel programming in non-volatile memory
US9037902B2 (en) 2013-03-15 2015-05-19 Sandisk Technologies Inc. Flash memory techniques for recovering from write interrupt resulting from voltage fault
US8947944B2 (en) 2013-03-15 2015-02-03 Sandisk 3D Llc Program cycle skip evaluation before write operations in non-volatile memory
US9047933B2 (en) 2013-04-22 2015-06-02 Sandisk Technologies Inc. High speed signaling techniques to improve performance of integrated circuits
FR3006097A1 (en) * 2013-05-21 2014-11-28 St Microelectronics Rousset MECHANISM FOR WRITING A MEMORY EEPROM ON I2C BUS
US9183940B2 (en) 2013-05-21 2015-11-10 Aplus Flash Technology, Inc. Low disturbance, power-consumption, and latency in NAND read and program-verify operations
FR3006094A1 (en) * 2013-05-21 2014-11-28 St Microelectronics Rousset WRITING A MEMORY EEPROM ON I2C BUS
KR20140142759A (en) 2013-05-31 2014-12-15 에스케이하이닉스 주식회사 Nonvolatile memory device and operation method for the same and system including nonvolatile memory device
US9136876B1 (en) 2013-06-13 2015-09-15 Densbits Technologies Ltd. Size limited multi-dimensional decoding
WO2014210424A2 (en) 2013-06-27 2014-12-31 Aplus Flash Technology, Inc. Novel nand array architecture for multiple simultaneous program and read
US20150006784A1 (en) 2013-06-27 2015-01-01 Sandisk Technologies Inc. Efficient Post Write Read in Three Dimensional Nonvolatile Memory
US9195406B2 (en) 2013-06-28 2015-11-24 Micron Technology, Inc. Operation management in a memory device
US9063671B2 (en) 2013-07-02 2015-06-23 Sandisk Technologies Inc. Write operations with full sequence programming for defect management in nonvolatile memory
US9218242B2 (en) 2013-07-02 2015-12-22 Sandisk Technologies Inc. Write operations for defect management in nonvolatile memory
US9230677B2 (en) 2013-07-25 2016-01-05 Aplus Flash Technology, Inc NAND array hiarchical BL structures for multiple-WL and all-BL simultaneous erase, erase-verify, program, program-verify, and read operations
KR102133362B1 (en) 2013-08-14 2020-07-15 삼성전자주식회사 Nonvolatile memory device, memory system having the same, and programming method thereof
US8981750B1 (en) 2013-08-21 2015-03-17 Sandisk Technologies Inc. Active regulator wake-up time improvement by capacitive regulation
US9293205B2 (en) 2013-09-14 2016-03-22 Aplus Flash Technology, Inc Multi-task concurrent/pipeline NAND operations on all planes
US9165683B2 (en) 2013-09-23 2015-10-20 Sandisk Technologies Inc. Multi-word line erratic programming detection
US9413491B1 (en) 2013-10-08 2016-08-09 Avago Technologies General Ip (Singapore) Pte. Ltd. System and method for multiple dimension decoding and encoding a message
US9397706B1 (en) 2013-10-09 2016-07-19 Avago Technologies General Ip (Singapore) Pte. Ltd. System and method for irregular multiple dimension decoding and encoding
US9786388B1 (en) 2013-10-09 2017-10-10 Avago Technologies General Ip (Singapore) Pte. Ltd. Detecting and managing bad columns
US9348694B1 (en) 2013-10-09 2016-05-24 Avago Technologies General Ip (Singapore) Pte. Ltd. Detecting and managing bad columns
US9711225B2 (en) 2013-10-16 2017-07-18 Sandisk Technologies Llc Regrouping and skipping cycles in non-volatile memory
US9043537B1 (en) 2013-11-21 2015-05-26 Sandisk Technologies Inc. Update block programming order
US9218891B2 (en) * 2013-11-27 2015-12-22 Silicon Motion, Inc. Data storage device and flash memory control method
US9058881B1 (en) 2013-12-05 2015-06-16 Sandisk Technologies Inc. Systems and methods for partial page programming of multi level cells
US9244631B2 (en) 2013-12-06 2016-01-26 Sandisk Technologies Inc. Lower page only host burst writes
US9280419B2 (en) 2013-12-16 2016-03-08 International Business Machines Corporation Dynamic adjustment of data protection schemes in flash storage systems based on temperature, power off duration and flash age
WO2015100434A2 (en) 2013-12-25 2015-07-02 Aplus Flash Technology, Inc A HYBRID NAND WITH ALL-BL m-PAGE OPERATION SCHEME
US9536612B1 (en) 2014-01-23 2017-01-03 Avago Technologies General Ip (Singapore) Pte. Ltd Digital signaling processing for three dimensional flash memory arrays
KR102187521B1 (en) 2014-01-28 2020-12-08 삼성전자주식회사 Memory system including nonvolatile memory and memory controller and programming method for programming data into nonvolatile memory
US10120792B1 (en) 2014-01-29 2018-11-06 Avago Technologies General Ip (Singapore) Pte. Ltd. Programming an embedded flash storage device
US9552882B2 (en) 2014-02-06 2017-01-24 Sandisk Technologies Llc Sense amplifier with efficient use of data latches
US9230689B2 (en) 2014-03-17 2016-01-05 Sandisk Technologies Inc. Finding read disturbs on non-volatile memories
US8902652B1 (en) 2014-05-13 2014-12-02 Sandisk Technologies Inc. Systems and methods for lower page writes
US8886877B1 (en) 2014-05-15 2014-11-11 Sandisk Technologies Inc. In-situ block folding for nonvolatile memory
US9542262B1 (en) 2014-05-29 2017-01-10 Avago Technologies General Ip (Singapore) Pte. Ltd. Error correction
US9892033B1 (en) 2014-06-24 2018-02-13 Avago Technologies General Ip (Singapore) Pte. Ltd. Management of memory units
US9584159B1 (en) 2014-07-03 2017-02-28 Avago Technologies General Ip (Singapore) Pte. Ltd. Interleaved encoding
US9972393B1 (en) 2014-07-03 2018-05-15 Avago Technologies General Ip (Singapore) Pte. Ltd. Accelerating programming of a flash memory module
US9449702B1 (en) 2014-07-08 2016-09-20 Avago Technologies General Ip (Singapore) Pte. Ltd. Power management
US9460809B2 (en) 2014-07-10 2016-10-04 Sandisk Technologies Llc AC stress mode to screen out word line to word line shorts
US9443612B2 (en) 2014-07-10 2016-09-13 Sandisk Technologies Llc Determination of bit line to low voltage signal shorts
US9514835B2 (en) 2014-07-10 2016-12-06 Sandisk Technologies Llc Determination of word line to word line shorts between adjacent blocks
US9484086B2 (en) 2014-07-10 2016-11-01 Sandisk Technologies Llc Determination of word line to local source line shorts
US9659636B2 (en) 2014-07-22 2017-05-23 Peter Wung Lee NAND memory array with BL-hierarchical structure for concurrent all-BL, all-threshold-state program, and alternative-WL program, odd/even read and verify operations
US9202593B1 (en) 2014-09-02 2015-12-01 Sandisk Technologies Inc. Techniques for detecting broken word lines in non-volatile memories
US9240249B1 (en) 2014-09-02 2016-01-19 Sandisk Technologies Inc. AC stress methods to screen out bit line defects
US9449694B2 (en) 2014-09-04 2016-09-20 Sandisk Technologies Llc Non-volatile memory with multi-word line select for defect detection operations
TWI559320B (en) * 2014-09-10 2016-11-21 東芝股份有限公司 Semiconductor storage device
US9275714B1 (en) * 2014-09-26 2016-03-01 Qualcomm Incorporated Read operation of MRAM using a dummy word line
US9552171B2 (en) 2014-10-29 2017-01-24 Sandisk Technologies Llc Read scrub with adaptive counter management
US9934872B2 (en) 2014-10-30 2018-04-03 Sandisk Technologies Llc Erase stress and delta erase loop count methods for various fail modes in non-volatile memory
US9978456B2 (en) 2014-11-17 2018-05-22 Sandisk Technologies Llc Techniques for reducing read disturb in partially written blocks of non-volatile memory
US9349479B1 (en) 2014-11-18 2016-05-24 Sandisk Technologies Inc. Boundary word line operation in nonvolatile memory
US9524211B1 (en) 2014-11-18 2016-12-20 Avago Technologies General Ip (Singapore) Pte. Ltd. Codeword management
US9224502B1 (en) 2015-01-14 2015-12-29 Sandisk Technologies Inc. Techniques for detection and treating memory hole to local interconnect marginality defects
US10305515B1 (en) 2015-02-02 2019-05-28 Avago Technologies International Sales Pte. Limited System and method for encoding using multiple linear feedback shift registers
US10032524B2 (en) 2015-02-09 2018-07-24 Sandisk Technologies Llc Techniques for determining local interconnect defects
US9564215B2 (en) 2015-02-11 2017-02-07 Sandisk Technologies Llc Independent sense amplifier addressing and quota sharing in non-volatile memory
US9449700B2 (en) 2015-02-13 2016-09-20 Sandisk Technologies Llc Boundary word line search and open block read methods with reduced read disturb
US9564219B2 (en) 2015-04-08 2017-02-07 Sandisk Technologies Llc Current based detection and recording of memory hole-interconnect spacing defects
US9269446B1 (en) 2015-04-08 2016-02-23 Sandisk Technologies Inc. Methods to improve programming of slow cells
KR20160127524A (en) 2015-04-27 2016-11-04 에스케이하이닉스 주식회사 Memory system and operating method of memory system
KR102282196B1 (en) 2015-04-28 2021-07-27 삼성전자 주식회사 Non-volatile memory device, memory system and operating method thereof
CN107430879B (en) * 2015-05-08 2020-07-21 桑迪士克科技有限责任公司 Data mapping for non-volatile storage
US10628255B1 (en) 2015-06-11 2020-04-21 Avago Technologies International Sales Pte. Limited Multi-dimensional decoding
JP6359491B2 (en) * 2015-06-12 2018-07-18 東芝メモリ株式会社 Semiconductor memory device
US9851921B1 (en) 2015-07-05 2017-12-26 Avago Technologies General Ip (Singapore) Pte. Ltd. Flash memory chip processing
US9659666B2 (en) 2015-08-31 2017-05-23 Sandisk Technologies Llc Dynamic memory recovery at the sub-block level
US9653154B2 (en) 2015-09-21 2017-05-16 Sandisk Technologies Llc Write abort detection for multi-state memories
US9858009B2 (en) 2015-10-26 2018-01-02 Sandisk Technologies Llc Data folding in 3D nonvolatile memory
US9711211B2 (en) 2015-10-29 2017-07-18 Sandisk Technologies Llc Dynamic threshold voltage compaction for non-volatile memory
KR20170050953A (en) * 2015-11-02 2017-05-11 에스케이하이닉스 주식회사 Memory system and operation method for the same
KR102435027B1 (en) 2015-11-09 2022-08-23 삼성전자주식회사 Nonvolatile memory device and read method thereof
US10671291B2 (en) 2015-11-17 2020-06-02 Hewlett Packard Enterprise Development Lp Iterative write sequence interrupt
KR20170057902A (en) 2015-11-17 2017-05-26 에스케이하이닉스 주식회사 Memory system and operating method of memory system
US9954558B1 (en) 2016-03-03 2018-04-24 Avago Technologies General Ip (Singapore) Pte. Ltd. Fast decoding of data stored in a flash memory
US9698676B1 (en) 2016-03-11 2017-07-04 Sandisk Technologies Llc Charge pump based over-sampling with uniform step size for current detection
US9996280B2 (en) 2016-03-15 2018-06-12 Sandisk Technologies Llc Data register copying for non-volatile storage array operations
KR20180011376A (en) 2016-07-21 2018-02-01 에스케이하이닉스 주식회사 Memory system and operating method of memory system
US9898229B1 (en) 2016-07-29 2018-02-20 Sandisk Technologies Llc Systems and methods of memory reads
JP2018041154A (en) * 2016-09-05 2018-03-15 東芝メモリ株式会社 Storage system and processing method
US9767914B1 (en) 2016-10-10 2017-09-19 Wingyu Leung Durable maintenance of memory cell electric current sense window following program-erase operations to a non-volatile memory
CN106502919B (en) * 2016-10-11 2019-05-31 上海东软载波微电子有限公司 A kind of write operation method and device of Flash flash memory
US10379940B2 (en) 2016-12-08 2019-08-13 Sandisk Technologies Llc Pipeline delay detection during decoding by a data storage device
US10325658B2 (en) 2017-01-09 2019-06-18 Samsung Electronics Co., Ltd. Non-volatile memory device and programming method thereof
JP6783682B2 (en) * 2017-02-27 2020-11-11 キオクシア株式会社 Semiconductor storage and memory system
JP2019029045A (en) * 2017-07-26 2019-02-21 東芝メモリ株式会社 Semiconductor storage device
KR102631353B1 (en) * 2017-08-17 2024-01-31 삼성전자주식회사 Nonvolatile memory device and operating method of the same
CN111433754A (en) 2017-09-30 2020-07-17 美光科技公司 Preemptive idle time read scan
KR20190090268A (en) * 2018-01-24 2019-08-01 에스케이하이닉스 주식회사 Memory controller and memory system having the same
US10642746B2 (en) 2018-03-22 2020-05-05 Western Digital Technologies, Inc. Controlling cached/non-cached memory access decisions based on memory access queue fill levels
KR20200023758A (en) * 2018-08-27 2020-03-06 에스케이하이닉스 주식회사 Memory system and operating method thereof
JP2020047335A (en) 2018-09-18 2020-03-26 キオクシア株式会社 Nonvolatile memory and memory system
KR20200034312A (en) * 2018-09-21 2020-03-31 에스케이하이닉스 주식회사 Data storage device and operating method thereof
US11055184B2 (en) 2018-12-19 2021-07-06 Vmware, Inc. In-place garbage collection of a sharded, replicated distributed state machine based on supersedable operations
US11360704B2 (en) * 2018-12-21 2022-06-14 Micron Technology, Inc. Multiplexed signal development in a memory device
US10877881B2 (en) * 2019-01-11 2020-12-29 Vmware, Inc. In-place garbage collection of a sharded, replicated distributed state machine based on mergeable operations
KR20200098009A (en) 2019-02-11 2020-08-20 삼성전자주식회사 Nonvolatile memory device and operation method thereof
KR20200139496A (en) 2019-06-04 2020-12-14 에스케이하이닉스 주식회사 Memory device and operating method thereof
US10825526B1 (en) * 2019-06-24 2020-11-03 Sandisk Technologies Llc Non-volatile memory with reduced data cache buffer
US10811082B1 (en) 2019-06-24 2020-10-20 Sandisk Technologies Llc Non-volatile memory with fast data cache transfer scheme
US11681797B2 (en) 2019-08-28 2023-06-20 Micron Technology, Inc. Row activation prevention using fuses
US11152054B2 (en) 2019-08-28 2021-10-19 Micron Technology, Inc. Apparatuses and methods for performing background operations in memory using sensing circuitry
KR20210060867A (en) * 2019-11-19 2021-05-27 에스케이하이닉스 주식회사 Data storage device and operating method thereof
CN111400201B (en) 2020-03-19 2022-08-16 合肥兆芯电子有限公司 Data sorting method of flash memory, storage device and control circuit unit
US11288011B2 (en) 2020-03-26 2022-03-29 Western Digital Technologies, Inc. Non-volatile memory array with write failure protection for multi-level cell (MLC) storage elements using coupled writes
KR20220001137A (en) 2020-06-29 2022-01-05 에스케이하이닉스 주식회사 Memory system, memory device, and operating method of memory device
US11816343B2 (en) * 2020-11-30 2023-11-14 Western Digital Technologies, Inc. Data storage device enabling latches of non-volatile memory dies for use as externally-accessible volatile memory
CN112466372B (en) * 2020-12-23 2021-12-21 芯天下技术股份有限公司 Small-size Latch unit circuit and Flash chip
CN113409852A (en) * 2021-06-17 2021-09-17 芯天下技术股份有限公司 Method, device, storage medium and terminal for improving flash memory programming efficiency
US11651800B2 (en) * 2021-06-22 2023-05-16 Sandisk Technologies Llc Sense amplifier mapping and control scheme for non-volatile memory
US11776599B2 (en) * 2021-09-24 2023-10-03 Advanced Micro Devices, Inc. Encoded enable clock gaters

Citations (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5509134A (en) * 1993-06-30 1996-04-16 Intel Corporation Method and apparatus for execution of operations in a flash memory array
US5532962A (en) * 1992-05-20 1996-07-02 Sandisk Corporation Soft errors handling in EEPROM devices
US5692165A (en) * 1995-09-12 1997-11-25 Micron Electronics Inc. Memory controller with low skew control signal
US5893135A (en) * 1995-12-27 1999-04-06 Intel Corporation Flash memory array with two interfaces for responding to RAS and CAS signals
US6029233A (en) * 1996-06-10 2000-02-22 Bull, S.A. Circuit for moving data between remote memories and computer comprising such a circuit
US6252803B1 (en) * 2000-10-23 2001-06-26 Advanced Micro Devices, Inc. Automatic program disturb with intelligent soft programming for flash cells
US6253250B1 (en) * 1999-06-28 2001-06-26 Telocity, Incorporated Method and apparatus for bridging a plurality of buses and handling of an exception event to provide bus isolation
US20010040826A1 (en) * 1998-12-29 2001-11-15 Micron Technology, Inc. Method and apparatus for programming multi-state cells in a memory device
US6324121B2 (en) * 1991-02-08 2001-11-27 Btg International Inc. Electrically alterable non-volatile memory with n-bits per cell
US6356485B1 (en) * 1999-02-13 2002-03-12 Integrated Device Technology, Inc. Merging write cycles by comparing at least a portion of the respective write cycle addresses
US6438038B2 (en) * 1999-12-28 2002-08-20 Kabushiki Kaisha Toshiba Read circuit of nonvolatile semiconductor memory
US6519180B2 (en) * 1999-01-14 2003-02-11 Silicon Storage Technology, Inc. Array architecture and operating methods for digital multilevel nonvolatile memory integrated circuit system
US20030123295A1 (en) * 2002-01-03 2003-07-03 Elmhurst Daniel R. Programming non-volatile memory devices
US20030174555A1 (en) * 2000-12-28 2003-09-18 Sandisk Corporation Novel method and structure for efficient data verification operation for non-volatile memories
US6650570B2 (en) * 2000-09-22 2003-11-18 Kabushiki Kaisha Toshiba Non-volatile semiconductor memory
US6687158B2 (en) * 2001-12-21 2004-02-03 Fujitsu Limited Gapless programming for a NAND type flash memory
US20040237000A1 (en) * 2003-05-08 2004-11-25 Micron Technology, Inc. Program failure recovery
US6829167B2 (en) * 2002-12-12 2004-12-07 Sandisk Corporation Error recovery for nonvolatile memory
US6829172B2 (en) * 2000-05-04 2004-12-07 Saifun Semiconductors Ltd. Programming of nonvolatile memory cells
US6847553B2 (en) * 2002-01-18 2005-01-25 Sandisk Corporation Techniques of recovering data from memory cells affected by field coupling with adjacent memory cells
US6856568B1 (en) * 2000-04-25 2005-02-15 Multi Level Memory Technology Refresh operations that change address mappings in a non-volatile memory
US6859394B2 (en) * 2001-03-06 2005-02-22 Kabushiki Kaisha Toshiba NAND type non-volatile semiconductor memory device
US20050047217A1 (en) * 2002-11-29 2005-03-03 Kabushiki Kaisha Toshiba Semiconductor memory device for storing multivalued data
US20050162913A1 (en) * 2004-01-26 2005-07-28 Jian Chen Method of reading NAND memory to compensate for coupling between storage elements
US20050169057A1 (en) * 2004-01-30 2005-08-04 Noboru Shibata Semiconductor memory device which stores plural data in a cell
US6987693B2 (en) * 2002-09-24 2006-01-17 Sandisk Corporation Non-volatile memory and method with reduced neighboring field errors
US6992936B2 (en) * 1998-02-16 2006-01-31 Renesas Technology Corp. Semiconductor, memory card, and data processing system
US7038946B2 (en) * 2002-02-06 2006-05-02 Kabushiki Kaisha Toshiba Non-volatile semiconductor memory device
US7046568B2 (en) * 2002-09-24 2006-05-16 Sandisk Corporation Memory sensing circuit and method for low voltage operation
US20060126394A1 (en) * 2004-12-14 2006-06-15 Yan Li Multi-state memory having data recovery after program fail
US7073103B2 (en) * 2002-12-05 2006-07-04 Sandisk Corporation Smart verify for multi-state memories
US20060221704A1 (en) * 2005-04-01 2006-10-05 Yan Li Use of data latches in cache operations of non-volatile memories
US20060221697A1 (en) * 2005-04-01 2006-10-05 Yan Li Use of data latches in multi-phase programming of non-volatile memories
US20060221692A1 (en) * 2005-04-05 2006-10-05 Jian Chen Compensating for coupling during read operations on non-volatile memory
US20060221696A1 (en) * 2005-04-01 2006-10-05 Yan Li Method for Non-Volatile Memory with Background Data Latch Caching During Read Operations
US20060239080A1 (en) * 2005-04-01 2006-10-26 Yan Li Method for Non-Volatile Memory with Managed Execution of Cached Data
US7177197B2 (en) * 2001-09-17 2007-02-13 Sandisk Corporation Latched programming of memory and method
US7187585B2 (en) * 2005-04-05 2007-03-06 Sandisk Corporation Read operation for non-volatile storage that includes compensation for coupling
US7196931B2 (en) * 2002-09-24 2007-03-27 Sandisk Corporation Non-volatile memory and method with reduced source line bias errors
US7224614B1 (en) * 2005-12-29 2007-05-29 Sandisk Corporation Methods for improved program-verify operations in non-volatile memories
US7251160B2 (en) * 2005-03-16 2007-07-31 Sandisk Corporation Non-volatile memory and method with power-saving read and program-verify operations

Family Cites Families (91)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IT1224062B (en) * 1979-09-28 1990-09-26 Ates Componenti Elettron PROGRAMMING METHOD FOR AN ELECTRICALLY ALTERABLE NON-VOLATILE SEMICONDUCTOR MEMORY
US4785427A (en) * 1987-01-28 1988-11-15 Cypress Semiconductor Corporation Differential bit line clamp
US5034922A (en) * 1987-12-21 1991-07-23 Motorola, Inc. Intelligent electrically erasable, programmable read-only memory with improved read latency
US5093806A (en) * 1988-02-16 1992-03-03 Tran Hiep V Sensing and decoding scheme for a bicmos read/write memory
US5095344A (en) * 1988-06-08 1992-03-10 Eliyahou Harari Highly compact eprom and flash eeprom devices
US5070032A (en) * 1989-03-15 1991-12-03 Sundisk Corporation Method of making dense flash eeprom semiconductor memory structures
DE69034191T2 (en) * 1989-04-13 2005-11-24 Sandisk Corp., Sunnyvale EEPROM system with multi-chip block erasure
US5172338B1 (en) * 1989-04-13 1997-07-08 Sandisk Corp Multi-state eeprom read and write circuits and techniques
ATE157183T1 (en) 1989-07-06 1997-09-15 Digital Equipment Corp INPUT QUEUE FOR STORAGE SUBSYSTEMS
JP2646850B2 (en) * 1990-11-30 1997-08-27 日本電気株式会社 Semiconductor memory circuit
US5343063A (en) * 1990-12-18 1994-08-30 Sundisk Corporation Dense vertical programmable read only memory cell structure and processes for making them
KR960000619B1 (en) * 1991-12-27 1996-01-10 후지쓰 가부시끼가이샤 Flash non-volatile semiconductor memory device and driving control circuit thereof
US6222762B1 (en) * 1992-01-14 2001-04-24 Sandisk Corporation Multi-state memory
US5313421A (en) * 1992-01-14 1994-05-17 Sundisk Corporation EEPROM with split gate source side injection
JP3323869B2 (en) 1992-03-31 2002-09-09 株式会社東芝 Nonvolatile semiconductor memory device
US5315541A (en) * 1992-07-24 1994-05-24 Sundisk Corporation Segmented column memory array
JP3594626B2 (en) 1993-03-04 2004-12-02 株式会社ルネサステクノロジ Non-volatile memory device
JP3078946B2 (en) 1993-03-11 2000-08-21 インターナショナル・ビジネス・マシーンズ・コーポレ−ション Managing method of batch erase nonvolatile memory and semiconductor disk device
US5555204A (en) * 1993-06-29 1996-09-10 Kabushiki Kaisha Toshiba Non-volatile semiconductor memory device
US5519847A (en) * 1993-06-30 1996-05-21 Intel Corporation Method of pipelining sequential writes in a flash memory
KR0169267B1 (en) * 1993-09-21 1999-02-01 사토 후미오 Nonvolatile semiconductor memory device
US5661053A (en) * 1994-05-25 1997-08-26 Sandisk Corporation Method of making dense flash EEPROM cell array and peripheral supporting circuits formed in deposited field oxide with the use of spacers
KR100210985B1 (en) * 1994-06-29 1999-07-15 니시무로 타이죠 Nonvolatile semiconductor device
US5691994A (en) 1995-05-08 1997-11-25 Western Digital Corporation Disk drive with fast error correction validation
US5838614A (en) 1995-07-31 1998-11-17 Lexar Microsystems, Inc. Identification and verification of a sector within a block of mass storage flash memory
KR0169419B1 (en) * 1995-09-28 1999-02-01 김광호 Reading method and device of non-volatile semiconductor memory
JP3941149B2 (en) * 1996-12-03 2007-07-04 ソニー株式会社 Semiconductor nonvolatile memory device
US5724303A (en) * 1996-02-15 1998-03-03 Nexcom Technology, Inc. Non-volatile programmable memory having an SRAM capability
US5903495A (en) * 1996-03-18 1999-05-11 Kabushiki Kaisha Toshiba Semiconductor device and memory system
US5860082A (en) * 1996-03-28 1999-01-12 Datalight, Inc. Method and apparatus for allocating storage in a flash memory
US5784705A (en) 1996-07-15 1998-07-21 Mosys, Incorporated Method and structure for performing pipeline burst accesses in a semiconductor memory
US5768192A (en) * 1996-07-23 1998-06-16 Saifun Semiconductors, Ltd. Non-volatile semiconductor memory cell utilizing asymmetrical charge trapping
JP3897388B2 (en) * 1996-12-27 2007-03-22 シャープ株式会社 Serial access semiconductor memory device
US6097638A (en) * 1997-02-12 2000-08-01 Kabushiki Kaisha Toshiba Semiconductor memory device
KR100272037B1 (en) * 1997-02-27 2000-12-01 니시무로 타이죠 Non volatile simiconductor memory
US5870335A (en) * 1997-03-06 1999-02-09 Agate Semiconductor, Inc. Precision programming of nonvolatile memory cells
US5732017A (en) 1997-03-31 1998-03-24 Atmel Corporation Combined program and data nonvolatile memory with concurrent program-read/data write capability
US5872739A (en) * 1997-04-17 1999-02-16 Radiant Technologies Sense amplifier for low read-voltage memory cells
JPH113290A (en) 1997-06-11 1999-01-06 Hitachi Ltd Memory control system
US5912906A (en) 1997-06-23 1999-06-15 Sun Microsystems, Inc. Method and apparatus for recovering from correctable ECC errors
US6768165B1 (en) * 1997-08-01 2004-07-27 Saifun Semiconductors Ltd. Two bit non-volatile electrically erasable and programmable semiconductor memory cell utilizing asymmetrical charge trapping
US5867429A (en) * 1997-11-19 1999-02-02 Sandisk Corporation High density non-volatile flash memory without adverse effects of electric field coupling between adjacent floating gates
US5969986A (en) * 1998-06-23 1999-10-19 Invox Technology High-bandwidth read and write architectures for non-volatile memories
KR100332950B1 (en) 1998-04-10 2002-08-21 삼성전자 주식회사 Non-volatile semiconductor memory device with signle-bit and multi-bit modes of operation and method for perporming programming and reading operations therein
US6128229A (en) 1998-09-16 2000-10-03 Sony Corporation Non-volatile semiconductor memory and method of verifying after writing and reading the same
US5949720A (en) * 1998-10-30 1999-09-07 Stmicroelectronics, Inc. Voltage clamping method and apparatus for dynamic random access memory devices
JP2000243085A (en) 1999-02-22 2000-09-08 Hitachi Ltd Semiconductor device
JP4173642B2 (en) 1999-02-22 2008-10-29 株式会社ルネサステクノロジ Memory card data writing method
KR100287188B1 (en) 1999-04-06 2001-04-16 윤종용 Semiconductor memory device capable of data processing speed and efficiency of data pin and read-write control method thereof
JP3299219B2 (en) * 1999-05-07 2002-07-08 日本電気株式会社 Digital PLL circuit
JP3863330B2 (en) * 1999-09-28 2006-12-27 株式会社東芝 Nonvolatile semiconductor memory
JP3983969B2 (en) 2000-03-08 2007-09-26 株式会社東芝 Nonvolatile semiconductor memory device
TW470967B (en) 2000-05-23 2002-01-01 Silicon Integrated Sys Corp High speed multiple ports first-in-first-out memory structure
US6504757B1 (en) * 2000-08-11 2003-01-07 Advanced Micro Devices, Inc. Double boosting scheme for NAND to improve program inhibit characteristics
US6266273B1 (en) * 2000-08-21 2001-07-24 Sandisk Corporation Method and structure for reliable data copy operation for non-volatile memories
US6684289B1 (en) 2000-11-22 2004-01-27 Sandisk Corporation Techniques for operating non-volatile memory systems with data sectors having different sizes than the sizes of the pages and/or blocks of the memory
US6763424B2 (en) 2001-01-19 2004-07-13 Sandisk Corporation Partial block data programming and reading operations in a non-volatile memory
KR100381956B1 (en) * 2001-02-02 2003-04-26 삼성전자주식회사 Sense amplifier circuit for use in a flash memory device
US6407953B1 (en) * 2001-02-02 2002-06-18 Matrix Semiconductor, Inc. Memory array organization and related test method particularly well suited for integrated circuits having write-once memory arrays
US6738289B2 (en) * 2001-02-26 2004-05-18 Sandisk Corporation Non-volatile memory with improved programming and method therefor
NO312928B1 (en) 2001-02-26 2002-07-15 Thin Film Electronics Asa Non-destructive readout
US6377507B1 (en) 2001-04-06 2002-04-23 Integrated Memory Technologies, Inc. Non-volatile memory device having high speed page mode operation
US6570810B2 (en) * 2001-04-20 2003-05-27 Multi Level Memory Technology Contactless flash memory with buried diffusion bit/virtual ground lines
JP2003018307A (en) 2001-06-29 2003-01-17 Mitsutoyo Corp Method and device for processing measured data
US6671204B2 (en) 2001-07-23 2003-12-30 Samsung Electronics Co., Ltd. Nonvolatile memory device with page buffer having dual registers and methods of using the same
JP2003036681A (en) 2001-07-23 2003-02-07 Hitachi Ltd Non-volatile memory device
US6456528B1 (en) * 2001-09-17 2002-09-24 Sandisk Corporation Selective operation of a multi-state non-volatile memory system in a binary mode
JP4454896B2 (en) * 2001-09-27 2010-04-21 シャープ株式会社 Virtual ground type nonvolatile semiconductor memory device
KR100454119B1 (en) * 2001-10-24 2004-10-26 삼성전자주식회사 Non-volatile semiconductor memory device with cache function and program, read and page copy-back operations thereof
JP3851865B2 (en) * 2001-12-19 2006-11-29 株式会社東芝 Semiconductor integrated circuit
JP2003233993A (en) 2002-02-08 2003-08-22 Matsushita Electric Ind Co Ltd Method for rewriting nonvolatile memory device
US20040023700A1 (en) * 2002-08-02 2004-02-05 Amphenol-T&M Antennas Self-contained portable hinge assembly
AU2003272596A1 (en) 2002-09-24 2004-04-19 Sandisk Corporation Non-volatile memory and its sensing method
US6940753B2 (en) * 2002-09-24 2005-09-06 Sandisk Corporation Highly compact non-volatile memory and method therefor with space-efficient data registers
US6983428B2 (en) * 2002-09-24 2006-01-03 Sandisk Corporation Highly compact non-volatile memory and method thereof
US7443757B2 (en) 2002-09-24 2008-10-28 Sandisk Corporation Non-volatile memory and method with reduced bit line crosstalk errors
JP4265206B2 (en) * 2002-11-27 2009-05-20 株式会社 東北テクノアーチ Non-contact conductivity measurement system
JP3920768B2 (en) 2002-12-26 2007-05-30 株式会社東芝 Nonvolatile semiconductor memory
DE60306488D1 (en) * 2003-02-27 2006-08-10 St Microelectronics Srl Built-in test procedure in a flash memory
US7093062B2 (en) * 2003-04-10 2006-08-15 Micron Technology, Inc. Flash memory data bus for synchronous burst read page
JP3913704B2 (en) 2003-04-22 2007-05-09 株式会社東芝 Nonvolatile semiconductor memory device and electronic device using the same
JP2004326974A (en) * 2003-04-25 2004-11-18 Toshiba Corp Semiconductor integrated circuit device and ic card
US7012835B2 (en) * 2003-10-03 2006-03-14 Sandisk Corporation Flash memory data correction and scrub techniques
US6868009B1 (en) 2003-10-20 2005-03-15 Macronix International Co., Ltd. Flash memory device with byte erase
US7177977B2 (en) 2004-03-19 2007-02-13 Sandisk Corporation Operating non-volatile memory without read disturb limitations
US7490283B2 (en) 2004-05-13 2009-02-10 Sandisk Corporation Pipelined data relocation and improved chip architectures
JP2006031871A (en) 2004-07-20 2006-02-02 Toshiba Corp Semiconductor memory
US8375146B2 (en) 2004-08-09 2013-02-12 SanDisk Technologies, Inc. Ring bus structure and its use in flash memory systems
US7120051B2 (en) 2004-12-14 2006-10-10 Sandisk Corporation Pipelined programming of non-volatile memories using early data
US7409473B2 (en) 2004-12-21 2008-08-05 Sandisk Corporation Off-chip data relocation
US20060140007A1 (en) 2004-12-29 2006-06-29 Raul-Adrian Cernea Non-volatile memory and method with shared processing for an aggregate of read/write circuits

Patent Citations (54)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6324121B2 (en) * 1991-02-08 2001-11-27 Btg International Inc. Electrically alterable non-volatile memory with n-bits per cell
US5532962A (en) * 1992-05-20 1996-07-02 Sandisk Corporation Soft errors handling in EEPROM devices
US5509134A (en) * 1993-06-30 1996-04-16 Intel Corporation Method and apparatus for execution of operations in a flash memory array
US5692165A (en) * 1995-09-12 1997-11-25 Micron Electronics Inc. Memory controller with low skew control signal
US5893135A (en) * 1995-12-27 1999-04-06 Intel Corporation Flash memory array with two interfaces for responding to RAS and CAS signals
US6029233A (en) * 1996-06-10 2000-02-22 Bull, S.A. Circuit for moving data between remote memories and computer comprising such a circuit
US6992936B2 (en) * 1998-02-16 2006-01-31 Renesas Technology Corp. Semiconductor, memory card, and data processing system
US20010040826A1 (en) * 1998-12-29 2001-11-15 Micron Technology, Inc. Method and apparatus for programming multi-state cells in a memory device
US6519180B2 (en) * 1999-01-14 2003-02-11 Silicon Storage Technology, Inc. Array architecture and operating methods for digital multilevel nonvolatile memory integrated circuit system
US6356485B1 (en) * 1999-02-13 2002-03-12 Integrated Device Technology, Inc. Merging write cycles by comparing at least a portion of the respective write cycle addresses
US6253250B1 (en) * 1999-06-28 2001-06-26 Telocity, Incorporated Method and apparatus for bridging a plurality of buses and handling of an exception event to provide bus isolation
US6438038B2 (en) * 1999-12-28 2002-08-20 Kabushiki Kaisha Toshiba Read circuit of nonvolatile semiconductor memory
US6856568B1 (en) * 2000-04-25 2005-02-15 Multi Level Memory Technology Refresh operations that change address mappings in a non-volatile memory
US6829172B2 (en) * 2000-05-04 2004-12-07 Saifun Semiconductors Ltd. Programming of nonvolatile memory cells
US6650570B2 (en) * 2000-09-22 2003-11-18 Kabushiki Kaisha Toshiba Non-volatile semiconductor memory
US6252803B1 (en) * 2000-10-23 2001-06-26 Advanced Micro Devices, Inc. Automatic program disturb with intelligent soft programming for flash cells
US20030174555A1 (en) * 2000-12-28 2003-09-18 Sandisk Corporation Novel method and structure for efficient data verification operation for non-volatile memories
US6859394B2 (en) * 2001-03-06 2005-02-22 Kabushiki Kaisha Toshiba NAND type non-volatile semiconductor memory device
US7177197B2 (en) * 2001-09-17 2007-02-13 Sandisk Corporation Latched programming of memory and method
US6687158B2 (en) * 2001-12-21 2004-02-03 Fujitsu Limited Gapless programming for a NAND type flash memory
US20030123295A1 (en) * 2002-01-03 2003-07-03 Elmhurst Daniel R. Programming non-volatile memory devices
US6847553B2 (en) * 2002-01-18 2005-01-25 Sandisk Corporation Techniques of recovering data from memory cells affected by field coupling with adjacent memory cells
US7038946B2 (en) * 2002-02-06 2006-05-02 Kabushiki Kaisha Toshiba Non-volatile semiconductor memory device
US6987693B2 (en) * 2002-09-24 2006-01-17 Sandisk Corporation Non-volatile memory and method with reduced neighboring field errors
US7046568B2 (en) * 2002-09-24 2006-05-16 Sandisk Corporation Memory sensing circuit and method for low voltage operation
US7196931B2 (en) * 2002-09-24 2007-03-27 Sandisk Corporation Non-volatile memory and method with reduced source line bias errors
US20050047217A1 (en) * 2002-11-29 2005-03-03 Kabushiki Kaisha Toshiba Semiconductor memory device for storing multivalued data
US7073103B2 (en) * 2002-12-05 2006-07-04 Sandisk Corporation Smart verify for multi-state memories
US6829167B2 (en) * 2002-12-12 2004-12-07 Sandisk Corporation Error recovery for nonvolatile memory
US20040237000A1 (en) * 2003-05-08 2004-11-25 Micron Technology, Inc. Program failure recovery
US20050162913A1 (en) * 2004-01-26 2005-07-28 Jian Chen Method of reading NAND memory to compensate for coupling between storage elements
US20050169057A1 (en) * 2004-01-30 2005-08-04 Noboru Shibata Semiconductor memory device which stores plural data in a cell
US20060126394A1 (en) * 2004-12-14 2006-06-15 Yan Li Multi-state memory having data recovery after program fail
US7251160B2 (en) * 2005-03-16 2007-07-31 Sandisk Corporation Non-volatile memory and method with power-saving read and program-verify operations
US20060233021A1 (en) * 2005-04-01 2006-10-19 Jason Lin Non-Volatile Memory with Background Data Latch Caching During Erase Operations
US7206230B2 (en) * 2005-04-01 2007-04-17 Sandisk Corporation Use of data latches in cache operations of non-volatile memories
US20060233023A1 (en) * 2005-04-01 2006-10-19 Jason Lin Method for Non-Volatile Memory with Background Data Latch Caching During Erase Operations
US20060221696A1 (en) * 2005-04-01 2006-10-05 Yan Li Method for Non-Volatile Memory with Background Data Latch Caching During Read Operations
US20060233022A1 (en) * 2005-04-01 2006-10-19 Yan Li Non-Volatile Memory with Background Data Latch Caching During Program Operations
US20060233026A1 (en) * 2005-04-01 2006-10-19 Yan Li Method for Non-Volatile Memory with Background Data Latch Caching During Program Operations
US20060239080A1 (en) * 2005-04-01 2006-10-26 Yan Li Method for Non-Volatile Memory with Managed Execution of Cached Data
US7158421B2 (en) * 2005-04-01 2007-01-02 Sandisk Corporation Use of data latches in multi-phase programming of non-volatile memories
US20070002626A1 (en) * 2005-04-01 2007-01-04 Yan Li Non-Volatile Memory with Managed Execution of Cached Data
US20060233010A1 (en) * 2005-04-01 2006-10-19 Yan Li Non-Volatile Memory with Background Data Latch Caching During Read Operations
US20060221704A1 (en) * 2005-04-01 2006-10-05 Yan Li Use of data latches in cache operations of non-volatile memories
US20060221697A1 (en) * 2005-04-01 2006-10-05 Yan Li Use of data latches in multi-phase programming of non-volatile memories
US20060221692A1 (en) * 2005-04-05 2006-10-05 Jian Chen Compensating for coupling during read operations on non-volatile memory
US20070103982A1 (en) * 2005-04-05 2007-05-10 Yan Li Read operation for non-volatile storage that includes compensation for coupling
US20070109846A1 (en) * 2005-04-05 2007-05-17 Yan Li Read operation for non-volatile storage that includes compensation for coupling
US7187585B2 (en) * 2005-04-05 2007-03-06 Sandisk Corporation Read operation for non-volatile storage that includes compensation for coupling
US7301808B2 (en) * 2005-04-05 2007-11-27 Sandisk Corporation Read operation for non-volatile storage that includes compensation for coupling
US7301816B2 (en) * 2005-04-05 2007-11-27 Sandisk Corporation Read operation for non-volatile storage that includes compensation for coupling
US7301839B2 (en) * 2005-04-05 2007-11-27 Sandisk Corporation Read operation for non-volatile storage that includes compensation for coupling
US7224614B1 (en) * 2005-12-29 2007-05-29 Sandisk Corporation Methods for improved program-verify operations in non-volatile memories

Cited By (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7936602B2 (en) 2005-04-01 2011-05-03 Sandisk Corporation Use of data latches in cache operations of non-volatile memories
US20090067253A1 (en) * 2005-04-01 2009-03-12 Yan Li Method for Non-Volatile Memory With Background Data Latch Caching During Read Operations
US20060233026A1 (en) * 2005-04-01 2006-10-19 Yan Li Method for Non-Volatile Memory with Background Data Latch Caching During Program Operations
US20060233022A1 (en) * 2005-04-01 2006-10-19 Yan Li Non-Volatile Memory with Background Data Latch Caching During Program Operations
US20060239080A1 (en) * 2005-04-01 2006-10-26 Yan Li Method for Non-Volatile Memory with Managed Execution of Cached Data
US20070002626A1 (en) * 2005-04-01 2007-01-04 Yan Li Non-Volatile Memory with Managed Execution of Cached Data
US20070097744A1 (en) * 2005-04-01 2007-05-03 Yan Li Use of Data Latches in Multi-Phase Programming of Non-Volatile Memories
US20060221696A1 (en) * 2005-04-01 2006-10-05 Yan Li Method for Non-Volatile Memory with Background Data Latch Caching During Read Operations
US20100226176A1 (en) * 2005-04-01 2010-09-09 Yan Li Method for Non-Volatile Memory With Background Data Latch Caching During Read Operations
US8036041B2 (en) 2005-04-01 2011-10-11 Sandisk Technologies Inc. Method for non-volatile memory with background data latch caching during read operations
US20060233023A1 (en) * 2005-04-01 2006-10-19 Jason Lin Method for Non-Volatile Memory with Background Data Latch Caching During Erase Operations
US8351269B2 (en) 2005-04-01 2013-01-08 SanDisk Technologies, Inc. Method for non-volatile memory with background data latch caching during read operations
US7733703B2 (en) 2005-04-01 2010-06-08 Sandisk Corporation Method for non-volatile memory with background data latch caching during read operations
US7499320B2 (en) * 2007-03-07 2009-03-03 Sandisk Corporation Non-volatile memory with cache page copy
US20080219059A1 (en) * 2007-03-07 2008-09-11 Yan Li Method for Cache Page Copy in a Non-Volatile Memory
US20080219057A1 (en) * 2007-03-07 2008-09-11 Yan Li Non-Volatile Memory With Cache Page Copy
US7502255B2 (en) * 2007-03-07 2009-03-10 Sandisk Corporation Method for cache page copy in a non-volatile memory
US7961512B2 (en) 2008-03-19 2011-06-14 Sandisk Corporation Adaptive algorithm in cache operation with dynamic data latch requirements
US7986554B2 (en) 2008-03-19 2011-07-26 Sandisk Technologies Inc. Different combinations of wordline order and look-ahead read to improve non-volatile memory performance
US20090237998A1 (en) * 2008-03-19 2009-09-24 Yan Li Adaptive Algorithm in Cache Operation with Dynamic Data Latch Requirements
US20110208905A1 (en) * 2008-12-09 2011-08-25 Rambus Inc. Non-Volatile Memory Device For Concurrent And Pipelined Memory Operations
US8645617B2 (en) * 2008-12-09 2014-02-04 Rambus Inc. Memory device for concurrent and pipelined memory operations
US8472280B2 (en) 2010-12-21 2013-06-25 Sandisk Technologies Inc. Alternate page by page programming scheme

Also Published As

Publication number Publication date
US7486558B2 (en) 2009-02-03
ATE458248T1 (en) 2010-03-15
US20070002626A1 (en) 2007-01-04
US7505320B2 (en) 2009-03-17
JP2008535139A (en) 2008-08-28
WO2006107654A1 (en) 2006-10-12
EP1864289B1 (en) 2010-02-17
US20060233023A1 (en) 2006-10-19
CN101171641A (en) 2008-04-30
US7577037B2 (en) 2009-08-18
DE602006012293D1 (en) 2010-04-01
US7502260B2 (en) 2009-03-10
US8351269B2 (en) 2013-01-08
CN101171641B (en) 2012-07-11
KR20070122208A (en) 2007-12-28
US7936602B2 (en) 2011-05-03
US8036041B2 (en) 2011-10-11
US8705286B2 (en) 2014-04-22
US20060233026A1 (en) 2006-10-19
US20090262578A1 (en) 2009-10-22
US7619922B2 (en) 2009-11-17
US20060233021A1 (en) 2006-10-19
US20060221704A1 (en) 2006-10-05
US7609552B2 (en) 2009-10-27
US20100226176A1 (en) 2010-09-09
US20130121072A1 (en) 2013-05-16
US7733703B2 (en) 2010-06-08
TWI396199B (en) 2013-05-11
TW200701233A (en) 2007-01-01
US20120026791A1 (en) 2012-02-02
US20090067253A1 (en) 2009-03-12
EP1864289A1 (en) 2007-12-12
KR101106977B1 (en) 2012-01-20
JP5038292B2 (en) 2012-10-03
US7206230B2 (en) 2007-04-17
US20060233022A1 (en) 2006-10-19
US20060233010A1 (en) 2006-10-19
US7480181B2 (en) 2009-01-20

Similar Documents

Publication Publication Date Title
US7577037B2 (en) Use of data latches in cache operations of non-volatile memories
US7734861B2 (en) Pseudo random and command driven bit compensation for the cycling effects in flash memory
US7885112B2 (en) Nonvolatile memory and method for on-chip pseudo-randomization of data within a page and between pages
JP4814995B2 (en) Nonvolatile memory and method for performing background caching with data latch during read operation
US7508721B2 (en) Use of data latches in multi-phase programming of non-volatile memories
US7471575B2 (en) Non-volatile memory and method with shared processing for an aggregate of read/write circuits
US7345928B2 (en) Data recovery methods in multi-state memory after program fail
US7420847B2 (en) Multi-state memory having data recovery after program fail
US7606966B2 (en) Methods in a pseudo random and command driven bit compensation for the cycling effects in flash memory
EP2070090B1 (en) Pseudo random and command driven bit compensation for the cycling effects in flash memory and methods therefor
US20130003465A1 (en) Local sensing in a memory device

Legal Events

Date Code Title Description
STCF Information on status: patent grant

Free format text: PATENTED CASE

AS Assignment

Owner name: SANDISK TECHNOLOGIES INC., TEXAS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SANDISK CORPORATION;REEL/FRAME:026369/0225

Effective date: 20110404

FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: SANDISK TECHNOLOGIES LLC, TEXAS

Free format text: CHANGE OF NAME;ASSIGNOR:SANDISK TECHNOLOGIES INC;REEL/FRAME:038809/0472

Effective date: 20160516

FPAY Fee payment

Year of fee payment: 8

FEPP Fee payment procedure

Free format text: 11.5 YR SURCHARGE- LATE PMT W/IN 6 MO, LARGE ENTITY (ORIGINAL EVENT CODE: M1556); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12