Read threshold setting based on soft readout statistics

Information

  • Patent Grant
  • 8694854
  • Patent Number
    8,694,854
  • Date Filed
    Tuesday, August 2, 2011
    15 years ago
  • Date Issued
    Tuesday, April 8, 2014
    12 years ago
Abstract
A method for data storage includes storing data in analog memory cells by programming the memory cells with respective analog input values. After storing the data, respective analog output values are read from the memory cells using multiple read thresholds, which define multiple ranges of the analog output values. Respective numbers of read errors in the data, corresponding to the analog output values falling in the ranges, are assessed. The stored data is recovered based on respective numbers of the read errors assessed in the ranges.
Description
FIELD OF THE INVENTION

The present invention relates generally to memory devices, and particularly to methods and systems for setting read thresholds in non-volatile memory devices.


BACKGROUND OF THE INVENTION

Analog memory cells, such as Flash memory cells, are typically read by comparing the analog cell values to one or more read thresholds. Various techniques for setting and adjusting read thresholds are known in the art. For example, U.S. Pat. No. 5,657,332, whose disclosure is incorporated herein by reference, describes methods for recovering from hard errors in a solid-state memory system. A memory system includes an array of memory cells, each cell capable of having its threshold voltage programmed or erased to an intended level. An error checking scheme is provided for each of a plurality of groups of cells for identifying read errors therein. A read reference level is adjusted before each read operation on the individual group of cells containing read errors, each time the read reference level being displaced a predetermined step from a reference level for normal read, until the error checking means no longer indicates read errors. The drifted threshold voltage of each cell associated with a read error is re-written to its intended level.


U.S. Patent Application Publication 2007/0091677, whose disclosure is incorporated herein by reference, describes techniques for reading data from one or more Flash memory cells, and for recovering from read errors. In some embodiments, in the event of an error correction failure by an error detection and correction module, the Flash memory cells are re-read at least once using one or more modified reference voltages, until successful error correction may be carried out.


U.S. Pat. No. 6,963,505, whose disclosure is incorporated herein by reference, describes methods for determining a reference voltage. In some embodiments, a set of operating reference cells is established to be used in operating cells in a Non-Volatile Memory (NVM) block or array. At least a subset of cells of the NVM block or array may be read using each of two or more sets of test reference cells, where each set of test reference cells may generate or otherwise provide reference voltages at least slightly offset from each other set of test reference cells. For each set of test reference cells used to read at least a subset of the NVM block, a read error rate may be calculated or otherwise determined. A set of test reference cells associated with a relatively low read error rate may be selected as the set of operating reference cells to be used in operating other cells, outside the subset of cells, in the NVM block or array.


U.S. Patent Application Publication 2010/0091535, whose disclosure is incorporated herein by reference, describes various techniques for adjusting read thresholds of analog memory cells. In one of the disclosed techniques, data is encoded with an Error Correction Code (ECC) before it is stored in the memory cells. When retrieving data from the memory cells, the ECC is decoded in order to correct read errors. For a given read error that was corrected by the ECC, the direction of the error, i.e., the programming level with which the read storage value was erroneously associated before applying ECC correction, is determined. Information regarding directions of corrected errors is used for adjusting the read thresholds.


SUMMARY OF THE INVENTION

A method for data storage includes storing data in analog memory cells by programming the memory cells with respective analog input values. After storing the data, respective analog output values are read from the memory cells using multiple read thresholds, which define multiple ranges of the analog output values. Respective numbers of read errors in the data, corresponding to the analog output values falling in the ranges, are assessed. The stored data is recovered based on respective numbers of the read errors assessed in the ranges.


In some embodiments, recovering the stored data includes adjusting at least one of the read thresholds based on the respective numbers of the read errors, and retrieving the data from the memory cells using the adjusted read thresholds. In an embodiment, adjusting the read thresholds includes adapting the read thresholds based on the numbers of the read errors assessed in a first group of the memory cells, and retrieving the data includes reading the data from a second group of the memory cells using the adapted read thresholds.


In another embodiment, adjusting the read thresholds includes adapting the read thresholds based on the numbers of the read errors assessed in given group of the memory cells, and retrieving the data includes reading the data from the given group of the memory cells using the adapted read thresholds. In yet another embodiment, adjusting the read thresholds includes moving the multiple read thresholds while preserving separations between the read thresholds. In still another embodiment, adjusting the read thresholds includes modifying one or more separations between the read thresholds.


In a disclosed embodiment, the method includes holding a mapping that defines multiple sets of the read thresholds depending on one or more parameters related to the analog output values, and adjusting the read thresholds includes estimating the parameters based on the read analog output values, and obtaining the read thresholds from the mapping using the estimated parameters. In an embodiment, adjusting the read thresholds includes modeling readout of the data using a communication channel model, and adapting the read thresholds so as to maximize a capacity of the communication channel model.


In some embodiments, the read thresholds include at least a hard threshold and two soft thresholds on opposite sides of the hard threshold, and the ranges include at least a first range between the hard threshold and one of the soft thresholds, and a second range between the hard threshold and the other of the soft thresholds. In an embodiment, storing the data includes programming each memory cell to a respective one of multiple programming levels, and reading the analog output values includes positioning the multiple read thresholds in a boundary region between a given pair of the programming levels.


In a disclosed embodiment, recovering the stored data includes computing soft decoding metrics based on the respective numbers of the read errors, and decoding an Error Correction Code (ECC) that encodes the stored data using the soft decoding metrics. Recovering the stored data may include computing the soft decoding metrics over a first group of the memory cells, and decoding the ECC that encodes the data stored in a second group of the memory cells.


In another embodiment, storing the data includes encoding the data with an Error Correction Code (ECC), and assessing the numbers of the read errors includes correcting the read errors using the ECC and determining a respective count of the read errors in each range that were corrected by the ECC. In yet another embodiment, storing the data includes programming each memory cell to a respective one of multiple programming levels, and the analog output values corresponding to at least one of the programming levels are distributed in accordance with a non-Gaussian distribution.


There is additionally provided, in accordance with an embodiment of the present invention, a data storage apparatus including an interface and circuitry. The interface is configured to communicate with a memory including analog memory cells. The circuitry is configured to store data in the analog memory cells of the memory by programming the memory cells with respective analog input values, to read, after storing the data, respective analog output values from the memory cells using multiple read thresholds that define multiple ranges of the analog output values, to assess a respective number of read errors in the data corresponding to the analog output values falling in each of the ranges, and to adjust at least one of the read thresholds based on respective numbers of the read errors assessed in the ranges.


There is also provided, in accordance with an embodiment of the present invention, a data storage apparatus including a memory and circuitry. The memory includes analog memory cells. The circuitry is configured to store data in the analog memory cells of the memory by programming the memory cells with respective analog input values, to read, after storing the data, respective analog output values from the memory cells using multiple read thresholds that define multiple ranges of the analog output values, to assess a respective number of read errors in the data corresponding to the analog output values falling in each of the ranges, and to adjust at least one of the read thresholds based on respective numbers of the read errors assessed in the ranges.


There is further provided, in accordance with an embodiment of the present invention, a method for data storage. The method includes storing data in analog memory cells by programming the memory cells with respective analog input values. Multiple read thresholds are set for reading respective analog output values from the memory cells. the read thresholds define multiple ranges of the analog output values and are set such that a respective number of the analog output values occurring in each range matches a respective value. The stored data is retrieved by reading the analog output values from the memory cells using the multiple read thresholds.


In an embodiment, setting the read thresholds includes estimating one or more Cumulative Distribution Functions (CDFs) of the analog output values, and setting the read thresholds based on the estimated CDFs. In a disclosed embodiment, the method includes holding a mapping that defines multiple sets of the read thresholds depending on one or more parameters related to the analog output values, and setting the read thresholds includes estimating the parameters based on the read analog output values, and obtaining the read thresholds from the mapping using the estimated parameters. In another embodiment, setting the read thresholds includes modeling readout of the data using a communication channel model, and adapting the read thresholds so as to maximize a capacity of the communication channel model.


There is also provided, in accordance with an embodiment of the present invention, a data storage apparatus including an interface and circuitry. The interface is configured to communicate with a memory including analog memory cells. The circuitry is configured to store data in the analog memory cells by programming the memory cells with respective analog input values, to set multiple read thresholds for reading respective analog output values from the memory cells, wherein the read thresholds define multiple ranges of the analog output values and are set such that a respective number of the analog output values occurring in each range matches a respective value, and to retrieve the stored data by reading the analog output values from the memory cells using the multiple read thresholds.


There is moreover provided, in accordance with an embodiment of the present invention, a data storage apparatus including a memory and circuitry. The memory includes analog memory cells. The circuitry is configured to store data in the analog memory cells by programming the memory cells with respective analog input values, to set multiple read thresholds for reading respective analog output values from the memory cells, wherein the read thresholds define multiple ranges of the analog output values and are set such that a respective number of the analog output values occurring in each range matches a respective value, and to retrieve the stored data by reading the analog output values from the memory cells using the multiple read thresholds.


There is additionally provided, in accordance with an embodiment of the present invention, a method for data storage including holding a mapping that defines multiple sets of read thresholds for reading analog memory cells depending on one or more parameters related to analog values read from the memory cells. Data is stored in a group of the analog memory cells by programming the memory cells in the group with respective analog input values. After storing the data, respective analog output values are read from the memory cells in the group and the parameters are estimated based on the read analog output values. The read thresholds are set for subsequent readout operations based on the mapping using the estimated parameters.


In some embodiments, the parameters include a variance of a distribution of at least some of the analog output values, a width of the distribution and/or a distance between distributions of subsets of the analog output values.


There is also provided, in accordance with an embodiment of the present invention, a data storage apparatus including an interface and circuitry. The interface is configured to communicate with a memory including analog memory cells. The circuitry is configured to hold a mapping that defines multiple sets of read thresholds for reading analog memory cells depending on one or more parameters related to analog values read from the memory cells, to store data in a group of the analog memory cells by programming the memory cells in the group with respective analog input values, to read, after storing the data, respective analog output values from the memory cells in the group and to estimate the parameters based on the read analog output values, and to set the read thresholds for subsequent readout operations based on the mapping using the estimated parameters.


There is further provided, in accordance with an embodiment of the present invention, a data storage apparatus including a memory and circuitry. The memory includes analog memory cells. The circuitry is configured to hold a mapping that defines multiple sets of read thresholds for reading analog memory cells depending on one or more parameters related to analog values read from the memory cells, to store data in a group of the analog memory cells by programming the memory cells in the group with respective analog input values, to read, after storing the data, respective analog output values from the memory cells in the group and to estimate the parameters based on the read analog output values, and to set the read thresholds for subsequent readout operations based on the mapping using the estimated parameters.


There is furthermore provided, in accordance with an embodiment of the present invention, a method for data storage including storing data in analog memory cells by programming the memory cells with respective analog input values. After storing the data, respective analog output values are read from the memory cells using multiple read thresholds. Readout of the data is modeled using a communication channel model, and the read thresholds are adapted so as to maximize a capacity of the communication channel model.


There is also provided, in accordance with an embodiment of the present invention, a data storage apparatus including an interface and circuitry. The interface is configured to communicate with a memory including analog memory cells. The circuitry is configured to store data in the analog memory cells by programming the memory cells with respective analog input values, to read, after storing the data, respective analog output values from the memory cells using multiple read thresholds, to model readout of the data using a communication channel model, and to adapt the read thresholds so as to maximize a capacity of the communication channel model.


There is additionally provided, in accordance with an embodiment of the present invention, a data storage apparatus including a memory and circuitry. The memory includes analog memory cells. The circuitry is configured to store data in the analog memory cells by programming the memory cells with respective analog input values, to read, after storing the data, respective analog output values from the memory cells using multiple read thresholds, to model readout of the data using a communication channel model, and to adapt the read thresholds so as to maximize a capacity of the communication channel model.


The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram that schematically illustrates a memory system, in accordance with an embodiment of the present invention;



FIG. 2 is a graph showing threshold voltage distributions and read thresholds in a group of analog memory cells, in accordance with an embodiment of the present invention; and



FIG. 3 is a flow chart that schematically illustrates a method for adjusting read thresholds, in accordance with an embodiment of the present invention.





DETAILED DESCRIPTION OF EMBODIMENTS
Overview

