The present invention relates generally to memory devices, and particularly to methods and systems for setting read thresholds in analog memory cell devices.
Several types of memory devices, such as Flash memories, use arrays of analog memory cells for storing data. Each analog memory cell stores a quantity of an analog value, also referred to as a storage value, such as an electrical charge or voltage. This analog value represents the information stored in the cell. In Flash memories, for example, each analog memory cell holds a certain amount of electrical charge. The range of possible analog values is typically divided into intervals, each interval corresponding to one or more data bit values. Data is written to an analog memory cell by writing a nominal analog value that corresponds to the desired bit or bits.
Some memory devices, commonly referred to as Single-Level Cell (SLC) devices, store a single bit of information in each memory cell, i.e., each memory cell can be programmed to assume two possible programming levels. Higher-density devices, often referred to as Multi-Level Cell (MLC) devices, store two or more bits per memory cell, i.e., can be programmed to assume more than two possible programming levels.
Flash memory devices are described, for example, by Bez et al., in “Introduction to Flash Memory,” Proceedings of the IEEE, volume 91, number 4, April, 2003, pages 489-502, which is incorporated herein by reference. Multi-level Flash cells and devices are described, for example, by Eitan et al., in “Multilevel Flash Cells and their Trade-Offs,” Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), New York, N.Y., pages 169-172, which is incorporated herein by reference. The paper compares several kinds of multilevel Flash cells, such as common ground, DINOR, AND, NOR and NAND cells.
Eitan et al., describe another type of analog memory cell called Nitride Read Only Memory (NROM) in “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), Tokyo, Japan, Sep. 21-24, 1999, pages 522-524, which is incorporated herein by reference. NROM cells are also described by Maayan et al., in “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), San Francisco, Calif., Feb. 3-7, 2002, pages 100-101, which is incorporated herein by reference. Other exemplary types of analog memory cells are Floating Gate (FG) cells, Ferroelectric RAM (FRAM) cells, magnetic RAM (MRAM) cells, Charge Trap Flash (CTF) and phase change RAM (PRAM, also referred to as Phase Change Memory—PCM) cells. FRAM, MRAM and PRAM cells are described, for example, by Kim and Koh in “Future Memory Technology including Emerging New Memories,” Proceedings of the 24th International Conference on Microelectronics (MIEL), Nis, Serbia and Montenegro, May 16-19, 2004, volume 1, pages 377-384, which is incorporated herein by reference.
Analog memory cells are typically read by comparing their analog values (storage values) to one or more read thresholds. Several methods for determining read threshold values are known in the art. For example, U.S. Patent Application Publication 2005/0013165, whose disclosure is incorporated herein by reference, describes methods for reading cells of a Flash memory. The cells are read by determining respective adaptive reference voltages for the cells and comparing the cells' threshold voltages to their respective reference voltages. The adaptive reference voltages are determined either from analog measurements of the threshold voltages of the cells' neighbors, or from preliminary estimates of the cells' threshold voltages based on comparisons of the cells' threshold voltages with integral or fractional reference voltages common to all the cells. Cells of a Flash memory are also read by comparing the cells' threshold voltages to integral reference voltages, comparing the threshold voltages of cells that share a common bit pattern to a fractional reference voltage, and adjusting the reference voltages in accordance with the comparisons.
U.S. Patent Application Publication 2006/0028875, whose disclosure is incorporated herein by reference, describes methods for managing a plurality of memory cells. The cells are managed by obtaining values of one or more environmental parameters of the cells and adjusting values of one or more reference voltages of the cells accordingly. Alternatively, a statistic of at least some of the cells, relative to a single reference parameter that corresponds to a control parameter of the cells, is measured, and the value of the reference voltage is adjusted accordingly.
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. Pat. No. 7,023,735, whose disclosure is incorporated herein by reference, describes methods for reading Flash memory cells, which, in addition to comparing the threshold voltages of Flash cells to integral reference voltages, compare the threshold voltages to fractional reference voltages.
U.S. Patent Application Publication 2007/0091677, whose disclosure is incorporated herein by reference, describes methods, devices and computer readable code 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 a method, circuit and system 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.
An embodiment of the present invention that is described herein provides a method for data storage. The method includes storing data in a group of analog memory cells by writing into the memory cells in the group respective storage values, which program each of the analog memory cells to a respective programming state selected from a predefined set of programming states, including at least first and second programming states, which are applied respectively to first and second subsets of the memory cells, whereby the storage values held in the memory cells in the first and second subsets are distributed in accordance with respective first and second distributions. A first median of the first distribution is estimated, and a read threshold, which differentiates between the first and second programming states, is calculated based on the estimated first median. The data is retrieved from the analog memory cells in the group by reading the storage values using the calculated read threshold.
In some embodiments, the storage values corresponding to the first programming state lie in a given interval, and estimating the first median includes reading at least some of the storage values using one or more intermediate read thresholds, which are positioned in an interior of the given interval, and assessing the first median responsively to the storage values read using the intermediate read thresholds.
In an embodiment, estimating the first median includes holding an estimated Cumulative Distribution Function (CDF) of the first distribution, and assessing the first median responsively to the storage values read using the intermediate read thresholds and to the estimated CDF. Estimating the first median may include assessing the first median responsively to the estimated CDF and to the storage values read using only a single intermediate read threshold. In a disclosed embodiment, holding the estimated CDF includes holding multiple estimated CDFs, and assessing the first median includes selecting one of the multiple CDFs in accordance with a predefined criterion, and assessing the first median using the selected estimated CDF.
In another embodiment, reading the storage values using the intermediate read thresholds includes counting the storage values falling on a given side of a given one of the intermediate read thresholds, and assessing the first median includes computing the first median based on the counted storage values. In an embodiment, counting the storage values includes incrementing one or more hardware-based counters. In yet another embodiment, reading the storage values using the intermediate read thresholds includes reading the storage values from only a partial subset of the memory cells in the group. In still another embodiment, reading the storage values using the intermediate read thresholds includes reading the storage values using two or more intermediate read thresholds in a single multi-threshold read command.
In some embodiment, estimation of the first median and calculation of the read threshold are invoked responsively to a failure to successfully retrieve the data. In an embodiment, the method further includes calculating a second median of the second distribution, and calculating the read threshold includes estimating the read threshold based on the first and second medians. Estimating the read threshold may include calculating a first estimate of the read threshold based on the first median, calculating a second estimate of the read threshold based on the second median, and combining the first and second estimates. In an embodiment, estimating the first and second medians includes holding predefined nominal values of the first and second medians, and assessing the first and second medians responsively to the nominal values.
There is additionally provided, in accordance with an embodiment of the present invention, apparatus for data storage including an interface and circuitry. The interface is coupled to communicate with a memory that includes multiple analog memory cells. The circuitry is configured to store data in a group of the analog memory cells by writing into the memory cells in the group respective storage values, which program each of the analog memory cells to a respective programming state selected from a predefined set of programming states, including at least first and second programming states, which are applied respectively to first and second subsets of the memory cells, whereby the storage values held in the memory cells in the first and second subsets are distributed in accordance with respective first and second distributions, to estimate a first median of the first distribution, to calculate a read threshold, which differentiates between the first and second programming states, based on the estimated first median, and to retrieve the data from the analog memory cells in the group by reading the storage values using the calculated read threshold.
There is also provided, in accordance with an embodiment of the present invention, apparatus for data storage including a memory and circuitry. The memory includes multiple analog memory cells. The circuitry is configured to store data in a group of the analog memory cells by writing into the memory cells in the group respective storage values, which program each of the analog memory cells to a respective programming state selected from a predefined set of programming states, including at least first and second programming states, which are applied respectively to first and second subsets of the memory cells, whereby the storage values held in the memory cells in the first and second subsets are distributed in accordance with respective first and second distributions, to estimate a first median of the first distribution, to calculate a read threshold, which differentiates between the first and second programming states, based on the estimated first median, and to retrieve the data from the analog memory cells in the group by reading the storage values using the calculated read threshold.
The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:
A typical analog memory device stores data by writing respective storage values into a group of analog memory cells. The storage process programs each memory cell to a respective programming level (also referred to as a programming state), which is selected from a predefined set of programming levels. Due to various impairments, the storage values associated with each programming level are not uniform, but rather are distributed in accordance with a certain statistical distribution. This distribution is commonly referred to as a programming level distribution. Data is typically read from the memory cells by comparing the storage values of the cells to one or more read thresholds, which are usually positioned between adjacent programming level distributions. An optimal read threshold between two adjacent programming level distributions is a threshold value that minimizes the number of read errors, or equivalently, maximizes the number of cells whose storage values are read out correctly. Since programming level distributions may vary over time and/or from one cell group to another, and adjacent programming level distributions may overlap at their edges, the optimal positions of read threshold often vary, as well.
Embodiments of the present invention that are described hereinbelow provide improved methods and systems for setting and adjusting read thresholds used in data readout from analog memory cells. In some embodiments, a Memory Signal Processor (MSP) or other memory controller calculates a read threshold that is used for differentiating between two programming levels by (1) estimating the statistical median of at least one of the programming level distributions, and (2) estimating the optimal read threshold position based on the median or medians.
The median of a given programming level distribution is typically estimated by reading at least some of the memory cells using one or more intermediate read thresholds. The intermediate read thresholds are positioned in the interior of the programming level distribution, rather than at the edge of the distribution or between adjacent distributions. Each read operation using an intermediate read threshold indicates the number of storage values falling on either side of the intermediate threshold, and is therefore indicative of the location of the median. Several methods for estimating the distribution median using intermediate read thresholds are described herein.
The intermediate read thresholds are positioned in the interiors of the programming level distributions and not between distributions or at the distribution edges. At these threshold positions, the Cumulative Distribution Function (CDF) of the cell storage values is relatively steep, i.e., has a relatively high derivative. As a result, the read operations using these thresholds are highly accurate in estimating the distribution medians. Consequently, the read threshold calculation processes described herein are highly accurate and reliable, even when based on a small number of read operations.
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. 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 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.
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 or storage 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 storage 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 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.
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 32 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 Signal Processor (MSP) 40. MSP 40 comprises an interface 44 for communicating with memory device 24, and a signal processing unit 48, which processes the data that is written into and read from device 24. In particular, unit sets and adjusts read thresholds that are used for reading data from memory cells 32, using methods that are described below.
In some embodiments, unit 48 encodes the data for storage using a suitable Error Correction Code (ECC) and decodes the ECC of data retrieved from the memory. In some embodiments, unit 48 produces the storage values for storing in the memory cells and provides these values to R/W unit 36. Alternatively, unit 48 provides the data for storage, and the conversion to storage values is carried out by the R/W unit internally to the memory device. Alternatively to using an MSP, the methods described herein can be carried out by any suitable type of memory controller.
MSP 40 communicates with a host 52, for accepting data for storage in the memory device and for outputting data retrieved from the memory device. MSP 40, and in particular unit 48, may be implemented in hardware. Alternatively, MSP 40 may comprise a microprocessor that runs suitable software, or a combination of hardware and software elements.
The configuration of
In the exemplary system configuration shown in
In some embodiments, MSP 40 (or other memory controller that carries out the methods described herein) 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 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, and the sources of the transistors in each column are connected by bit lines. The memory array is typically divided into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously. Pages are sometimes sub-divided into sectors. In some embodiments, each page comprises an entire row of the array. In alternative embodiments, each row (word line) can be divided into two or more pages. For example, in some devices each row is divided into two pages, one comprising the odd-order cells and the other comprising the even-order cells. In a typical implementation, a two-bit-per-cell memory device may have four pages per row, a three-bit-per-cell memory device may have six pages per row, and a four-bit-per-cell memory device may have eight pages per row.
Erasing of cells is usually carried out in blocks that contain multiple pages. Typical memory devices may comprise several thousand 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 thousand 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.
Analog memory cells are programmed to store data by writing storage values into the cells. Although the programming operation attempts to write nominal storage values that represent the data, the actual storage values found in the cells at the time of readout may deviate from these nominal values. The deviations may be caused by several factors, such as inaccuracies in the programming process, drift due to device aging, cell wearing due to previous programming and erasure cycles, disturb noise caused by memory operations applied to other cells in the array and/or cross-coupling interference from other cells. In practice, the storage values of the cells typically have a certain statistical distribution, which may vary from one cell group to another and/or over the lifetime of the memory cells.
(Although the description that follows refers mainly to threshold voltages of Flash memory cells, this choice is made purely for the sake of conceptual clarity. The methods and systems described herein can be used with any other type of storage value used in any other type of analog memory cells.)
In the present example, the memory cells comprise four-level MLC, with each cell storing two data bits. Curves 60A . . . 60D show the distributions of threshold voltages in the group of cells. Each curve corresponds to a subset of the cells that are programmed to a certain programming level or state. Thus, distributions 60A . . . 60D are also referred to as programming level distributions. Distributions 60A . . . 60D have respective median values denoted M1 . . . M4. In order to read the data from the memory cells, R/W unit 36 compares the storage values of the cells with one or more read thresholds. In the present example, three read thresholds TH1 . . . TH3 are used to differentiate between the four programming levels.
A curve 64 shows the Cumulative Distribution Function (CDF) of the threshold voltages in the group of cells. For a given threshold voltage on the horizontal axis, the CDF gives the relative number of cells whose threshold voltage does not exceed the given threshold voltage. In other words, CDF(x) gives the relative number of memory cells in the group, for which VTH≦x. Thus, the CDF is zero at the lower edge of the voltage axis, and increases monotonically to reach a value of unity at the upper edge of the voltage axis. Distributions 60A . . . 60D are sometimes referred to as Probability Density Functions (PDFs) of the programming levels, and the CDF can be regarded as the integral of the PDFs along the VTH axis.
Two regions 65 and 66 are marked on curve 64, in order to demonstrate the advantage of performing read operations using intermediate read thresholds that are positioned inside the programming level distributions. Region 65 is in the vicinity of the median of one of the programming level distribution (in the vicinity of median M3 of distribution 60C). Region 66, on the other hand, is in the boundary region between adjacent distributions (between distributions 60A and 60B. As can be appreciated, the CDF (curve 64) is relatively steep in region 65, and relatively flat in region 66. For a given reading accuracy, a steeper CDF enables higher accuracy in estimating CDF properties, such as distribution medians.
Setting Read Thresholds Using Distribution Medians
Embodiments of the present invention provide improved methods and systems for setting and adjusting the positions of read thresholds, e.g., thresholds TH1 . . . TH3 in
For a given read threshold used in differentiating between adjacent programming levels, the optimal threshold position is typically in the boundary region that separates the two programming levels. The location of this boundary region (and therefore the optimal read threshold position) may change over time, as explained above. The techniques described herein estimate the distribution medians, and then find the optimal read threshold position using the estimated medians.
The median of a statistical distribution is commonly known as a value that is higher than half of the population and lower than the other half of the population. The median of a given threshold voltage distribution is a (not necessarily unique) threshold voltage that is lower than half of the threshold voltages in the distribution, and higher than the other half. In the context of the present patent application and in the claims, the term “estimating a median” is used broadly to describe various calculations that provide information as to the median. For example, processes that estimate the distribution mean, as well as processes that estimate the peak (highest value) of the distribution's Probability Density Function (PDF), are also regarded as types of median estimation.
Thus, in the context of the present patent application and in the claims, the term “median” also covers other central values or measures of central tendency of the distribution, such as the distribution mean (arithmetic, weighted, geometric or any other type of mean), the peak of the distribution PDF (sometimes referred to as the mode of the distribution), or any other suitable measure. Typically, the disclosed techniques do not require that the median be estimated with high accuracy, and rough estimation is often sufficient for determining the optimal read threshold positions.
MSP 40 may estimate the median of a given threshold voltage distribution in various ways. Typically, the MSP finds the median by performing one or more read operations using intermediate read thresholds, which are positioned in the interior of the distribution (rather than in the boundary region between the distributions or at the distribution edges). Each read operation of this sort compares the cell threshold voltages to a given intermediate read threshold. The MSP or R/W unit may count the number of storage values that are below (or above) the intermediate read threshold.
If the intermediate read threshold were positioned at the distribution median, the read operation would indicate that 50% of the read threshold voltages are below the intermediate threshold and 50% are above it. A read result that deviates from 50% indicates that the intermediate threshold is offset from the median. The MSP may estimate the offset and thus determine the median value. In some embodiments, the functional behavior or shape of the CDF or PDF may be known a-priori, and only its position on the VTH axis is unknown. For example, the cell threshold voltages in a given programming level may be distributed according to a Gaussian distribution having a known variance. Alternatively, the MSP may store an estimated CDF, e.g., in numerical or analytical form. When the CDF shape is known, the MSP can calculate the distribution median using (1) the read results of a single read operation using an intermediate read threshold, and (2) the known shape of the CDF.
(In the present context, the term “estimated CDF” refers to any representation that is indicative of the estimated statistical distribution of the cell threshold voltages, such as CDF, inverse CDF, PDF, histogram or any other suitable representation.)
Alternatively, the MSP may perform two or more read operations, using different intermediate read thresholds that are placed at different positions within the threshold voltage distribution in question. Each read operation produces an additional data point of the programming level CDF. The MSP may thus estimate the distribution median using the results of the multiple read operations. Any suitable number of read operations can be used. A large number of read operations increases the estimation accuracy at the expense of higher computational complexity, and vice versa.
In the embodiments described herein, each intermediate read threshold is placed in the interior of the threshold voltage distribution in question, rather than between distributions. In other words, the threshold voltages of a given programming level distribution may be regarded as occupying a certain interval. The intermediate read thresholds, which are used for estimating the median of that distribution, are positioned in the interior of the interval. In the context of the present patent application and in the claims, the term “interior” is used to describe any position that contains a statistically-significant level of the distribution PDF, as opposed to interval edges. The interior of the interval may be defined, for example, as the positions that are distant from the distribution medians by less than a certain amount. This amount may be quantified, for example, in units of cell number or CDF value. The interior may also be defined as the positions that are within one standard deviation of the distribution mean or median, the positions for which the distribution PDF is larger than a certain value (e.g., 50% of the PDF peak), or using any other suitable definition.
MSP 40 may apply various methods for calculating the optimal read threshold based on the estimated medians. For example, the MSP may calculate the read threshold position based on each estimated median separately, and then combine (e.g., average) the two results. When calculating the average, the MSP may give different weights to the two medians, according to any suitable criterion. Alternatively, the MSP may apply any other suitable method for calculating the optimal read threshold based on the estimated medians.
The read operation indicates that 43% of the memory cells have threshold voltages that are lower than intermediate threshold 84, and 57% of the memory cells have threshold voltages that are higher than the intermediate threshold. Based on this result (and assuming that the shape of distribution 68A is known) the MSP can estimate an offset 88 between intermediate threshold 84 and media 72A, and thus estimate the median.
Alternatively, as noted above, the MSP may perform two or more read operations, using different intermediate thresholds in the interior of interval 80, and estimate median 72A using the results of these multiple read operations. This technique can be used, for example, when the shape of distribution 68A in unknown a-priori or when the actual CDF differs from the estimated (reference) CDF. Consider, for example, a scenario in which the estimated CDF represents wider programming level distributions than the actual CDF. In such a case, reading the memory cells using two intermediate read thresholds, one on either side of the reference CDF's median. This kind of two-sided estimation would detect and correct the difference between the actual and estimated CDFs, resulting in accurate median estimation.
In some embodiments, system 20 may comprise one or more hardware-based counters, which are incremented so as to count the number of memory cells whose threshold voltages fall on either side of the read threshold. The counters may be part of MSP 40 or of R/W unit 36 in the memory device.
The description of
In the embodiments described above, the read threshold position is estimated based on the medians of two adjacent programming level distributions, one on either side of the read threshold. In alternative embodiments, the MSP may estimate the read threshold position based on a single median of a single programming level distribution. In an example embodiment of this sort, the MSP reads a certain group of memory cells using one or more intermediate read thresholds that are positioned in the interior of a single programming level distribution, as explained above. Using the results of these read operations, the MSP estimates the median of the programming level distribution. Based on the median (e.g., using the known shape of the distribution) the MSP estimates the optimal position of the read threshold. Referring to
As can be appreciated, the read threshold estimation methods described herein involve additional read operations, which cause an increase in computational complexity. In some embodiments, the MSP attempts to optimize read thresholds only in response to an indication that the currently-used read thresholds are not set properly. For example, the MSP may invoke the methods of
In some embodiments, the MSP may assume certain nominal positions of the programming level distribution medians. Consider, for example, a group (e.g., word line) of N memory cells, each storing data in M programming levels. Assume also that the MSP stores a nominal CDF, such as curve 64 in
The MSP can determine the nominal media positions from the stored CDF using the relation above. When the actual CDF differs from the stored CDF (e.g., because the data is not distributed uniformly among the different programming levels, or because of various impairments), the actual median locations may deviate from the nominal locations. Nevertheless, the MSP may use the nominal media locations as a first approximate for read threshold calculation. In some embodiments, when applying the methods of
When carrying out the methods of
In some embodiments, the MSP stores multiple different CDFs, and selects the CDF that best matching CDF at any given time. The different stored CDFs may correspond, for example, to different wear levels of the memory cells (e.g., one CDF that best matches fresh memory cells, another CDF that well represents mid-life memory cells, and a third CDF that represents heavily-cycled memory cells). When calculation read thresholds for a given memory cell group, the MSP may choose the appropriate stored CDF based on any suitable criterion, such as the number of programming and erasure cycles the memory cells have gone through, previously-calculated read threshold positions in other cells groups (e.g., other word lines in the same block), or previously-estimated median locations in the same word lines.
In many MLC devices, different bits are read from the memory cells using respective, different read commands that use different sets of read thresholds. For example, in an eight-level MLC configuration, each memory cell stores three bits, which are referred to as a Least Significant Bit (LSB), a Central Significance Bit (CSB) and a Most Significant Bit (MSB). In a common reading scheme, the LSB is read using a read command having a single threshold, the CSB is read using a read command having a set of two thresholds, and the MSB is read using a read command having different set that includes four thresholds. In this example, the CSB and MSB read commands apply multiple read thresholds in a single read operation, and are therefore referred to herein as multi-threshold commands. Some aspects of reading memory cells using multi-threshold read commands are addressed, for example, in U.S. Patent Application Publication 2009/0106485, which is assigned to the assignee of the present patent application and whose disclosure is incorporated herein by reference.
In some embodiments, the MSP may read the memory cells using multiple intermediate read thresholds simultaneously by using the above-mentioned multi-threshold read commands. For example, in an eight-level MLC device, the MSP may sample four programming level distributions using a single MSB read command, which uses four read thresholds. This technique provides multiple CDF data points at a relatively short read time. Typically, however, in order to interpret the read results of the MSB read command, the MSP first needs to read the LSB and CSB bits of the cells (or otherwise obtain the LSB and CSB data).
Certain additional aspects of calculating read thresholds are addressed, for example, in PCT International Publications WO 2008/053472 and WO 2008/111058, which are assigned to the assignee of the present patent application and whose disclosures are incorporated herein by reference.
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.
This application is a continuation-in-part of U.S. patent application Ser. No. 12/558,528, filed Sep. 13, 2009, which claims the benefit of U.S. Provisional Patent Application 61/096,806, filed Sep. 14, 2008. The disclosures of these related applications are incorporated herein by reference.
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 Koening | 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 | Yong et al. | Jul 2002 | B1 |
6438037 | Fastow et al. | Aug 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 |
6751146 | Wang et al. | Jun 2004 | B1 |
6751766 | Guterman et al. | Jun 2004 | B2 |
6757193 | Chen et al. | Jun 2004 | B2 |
6768676 | Hirano | Jul 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 |
7646632 | Philipp 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 |
7817469 | Avraham et al. | Oct 2010 | B2 |
7830708 | Jung et al. | Nov 2010 | B1 |
7848149 | Gonzales et al. | Dec 2010 | B2 |
7864593 | Taeuber et al. | Jan 2011 | 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 |
7957189 | Avraham et al. | Jun 2011 | B2 |
7975189 | Kose | Jul 2011 | B2 |
7978516 | Olbrich et al. | Jul 2011 | B2 |
8000135 | Perlmutter 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 |
8248856 | Goss et al. | Aug 2012 | B2 |
8250437 | Sakurada et al. | Aug 2012 | 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 | Gorobetz | 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 |
20080253195 | Kamata | 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 et al. | Dec 2009 | A1 |
20090327608 | Eschmann | 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 |
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 |
Entry |
---|
US 7,161,836, 01/2007, Wan et al. (withdrawn) |
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. |
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), pp. 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, pp. 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. |
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. |
U.S. Appl. No. 12/251,471, filed Oct. 15, 2008. |
U.S. Appl. No. 12/534,893, filed Aug. 4, 2009. |
U.S. Appl. No. 12/534,898, 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/558,528, filed Sep. 13, 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/171,467, filed Jun. 29, 2011. |
U.S. Appl. No. 13/176,761, filed Jul. 6, 2011. |
Wei, L., “Trellis-Coded Modulation With Multidimensional Constellations”, IEEE Transactions on Information Theory, vol. IT-33, No. 4, pp. 483-501, Jul. 1987. |
U.S. Appl. No. 13/114,049 Official Action dated Sep. 12, 2011. |
U.S. Appl. No. 12/405,275 Official Action dated Jul. 29, 2011. |
Conway et al., “Sphere Packings, Lattices and Groups”, 3rd edition, chapter 4, pp. 94-135, Springer, New York, USA 1998. |
Chinese Patent Application # 200780040493.X Official Action dated Jun. 15, 2011. |
U.S. Appl. No. 12/037,487 Official Action dated Oct. 3, 2011. |
U.S. Appl. No. 12/649,360 Official Action dated Aug. 9, 2011. |
U.S. Appl. No. 13/192,504, filed Jul. 28, 2011. |
U.S. Appl. No. 13/192,852, filed Aug. 2, 2011. |
U.S. Appl. No. 13/231,963, filed Sep. 14, 2011. |
U.S. Appl. No. 13/239,408, filed Sep. 22, 2011. |
U.S. Appl. No. 13/239,411, filed Sep. 22, 2011. |
U.S. Appl. No. 13/214,257, filed Aug. 22, 2011. |
U.S. Appl. No. 13/192,501, filed Jul. 28, 2011. |
U.S. Appl. No. 13/192,495, filed Jul. 28, 2011. |
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. 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. |
Number | Date | Country | |
---|---|---|---|
61096806 | Sep 2008 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12558528 | Sep 2009 | US |
Child | 13170202 | US |