In memory devices such as Flash memory, data is stored in analog memory cells by programming the memory cells to respective analog input values that represent the stored bit values. Data is retrieved by comparing respective analog output values of the memory cells to one or more read thresholds. In other words, each bit value corresponds to a respective programming level that is represented by a certain region of analog output values. The relation between the analog output value of a given memory cell and the read thresholds is indicative of the memory cell's programming level, and thus of the data stored in that memory cell. Analog output values may drift over time and may be subject to various types of impairments. Thus, proper setting and adaptation of the read thresholds is important for maintaining low read error probability.


Embodiments of the present invention that are described herein provide improved methods and systems for setting read thresholds used for reading analog memory cells. The disclosed techniques are based on reading the memory cells using multiple read thresholds. The multiple read thresholds are typically all positioned in a boundary region between a given pair of programming levels. Positioning of the read thresholds defines multiple ranges of output values between the thresholds.


In each range, the number of read errors in the data corresponding to the analog output values falling in the range is assessed. In other words, the number of memory cells whose output value falls in the range even though their stored data corresponds to a different range is assessed separately for each range. One or more of the read thresholds are adjusted based on the numbers of read errors assessed for the different output value ranges. In some embodiments, the stored data is encoded with an Error Correction Code (ECC), and the numbers of errors for the different ranges are obtained from the ECC decoding process.


It is possible in principle to perform threshold adaptation based on the number of read errors relative to a single read threshold, e.g., by aiming to equalize the total number of read bits that were corrected by the ECC from “0” to “1” and the total number of bits that were corrected from “1” to “0”. This technique, however, performs well only for certain types of statistical distributions of the output values, and is therefore not valid for all cases.


By considering the number of read errors that occur in multiple different ranges of output values, the disclosed techniques are able to focus on subsets of the read errors that are meaningful for threshold setting. As such, the disclosed techniques perform well under a wide variety of real-life output value distributions, such as various non-Gaussian distributions. One example of such a distribution is caused by “stuck bits,” i.e., memory cells whose output values remain fixed and do not respond to programming.


Several example embodiments that use the disclosed techniques are described herein. Some embodiments use hard ECC decoding and others use soft decoding. In some embodiments, the assessed numbers of errors for the different output value ranges are used to improve initial soft decoding metrics (e.g., Log Likelihood Ratios LLRs) used for soft ECC decoding.


In other embodiments, multiple sets of read thresholds are stored in a Look-Up Table (LUT), and the appropriate set is chosen based on the read output values. Other disclosed techniques adjust the read thresholds such that the absolute number of output values falling in each range of output values matches a respective target number. In other embodiments, the data readout process is modeled in terms of a communication channel, and the read thresholds are adapted so as to maximize the channel capacity.


System Description


FIG. 1 is a block diagram that schematically illustrates a memory system 20, in accordance with an embodiment of the present invention. System 20 can be used in various host systems and devices, such as in computing devices, cellular phones or other communication terminals, removable memory modules (sometimes referred to as “Flash drives”), Solid State Disks (SSD), digital cameras, music and other media players and/or any other system or device in which data is stored and retrieved.


System 20 comprises a memory device 24, which stores data in a memory cell array 28. The memory array comprises multiple analog memory cells 32 that are arranged in word lines 34. In the context of the present patent application and in the claims, the term “analog memory cell” is used to describe any memory cell that holds a continuous, analog value of a physical parameter, such as an electrical voltage or charge. Array 32 may comprise solid-state analog memory cells of any kind, such as, for example, NAND, NOR and Charge Trap Flash (CTF) Flash cells, phase change RAM (PRAM, also referred to as Phase Change Memory—PCM), Nitride Read Only Memory (NROM), Ferroelectric RAM (FRAM), magnetic RAM (MRAM) and/or Dynamic RAM (DRAM) cells. Although the embodiments described herein refer mainly to analog memory, the disclosed techniques may also be used with various other memory types.


The charge levels stored in the cells and/or the analog voltages or currents written into and read out of the cells are referred to herein collectively as analog values, storage values or analog storage values. The analog values written to the memory cells are referred to herein as input analog values, and the analog values read from the memory cells are referred to as analog output values. Although the embodiments described herein mainly address threshold voltages, the methods and systems described herein may be used with any other suitable kind of analog values.


System 20 stores data in the analog memory cells by programming the cells to assume respective memory states, which are also referred to as programming states or programming levels. The programming levels are selected from a finite set of possible levels, and each level corresponds to a certain nominal storage value. For example, a 2 bit/cell MLC can be programmed to assume one of four possible programming levels by writing one of four possible nominal storage values into the cell. The techniques described herein mainly address storage densities of a non-integer number of bits per memory cell, i.e., a number of programming levels per cell that is not an integer power of two.


Memory device 24 comprises a reading/writing (R/W) unit 36, which converts data for storage in the memory device to analog storage values and writes them into memory cells 32. In alternative embodiments, the R/W unit does not perform the conversion, but is provided with voltage samples, i.e., with the storage values for storage in the cells. When reading data out of array 28, R/W unit 36 converts the storage values of memory cells into digital samples having a resolution of one or more bits. Data is typically written to and read from the memory cells in groups that are referred to as pages. In some embodiments, the R/W unit can erase a group of cells 32 by applying one or more negative erasure pulses to the cells.


The storage and retrieval of data in and out of memory device 24 is performed by a memory controller 40. Memory controller 40 comprises an interface 44 for communicating with memory device 24, and a processor 48. The disclosed techniques can be carried out by memory controller 40, by R/W unit 36, or both. Thus, in the present context, memory controller 40 and R/W unit 36 are referred to collectively as circuitry that carries out the disclosed techniques.


Memory controller 40 communicates with a host 52, for accepting data for storage in the memory device and for outputting data retrieved from the memory device. Memory controller 40 may be implemented in hardware, e.g., using one or more Application-Specific Integrated Circuits (ASICs) or Field-Programmable Gate Arrays (FPGAs). Alternatively, the memory controller may comprise a microprocessor that runs suitable software, or a combination of hardware and software elements.


The configuration of FIG. 1 is an example system configuration, which is shown purely for the sake of conceptual clarity. Any other suitable memory system configuration can also be used. For example, although the example of FIG. 1 shows a single memory device, in alternative embodiments memory controller 40 may control multiple memory devices 24. Elements that are not necessary for understanding the principles of the present invention, such as various interfaces, addressing circuits, timing and sequencing circuits and debugging circuits, have been omitted from the figure for clarity.


In the example system configuration shown in FIG. 1, memory device 24 and memory controller 40 are implemented as two separate Integrated Circuits (ICs). In alternative embodiments, however, the memory device and the memory controller may be integrated on separate semiconductor dies in a single Multi-Chip Package (MCP) or System on Chip (SoC), and may be interconnected by an internal bus. Further alternatively, some or all of the memory controller circuitry may reside on the same die on which the memory array is disposed. Further alternatively, some or all of the functionality of memory controller 40 can be implemented in software and carried out by a processor or other element of the host system. In some embodiments, host 52 and memory controller 40 may be fabricated on the same die, or on separate dies in the same device package.


In some embodiments, memory controller 40 comprises a general-purpose processor, which is programmed in software to carry out the functions described herein. The software may be downloaded to the processor in electronic form, over a network, for example, or it may, alternatively or additionally, be provided and/or stored on non-transitory tangible media, such as magnetic, optical, or electronic memory.


In an example configuration of array 28, memory cells 32 are arranged in multiple rows and columns, and each memory cell comprises a floating-gate transistor. The gates of the transistors in each row are connected by word lines 34, and the sources of the transistors in each column are connected by bit lines. In the present context, the term “row” is used in the conventional sense to mean a group of memory cells that are fed by a common word line, and the term “column” means a group of memory cells fed by a common bit line. The terms “row” and “column” do not connote a certain physical orientation of the memory cells relative to the memory device. The memory array is typically divided into multiple memory pages, i.e., groups of memory cells that are programmed and read simultaneously.


In some embodiments, memory pages are sub-divided into sectors. Pages may be mapped to word lines in various manners. Each word line may store one or more pages. A given page may be stored in all the memory cells of a word line, or in a subset of the memory cells (e.g., the odd-order or even-order memory cells).


Erasing of cells is usually carried out in blocks that contain multiple pages. Typical memory devices may comprise thousands of erasure blocks. In a typical two-bit-per-cell MLC device, each erasure block is on the order of 32 word lines, each comprising several tens of thousands of cells. Each word line of such a device is often partitioned into four pages (odd/even order cells, least/most significant bit of the cells). Three-bit-per cell devices having 32 word lines per erasure block would have 192 pages per erasure block, and four-bit-per-cell devices would have 256 pages per block. Alternatively, other block sizes and configurations can also be used. Some memory devices comprise two or more separate memory cell arrays, often referred to as planes. Since each plane has a certain “busy” period between successive write operations, data can be written alternately to the different planes in order to increase programming speed.


Read Threshold Setting Based on Soft Readout Statistics


In some embodiments, memory controller 40 reads a group of memory cells 32, e.g., a word line or part of a word line, using multiple read thresholds. The memory controller decodes the stored data based on the read results, i.e., based on where each cell output value falls relative to the read thresholds. The memory controller sets and adjusts the positions of the read thresholds using methods that are described below.


The description that follows refers to a specific embodiment involving two programming levels and three read thresholds. The disclosed techniques, however, are in no way limited to this embodiment, and can be generalized in a straightforward manner to any desired number of programming levels and read thresholds. For ease of explanation, the description that follows refers to the disclosed techniques as being carried out by memory controller 40. In alternative embodiments, however, these techniques can be carried out by R/W unit 36 in the memory device, or jointly by the R/W unit and the memory controller.



FIG. 2 is a graph showing threshold voltage distributions and read thresholds in a group of analog memory cells, in accordance with an embodiment of the present invention. In the present example, the memory cells are programmed to two programming levels corresponding to “1” and “0” bit values, respectively. Because of various impairments and inaccuracies, the threshold voltages (VTH) of the memory cells programmed with “1” are distributed in accordance with a distribution 60A, and the threshold voltages of the memory cells programmed with “0” are distributed in accordance with a distribution 60B. Note that, as shown in the figure, the threshold voltage distributions are not necessarily Gaussian or even symmetric, and are not necessarily similar to one another. Moreover, the memory cells are not necessarily divided evenly between the programming levels.


The stored data is encoded prior to storage with an Error Correction Code (ECC), such as a Bose-Chaudhuri-Hocquenghem (BCH) code, a Low-Density Parity Check (LDPC) code or any other suitable ECC. In some embodiments, the memory controller decodes the ECC in a hard decoding process, i.e., based on a binary input for each bit. In alternative embodiments, the memory controller decodes the ECC in a soft decoding process, based on soft decoding metrics (e.g., Log Likelihood Ratios—LLRs) that are computed for the bits.


Memory controller 40 retrieves the data from the group of memory cells by setting (using R/W unit 36) one or more read thresholds, and comparing the threshold voltages of the memory cells to the read thresholds. In the present example, memory controller 40 sets a total of three thresholds—A hard threshold 64 and two soft thresholds 68A and 68B on opposite sides of the hard threshold. All three thresholds are positioned in the boundary region between the two programming levels in question.


Consider, for example, a hard readout process in which the memory controller reads any memory cell whose threshold voltage is smaller than hard threshold 64 as holding “1”, and any memory cell whose threshold voltage is larger than hard threshold 64 as holding “0”. In this process, the memory cells that belong to distribution 60A but whose VTH is larger than threshold 64 will be read erroneously as holding “0”. Similarly, the memory cells that belong to distribution 60B but whose VTH is smaller than threshold 64 will be read erroneously as holding “1”. As can be seen in the figure, proper positioning of threshold 64 is important for maintaining low error probability.


In some embodiments, memory controller 40 adjusts the position of hard threshold 64 using the following process: The memory controller reads the memory cells using all three read thresholds (hard threshold 64 and soft thresholds 68A and 68B). The three thresholds define two finite ranges (intervals) 72A and 72B of threshold voltages that fall between the thresholds. For each of the two ranges (intervals 72A and 72B), the memory controller assesses the number of read errors occurring in the range.


The assessed numbers of errors are illustrated graphically in FIG. 2: A shaded region 76A corresponds to the memory cells that belong to distribution 60B and whose VTH falls between thresholds 64 and 68A. Thus, the area of region 76A is indicative of the number of read errors occurring in interval 72A. Similarly, a shaded region 76B corresponds to the memory cells belonging to distribution 60A and whose VTH falls between thresholds 64 and 68B. The area of region 76A is thus indicative of the number of read errors occurring in interval 72B.


In some embodiments, memory controller 40 adjusts the position of hard threshold 64 based on the number of read errors falling in intervals 72A and 72B. Typically, the memory controller adjusts thresholds 64 so as to equalize these two numbers. In other words, if the number of read errors in interval 72A is greater than the number or read errors in interval 72B, the memory controller decreases threshold 64 (i.e., moves it to the left). If the number of read errors in interval 72A is smaller than the number or read errors in interval 72B, the memory controller increases threshold 64. Soft thresholds 68A and 68B are typically adjusted together with threshold 64, so as to maintain the separations between the thresholds.


In some embodiments, the numbers of read errors are used for deciding on the direction in which the threshold is to be adjusted, but the amount of adjustment is set regardless of these numbers (e.g., at fixed or predefined increments). In other embodiments, the memory controller sets the size of the adjustment based on the numbers of read errors, e.g., based on the ratio between the numbers.


In the disclosed technique, the threshold is adjusted based on the numbers of errors that occur in close proximity to the threshold. This choice is in contrast to basing the adjustment on the total numbers of read errors (the total number of memory cells in distribution 60A whose VTH falls above threshold 64, and the total number of memory cells in distribution 60B whose VTH falls below threshold 64). As a result, the threshold adjustment process is not sensitive to the actual shapes of distributions 60A and 60B.


Typically, within each interval (e.g., 72A or 72B) the VTH distribution is approximately Gaussian, and therefore the direction and size of the read threshold adjustment can be computed with high accuracy and reliability.


For example, in some scenarios, a number of memory cells are stuck at certain threshold voltages regardless of programming. These stuck threshold voltages are, with high probability, not in the vicinity of hard threshold 64. This phenomenon is sometimes referred to as “stuck cells” or “stuck bits.” Such stuck memory cells typically distort the shapes of the VTH distributions and cause them to deviate from Gaussian. Therefore, the correct adjustment of threshold 64 is by equalizing the total number of read errors while ignoring the “stuck cells.” The disclosed technique overcomes the distorting effect of stuck memory cells, since it considers only the read errors that occur in proximity to the hard read threshold.


Generally, considering the numbers of read errors in finite intervals that are close to the read thresholds makes the disclosed technique highly robust and performs well regardless of the actual VTH distributions.


Memory controller 40 may assess the numbers of read errors in the various VTH ranges (e.g., in intervals 72A and 72B) using any suitable method. In some embodiments, the ECC decoding process in the memory controller is able to output the number of corrected read errors (“0” to “1”, and “1” to “0”) for each interval separately. Alternatively, any other suitable method can be used for assessing the numbers of read errors in the various VTH ranges.



FIG. 3 is a flow chart that schematically illustrates a method for adjusting read thresholds, in accordance with an embodiment of the present invention. The method begins with memory controller 40 initializing hard threshold 64 and soft thresholds 68A and 68B to some initial positions, at an initialization step 80. The memory controller then reads a group of memory cells using the three read thresholds, at a readout step 84. The memory controller decodes the ECC, at an ECC decoding step 88. ECC decoding may be hard (i.e., based on the read results of threshold 64) or soft (i.e., based on the read results of thresholds 64, 68A and 68B).


Memory controller 40 then assesses the number of read errors for each of intervals 72A and 72B between the read thresholds, at an error assessment step 92. For example, the memory controller may compare the data before and after ECC correction, or accept from the ECC decoding process a respective count of the corrected errors for each interval. In the example of FIG. 2, the memory controller assesses the number of “0”→“1” errors in interval 72A, and the number of “1”→“0” errors in interval 72B. The memory controller adjusts one or more of the read thresholds based on the numbers of read errors assessed for the different intervals, at a threshold adjustment step 96.


In some of the disclosed embodiments, the memory controller assesses the number of errors based on outputs from the ECC decoding process following successful ECC decoding. In practice, however, ECC decoding may sometimes fail. In such cases, the memory controller may attempt ECC decoding on another group of memory cells (either in the same word line or in a different word line), estimate the read threshold positions on that group, and use the resulting read threshold for reading the memory cells for which ECC decoding has failed. The disclosed techniques can be used for adapting the read thresholds and performing data readout using the adapted read thresholds on the same group of memory cells, or for adapting the read thresholds on one group of memory cells and performing data readout using the adapted read thresholds on a different group of memory cells.


The embodiment of FIGS. 2 and 3 above refers to a readout scheme that differentiates between two programming levels using three read thresholds that define a total of four output value intervals: two finite intervals 72A and 72B, an infinite interval below threshold 68A and an infinite interval above threshold 68B. The disclosed technique adapts the read thresholds based on the number of errors occurring in the two finite intervals 72A and 72B. In alternative embodiments, the disclosed technique can be used with any desired number of read thresholds and intervals, such as a scheme that uses five read thresholds defining a total of six intervals.


The memory controller may set the separations of the soft thresholds from the hard threshold (i.e., the sizes of intervals 72A and 72B) based on any suitable criterion. In some embodiments, the separations are fixed and predetermined. In some embodiments, the memory controller sets the separations based on the VTH distributions, e.g., based on the Cumulative Distribution Function (CDF) of the VTH distributions.


In an example embodiment, the memory controller sets the separation of a given soft threshold such that a predefined percentage of the memory cells will have VTH that falls between this soft threshold and the hard threshold. The memory controller may adapt the size of intervals 72A and 72B in accordance with such a criterion. When using this criterion, the separation between the hard threshold and a soft threshold typically changes according to the quality of the memory media (e.g., from start-of-life to end-of-life).


In some embodiments, the memory controller sets the read thresholds such that the absolute number of memory cells in intervals 72A and 72B will match a pre-defined target number. These techniques are particularly useful when ECC decoding fails and the actual numbers of errors are unknown. In some of these embodiments, the memory controller may set the read thresholds without prior knowledge of the VTH distribution CDF, by explicitly setting the number of memory cells in the intervals.


Alternatively, if the CDF or its approximation is known in advance, the CDF can be used to decide how many cells should be included in intervals 72A and 72B such that most of the read errors will occur in the intervals. In these embodiments, the memory controller sets the numbers of memory cells in intervals 72A and 72B according to the CDF, and the read thresholds are set to meet these numbers during data readout. This setting can be performed without a need to know where the errors occur, e.g., without a need for successful ECC decoding.


In some embodiments, the memory controller may hold a set of multiple CDFs, for example CDFs typical of start-of-life and end-of-life conditions, CDFs typical of cycling at various levels, CDFs typical of combined cycling and retention, or any other suitable CDFs. The memory controller may choose the appropriate CDF from the set using side information (e.g. the number of programming and erasure cycles applied to the memory cells). Alternatively, the memory controller may estimate which CDF to use based on the data (e.g. according to the width or standard deviation of the VTH distribution), or apply a worst-case CDF in all cases.


Using Soft Readout Statistics to Set the Spacing Between Soft Read Thresholds

In some embodiments, memory controller 40 decodes the ECC in a soft decoding process. Typically, each read bit is assigned a respective soft metric, and the memory controller decodes the ECC based on the soft metrics. Each soft metric indicates the confidence of the respective bit being “1” or “0”. The embodiments described herein refer mainly to LLRs, but the disclosed techniques can be used with any other suitable kind of soft metrics.


In an example embodiment, the memory controller assigns the soft metric to a given read bit depending on the interval in which the corresponding output value (VTH) falls. In the embodiment of FIG. 2, for example, the memory controller typically assigns high soft metrics to the memory cells as follows:
















Cell VTH location
Assigned LLR









In interval 72A
“1” with small confidence



In interval 72B
“0” with small confidence



Below read threshold 68A
“1” with high confidence



(below interval 72A)




Above read threshold 68B
“0” with high confidence



(above interval 72B)










In this scheme, memory cells whose VTH is far from the read thresholds are assigned high confidence, since they are unlikely to cause read errors. Memory cells whose VTH is close to the read thresholds are assigned low confidence, since they are more likely to cause read errors.


In some embodiments, memory controller 40 adjusts the separation between the read thresholds (e.g., the distance between the hard threshold and each of the soft thresholds) based on the number of read errors assessed for each interval. In the embodiment of FIG. 2, for example, it is typically desirable that most of the read errors will occur within intervals 72A and 72B, and only few errors would occur outside these intervals. This sort of setting would yield high-performance soft decoding.


In an example embodiment, memory controller 40 adjusts the separation between hard threshold 64 and soft threshold 68A so that most of the read errors will occur within interval 72A. The memory controller may check this condition, for example, by comparing the number of errors within interval 72A to the total number of read errors occurring below threshold 64. A similar process may be carried out for threshold 68B and interval 72B, or jointly for both thresholds 68A and 68B. As another example, the memory controller may use additional soft read thresholds and additional ranges (not shown in FIG. 2) in order to assess the number of errors falling outside intervals 72A and 72B.


The memory controller may use any suitable criterion for adjusting the separation between a given soft threshold and the hard threshold, based on the number of read errors occurring in the VTH interval between these thresholds (e.g., adapt the size of interval 72A based on the number of errors occurring in this interval). In an example embodiment, the memory controller adapts the separation such that the number of errors in the interval reaches a desired value. As another example, the memory controller may adapt the separation such that a ratio between the number of errors and the number of memory cells in the interval reaches a desired value. This condition is substantially equivalent to setting a constant LLR for the memory cells in the interval.


In some embodiments, the memory controller holds a mapping, e.g., Look-Up Table (LUT), of definitions of optimal read threshold positions that are calculated using the disclosed techniques. In one example embodiment, the table is addressed by the distance between the programming level VTH distributions and by the variance of the VTH distribution. In other embodiments, the LUT can be accessed by the distance between the programming level VTH distributions, the variance of the VTH distribution, the width of the VTH distribution (i.e., the size of the interval containing X % of the analog values belonging to the distribution, e.g., 99.9%), any suitable combination of these parameters and/or any other suitable parameter of the analog values.


The memory controller estimates the distance between levels and the distribution variance, and accesses the LUT with these values to obtain the optimal read threshold setting. The LUT is typically prepared in advance based on an assumed VTH distribution model, which depends on a relatively small number of VTH parameters (such as the VTH distribution variance and distance between programming levels). During readout, the VTH parameters are estimated from the read data and used for accessing the LUT to estimate the thresholds. In an alternative embodiment, the LUT holds only the separations between the read thresholds, and the hard threshold is estimated using other methods.


In an example embodiment, the memory controller may use the variance of the VTH distribution as input to the LUT, in order to obtain the separation between the hard threshold and the soft thresholds (without having to count the number of read errors or the absolute number of memory cells per interval). In another embodiment, the memory controller may start with an initial threshold separation, count the number of errors or absolute number of cells per interval, and use the LUT to obtain the optimal threshold separation. Further alternatively, the memory controller may adapt the read threshold positions based on the definitions in the LUT, and in particular the separation between read thresholds, in any other suitable manner.


Generally, the above-described technique is not limited to LUTs. The memory controller may hold any suitable kind of mapping that defines multiple sets of read threshold values depending on one or more parameters related to the analog output values (e.g., VTH) read from the memory cells. Alternatively to LUT, the mapping may comprise, for example, an analytical function. The mapping may define the read thresholds in various ways. For example, the mapping may give the absolute positions of the read thresholds, or the separations between them. In the latter case, the absolute position of at least one of the read thresholds may be calculated using other suitable methods.


In alternative embodiments, the threshold setting problem can be modeled in terms of maximizing communication channel capacity. In these embodiments, the memory is modeled as a communication channel: The input to the channel corresponds to the bits programmed into a memory cell, and the channel output corresponds to the analog output values (e.g., VTH) of the memory cell, quantized according to the read thresholds. For example, for three read thresholds, the channel output comprises one of four possible intervals in which the memory cell VTH may fall. For such a channel, given the VTH distribution shape, the channel capacity can be calculated. (The capacity in this case is typically defined as the maximum number of bits that can be stored in a memory cell such that there exists a readout algorithm that enables to read the data with error probability as low as desired.) Capacity is typically calculated as a function of the positions (or separation) of the read thresholds, and the position that maximizes capacity is chosen.


In the example of FIG. 2, the channel in question has two inputs (read bit value being “1” or “0”) and four outputs (cell output value falling below threshold 68A, between thresholds 68A and 64, between thresholds 64 and 68B, or above threshold 68B). For a given VTH distribution, the channel capacity can be computed as a function of the soft threshold positions. In some embodiments, the memory controller adapts the read threshold positions so as to maximize the channel capacity.


In an example embodiment, the memory controller may set the separation such that the resulting capacity will be maximized, without having to count the number of errors or the absolute number of cells per interval. In another embodiment, the memory controller may try several read threshold separations (or read threshold positions), count the number of errors (or absolute number of cells) per interval, and deduce the read threshold positions that maximize channel capacity based on this information. Further alternatively, the memory controller may adapt the read threshold positions based on maximizing channel capacity in any other suitable manner.


In some embodiments, memory controller 40 may carry out a readout process that combines soft decoding and cancellation of interference from neighboring memory cells. Processes of this sort are described, for example, in U.S. Patent Application Publication 2009/0024905, whose disclosure is incorporated herein by reference. For example, the memory controller may read neighboring cells, estimate their impact on a certain target cell, and compensate for this impact when recovering the data from the target cell.


Any of the techniques described herein, e.g., the techniques that set the read thresholds based on the number of read errors or the number of memory cells per interval, may take into account the interference coefficients when determining the read threshold positions. The interference coefficient may be estimated from the read data, or they may be known in advance.


When the memory controller carries out interference cancellation, the number of read errors per interval (which are used for estimating the read thresholds) can be defined as the total number of errors, e.g., as counted by comparing the correct data with the original data, as read with the hard threshold. Alternatively, the number of read errors per interval can be defined as the number of read errors after the interference is taken into account. In other words, if the interference cancellation process changes the hard bit value of a given memory cell, then the changed bit value can be used as reference and not the original bit read with the hard threshold.


Using Soft Readout Statistics to Improve Initial LLR'S

When the memory controller uses a soft ECC decoding process, each bit is assigned an initial LLR (or other soft metric) that indicates the confidence of this bit being “0” or “1”. In some embodiments, the memory controller assigns for each soft interval a predefined initial LLR value. However, the initial LLRs that maximize the probability of successful decoding may vary according to the VTH distribution. Thus, the memory controller can adjust the initial LLRs based on the numbers of read errors assessed for the various VTH intervals to improve the initial LLRs to be used in subsequent read operations. For example, after successful ECC decoding, the memory controller may compute an “empirical LLR” for each VTH interval.


The empirical LLR of a given VTH interval indicates, based on past results, the empirical probability of a cell whose VTH falls in this interval being “1” or “0”. In an embodiment, memory controller 40 computes the empirical LLR of a given VTH interval based on the number of correct bits and the number of errors occurring in that interval. These numbers are typically obtained from the ECC decoding process. The empirical LLRs can be used as initial LLRs in subsequent readout operations, so as to improve decoding performance.


It will be appreciated that the embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and sub-combinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art. Documents incorporated by reference in the present patent application are to be considered an integral part of the application except that to the extent any terms are defined in these incorporated documents in a manner that conflicts with the definitions made explicitly or implicitly in the present specification, only the definitions in the present specification should be considered.

Claims
  • 1. A method for data storage, comprising: storing data in memory cells;after storing the data, reading the memory cells using multiple read thresholds to produce respective output values, wherein the multiple read thresholds define multiple ranges of the output values;assessing a number of read errors in the data corresponding to the output values included in each of the ranges, wherein the output values of the data included in each of the ranges are bounded by read thresholds of the multiple read thresholds associated with each range; andrecovering the stored data based on the number of read errors assessed in each of the ranges.
  • 2. The method according to claim 1, wherein recovering the stored data comprises adjusting at least one of the read thresholds based on the number of read errors in at least one of the ranges, and retrieving the data from the memory cells using the adjusted read thresholds.
  • 3. The method according to claim 2, wherein adjusting the read thresholds comprises adapting the read thresholds based on the number of read errors in at least one of the ranges assessed in a first group of the memory cells, and wherein retrieving the data comprises reading the data from a second group of the memory cells using the adapted read thresholds.
  • 4. The method according to claim 2, wherein adjusting the read thresholds comprises adapting the read thresholds based on the number of read errors in at least one of the ranges assessed in a given group of the memory cells, and wherein retrieving the data comprises reading the data from the given group of the memory cells using the adapted read thresholds.
  • 5. The method according to claim 2, wherein adjusting the read thresholds comprises moving the multiple read thresholds while maintaining separations between the read thresholds.
  • 6. The method according to claim 2, wherein adjusting the read thresholds comprises modifying one or more separations between the read thresholds.
  • 7. The method according to claim 2, further comprising using a look-up table that maps multiple sets of the read thresholds to one or more parameters related to the output values, wherein adjusting the read thresholds comprises estimating the parameters based on the read output values, and obtaining the read thresholds from the look-up table using the estimated parameters.
  • 8. The method according to claim 1, wherein the read thresholds comprise at least a hard threshold and two soft thresholds on opposite sides of the hard threshold, and wherein the ranges comprise at least a first range between the hard threshold and one of the soft thresholds, and a second range between the hard threshold and the other of the soft thresholds.
  • 9. The method according to claim 1, wherein storing the data comprises programming each memory cell to a respective one of multiple programming levels, and wherein reading the analog output values comprises positioning the multiple read thresholds in a boundary region between a given pair of the programming levels.
  • 10. The method according to claim 1, wherein recovering the stored data comprises computing soft decoding metrics based on the number of read errors in at least one of the ranges, and decoding an Error Correction Code (ECC) that encodes the stored data using the soft decoding metrics.
  • 11. The method according to claim 10, wherein recovering the stored data comprises computing the soft decoding metrics over a first group of the memory cells, and decoding the ECC that encodes the data stored in a second group of the memory cells.
  • 12. The method according to claim 1, wherein storing the data comprises encoding the data with an Error Correction Code (ECC), and wherein assessing the number of read errors in each range comprises correcting the read errors using the ECC and determining a respective count of the read errors in each range that were corrected by the ECC.
  • 13. The method according to claim 1, wherein storing the data comprises programming each memory cell to a respective one of multiple programming levels, and wherein the output values corresponding to at least one of the programming levels are distributed in accordance with a non-Gaussian distribution.
  • 14. A data storage apparatus, comprising: an interface configured to communicate with a memory, wherein the memory includes a plurality of memory cells; andcircuitry configured to: store data in the memory cells of the memory;read, after storing the data, the memory cells using multiple read thresholds to produce respective output values of the data, wherein the multiple read thresholds define multiple ranges of the output values;assess a number of read errors in the data corresponding to the output values included in each of the ranges, wherein the output values of the data included in each of the ranges are bounded by associated read thresholds; andrecover the stored data based on the number of the read errors assessed in each of the ranges.
  • 15. The apparatus according to claim 14, wherein to recover the stored data, the circuitry is further configured to adjust at least one of the read thresholds based on the number of read errors in at least one of the ranges, and retrieving the data from the memory cells using the adjusted read thresholds.
  • 16. The apparatus according to claim 15, wherein the circuitry is further configured to adjust the read thresholds based on the number of read errors in at least one of the ranges assessed in a first group of the memory cells, and to retrieve the data from a second group of the memory cells using the adjusted read thresholds.
  • 17. The apparatus according to claim 15, wherein the circuitry is further configured to adjust the read thresholds based on the number of read errors in at least one of the ranges assessed in given group of the memory cells, and to retrieve the data from the given group of the memory cells using the adjusted read thresholds.
  • 18. The apparatus according to claim 15, wherein the circuitry is further configured to move the multiple read thresholds while maintaining separations between the read thresholds.
  • 19. The apparatus according to claim 15, wherein the circuitry is further configured to modify one or more separations between the read thresholds.
  • 20. The apparatus according to claim 15, wherein the circuitry is further configured use a look-up table that maps multiple sets of read thresholds to one or more parameters related to the output values, and to adjust the read thresholds by estimating the parameters based on the read output values, and obtaining the read thresholds from the look-up table using the estimated parameters.
  • 21. The apparatus according to claim 14, wherein the read thresholds comprise at least a hard threshold and two soft thresholds on opposite sides of the hard threshold, and wherein the ranges comprise at least a first range between the hard threshold and one of the soft thresholds, and a second range between the hard threshold and the other of the soft thresholds.
  • 22. The apparatus according to claim 14, wherein the circuitry is further configured to program each memory cell to a respective one of multiple programming levels, and to position the multiple read thresholds in a boundary region between a given pair of the programming levels.
  • 23. The apparatus according to claim 14, wherein the circuitry is further configured to recover the stored data by computing soft decoding metrics based on the number of read errors in at least one of the ranges, and decoding an Error Correction Code (ECC) that encodes the stored data using the soft decoding metrics.
  • 24. The apparatus according to claim 23, wherein the circuitry is further configured to compute the soft decoding metrics over a first group of the memory cells, and to decode the ECC that encodes the data stored in a second group of the memory cells.
  • 25. The apparatus according to claim 14, wherein the circuitry is further configured to encode the stored data with an Error Correction Code (ECC), and to assess the number of read errors in each range by correcting the read errors using the ECC and determining a respective count of the read errors in each range that were corrected by the ECC.
  • 26. The apparatus according to claim 14, wherein the circuitry is further configured to program each memory cell to a respective one of multiple programming levels, and wherein the output values corresponding to at least one of the programming levels are distributed in accordance with a non-Gaussian distribution.
  • 27. A data storage apparatus, comprising: a memory comprising a plurality of memory cells; andcircuitry configured to: store data in the memory cells of the memory;read, after storing the data, the memory cells using multiple read thresholds to produce respective output values of the data, wherein the multiple read thresholds define multiple ranges of the output values;assess a number of read errors in the data corresponding to the output values included in each of the ranges, wherein the output values of the data included in each of the ranges are bounded by associated read thresholds; andadjust at least one of the read thresholds based on the number of read errors assessed in each of the ranges.
  • 28. A method for data storage, comprising: storing data in analog memory cells by programming the memory cells with respective analog input values;setting multiple read thresholds for reading respective analog output values from the memory cells, wherein the read thresholds define multiple ranges of the analog output values and are set such that a respective number of the analog output values occurring in each range matches a respective value; andretrieving the stored data by reading the analog output values from the memory cells using the multiple read thresholds.
  • 29. The method according to claim 28, wherein setting the read thresholds comprises estimating one or more Cumulative Distribution Functions (CDFs) of the analog output values, and setting the read thresholds based on the estimated CDFs.
  • 30. The method according to claim 28, and comprising holding a mapping that defines multiple sets of the read thresholds depending on one or more parameters related to the analog output values, wherein setting the read thresholds comprises estimating the parameters based on the read analog output values, and obtaining the read thresholds from the mapping using the estimated parameters.
  • 31. A data storage apparatus, comprising: an interface, which is configured to communicate with a memory comprising analog memory cells; andcircuitry, which is configured to store data in the analog memory cells by programming the memory cells with respective analog input values, to set multiple read thresholds for reading respective analog output values from the memory cells, wherein the read thresholds define multiple ranges of the analog output values and are set such that a respective number of the analog output values occurring in each range matches a respective value, and to retrieve the stored data by reading the analog output values from the memory cells using the multiple read thresholds.
  • 32. The apparatus according to claim 31, wherein the circuitry is configured to estimate one or more Cumulative Distribution Functions (CDFs) of the analog output values, and to set the read thresholds based on the estimated CDFs.
  • 33. The apparatus according to claim 31, wherein the circuitry is configured to hold a mapping that defines multiple sets of the read thresholds depending on one or more parameters related to the analog output values, and to set the read thresholds by estimating the parameters based on the read analog output values, and obtaining the read thresholds from the mapping using the estimated parameters.
  • 34. A data storage apparatus, comprising: a memory comprising analog memory cells; andcircuitry, which is configured to store data in the analog memory cells by programming the memory cells with respective analog input values, to set multiple read thresholds for reading respective analog output values from the memory cells, wherein the read thresholds define multiple ranges of the analog output values and are set such that a respective number of the analog output values occurring in each range matches a respective value, and to retrieve the stored data by reading the analog output values from the memory cells using the multiple read thresholds.
  • 35. A method for data storage, comprising: using a look-up table that maps multiple sets of read thresholds for reading memory cells to one or more parameters related to values read from the memory cells;storing data in a group of the analog memory cells;after storing the data, reading respective output values from the memory cells in the group and estimating the parameters based on the read output values; andsetting the read thresholds for subsequent read operations dependent upon the look-up table, using the estimated parameters.
  • 36. The method according to claim 35, wherein the parameters comprise at least one parameter type selected from a group of types consisting of a variance of a distribution of at least some of the output values, a width of the distribution of at least some of the output values, and a distance between distributions of subsets of the output values.
  • 37. A data storage apparatus, comprising: an interface, which is configured to communicate with a memory comprising analog memory cells; andcircuitry, which is configured to hold a mapping that defines multiple sets of read thresholds for reading analog memory cells depending on one or more parameters related to analog values read from the memory cells, to store data in a group of the analog memory cells by programming the memory cells in the group with respective analog input values, to read, after storing the data, respective analog output values from the memory cells in the group and to estimate the parameters based on the read analog output values, and to set the read thresholds for subsequent readout operations based on the mapping using the estimated parameters.
  • 38. The apparatus according to claim 37, wherein the parameters comprise at least one parameter type selected from a group of types consisting of a variance of a distribution of at least some of the analog output values, a width of the distribution and a distance between distributions of subsets of the analog output values.
  • 39. A data storage apparatus, comprising: a memory comprising analog memory cells; andcircuitry, which is configured to hold a mapping that defines multiple sets of read thresholds for reading analog memory cells depending on one or more parameters related to analog values read from the memory cells, to store data in a group of the analog memory cells by programming the memory cells in the group with respective analog input values, to read, after storing the data, respective analog output values from the memory cells in the group and to estimate the parameters based on the read analog output values, and to set the read thresholds for subsequent readout operations based on the mapping using the estimated parameters.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Patent Application 61/374,377, filed Aug. 17, 2010, whose disclosure is incorporated herein by reference.

US Referenced Citations (577)
Number Name Date Kind
3668631 Griffith et al. Jun 1972 A
3668632 Oldham Jun 1972 A
4058851 Scheuneman Nov 1977 A
4112502 Scheuneman Sep 1978 A
4394763 Nagano et al. Jul 1983 A
4413339 Riggle et al. Nov 1983 A
4556961 Iwahashi et al. Dec 1985 A
4558431 Satoh Dec 1985 A
4608687 Dutton Aug 1986 A
4654847 Dutton Mar 1987 A
4661929 Aoki et al. Apr 1987 A
4768171 Tada Aug 1988 A
4811285 Walker et al. Mar 1989 A
4899342 Potter et al. Feb 1990 A
4910706 Hyatt Mar 1990 A
4993029 Galbraith et al. Feb 1991 A
5056089 Furuta et al. Oct 1991 A
5077722 Geist et al. Dec 1991 A
5126808 Montalvo et al. Jun 1992 A
5163021 Mehrotra et al. Nov 1992 A
5172338 Mehrotra et al. Dec 1992 A
5182558 Mayo Jan 1993 A
5182752 DeRoo et al. Jan 1993 A
5191584 Anderson Mar 1993 A
5200959 Gross et al. Apr 1993 A
5237535 Mielke et al. Aug 1993 A
5272669 Samachisa et al. Dec 1993 A
5276649 Hoshita et al. Jan 1994 A
5287469 Tsuboi Feb 1994 A
5365484 Cleveland et al. Nov 1994 A
5388064 Khan Feb 1995 A
5416646 Shirai May 1995 A
5416782 Wells et al. May 1995 A
5446854 Khalidi et al. Aug 1995 A
5450424 Okugaki et al. Sep 1995 A
5469444 Endoh et al. Nov 1995 A
5473753 Wells et al. Dec 1995 A
5479170 Cauwenberghs et al. Dec 1995 A
5508958 Fazio et al. Apr 1996 A
5519831 Holzhammer May 1996 A
5532962 Auclair et al. Jul 1996 A
5533190 Binford et al. Jul 1996 A
5541886 Hasbun Jul 1996 A
5600677 Citta et al. Feb 1997 A
5638320 Wong et al. Jun 1997 A
5657332 Auclair et al. Aug 1997 A
5675540 Roohparvar Oct 1997 A
5682352 Wong et al. Oct 1997 A
5687114 Khan Nov 1997 A
5696717 Koh Dec 1997 A
5726649 Tamaru et al. Mar 1998 A
5726934 Tran et al. Mar 1998 A
5742752 De Koning Apr 1998 A
5748533 Dunlap et al. May 1998 A
5748534 Dunlap et al. May 1998 A
5751637 Chen et al. May 1998 A
5761402 Kaneda et al. Jun 1998 A
5798966 Keeney Aug 1998 A
5799200 Brant et al. Aug 1998 A
5801985 Roohparvar et al. Sep 1998 A
5838832 Barnsley Nov 1998 A
5860106 Domen et al. Jan 1999 A
5867114 Barbir Feb 1999 A
5867428 Ishii et al. Feb 1999 A
5867429 Chen et al. Feb 1999 A
5877986 Harari et al. Mar 1999 A
5889937 Tamagawa Mar 1999 A
5901089 Korsh et al. May 1999 A
5909449 So et al. Jun 1999 A
5912906 Wu et al. Jun 1999 A
5930167 Lee et al. Jul 1999 A
5937424 Leak et al. Aug 1999 A
5942004 Cappelletti Aug 1999 A
5946716 Karp et al. Aug 1999 A
5969986 Wong et al. Oct 1999 A
5982668 Ishii et al. Nov 1999 A
5991517 Harari et al. Nov 1999 A
5995417 Chen et al. Nov 1999 A
6009014 Hollmer et al. Dec 1999 A
6009016 Ishii et al. Dec 1999 A
6023425 Ishii et al. Feb 2000 A
6034891 Norman Mar 2000 A
6040993 Chen et al. Mar 2000 A
6041430 Yamauchi Mar 2000 A
6073204 Lakhani et al. Jun 2000 A
6101614 Gonzales et al. Aug 2000 A
6128237 Shirley et al. Oct 2000 A
6134140 Tanaka et al. Oct 2000 A
6134143 Norman Oct 2000 A
6134631 Jennings Oct 2000 A
6141261 Patti Oct 2000 A
6151246 So et al. Nov 2000 A
6157573 Ishii et al. Dec 2000 A
6166962 Chen et al. Dec 2000 A
6169691 Pasotti et al. Jan 2001 B1
6178466 Gilbertson et al. Jan 2001 B1
6185134 Tanaka et al. Feb 2001 B1
6209113 Roohparvar Mar 2001 B1
6212654 Lou et al. Apr 2001 B1
6219276 Parker Apr 2001 B1
6219447 Lee et al. Apr 2001 B1
6222762 Guterman et al. Apr 2001 B1
6230233 Lofgren et al. May 2001 B1
6240458 Gilbertson May 2001 B1
6259627 Wong Jul 2001 B1
6275419 Guterman et al. Aug 2001 B1
6278632 Chevallier Aug 2001 B1
6279069 Robinson et al. Aug 2001 B1
6288944 Kawamura Sep 2001 B1
6292394 Cohen et al. Sep 2001 B1
6301151 Engh et al. Oct 2001 B1
6304486 Yano Oct 2001 B1
6307776 So et al. Oct 2001 B1
6314044 Sasaki et al. Nov 2001 B1
6317363 Guterman et al. Nov 2001 B1
6317364 Guterman et al. Nov 2001 B1
6345004 Omura et al. Feb 2002 B1
6360346 Miyauchi et al. Mar 2002 B1
6363008 Wong Mar 2002 B1
6363454 Lakhani et al. Mar 2002 B1
6366496 Torelli et al. Apr 2002 B1
6385092 Ishii et al. May 2002 B1
6392932 Ishii et al. May 2002 B1
6396742 Korsh et al. May 2002 B1
6397364 Barkan May 2002 B1
6405323 Lin et al. Jun 2002 B1
6405342 Lee Jun 2002 B1
6418060 Yang et al. Jul 2002 B1
6442585 Dean et al. Aug 2002 B1
6445602 Kokudo et al. Sep 2002 B1
6452838 Ishii et al. Sep 2002 B1
6456528 Chen Sep 2002 B1
6466476 Wong et al. Oct 2002 B1
6467062 Barkan Oct 2002 B1
6469931 Ban et al. Oct 2002 B1
6480948 Virajpet et al. Nov 2002 B1
6490236 Fukuda et al. Dec 2002 B1
6522580 Chen et al. Feb 2003 B2
6525952 Araki et al. Feb 2003 B2
6532556 Wong et al. Mar 2003 B1
6538922 Khalid et al. Mar 2003 B1
6549464 Tanaka et al. Apr 2003 B2
6553510 Pekny et al. Apr 2003 B1
6558967 Wong May 2003 B1
6560152 Cernea May 2003 B1
6567311 Ishii et al. May 2003 B2
6577539 Iwahashi Jun 2003 B2
6584012 Banks Jun 2003 B2
6615307 Roohparvar Sep 2003 B1
6621739 Gonzalez et al. Sep 2003 B2
6640326 Buckingham et al. Oct 2003 B1
6643169 Rudelic et al. Nov 2003 B2
6646913 Micheloni et al. Nov 2003 B2
6678192 Gongwer et al. Jan 2004 B2
6683811 Ishii et al. Jan 2004 B2
6687155 Nagasue Feb 2004 B2
6707748 Lin et al. Mar 2004 B2
6708257 Bao Mar 2004 B2
6714449 Khalid Mar 2004 B2
6717847 Chen Apr 2004 B2
6731557 Beretta May 2004 B2
6732250 Durrant May 2004 B2
6738293 Iwahashi May 2004 B1
6751766 Guterman et al. Jun 2004 B2
6757193 Chen et al. Jun 2004 B2
6774808 Hibbs et al. Aug 2004 B1
6781877 Cernea et al. Aug 2004 B2
6804805 Rub Oct 2004 B2
6807095 Chen et al. Oct 2004 B2
6807101 Ooishi et al. Oct 2004 B2
6809964 Moschopoulos et al. Oct 2004 B2
6819592 Noguchi et al. Nov 2004 B2
6829167 Tu et al. Dec 2004 B2
6845052 Ho et al. Jan 2005 B1
6851018 Wyatt et al. Feb 2005 B2
6851081 Yamamoto Feb 2005 B2
6856546 Guterman et al. Feb 2005 B2
6862218 Guterman et al. Mar 2005 B2
6870767 Rudelic et al. Mar 2005 B2
6870773 Noguchi et al. Mar 2005 B2
6873552 Ishii et al. Mar 2005 B2
6879520 Hosono et al. Apr 2005 B2
6882567 Wong Apr 2005 B1
6894926 Guterman et al. May 2005 B2
6907497 Hosono et al. Jun 2005 B2
6925009 Noguchi et al. Aug 2005 B2
6930925 Guo et al. Aug 2005 B2
6934188 Roohparvar Aug 2005 B2
6937511 Hsu et al. Aug 2005 B2
6958938 Noguchi et al. Oct 2005 B2
6963505 Cohen Nov 2005 B2
6972993 Conley et al. Dec 2005 B2
6988175 Lasser Jan 2006 B2
6992932 Cohen Jan 2006 B2
6999344 Hosono et al. Feb 2006 B2
7002843 Guterman et al. Feb 2006 B2
7006379 Noguchi et al. Feb 2006 B2
7012835 Gonzalez et al. Mar 2006 B2
7020017 Chen et al. Mar 2006 B2
7023735 Ban et al. Apr 2006 B2
7031210 Park et al. Apr 2006 B2
7031214 Tran Apr 2006 B2
7031216 You Apr 2006 B2
7039846 Hewitt et al. May 2006 B2
7042766 Wang et al. May 2006 B1
7054193 Wong May 2006 B1
7054199 Lee et al. May 2006 B2
7057958 So et al. Jun 2006 B2
7065147 Ophir et al. Jun 2006 B2
7068539 Guterman et al. Jun 2006 B2
7071849 Zhang Jul 2006 B2
7072222 Ishii et al. Jul 2006 B2
7079555 Baydar et al. Jul 2006 B2
7088615 Guterman et al. Aug 2006 B2
7099194 Tu et al. Aug 2006 B2
7102924 Chen et al. Sep 2006 B2
7113432 Mokhlesi Sep 2006 B2
7130210 Bathul et al. Oct 2006 B2
7139192 Wong Nov 2006 B1
7139198 Guterman et al. Nov 2006 B2
7145805 Ishii et al. Dec 2006 B2
7151692 Wu Dec 2006 B2
7158058 Yu Jan 2007 B1
7170781 So et al. Jan 2007 B2
7170802 Cernea et al. Jan 2007 B2
7173859 Hemink Feb 2007 B2
7177184 Chen Feb 2007 B2
7177195 Gonzalez et al. Feb 2007 B2
7177199 Chen et al. Feb 2007 B2
7177200 Ronen et al. Feb 2007 B2
7184338 Nakagawa et al. Feb 2007 B2
7187195 Kim Mar 2007 B2
7187592 Guterman et al. Mar 2007 B2
7190614 Wu Mar 2007 B2
7193898 Cernea Mar 2007 B2
7193921 Choi et al. Mar 2007 B2
7196644 Anderson et al. Mar 2007 B1
7196928 Chen Mar 2007 B2
7196933 Shibata Mar 2007 B2
7197594 Raz et al. Mar 2007 B2
7200062 Kinsely et al. Apr 2007 B2
7210077 Brandenberger et al. Apr 2007 B2
7221592 Nazarian May 2007 B2
7224613 Chen et al. May 2007 B2
7231474 Helms et al. Jun 2007 B1
7231562 Ohlhoff et al. Jun 2007 B2
7243275 Gongwer et al. Jul 2007 B2
7254690 Rao Aug 2007 B2
7254763 Aadsen et al. Aug 2007 B2
7257027 Park Aug 2007 B2
7259987 Chen et al. Aug 2007 B2
7266026 Gongwer et al. Sep 2007 B2
7266069 Chu Sep 2007 B2
7269066 Nguyen et al. Sep 2007 B2
7272757 Stocken Sep 2007 B2
7274611 Roohparvar Sep 2007 B2
7277355 Tanzawa Oct 2007 B2
7280398 Lee et al. Oct 2007 B1
7280409 Misumi et al. Oct 2007 B2
7280415 Hwang et al. Oct 2007 B2
7283399 Ishii et al. Oct 2007 B2
7289344 Chen Oct 2007 B2
7301807 Khalid et al. Nov 2007 B2
7301817 Li et al. Nov 2007 B2
7308525 Lasser et al. Dec 2007 B2
7310255 Chan Dec 2007 B2
7310269 Shibata Dec 2007 B2
7310271 Lee Dec 2007 B2
7310272 Mokhlesi et al. Dec 2007 B1
7310347 Lasser Dec 2007 B2
7312727 Feng et al. Dec 2007 B1
7321509 Chen et al. Jan 2008 B2
7328384 Kulkarni et al. Feb 2008 B1
7342831 Mokhlesi et al. Mar 2008 B2
7343330 Boesjes et al. Mar 2008 B1
7345924 Nguyen et al. Mar 2008 B2
7345928 Li Mar 2008 B2
7349263 Kim et al. Mar 2008 B2
7356755 Fackenthal Apr 2008 B2
7363420 Lin et al. Apr 2008 B2
7365671 Anderson Apr 2008 B1
7388781 Litsyn et al. Jun 2008 B2
7397697 So et al. Jul 2008 B2
7405974 Yaoi et al. Jul 2008 B2
7405979 Ishii et al. Jul 2008 B2
7408804 Hemink et al. Aug 2008 B2
7408810 Aritome et al. Aug 2008 B2
7409473 Conley et al. Aug 2008 B2
7409623 Baker et al. Aug 2008 B2
7420847 Li Sep 2008 B2
7433231 Aritome Oct 2008 B2
7433697 Karaoguz et al. Oct 2008 B2
7434111 Sugiura et al. Oct 2008 B2
7437498 Ronen Oct 2008 B2
7440324 Mokhlesi Oct 2008 B2
7440331 Hemink Oct 2008 B2
7441067 Gorobetz et al. Oct 2008 B2
7447970 Wu et al. Nov 2008 B2
7450421 Mokhlesi et al. Nov 2008 B2
7453737 Ha Nov 2008 B2
7457163 Hemink Nov 2008 B2
7457897 Lee et al. Nov 2008 B1
7460410 Nagai et al. Dec 2008 B2
7460412 Lee et al. Dec 2008 B2
7466592 Mitani et al. Dec 2008 B2
7468907 Kang et al. Dec 2008 B2
7468911 Lutze et al. Dec 2008 B2
7469049 Feng Dec 2008 B1
7471581 Tran et al. Dec 2008 B2
7483319 Brown Jan 2009 B2
7487329 Hepkin et al. Feb 2009 B2
7487394 Forhan et al. Feb 2009 B2
7492641 Hosono et al. Feb 2009 B2
7508710 Mokhlesi Mar 2009 B2
7526711 Orio Apr 2009 B2
7539061 Lee May 2009 B2
7539062 Doyle May 2009 B2
7551492 Kim Jun 2009 B2
7558109 Brandman et al. Jul 2009 B2
7558839 McGovern Jul 2009 B1
7568135 Cornwell et al. Jul 2009 B2
7570520 Kamei et al. Aug 2009 B2
7574555 Porat et al. Aug 2009 B2
7590002 Mokhlesi et al. Sep 2009 B2
7593259 Kim Sep 2009 B2
7594093 Kancherla Sep 2009 B1
7596707 Vemula Sep 2009 B1
7609787 Jahan et al. Oct 2009 B2
7613043 Cornwell et al. Nov 2009 B2
7616498 Mokhlesi et al. Nov 2009 B2
7619918 Aritome Nov 2009 B2
7631245 Lasser Dec 2009 B2
7633798 Sarin et al. Dec 2009 B2
7633802 Mokhlesi Dec 2009 B2
7639532 Roohparvar et al. Dec 2009 B2
7644347 Alexander et al. Jan 2010 B2
7656734 Thorp et al. Feb 2010 B2
7660158 Aritome Feb 2010 B2
7660183 Ware et al. Feb 2010 B2
7661000 Ueda et al. Feb 2010 B2
7661054 Huffman et al. Feb 2010 B2
7665007 Yang et al. Feb 2010 B2
7680987 Clark et al. Mar 2010 B1
7733712 Walston et al. Jun 2010 B1
7742351 Inoue et al. Jun 2010 B2
7761624 Karamcheti et al. Jul 2010 B2
7797609 Neuman Sep 2010 B2
7810017 Radke Oct 2010 B2
7848149 Gonzalez et al. Dec 2010 B2
7869273 Lee et al. Jan 2011 B2
7885119 Li Feb 2011 B2
7904783 Brandman et al. Mar 2011 B2
7924613 Sommer Apr 2011 B1
7925936 Sommer Apr 2011 B1
7928497 Yaegashi Apr 2011 B2
7929549 Talbot Apr 2011 B1
7930515 Gupta et al. Apr 2011 B2
7945825 Cohen et al. May 2011 B2
7975192 Sommer et al. Jul 2011 B2
7978516 Olbrich et al. Jul 2011 B2
7995388 Winter et al. Aug 2011 B1
8000135 Perlmutter et al. Aug 2011 B1
8000141 Shalvi et al. Aug 2011 B1
8014094 Jin Sep 2011 B1
8037380 Cagno et al. Oct 2011 B2
8040744 Gorobets et al. Oct 2011 B2
8065583 Radke Nov 2011 B2
8438471 Thorpe et al. May 2013 B2
20010002172 Tanaka et al. May 2001 A1
20010006479 Ikehashi et al. Jul 2001 A1
20020038440 Barkan Mar 2002 A1
20020056064 Kidorf et al. May 2002 A1
20020118574 Gongwer et al. Aug 2002 A1
20020133684 Anderson Sep 2002 A1
20020166091 Kidorf et al. Nov 2002 A1
20020174295 Ulrich et al. Nov 2002 A1
20020196510 Hietala et al. Dec 2002 A1
20030002348 Chen et al. Jan 2003 A1
20030103400 Van Tran Jun 2003 A1
20030161183 Van Tran Aug 2003 A1
20030189856 Cho et al. Oct 2003 A1
20040057265 Mirabel et al. Mar 2004 A1
20040057285 Cernea et al. Mar 2004 A1
20040083333 Chang et al. Apr 2004 A1
20040083334 Chang et al. Apr 2004 A1
20040105311 Cernea et al. Jun 2004 A1
20040114437 Li Jun 2004 A1
20040160842 Fukiage Aug 2004 A1
20040223371 Roohparvar Nov 2004 A1
20050007802 Gerpheide Jan 2005 A1
20050013165 Ban Jan 2005 A1
20050024941 Lasser et al. Feb 2005 A1
20050024978 Ronen Feb 2005 A1
20050030788 Parkinson et al. Feb 2005 A1
20050086574 Fackenthal Apr 2005 A1
20050121436 Kamitani et al. Jun 2005 A1
20050144361 Gonzalez et al. Jun 2005 A1
20050157555 Ono et al. Jul 2005 A1
20050162913 Chen Jul 2005 A1
20050169051 Khalid et al. Aug 2005 A1
20050189649 Maruyama et al. Sep 2005 A1
20050213393 Lasser Sep 2005 A1
20050224853 Ohkawa Oct 2005 A1
20050240745 Iyer et al. Oct 2005 A1
20050243626 Ronen Nov 2005 A1
20060004952 Lasser Jan 2006 A1
20060028875 Avraham et al. Feb 2006 A1
20060028877 Meir Feb 2006 A1
20060101193 Murin May 2006 A1
20060106972 Gorobets et al. May 2006 A1
20060107136 Gongwer et al. May 2006 A1
20060129750 Lee et al. Jun 2006 A1
20060133141 Gorobets Jun 2006 A1
20060156189 Tomlin Jul 2006 A1
20060179334 Brittain et al. Aug 2006 A1
20060190699 Lee Aug 2006 A1
20060203546 Lasser Sep 2006 A1
20060218359 Sanders et al. Sep 2006 A1
20060221692 Chen Oct 2006 A1
20060221705 Hemink et al. Oct 2006 A1
20060221714 Li et al. Oct 2006 A1
20060239077 Park et al. Oct 2006 A1
20060239081 Roohparvar Oct 2006 A1
20060256620 Nguyen et al. Nov 2006 A1
20060256626 Werner et al. Nov 2006 A1
20060256891 Yuan et al. Nov 2006 A1
20060271748 Jain et al. Nov 2006 A1
20060285392 Incarnati et al. Dec 2006 A1
20060285396 Ha Dec 2006 A1
20070006013 Moshayedi et al. Jan 2007 A1
20070019481 Park Jan 2007 A1
20070033581 Tomlin et al. Feb 2007 A1
20070047314 Goda et al. Mar 2007 A1
20070047326 Nguyen et al. Mar 2007 A1
20070050536 Kolokowsky Mar 2007 A1
20070058446 Hwang et al. Mar 2007 A1
20070061502 Lasser et al. Mar 2007 A1
20070067667 Ikeuchi et al. Mar 2007 A1
20070074093 Lasser Mar 2007 A1
20070086239 Litsyn et al. Apr 2007 A1
20070086260 Sinclair Apr 2007 A1
20070089034 Litsyn et al. Apr 2007 A1
20070091677 Lasser et al. Apr 2007 A1
20070091694 Lee et al. Apr 2007 A1
20070103978 Conley et al. May 2007 A1
20070103986 Chen May 2007 A1
20070104211 Opsasnick May 2007 A1
20070109845 Chen May 2007 A1
20070109849 Chen May 2007 A1
20070115726 Cohen et al. May 2007 A1
20070118713 Guterman et al. May 2007 A1
20070143378 Gorobet Jun 2007 A1
20070143531 Atri Jun 2007 A1
20070159889 Kang et al. Jul 2007 A1
20070159892 Kang et al. Jul 2007 A1
20070159907 Kwak Jul 2007 A1
20070168837 Murin Jul 2007 A1
20070171714 Wu et al. Jul 2007 A1
20070183210 Choi et al. Aug 2007 A1
20070189073 Aritome Aug 2007 A1
20070195602 Fong et al. Aug 2007 A1
20070206426 Mokhlesi Sep 2007 A1
20070208904 Hsieh et al. Sep 2007 A1
20070226599 Motwani Sep 2007 A1
20070236990 Aritome Oct 2007 A1
20070253249 Kang et al. Nov 2007 A1
20070256620 Viggiano et al. Nov 2007 A1
20070263455 Cornwell et al. Nov 2007 A1
20070266232 Rodgers et al. Nov 2007 A1
20070271424 Lee et al. Nov 2007 A1
20070280000 Fujiu et al. Dec 2007 A1
20070291571 Balasundaram Dec 2007 A1
20070297234 Cernea et al. Dec 2007 A1
20080010395 Mylly et al. Jan 2008 A1
20080025121 Tanzawa Jan 2008 A1
20080043535 Roohparvar Feb 2008 A1
20080049504 Kasahara et al. Feb 2008 A1
20080049506 Guterman Feb 2008 A1
20080052446 Lasser et al. Feb 2008 A1
20080055993 Lee Mar 2008 A1
20080080243 Edahiro et al. Apr 2008 A1
20080082730 Kim et al. Apr 2008 A1
20080089123 Chae et al. Apr 2008 A1
20080104309 Cheon et al. May 2008 A1
20080104312 Lasser May 2008 A1
20080109590 Jung et al. May 2008 A1
20080115017 Jacobson May 2008 A1
20080123420 Brandman et al. May 2008 A1
20080123426 Lutze et al. May 2008 A1
20080126686 Sokolov et al. May 2008 A1
20080130341 Shalvi et al. Jun 2008 A1
20080148115 Sokolov et al. Jun 2008 A1
20080151618 Sharon et al. Jun 2008 A1
20080151667 Miu et al. Jun 2008 A1
20080158958 Sokolov et al. Jul 2008 A1
20080181001 Shalvi Jul 2008 A1
20080198650 Shalvi et al. Aug 2008 A1
20080198654 Toda Aug 2008 A1
20080209116 Caulkins Aug 2008 A1
20080209304 Winarski et al. Aug 2008 A1
20080215798 Sharon et al. Sep 2008 A1
20080219050 Shalvi et al. Sep 2008 A1
20080239093 Easwar et al. Oct 2008 A1
20080239812 Abiko et al. Oct 2008 A1
20080253188 Aritome Oct 2008 A1
20080263262 Sokolov et al. Oct 2008 A1
20080263676 Mo et al. Oct 2008 A1
20080270730 Lasser et al. Oct 2008 A1
20080282106 Shalvi et al. Nov 2008 A1
20080288714 Salomon et al. Nov 2008 A1
20090013233 Radke Jan 2009 A1
20090024905 Shalvi et al. Jan 2009 A1
20090034337 Aritome Feb 2009 A1
20090043831 Antonopoulos et al. Feb 2009 A1
20090043951 Shalvi et al. Feb 2009 A1
20090049234 Oh et al. Feb 2009 A1
20090073762 Lee et al. Mar 2009 A1
20090086542 Lee et al. Apr 2009 A1
20090089484 Chu Apr 2009 A1
20090091979 Shalvi Apr 2009 A1
20090094930 Schwoerer Apr 2009 A1
20090106485 Anholt Apr 2009 A1
20090112949 Ergan et al. Apr 2009 A1
20090132755 Radke May 2009 A1
20090144600 Perlmutter et al. Jun 2009 A1
20090150894 Huang et al. Jun 2009 A1
20090157950 Selinger Jun 2009 A1
20090157964 Kasorla et al. Jun 2009 A1
20090158126 Perlmutter et al. Jun 2009 A1
20090168524 Golov et al. Jul 2009 A1
20090172257 Prins et al. Jul 2009 A1
20090172261 Prins et al. Jul 2009 A1
20090193184 Yu et al. Jul 2009 A1
20090199074 Sommer et al. Aug 2009 A1
20090204824 Lin et al. Aug 2009 A1
20090204872 Yu et al. Aug 2009 A1
20090213653 Perlmutter et al. Aug 2009 A1
20090213654 Perlmutter et al. Aug 2009 A1
20090225595 Kim Sep 2009 A1
20090228761 Perlmutter et al. Sep 2009 A1
20090240872 Perlmutter et al. Sep 2009 A1
20090265509 Klein Oct 2009 A1
20090300227 Nochimowski et al. Dec 2009 A1
20090323412 Mokhlesi Dec 2009 A1
20090327608 Eschmann et al. Dec 2009 A1
20100017650 Chin et al. Jan 2010 A1
20100034022 Dutta et al. Feb 2010 A1
20100057976 Lasser Mar 2010 A1
20100061151 Miwa et al. Mar 2010 A1
20100082883 Chen et al. Apr 2010 A1
20100083247 Kanevsky et al. Apr 2010 A1
20100110580 Takashima May 2010 A1
20100124088 Shalvi et al. May 2010 A1
20100131697 Alrod et al. May 2010 A1
20100131827 Sokolov et al. May 2010 A1
20100142268 Aritome Jun 2010 A1
20100142277 Yang et al. Jun 2010 A1
20100157675 Shalvi et al. Jun 2010 A1
20100165689 Rotbard et al. Jul 2010 A1
20100169547 Ou Jul 2010 A1
20100169743 Vogan et al. Jul 2010 A1
20100174847 Paley et al. Jul 2010 A1
20100195390 Shalvi Aug 2010 A1
20100199150 Shalvi et al. Aug 2010 A1
20100211803 Lablans Aug 2010 A1
20100220509 Sokolov et al. Sep 2010 A1
20100220510 Shalvi Sep 2010 A1
20100250836 Sokolov et al. Sep 2010 A1
20100287217 Borchers et al. Nov 2010 A1
20110010489 Yeh Jan 2011 A1
20110060969 Ramamoorthy et al. Mar 2011 A1
20110066793 Burd Mar 2011 A1
20110075482 Shepard et al. Mar 2011 A1
20110107049 Kwon et al. May 2011 A1
20110149657 Haratsch et al. Jun 2011 A1
20110199823 Bar-Or et al. Aug 2011 A1
20110302354 Miller Dec 2011 A1
Foreign Referenced Citations (43)
Number Date Country
0783754 Jul 1997 EP
1434236 Jun 2004 EP
1605509 Dec 2005 EP
9610256 Apr 1996 WO
9828745 Jul 1998 WO
02100112 Dec 2002 WO
03100791 Dec 2003 WO
2007046084 Apr 2007 WO
2007132452 Nov 2007 WO
2007132453 Nov 2007 WO
2007132456 Nov 2007 WO
2007132457 Nov 2007 WO
2007132458 Nov 2007 WO
2007146010 Dec 2007 WO
2008026203 Mar 2008 WO
2008053472 May 2008 WO
2008053473 May 2008 WO
2008068747 Jun 2008 WO
2008077284 Jul 2008 WO
2008083131 Jul 2008 WO
2008099958 Aug 2008 WO
2008111058 Sep 2008 WO
2008124760 Oct 2008 WO
2008139441 Nov 2008 WO
2009037691 Mar 2009 WO
2009037697 Mar 2009 WO
2009038961 Mar 2009 WO
2009050703 Apr 2009 WO
2009053961 Apr 2009 WO
2009053962 Apr 2009 WO
2009053963 Apr 2009 WO
2009063450 May 2009 WO
2009072100 Jun 2009 WO
2009072101 Jun 2009 WO
2009072102 Jun 2009 WO
2009072103 Jun 2009 WO
2009072104 Jun 2009 WO
2009072105 Jun 2009 WO
2009074978 Jun 2009 WO
2009074979 Jun 2009 WO
2009078006 Jun 2009 WO
2009095902 Aug 2009 WO
2011024015 Mar 2011 WO
Non-Patent Literature Citations (147)
Entry
U.S. Appl. No. 12/323,544 Office Action dated Dec. 13, 2011.
U.S. Appl. No. 12/332,368 Office Action dated Nov. 10, 2011.
U.S. Appl. No. 12/063,544 Office Action dated Dec. 14, 2011.
U.S. Appl. No. 12/186,867 Office Action dated Jan. 17, 2012.
U.S. Appl. No. 12/119,069 Office Action dated Nov. 14, 2011.
U.S. Appl. No. 12/037,487 Office Action dated Jan. 3, 2012.
U.S. Appl. No. 11/995,812 Office Action dated Oct. 28, 2011.
U.S. Appl. No. 12/551,567 Office Action dated Oct. 27, 2011.
U.S. Appl. No. 12/618,732 Office Action dated Nov. 4, 2011.
U.S. Appl. No. 12/649,382 Office Action dated Jan. 6, 2012.
U.S. Appl. No. 13/284,909, filed Oct. 30, 2011.
U.S. Appl. No. 13/284,913, filed Oct. 30, 2011.
U.S. Appl. No. 13/338,335, filed Dec. 28, 2011.
U.S. Appl. No. 13/355,536, filed Jan. 22, 2012.
Kim et al., “Multi-bit Error Tolerant Caches Using Two-Dimensional Error Coding”, Proceedings of the 40th Annual ACM/IEEE International Symposium on Microarchitecture (MICRO-40), Chicago, USA, Dec. 1-5, 2007.
U.S. Appl. No. 12/323,544 Official Action dated Mar. 9, 2012.
Chinese Patent Application # 200780026181.3 Official Action dated Mar. 7, 2012.
Chinese Patent Application # 200780026094.8 Official Action dated Feb. 2, 2012.
U.S. Appl. No. 12/332,370 Official Action dated Mar. 8, 2012.
U.S. Appl. No. 12/579,432 Official Action dated Feb. 29, 2012.
U.S. Appl. No. 12/522,175 Official Action dated Mar. 27, 2012.
U.S. Appl. No. 12/607,085 Official Action dated Mar. 28, 2012.
Budilovsky et al., “Prototyping a High-Performance Low-Cost Solid-State Disk”, SYSTOR—The 4th Annual International Systems and Storage Conference, Haifa, Israel, May 30-Jun. 1, 2011.
NVM Express Protocol, “NVM Express”, Revision 1.0b, Jul. 12, 2011.
SCSI Protocol, “Information Technology—SCSI Architecture Model—5 (SAM-5)”, INCITS document T10/2104-D, revision 01, Jan. 28, 2009.
SAS Protocol, “Information Technology—Serial Attached SCSI—2 (SAS-2)”, INCITS document T10/1760-D, revision 15a, Feb. 22, 2009.
Agrell et al., “Closest Point Search in Lattices”, IEEE Transactions on Information Theory, vol. 48, No. 8, pp. 2201-2214, Aug. 2002.
Ankolekar et al., “Multibit Error-Correction Methods for Latency-Constrained Flash Memory Systems”, IEEE Transactions on Device and Materials Reliability, vol. 10, No. 1, pp. 33-39, Mar. 2010.
Berman et al., “Mitigating Inter-Cell Coupling Effects in MLC NAND Flash via Constrained Coding”, Flash Memory Summit, Santa Clara, USA, Aug. 19, 2010.
Bez et al., “Introduction to Flash memory”, Proceedings of the IEEE, vol. 91, No. 4, pp. 489-502, Apr. 2003.
Blahut, R.E., “Theory and Practice of Error Control Codes,” Addison-Wesley, May, 1984, section 3.2, pp. 47-48.
Conway et al., “Sphere Packings, Lattices and Groups”, 3rd edition, chapter 4, pp. 94-135, Springer, New York, US 1998.
Chang, L., “Hybrid Solid State Disks: Combining Heterogeneous NAND Flash in Large SSDs”, ASPDAC, Jan. 2008.
Cho et al., “Multi-Level NAND Flash Memory with Non-Uniform Threshold Voltage Distribution,” IEEE International Solid-State Circuits Conference (ISSCC), San Francisco, CA, Feb. 5-7, 2001, pp. 28-29 and 424.
Compaq et al., “Universal Serial Bus Specification”, revision 2.0, Apr. 27, 2000.
Databahn™, “Flash memory controller IP”, Denali Software, Inc., 1994 https://www.denali.com/en/products/databahn—flash.jsp.
Datalight, Inc., “FlashFX Pro 3.1 High Performance Flash Manager for Rapid Development of Reliable Products”, Nov. 16, 2006.
Duann, N., Silicon Motion Presentation “SLC & MLC Hybrid”, Flash Memory Summit, Santa Clara, USA, Aug. 2008.
Eitan et al., “Can NROM, a 2-bit, Trapping Storage NVM Cell, Give a Real Challenge to Floating Gate Cells?”, Proceedings of the 1999 International Conference on Solid State Devices and Materials (SSDM), p. 522-524, Tokyo, Japan 1999.
Eitan et al., “Multilevel Flash Cells and their Trade-Offs”, Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), pp. 169-172, New York, USA 1996.
Engh et al., “A self adaptive programming method with 5 mV accuracy for multi-level storage in FLASH”, pp. 115-118, Proceedings of the IEEE 2002 Custom Integrated Circuits Conference, May 12-15, 2002.
Engineering Windows 7, “Support and Q&A for Solid-State Drives”, e7blog, May 5, 2009.
Goodman et al., “On-Chip ECC for Multi-Level Random Access Memories,” Proceedings of the IEEE/CAM Information Theory Workshop, Ithaca, USA, Jun. 25-29, 1989.
Gotou, H., “An Experimental Confirmation of Automatic Threshold Voltage Convergence in a Flash Memory Using Alternating Word-Line Voltage Pulses”, IEEE Electron Device Letters, vol. 18, No. 10, pp. 503-505, Oct. 1997.
Han et al., “An Intelligent Garbage Collection Algorithm for Flash Memory Storages”, Computational Science and Its Applications—ICCSA 2006, vol. 3980/2006, pp. 1019-1027, Springer Berlin / Heidelberg, Germany, May 11, 2006.
Han et al., “CATA: A Garbage Collection Scheme for Flash Memory File Systems”, Ubiquitous Intelligence and Computing, vol. 4159/2006, p. 103-112, Springer Berlin / Heidelberg, Aug. 25, 2006.
Hong et al., “NAND Flash-based Disk Cache Using SLC/MLC Combined Flash Memory”, 2010 International Workshop on Storage Network Architecture and Parallel I/Os, pp. 21-30, USA, May 3, 2010.
Horstein, “On the Design of Signals for Sequential and Nonsequential Detection Systems with Feedback,” IEEE Transactions on Information Theory IT-12:4 (Oct. 1966), pp. 448-455.
How to Resolve Bad Super Block: Magic Number Wrong “in BSD”, Free Online Articles Director Article Base, posted Sep. 5, 2009.
Huffman, A., “Non-Volatile Memory Host Controller Interface (NVMHCI)”, Specification 1.0, Apr. 14, 2008.
Jedec Standard JESD84-C44, “Embedded MultiMediaCard (eMMC) Mechanical Standard, with Optional Reset Signal”, Jedec Solid State Technology Association, USA, Jul. 2009.
Jedec, “UFS Specification”, version 0.1, Nov. 11, 2009.
Jung et al., in “A 117 mm.sup.2 3.3V Only 128 Mb Multilevel NAND Flash Memory for Mass Storage Applications,” IEEE Journal of Solid State Circuits, (11:31), Nov. 1996, pp. 1575-1583.
Kang et al., “A Superblock-based Flash Translation Layer for NAND Flash Memory”, Proceedings of the 6th ACM & IEEE International Conference on Embedded Software, pp. 161-170, Seoul, Korea, Oct. 22-26, 2006.
Kawaguchi et al. 1995. A flash-memory based file system. In Proceedings of the USENIX 1995 Technical Conference , New Orleans, Louisiana. 155-164.
Kim et al., “Future Memory Technology including Emerging New Memories”, Proceedings of the 24th International Conference on Microelectronics (MIEL), vol. 1, pp. 377-384, Nis, Serbia and Montenegro, May 16-19, 2004.
Lee et al., “Effects of Floating Gate Interference on NAND Flash Memory Cell Operation”, IEEE Electron Device Letters, vol. 23, No. 5, pp. 264-266, May 2002.
Maayan et al., “A 512 Mb NROM Flash Data Storage Memory with 8 Mb/s Data Rate”, Proceedings of the 2002 IEEE International Solid-State circuits Conference (ISSCC 2002), pp. 100-101, San Francisco, USA, Feb. 3-7, 2002.
Mielke et al., “Recovery Effects in the Distributed Cycling of Flash Memories”, IEEE 44th Annual International Reliability Physics Symposium, pp. 29-35, San Jose, USA, Mar. 2006.
Micron Technology Inc., “Memory Management in NAND Flash Arrays”, Technical Note, year 2005.
NUMONYX, “M25PE16: 16-Mbit, page-erasable serial flash memory with byte-alterability, 75 MHz SPI bus, standard pinout”, Apr. 2008.
Onfi, “Open NAND Flash Interface Specification,” revision 1.0, Dec. 28, 2006.
Panchbhai et al., “Improving Reliability of NAND Based Flash Memory Using Hybrid SLC/MLC Device”, Project Proposal for CSci 8980—Advanced Storage Systems, University of Minnesota, USA, Spring 2009.
Park et al., “Sub-Grouped Superblock Management for High-Performance Flash Storages”, IEICE Electronics Express, vol. 6, No. 6, pp. 297-303, Mar. 25, 2009.
Phison Electronics Corporation, “PS8000 Controller Specification (for SD Card)”, revision 1.2, Document No. S-07018, Mar. 28, 2007.
Shalvi, et al., “Signal Codes,” Proceedings of the 2003 IEEE Information Theory Workshop (ITW'2003), Paris, France, Mar. 31-Apr. 4, 2003.
SD Group and SD Card Association, “SD Specifications Part 1 Physical Layer Specification”, version 3.01, draft 1.00, Nov. 9, 2009.
Serial ATA International Organization, “Serial ATA Revision 3.0 Specification”, Jun. 2, 2009.
Shiozaki, A., “Adaptive Type-II Hybrid Broadcast ARQ System”, IEEE Transactions on Communications, vol. 44, Issue 4, pp. 420-422, Apr. 1996.
Suh et al., “A 3.3V 32Mb NAND Flash Memory with Incremental Step Pulse Programming Scheme”, IEEE Journal of Solid-State Circuits, vol. 30, No. 11, pp. 1149-1156, Nov. 1995.
ST Microelectronics, “Bad Block Management in NAND Flash Memories”, Application note AN-1819, Geneva, Switzerland, May 2004.
ST Microelectronics, “Wear Leveling in Single Level Cell NAND Flash Memories,” Application note AN-1822 Geneva, Switzerland, Feb. 2007.
Super User Forums, “SD Card Failure, can't read superblock”, posted Aug. 8, 2010.
Takeuchi et al., “A Double Level VTH Select Gate Array Architecture for Multi-Level Nand Flash Memories”, Digest of Technical Papers, 1995 Symposium on VLSI Circuits, pp. 69-70, Jun. 8-10, 1995.
Takeuchi et al., “A Multipage Cell Architecture for High-Speed Programming Multilevel NAND Flash Memories”, IEEE Journal of Solid State Circuits, vol. 33, No. 8, Aug. 1998.
UBUNTU Forums, “Memory Stick Failed IO Superblock”, posted Nov. 11, 2009.
Wei, L., “Trellis-Coded Modulation With Multidimensional Constellations”, IEEE Transactions on Information Theory, vol. IT-33, No. 4, pp. 483-501, Jul. 1987.
Wu et al., “eNVy: A non-Volatile, Main Memory Storage System”, Proceedings of the 6th International Conference on Architectural support for programming languages and operating systems, pp. 86-87, San Jose, USA, 1994.
International Application PCT/IL2007/000575 Search Report dated May 30, 2008.
International Application PCT/IL2007/000576 Search Report dated Jul. 7, 2008.
International Application PCT/IL2007/000579 Search report dated Jul. 3, 2008.
International Application PCT/IL2007/000580 Search Report dated Sep. 11, 2008.
International Application PCT/IL2007/000581 Search Report dated Aug. 25, 2008.
International Application PCT/IL2007/001059 Search report dated Aug. 7, 2008.
International Application PCT/IL2007/001315 search report dated Aug. 7, 2008.
International Application PCT/IL2007/001316 Search report dated Jul. 22, 2008.
International Application PCT/IL2007/001488 Search report dated Jun. 20, 2008.
International Application PCT/IL2008/000329 Search report dated Nov. 25, 2008.
International Application PCT/IL2008/000519 Search report dated Nov. 20, 2008.
International Application PCT/IL2008/001188 Search Report dated Jan. 28, 2009.
International Application PCT/IL2008/001356 Search Report dated Feb. 3, 2009.
International Application PCT/IL2008/001446 Search report dated Feb. 20, 2009.
U.S. Appl. No. 11/949,135 Official Action dated Oct. 2, 2009.
U.S. Appl. No. 12/019,011 Official Action dated Nov. 20, 2009.
U.S. Appl. No. 11/957,970 Official Action dated May 20, 2010.
U.S. Appl. No. 12/171,797 Official Action dated Aug. 25, 2010.
U.S. Appl. No. 11/945,575 Official Action dated Aug. 24, 2010.
U.S. Appl. No. 12/497,707 Official Action dated Sep. 15, 2010.
U.S. Appl. No. 11/995,801 Official Action dated Oct. 15, 2010.
U.S. Appl. No. 12/045,520 Official Action dated Nov. 16, 2010.
U.S. Appl. No. 12/388,528 Official Action dated Nov. 29, 2010.
U.S. Appl. No. 11/995,814 Official Action dated Dec. 17, 2010.
U.S. Appl. No. 12/251,471 Official Action dated Jan. 3, 2011.
U.S. Appl. No. 12/534,898 Official Action dated Mar. 23, 2011.
Chinese Application # 200780026181.3 Official Action dated Apr. 8, 2011.
U.S. Appl. No. 12/178,318 Official Action dated May 31, 2011.
U.S. Appl. No. 11/995,813 Official Action dated Jun. 16, 2011.
U.S. Appl. No. 12/344,233 Official Action dated Jun. 24, 2011.
Chinese Patent Application # 200780040493.X Official Action dated Jun. 15, 2011.
U.S. Appl. No. 12/405,275 Official Action dated Jul. 29, 2011.
U.S. Appl. No. 12/649,360 Official Action dated Aug. 9, 2011.
U.S. Appl. No. 13/114,049 Official Action dated Sep 12, 2011.
U.S. Appl. No. 12/037,487 Official Action dated Oct. 3, 2011.
U.S. Appl. No. 12/534,893, filed Aug. 4, 2009.
U.S. Appl. No. 12/551,583, filed Sep. 1, 2009.
U.S. Appl. No. 12/551,567, filed Sep. 1, 2009.
U.S. Appl. No. 12/579,430, filed Oct. 15, 2009.
U.S. Appl. No. 12/579,432, filed Oct. 15, 2009.
U.S. Appl. No. 12/607,078, filed Oct. 28, 2009.
U.S. Appl. No. 12/607,085, filed Oct. 28, 2009.
U.S. Appl. No. 12/649,358, filed Dec. 30, 2009.
U.S. Appl. No. 12/649,360, filed Dec. 30, 2009.
U.S. Appl. No. 12/688,883, filed Jan. 17, 2010.
U.S. Appl. No. 12/728,296, filed Mar. 22, 2010.
U.S. Appl. No. 12/758,003, filed Apr. 11, 2010.
U.S. Appl. No. 12/880,101, filed Sep. 12, 2010.
U.S. Appl. No. 12/890,724, filed Sep. 27, 2010.
U.S. Appl. No. 12/822,207, filed Jun. 24, 2010.
U.S. Appl. No. 12/987,174, filed Jan. 10, 2011.
U.S. Appl. No. 12/987,175, filed Jan. 10, 2011.
U.S. Appl. No. 12/963,649, filed Dec. 9, 2010.
U.S. Appl. No. 13/021,754, filed Feb. 6, 2011.
U.S. Appl. No. 13/047,822, filed Mar. 15, 2011.
U.S. Appl. No. 13/069,406, filed Mar. 23, 2011.
U.S. Appl. No. 13/088,361, filed Apr. 17, 2011.
U.S. Appl. No. 13/114,049, filed May 24, 2011.
U.S. Appl. No. 13/170,202, filed Jun. 28, 2011.
U.S. Appl. No. 13/171,467, filed Jun. 29, 2011.
U.S. Appl. No. 13/176,761, filed Jul. 6, 2011.
U.S. Appl. No. 13/192,495, filed Jul. 28, 2011.
U.S. Appl. No. 13/192,501, filed Jul. 28, 2011.
U.S. Appl. No. 13/192,504, filed Jul. 28, 2011.
U.S. Appl. No. 13/231,963, filed Sep. 14, 2011.
U.S. Appl. No. 13/214,257, filed Aug. 22, 2011.
U.S. Appl. No. 13/239,408, filed Sep. 22, 2011.
U.S. Appl. No. 13/239,411, filed Sep. 22, 2011.
US 7,161,836, Jan. 2007, Wan et al. (withdrawn).
Provisional Applications (1)
Number Date Country
61374377 Aug 2010 US