US 7,975,192 B2Grant
Reading memory cells using multiple thresholds
Issue Date:2011-07-05
•26 Claims
•9 Drawing Sheets
Abstract
A method for operating a memory (28) includes storing data, which is encoded with an Error Correction Code (ECC), in analog memory cells (32) of the memory by writing respective analog input values selected from a set of nominal values to the analog memory cells. The stored data is read by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells. At least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values. Soft metrics are computed responsively to the multiple comparison results. The ECC is decoded using the soft metrics, so as to extract the data stored in the analog memory cells.
Metadata
Assignee
- Anobit Technologies Ltd.
Inventors
- Naftali Sommer
- Ofir Shalvi
- Dotan Sokolov
Application Information
Application Number:US 11/995,814
Filing Date:2007-10-30
Priority Date:2006-10-30
Art Unit:2117
Classifications
IPC:
G11C29/42G11C29/50
Patent Drawings (9 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application is the U.S. national phase of PCT Application No. PCT/IL 2007/001315, filed Oct. 30, 2007, which claims the benefit of U.S. Provisional Patent Application No. 60/863,506, filed Oct. 30, 2006, U.S. Provisional Patent Application No. 60/867,399, filed Nov. 28, 2006, U.S. Provisional Patent Application No. 60/888,828, filed Feb. 8, 2007, U.S. Provisional Patent Application No. 60/889,277, filed Feb. 11, 2007, U.S. Provisional Patent Application 60/892,869, filed Mar. 4, 2007, U.S. Provisional Patent Application No. 60/894,456, filed Mar. 13, 2007, U.S. Provisional Patent Application No. 60/917,653, filed May 12, 2007, U.S. Provisional Patent Application No. 60/950,884, filed Jul. 20, 2007, and U.S. Provisional Patent Application No. 60/951,215, filed Jul. 22, 2007, whose disclosures are incorporated herein by reference.
FIELD OF THE INVENTION
[0002] The present invention relates generally to memory devices, and particularly to methods and systems for reading data from memory cells.
BACKGROUND OF THE INVENTION
[0003] 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, such as an electrical charge or voltage, which 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 regions, each region 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. The possible bit values that can be stored in an analog memory cell are also referred to as the memory states of the cell.
[0004] 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 memory states. 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 memory states.
[0005] Flash memory devices are described, for example, by Bez et al., in “Introduction to Flash Memory,” Proceedings of the IEEE, volume 91, number 4, Apr., 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.
[0006] 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.
[0007] The analog values read from analog memory cells are sometimes distorted. The distortion may be due to various reasons, such as electrical field coupling from neighboring memory cells, disturb noise caused by memory access operations on other cells in the array and threshold voltage drift caused by device aging. Some common distortion mechanisms are described in the article by Bez et al., cited above. Distortion effects are also described by Lee et al., in “Effects of Floating Gate Interference on NAND Flash Memory Cell Operation,” IEEE Electron Device Letters, (23:5), May, 2002, pages 264-266, which is incorporated herein by reference.
[0008] Reading data from analog memory cells often involves comparing the analog values stored in the cells to one or more thresholds, or reference levels. Several methods for determining the appropriate threshold values 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. Hard errors may arise from cells whose threshold voltages drifted from their intended level to cause read errors. The 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.
[0009] 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.
[0010] 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. In some embodiments, after successful error correction, a subsequent read request is handled without re-writing data to the flash memory cells in the interim.
[0011] 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.
[0012] U.S. Pat. No. 7,196,928 and U.S. patent Application Publications 2006/0221692, 2007/0103986, 2007/0109845 and 2007/0109849, whose disclosures are incorporated herein by reference, describe several processes for reading a memory cell, which take into account the programmed state of an adjacent memory cell.
[0013] Some known methods use information regarding the quality of stored data when reading the data from memory cells. For example, U.S. Pat. No. 6,751,766, whose disclosure is incorporated herein by reference, describes several methods for assessing the quality of data stored in a memory system, and for operating the memory system according to the assessed quality. The data quality is sometimes assessed during read operations. Subsequent use of an Error Correction Code (ECC) can utilize the quality indications to detect and reconstruct the data with improved effectiveness. Alternatively, a statistics of data quality can be constructed and digital data values can be associated in a modified manner to prevent data corruption.
SUMMARY OF THE INVENTION
[0014] Embodiments of the present invention provide a method for operating a memory, including:
-
- [0015] storing data, which is encoded with an Error Correction Code (ECC), in analog memory cells of the memory by writing respective analog input values selected from a set of nominal values to the analog memory cells;
[0016] reading the stored data by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values;
[0017] computing soft metrics responsively to the multiple comparison results; and
[0018] decoding the ECC using the soft metrics, so as to extract the data stored in the analog memory cells.
[0019] In some embodiments, each of the analog memory cells stores one or more bits of the data, and each of the soft metrics corresponds to one of the bits. In an embodiment, each of at least some of the analog memory cells stores two or more bits of the data, reading the data includes, for each of the at least some of the analog memory cells, reading the two or more data bits in respective two or more decoding stages, and computing the soft metrics includes modifying a soft metric of a first bit read in a first decoding stage responsively to a value of a second bit read in a second decoding stage that precedes the first decoding stage. Modifying the soft metric may include conditionally inverting the soft metric of the first bit depending on the value of the second bit.
[0020] In another embodiment, the method includes making an initial attempt to decode the ECC using an initial set of the read thresholds, such that no more than one of the read thresholds in the initial set is positioned between each pair of the nominal values that are adjacent to one another, and comparing the analog output values to the multiple read thresholds upon a failure of the initial attempt.
[0021] In yet another embodiment, each comparison result has one of first and second possible values, and computing the soft metrics includes determining respective first and second counts of the comparison results having the first and second possible values, and computing the soft metrics based on the first and second counts.
[0022] In still another embodiment, the method further includes, upon failing to decode the ECC, adding one or more additional read thresholds to the multiple read thresholds, re-computing the soft metrics responsively to the additional read thresholds, and decoding the ECC using the re-computed soft metrics. Adding the additional threshold may include progressively increasing a number of the read thresholds until a predetermined condition is met.
[0023] In a disclosed embodiment, reading the data from a first group of the analog memory cells further includes estimating interference caused to the first group by a second group of the analog memory cells and canceling the estimated interference. Canceling the estimated interference may include modifying the soft metrics associated with the first group responsively to the estimated interference. In some embodiment, the method includes, upon failing to decode the ECC in the first group, selecting whether to perform one of:
[0024] re-reading the data in the second group, so as to re-estimate and cancel the interference;
[0025] re-estimating the interference by reading the data in a third group of the memory cells; and
[0026] adding one or more additional read thresholds and re-reading the data in the first group using the additional read thresholds.
[0027] In an embodiment, computing the soft metrics includes normalizing the soft metrics so as not to depend on a number of the read thresholds. Performing the multiple read operations may include positioning the multiple read thresholds at non-uniform intervals with respect to one another.
[0028] There is additionally provided, in accordance with an embodiment of the present invention, a data storage apparatus, including:
[0029] an interface, which is operative to communicate with a memory that includes a plurality of analog memory cells; and
[0030] a memory signal processor (MSP), which is connected to the interface and is coupled to store data, which is encoded with an Error Correction Code (ECC), in the analog memory cells by writing respective input analog values selected from a set of nominal values to the analog memory cells, to read the stored data by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values, to compute soft metrics responsively to the multiple comparison results, and to decode the ECC using the soft metrics, so as to extract the data stored in the analog memory cells.
[0031] There is also provided, in accordance with an embodiment of the present invention, a data storage apparatus, including:
[0032] a memory device, including:
[0033] a plurality of analog memory cells, which are configured to store data, which is encoded with an Error Correction Code (ECC) and written to the analog memory cells as respective analog input values selected from a set of nominal values; and
[0034] reading circuitry, which is coupled to read the stored data by performing multiple read operations that compare output analog values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values, to compute soft metrics responsively to the multiple comparison results, and to output the computed soft metrics; and
[0035] a Memory Signal Processor (MSP) device, which is connected to the memory device and is coupled to accept the soft metrics computed by the reading circuitry, and to decode the ECC using the soft metrics.
[0036] There is further provided, in accordance with an embodiment of the present invention, a method for operating a memory, including:
[0037] storing data, which is encoded with an Error Correction Code (ECC), in analog memory cells of the memory by writing respective analog input values to the analog memory cells;
[0038] reading the stored data by comparing analog output values of the analog memory cells to a set of read thresholds, so as to produce multiple comparison results for each of the analog memory cells;
[0039] computing soft metrics responsively to the multiple comparison results;
[0040] decoding the ECC using the soft metrics, so as to extract the data stored in the analog memory cells; and
[0041] upon a failure to successfully extract the data, extending the set of the read thresholds by adding one or more new read thresholds to the set, updating the multiple comparison results based on the extended set of the read thresholds, re-computing the soft metrics and re-decoding the ECC, so as to extract the data.
[0042] In an embodiment, extending the set of the read thresholds includes selecting the one or more new read thresholds responsively to the output analog values of the analog memory cells. Selecting the one or more new read thresholds may include determining at least one property selected from a group of properties consisting of a number of the new read thresholds and values of the new read thresholds.
[0043] 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
[0044] FIG. 1 is a block diagram that schematically illustrates a system for memory signal processing, in accordance with an embodiment of the present invention;
[0045] FIG. 2 is a diagram that schematically illustrates a memory cell array, in accordance with an embodiment of the present invention;
[0046] FIG. 3 is a diagram that schematically illustrates read thresholds in a Single-Level Cell (SLC), in accordance with an embodiment of the present invention;
[0047] FIG. 4 is a diagram that schematically illustrates read thresholds in a Multi-Level Cell (MLC), in accordance with an embodiment of the present invention;
[0048] FIG. 5 is a flow chart that schematically illustrates a method for reading data from analog memory cells, in accordance with an embodiment of the present invention;
[0049] FIG. 6 is a flow chart that schematically illustrates a method for computing soft metrics, in accordance with an embodiment of the present invention;
[0050] FIG. 7 is a block diagram that schematically illustrates a circuit for computing soft metrics, in accordance with an embodiment of the present invention;
[0051] FIG. 8 is a flow chart that schematically illustrates a method for reading data from analog memory cells, in accordance with another embodiment of the present invention;
[0052] FIG. 9 is a diagram that schematically illustrates a process for reading data from analog memory cells, in accordance with yet another embodiment of the present invention;
[0053] FIG. 10 is a flow chart that schematically illustrates a method for reading data from analog memory cells, in accordance with still another embodiment of the present invention; and
[0054] FIG. 11 is a block diagram that schematically illustrates a system for memory signal processing, in accordance with an alternative embodiment of the present invention.
DETAILED DESCRIPTION OF EMBODIMENTS
Overview
[0055] Embodiments of the present invention provide improved methods and systems for reading data from analog memory cells, such as Flash memory cells. In some embodiments that are described hereinbelow, a Memory Signal Processor (MSP) stores data, which is encoded with an Error Correction Code (ECC), in an array of analog memory cells. The MSP stores the encoded data by writing respective analog values to the analog memory cells. The analog values are selected from a set of nominal analog values, which represent the data.
[0056] The MSP reads the data from the analog memory cells by performing multiple read operations, which compare the analog values written to the cells to multiple read thresholds. The read thresholds are set so that at least two of them are positioned between a pair of adjacent nominal analog values. The multiple threshold comparisons produce multiple comparison results for each of the analog memory cells. The MSP computes soft metrics based on the multiple comparison results. The soft metrics provide quantitative measures of the levels of confidence or certainty that are associated with the values read from the memory cells, or of individual bits within the memory cells. The MSP decodes the ECC using the soft metrics. In some embodiments, the MSP increases the number of read thresholds in an iterative manner, until successful decoding is achieved.
[0057] Some known reading methods differentiate between adjacent memory states using a single threshold at any given time. Unlike these known methods, the methods and systems described herein perform multiple read operations using multiple thresholds, which are positioned between adjacent memory states. Typically, multiple thresholds are positioned in boundary regions between adjacent nominal values, so that the multiple comparison results convey valuable information regarding the statistical distribution of the analog values in these regions. As a result, the soft metrics, which are based on this information, enable the ECC decoding process to correct a higher number of read errors and to provide an improved overall error probability.
[0058] Some known reading methods modify the threshold values in order to improve decoding performance. Unlike these known methods, the methods and systems described herein do not adapt the threshold values, but rather add new thresholds to the existing set, and improve the decoding performance by refining the accuracy of the soft metrics.
[0059] The improved decoding performance achieved by the disclosed methods and systems enables improving the data storage reliability, storage density and retention time of memory devices, and enables lowering the memory device cost and complexity for a given performance level.
System Description
[0060] FIG. 1 is a block diagram that schematically illustrates a system 20 for memory signal processing, 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 (“disk-on-key” devices), digital cameras, music and other media players and/or any other system or device in which data is stored and retrieved.
[0061] 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 28 may comprise analog memory cells of any kind, such as, for example, NAND, NOR and CTF Flash cells, PCM, NROM, FRAM, MRAM and 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.
[0062] System 20 stores data in the analog memory cells by programming the cells to assume respective memory states. The memory states are selected from a finite set of possible states, and each state corresponds to a certain nominal analog value. For example, a 2 bit/cell MLC can be programmed to assume one of four possible memory states by writing one of four possible nominal analog values into the cell.
[0063] Data for storage in memory device 24 is provided to the device and cached in data buffers 36. The data is then converted to analog voltages and written into memory cells 32 using a reading/writing (RJW) unit 40, whose functionality is described in greater detail below. When reading data out of array 28, R/W unit 40 converts the electrical charge, and this the analog voltages of memory cells 32, into digital samples having a resolution of one or more bits. The samples are cached in buffers 36. The operation and timing of memory device 24 is managed by control logic 48.
[0064] The storage and retrieval of data in and out of memory device 24 is performed by a Memory Signal Processor (MSP) 52. MSP 52 comprises a signal processing unit 60, which processes the data that is written into and read from device 24. Unit 60 encodes the data to be written into the memory cells using an Error Correction Code (ECC), and decodes the ECC of the retrieved data.
[0065] In particular, MSP 52 reads data out of memory cells 32 by comparing the values read from the cells to multiple read thresholds. The ECC decoding scheme used by unit 60 operates on soft metrics, which are computed based on the multiple threshold comparisons. exemplary methods for reading data and for computing soft metrics are described in detail below.
[0066] Many known ECC decoding schemes can accept soft metrics of the encoded bits or symbols as input. For example, unit 60 may use a block code such as the Bose-Chaudhuri-Hocquenghem (BCH) code, Low-Density Parity Check (LDPC) code or Reed-Solomon (RS) code, a trellis code, a turbo-code, or any other suitable ECC and decoding scheme, which is able to operate on soft metrics. The methods and systems described herein are not limited to block codes and can be used with convolutional codes, as well.
[0067] MSP 52 comprises a data buffer 72, which is used by unit 60 for storing data and for interfacing with memory device 24. MSP 52 also comprises an Input/Output (I/O) buffer 56, which forms an interface between the MSP and the host system. A controller 76 manages the operation and timing of MSP 52. Signal processing unit 60 and controller 76 may be implemented in hardware. Alternatively, unit 60 and/or controller 76 may comprise microprocessors that run suitable software, or a combination of hardware and software elements.
[0068] The configuration of FIG. 1 is an exemplary system configuration, which is shown purely for the sake of conceptual clarity. Any other suitable configuration can also be used. 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.
[0069] In the exemplary system configuration shown in FIG. 1 , memory device 24 and MSP 52 are implemented as two separate Integrated Circuits (ICs). In alternative embodiments, however, the memory device and MSP may be integrated on separate semiconductor dies in a single Multi-Chip Package (MCP) or System on Chip (SoC). Further alternatively, some or all of the MSP circuitry may reside on the same die on which memory array 28 is disposed. An exemplary configuration of this sort is described in FIG. 11 below. Further alternatively, some or all of the functionality of MSP 52 can be implemented in software and carried out by a processor or other element of the host system. In some implementations, a single MSP 52 may be connected to multiple memory devices 24. Additional architectural aspects of certain embodiments of system 20 are described in greater detail in U.S. Provisional Patent Application 60/867,399, cited above.
[0070] In a typical writing operation, data to be written into memory device 24 is accepted from the host and cached in I/O buffer 56. The data is transferred, via data buffers 72, to memory device 24. The data may be pre-processed by MSP 52 before it is transferred to the memory device for programming. For example, unit 60 may encode the data using an ECC, add certain data for internal use, and/or scramble the data. In device 24 the data is temporarily stored in buffers 36. R/W unit 40 converts the data to nominal analog values and writes the nominal values into the appropriate cells 32 of array 28.
[0071] In a typical reading operation, R/W unit 40 reads analog values out of the appropriate memory cells 32 and converts them to soft digital samples. The samples are cached in buffers 36 and transferred to buffers 72 of MSP 52. In some embodiments, unit 60 of MSP 52 converts the samples to data bits. As noted above, the range of possible analog values is divided into two or more regions, with each region representing a certain combination of one or more data bits.
[0072] As will be described in greater detail further below, the memory cells are read by comparing their analog values to multiple sets of read thresholds. For each cell, the MSP computes a soft metric based on the multiple comparison results. The soft metrics are then used by the MSP when decoding the ECC. The decoded data is transferred via I/O buffer 56 to the host system.
Memory Array Structure
[0073] FIG. 2 is a diagram that schematically illustrates memory cell array 28, in accordance with an embodiment of the present invention. Although FIG. 2 refers to Flash memory cells that are connected in a particular array configuration, the principles of the present invention are applicable to other types of memory cells and other array configurations, as well. Some exemplary cell types and array configurations are described in the references cited in the Background section above.
[0074] Memory cells 32 of array 28 are arranged in a grid having multiple rows and columns. Each cell 32 comprises a floating gate Metal-Oxide Semiconductor (MOS) transistor. A certain amount of electrical charge (electrons or holes) can be stored in a particular cell by applying appropriate voltage levels to the transistor gate, source and drain. The value stored in the cell can be read by measuring the threshold voltage of the cell, which is defined as the minimal voltage that needs to be applied to the gate of the transistor in order to cause the transistor to conduct. The read threshold voltage is indicative of the charge stored in the cell.
[0075] In the exemplary configuration of FIG. 2 , the gates of the transistors in each row are connected by word lines 80. The sources of the transistors in each column are connected by bit lines 84. In some embodiments, such as in some NOR cell devices, the sources are connected to the bit lines directly. In alternative embodiments, such as in some NAND cell devices, the bit lines are connected to strings of floating-gate cells.
[0076] Typically, R/W unit 40 reads the threshold voltage of a particular cell 32 by applying varying voltage levels to its gate (i.e., to the word line to which the cell is connected) and checking whether the drain current of the cell exceeds a certain threshold (i.e., whether the transistor conducts). Unit 40 usually applies a sequence of different voltage values to the word line to which the cell is connected, and determines the lowest gate voltage value for which the drain current exceeds the threshold. Typically, unit 40 reads a group of cells, referred to as a page, simultaneously. Alternatively, R/W unit may use any other technique or circuitry for reading and writing values to and from memory cells 32 of array 28.
[0077] The memory cell array is typically divided into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously. 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 SLC devices each row is divided into two pages, one comprising the odd-order cells and the other comprising the even-order cells. Typically but not necessarily, a two-bit-per-cell memory device usually has four pages per row, a three-bit-per-cell memory device has six pages per row, and a four-bit-per-cell memory device has eight pages per row.
[0078] 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 is often partitioned into four pages (odd/even order cells, least/most significant bit of the cells). Alternatively, other block sizes and configurations can also be used. Three-bit-per cell devices often have 192 pages per erasure block, and four-bit-per-cell devices often have 256 pages per block.
[0079] 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.
Memory Cell Distortion Mechanisms
[0080] The analog values (e.g., threshold voltages) stored in memory cells 32 may contain various types of distortion, which are caused by different distortion mechanisms in array 28. For example, electrical cross-coupling between nearby cells in the array may modify the threshold voltage of a particular cell. As another example, electrical charge may leak from the cells over time. As a result of this aging effect, the threshold voltage of the cells may drift over time from the initially-written value. Another type of distortion, commonly referred to as disturb noise, is caused by memory access operations (e.g., read, write or erase operations) on certain cells in the array, which cause unintended charge variations in other cells. As yet another example, the source-drain current of a particular cell can be affected by the charge in adjacent cells, e.g., other cells in the same NAND cell string, via an effect referred to as Back Pattern Dependency (BPD).
[0081] The distortion in memory cells 32 degrades the performance of the memory device, e.g., the error probability when reconstructing the data, the achievable storage capacity and/or the achievable data retention period. Performance degradation is particularly severe in MLC devices, in which the differences between the different voltage levels that represent the data are relatively small.
Reading Memory Cells Using Multiple Thresholds
[0082] Embodiments of the present invention provide improved methods and systems for reading data from analog memory cells 32 of array 28, by using multiple read thresholds. The methods described herein are suitable for both SLC devices (as illustrated, for example, in FIG. 3 below) and MLC devices (as illustrated, for example, in FIG. 4 below).
[0083] FIG. 3 is a diagram that schematically illustrates read thresholds in an SLC device, in accordance with an embodiment of the present invention. The figure shows two statistical distributions of the threshold voltages in a group (e.g., page) of analog memory cells. For a specific page, the diagram represents a histogram of the threshold voltages stored in the memory cells of the page. In the example of FIG. 3 , each memory cell is programmed to one of two possible nominal levels, i.e., each cell stores a single data bit. Due to various distortion variations among the cells and various impairment mechanisms, the actual threshold voltages read from the memory cells may statistically vary from the nominal levels. In the present example, a curve 90A shows the distribution of threshold voltages of the cells, which are programmed to store a “1” value. A curve 90B shows the distribution of threshold voltages of the cells that are programmed to store “0”.
[0084] As can be seen in the figure, curves 90A and 90B overlap. In other words, there is a finite probability that a memory cell, which was programmed to a certain bit value, will be erroneously interpreted as being programmed to another bit value. The position of the read threshold or thresholds used to differentiate between “1” and “0” has a considerable effect on the probability of error. In some embodiments of the present invention, MSP 52 reconstructs the data stored in the memory cells by combining information, which is obtained using multiple read thresholds, in order to reduce the probability of error.
[0085] FIG. 3 shows five thresholds denoted T1 . . . T5. In some embodiments, MSP 52 reads each memory cell using each of the thresholds. Each read operation produces a comparison result, i.e., an indication of whether the read threshold voltage is greater or smaller than the threshold used in the operation. In the exemplary embodiment of FIG. 3 , the MSP reads each memory cell five times, using thresholds T1 . . . T5, to produce five respective comparison results. The MSP may go through the different thresholds at any suitable order. For example, the MSP may begin with the threshold positioned in the middle of the desired region and gradually move away from this point by adding thresholds on either side of the initial threshold. Exemplary iterative methods that gradually increase the number of thresholds are described further below.
[0086] For each memory cell being read, the MSP computes a soft metric using the multiple comparison results. The soft metric indicates a confidence level or measure of certainty associated with the value read from the memory cell. In some embodiments, the soft metric indicates a likelihood that the read value corresponds to a certain data value (e.g., a very low metric value may indicate a high certainty that the read value corresponds to a “1”, a very high metric value indicates that the read value is likely to represent a “0”, and intermediate metric values indicate lower confidence). In other embodiments, the metric value indicates the reliability of the read value without indicating a particular bit value (e.g., low metric value indicates low confidence, high metric value represents high confidence).
[0087] In the context of the present patent application and in the claims, the term “soft metric” refers to any type of quantitative measure that conveys more than a single bit of information, i.e., more than two possible values. For example, the soft metric may comprise a fixed- or floating-point numerical value represented using two or more bits. Another exemplary type of soft metric, sometimes referred to as “erasure,” assigns each read memory cell one of three possible values—“0”, “1” or “uncertain.” Further alternatively, any other suitable type of soft metric can be used.
[0088] Note that when each cell stores multiple data bits, a soft metric value may be computed and assigned to each individual bit. For example, in a four-level MLC, one metric value is computed for the Least Significant Bit (LSB) and another metric value is computed for the Most Significant Bit (MSB). Detailed examples of metric computation methods for both SLC and MLC applications are described further below.
[0089] MSP 52 may use any suitable method for computing the soft metric value based on the multiple comparison results. In some embodiments, the MSP may use a table, which provides the metric values associated with different combinations of the comparison results. For example, the following table can be used with the five-threshold configuration of FIG. 3 :
[0090]
| Comparison results | Metric | ||||
| T1 | T2 | T3 | T4 | T5 | value |
| 0 | 0 | 0 | 0 | 0 | M1 |
| 0 | 0 | 0 | 0 | 1 | M2 |
| 0 | 0 | 0 | 1 | 0 | M3 |
| 0 | 0 | 0 | 1 | 1 | M4 |
| — | — | — | — | — | — |
| 1 | 1 | 1 | 1 | 0 | M31 |
| 1 | 1 | 1 | 1 | 1 | M32 |
[0091] The table above provides thirty-two soft metric values denoted M1 . . . M32, which correspond to the thirty-two possible combinations of five comparison results of thresholds T1 . . . T5. Following the notation of FIG. 3 , a “0” comparison result means that the read value was higher than the threshold used, and a “1” comparison result means the read value was lower than the threshold.
[0092] Typically, M1 and M32 will indicate high confidence levels, since these metric values correspond to situations in which the read operations with all five thresholds produce the same comparison results. Other combinations of comparison results will usually be assigned metrics that indicate lower confidence levels.
[0093] Some sets of comparison results may be regarded as inconsistent or self-contradictory. For example, assume T1 <T2 <T3 <T4 <T5, and that the five comparison results produced by thresholds T1 . . . T5 are denoted C1 . . . C5, respectively. The result set ‘1,1,1,0,1’ for a certain memory cell is inconsistent because it indicates that the analog value is larger than T4 and smaller than T3, even though T4 >T3. Such a result set may be caused, for example, when the cell has a high level of read noise in at least one of the read operations. Result sets such as ‘1,1,1,1,0’, ‘1,1,1,0,0’, or ‘1,0,0,0,0’, on the other hand, are consistent.
[0094] The MSP may treat inconsistent sets of comparison results in different manners, by assigning them different soft metric values. For example, the MSP may regard inconsistent result sets as uncertain and mark them as erasures to the ECC decoding process. Alternatively, the MSP may disregard or otherwise attempt to resolve some inconsistencies. For example, the MSP may regard a ‘1,1,0,1,1,’ result set similarly to a ‘1,1,1,1,1’ set, assuming that the “0” comparison result of T3 was caused by read noise.
[0095] Alternatively to using tables, MSP 52 may evaluate a function that operates on the multiple comparison results and produces the corresponding soft metric value. For example, the MSP may evaluate Log Likelihood Ratios (LLRs) of individual bits in each memory cell, which are defined as
[0096]
[0097] wherein Xi denotes a particular data bit stored in the memory cell in question, and r denotes the analog value read from the cell. The use of LLRs as metrics that are provided to an ECC decoding process is described, for example, in PCT Patent Application PCT/IL2007/000580, entitled “Combined Distortion Estimation and Error Correction Coding For Memory Devices,” filed May 10, 2007, whose disclosure is incorporated herein by reference.
[0098] In order to calculate the LLR, the MSP may maintain two values for each memory cell: (1) the largest read threshold that was found to be below the analog value of the cell, denoted Va, and (2) the smallest read threshold that was found to be above the analog value of the cell, denoted Vb. The LLR of the cell can be shown to be approximated by
[0099]
wherein T1 denotes the center analog value of the nearest distribution that has “1” as its data bit, and T0 denotes the center value of the nearest distribution having “0” as its data bit. The distribution of r is assumed Gaussian with variance σ2.
wherein T1 denotes the center analog value of the nearest distribution that has “1” as its data bit, and T0 denotes the center value of the nearest distribution having “0” as its data bit. The distribution of r is assumed Gaussian with variance σ2.
[0100] As the memory cell is read with an increasing number of read thresholds, the MSP updates Va and Vb. At each stage, the actual analog value of the cell is known to be within the interval [Va,Vb]. As the number of thresholds increases, the interval shrinks, the uncertainty becomes smaller and the estimated LLR becomes more accurate.
[0101] Further alternatively, the MSP may use any other suitable method or mechanism for computing the soft metric values based on the multiple comparison results.
[0102] MSP 52 uses the soft metrics when decoding the ECC. In a typical application, the data stored in a group of memory cells, such as in a certain memory page, forms a single codeword. When decoding a certain ECC codeword, signal processing unit 60 of the MSP uses the soft metric values of the memory cells in the group. As a result, memory cells that are considered to have a high confidence level are given more weight in the ECC decoding process, and vice versa.
[0103] FIG. 4 is a diagram that schematically illustrates read thresholds in an MLC device, in accordance with an embodiment of the present invention. In the example of FIG. 4 , each memory cell is programmed to one of four possible nominal levels, thus storing two bits of data. Curves 94A . . . 94D show the threshold voltage distributions of the memory cells that are programmed to store “11”, “01”, “00” and “10” data, respectively. In the present example, MSP 52 reads the memory cells using five sets of thresholds. Each threshold set comprises three thresholds, which are typically positioned in the three boundary regions between pairs of adjacent distribution curves. The threshold sets are listed in the following table:
[0104]
| Threshold set | Thresholds |
|---|---|
| 1 | T11, T21, T31 |
| 2 | T12, T22, T32 |
| 3 | T13, T23, T33 |
| 4 | T14, T24, T34 |
| 5 | T15, T25, T35 |
[0105] In some embodiments, MSP 52 reads the threshold voltage of the cell using each of the fifteen thresholds, and computes a soft metric based on the fifteen comparison results. The MSP may use any type of soft metric and any method of computing the metric value based on the multiple comparison results. The MSP uses the soft metric values as input to the ECC decoding process, as explained above.
[0106] In alternative embodiments, the memory cell is read in two stages, corresponding to the two bits stored in the cell. For example, in the configuration of FIG. 4 , the R/W unit performs a first set of comparisons using the five thresholds T21, T22, T23, T24 and T25, i.e., the thresholds located in the middle of the voltage axis, between curves 94B and 94C. The MSP computes a first soft metric based on the five comparison results obtained using these five thresholds. Note that both nominal levels located above thresholds T21 . . . T25 have an LSB value of “0” and that both nominal levels located below thresholds T21 . . . T25 have an LSB value of “1”. Therefore, the first soft metric corresponds to the LSB. Once the LSB is decoded, the R/W unit performs a second set of comparisons. The R/W unit may use thresholds T11 . . . T15 or thresholds T31 . . . T35 in the second stage, depending on the decoded value of the LSB. If the LSB was determined to be “1”, i.e., the read value was determined to be in the lower part of the voltage range, the MSB will be decoded using thresholds T11 . . . T15 in the second stage. If the LSB was decoded as “0”, the MSB will be decoded using thresholds T31 . . . T35. The MSP computes a second metric, which corresponds to the MSB, based on the five comparison results obtained in the second comparison stage.
[0107] A similar multi-stage comparison process can be carried out in multi-level cells storing a higher number of bits. For example, in eight-level (3 bit/cell) cells, the MSP and R/W unit may perform a three-stage comparison process to decode the individual bits. Apart from the first stage, the selection of the thresholds used in each stage typically depends on the decoded values of the previous bits.
[0108] In alternative multi-stage reading processes, each bit is read independently of the other bits. For example, referring to FIG. 4 , the LSB can be read using thresholds T21 . . . T25. The MSB is read by sequentially reading the cell using both thresholds T11 . . . T15 and T31 . . . T35. If the comparison results indicate that the analog value is between T11 . . . T15 and T31 . . . T35, the bit is determined to be “0”. If, on the other hand, the comparison results indicate that the analog value is larger than T31 . . . T35 or smaller than T11 . . . T15, the bit is determined to be “1”. In this example, the comparison results to thresholds T21 . . . T25, which were used for reading the LSB, are not used for reading the MSB. Similar processes may be performed for other types of MLC, such as eight-level cells storing three bits per cell.
[0109] The threshold configurations shown in FIGS. 3 and 4 above are exemplary configurations, which were chosen purely for the sake of conceptual clarity. In alternative embodiments, system 20 may use any desired number of nominal levels, any other mapping of bit values to nominal levels and any desired number of threshold sets. Although FIGS. 3 and 4 show thresholds that are spaced at regular increments, the methods and systems described herein may use irregularly-spaced thresholds, as well. In MLC devices, the threshold spacing may vary from one voltage region to another. For example, in FIG. 4 , thresholds T11 . . . T15 may be spaced differently than thresholds T21 . . . T25. Different threshold spacing may be used, for example, when different analog value distributions have different shapes or different spacing with respect to one another. The MSP may modify the threshold spacing, or otherwise select the threshold values to use, such as based on estimation of the analog value distributions.
[0110] FIG. 5 is a flow chart that schematically illustrates a method for reading data from analog memory cells 32, in accordance with an embodiment of the present invention. For a certain memory cell, the method begins with system 20 performing multiple read operations using respective multiple thresholds, at a reading step 100. The multiple read operations produce respective multiple comparison results, i.e., indications of whether the threshold voltage of the cell is smaller or greater than the different thresholds. MSP 52 computes a soft metric of the memory cell based on the multiple comparison results, at a metric computation step 104.
[0111] The MSP typically repeats the process of steps 100 and 104 above over a group of memory cells, whose data forms a single ECC codeword. In a typical implementation, R/W unit 40 reads the cells of an entire page of the memory device, using a particular threshold value, simultaneously. Once the soft metrics of the cells that store a certain codeword are computed, the MSP decodes the codeword using the metrics, at a decoding step 108. The MSP extracts the decoded data, at a data extraction step 112. The decoded data is typically output to the host system.
[0112] The multiple-threshold reading methods described herein can also be viewed as an efficient means for obtaining accurate information regarding the stored analog values using a relatively small number of read operations. Theoretically, if the exact analog values stored in the memory cells were known to the MSP (e.g., by employing high-resolution analog-to-digital conversion), this information could be used to extract probability measures on the stored data. However, the basic read operation of analog memory devices, such as Flash memories, usually comprises comparison operations, which compare the analog value stored in a cell to a single threshold. In order to obtain the analog value with a given resolution, the entire possible voltage range would have to be searched or scanned with the desired resolution. For example, if the range of possible analog values is 0-4V, and the desired resolution is 10 mV, 400 read operations would be needed. In practice, however, much of the valuable statistical information can be obtained by performing a much smaller number of read operations, for example by positioning the read thresholds in a region around the midpoint between distributions. The methods and systems described herein thus provide efficient means of gaining insight to such analog value statistics using a relatively small number of read operations.
[0113] In many practical cases, performing a large number of read operations on a certain memory cell is a computationally-intensive task, which complicates and slows down the data retrieval process. Moreover, the ECC is usually strong enough to successfully decode the vast majority of codewords, even when the memory cells are read using a single set of thresholds. Therefore, in some embodiments, the MSP initially reads the memory cells using a single set of thresholds. The MSP reverts to read the memory cells that correspond to a certain codeword using the multiple-threshold methods described herein only when the ECC decoding process fails.
[0114] The methods of FIGS. 3-5 above can be applied iteratively, gradually increasing the number of thresholds used. For example, the MSP may attempt to reconstruct the data using soft metrics that are based on two sets of thresholds. If the data cannot be reconstructed (i.e., if the ECC fails), the MSP can re-read the memory cells using a third threshold set. The iterations may continue until ECC decoding succeeds, or until reaching a predetermined maximum number of threshold sets. Note that at each stage of the iterative process, the MSP computes the soft metrics based on the multiple comparison results that are available so far. In some cases, the MSP may use information, such as metric values, which was calculated in previous iterations. The iterative process enables a gradual increase in the number of computations, only as needed to carry out successful decoding.
Soft Metrics Based on Counting Computation Results
[0115] In some embodiments, the MSP computes the soft metric value based on the number of computation results falling on either side of the thresholds. (In the description that follows, a “0” comparison result means the read value was higher than the threshold, and vice versa. This convention, however, is chosen purely for the sake of convenience, and the opposite convention can also be used.) Consider, for example, the exemplary SLC embodiment of FIG. 3 above. In this embodiment, out of the five comparison results, if the number of “0” comparison results is considerably higher than the number of “1” results, it is likely that the cell was programmed to “0”. Similarly, if the number of “1” comparison results is considerably higher than the number of “0” results, the programmed bit is likely to be “1”. Similar logic can also be used within each stage of the multi-stage comparison process that decodes the individual bits of a MLC cell, which was described in FIG. 4 above.
[0116] FIG. 6 is a flow chart that schematically illustrates an exemplary method for computing soft metrics, in accordance with an embodiment of the present invention. The method description refers to an SLC application and makes reference to FIG. 3 above. This choice, however, is made purely for the sake of simplicity of explanation. The method can similarly be used in MLC applications, as well.
[0117] The method begins with the MSP defining multiple thresholds, at a threshold definition step 116. Typically but not necessarily, the thresholds are defined within the boundary region between the voltage distribution. In FIG. 3 , five thresholds are defined in the region in which curves 90A and 90B overlap. For example, assuming the mid-point between curves 90A and 90B is at 1 volt, and that the thresholds can be represented at a resolution of 20 mV, a set of thresholds can be defined to cover the voltage range of 1V±40 mV at 20 mV intervals.
[0118] The MSP reads the memory cells using the multiple thresholds, at a reading step 120. The MSP counts the number of comparison results falling on either side of the thresholds, at a counting step 124. In other words, the MSP determines the number of “0” comparison results and/or the number of “1” results out of the total number of threshold comparisons.
[0119] The MSP computes a soft metric associated with the cell (or with an individual bit within the cell) based on the count of comparison results, at a metric computation step 128. For example, assuming the five-threshold configuration of FIG. 3 above and a four-bit metric value, the MSP may compute the soft metric according to the following table:
[0120]
| Number of “0” | Number of “1” | ||
|---|---|---|---|
| computation | computation | ||
| results | results | Soft metric value | |
| 0 | 5 | “1111” = 15 | |
| 1 | 4 | “1100” = 12 | |
| 2 | 3 | “1001” = 9 | |
| 3 | 2 | “0110” = 6 | |
| 4 | 1 | “0011” = 3 | |
| 5 | 0 | “0000” = 0 | |
[0121] In the table above, if all five computation results are “1”, the stored data bit is “1” with high likelihood, therefore the maximum metric value of “1111” is assigned. At the other extreme, if all five comparison results are “0”, the stored bit is likely to be “0”, and the minimum metric value of “0000” is assigned. If some comparison results are “0” and others are “1”, the metric value is set to an intermediate value, which grows monotonously with the number of “1” results out of the total.
[0122] Alternatively, any other suitable method for determining the soft metric value based on the count of comparison results can be used. The metric computation may be implemented by querying a table that holds the metric values and is indexed by the count of comparison results, evaluating a function that operates on the count of the comparison results, or using any other suitable mechanism.
Exemplary Hardware Implementation for MLC Metric Computation
[0123] As noted above, when computing the soft metrics of individual bits in a multi-level cell, the selection of thresholds may depend on the values of previously-decoded bits. Moreover, the values of previously-decoded bits may in some cases affect the metric value itself.
[0124] Consider, for example, the four-level cell configuration of FIG. 4 above. When reading the data out of such a cell in a two-stage process, the LSB is first decoded by determining whether the value read from the cell falls on the left- or right-hand-side of thresholds T21 . . . T25. Note that in the example of FIG. 4 , the two nominal levels located below these thresholds have an LSB value of “1”, and the two nominal levels located above the thresholds have an LSB value of “0”.
[0125] The second decoding stage (decoding of the MSB) depends on the results of the first stage. When the LSB is “0”, decoding the MSB comprises determining whether the read value is likely to belong to curve 94C or to curve 94D. When the LSB is “1”, decoding the MSB comprises determining whether the read value is likely to belong to curve 94A or to curve 94B.
[0126] Note, however, that when comparing curves 94A and 94B (i.e., when LSB=“1”), high threshold voltages correspond to MSB=“0” and low threshold voltages correspond to MSB=“1”. When comparing curves 94C and 94D (i.e., when LSB=“0”) the situation is reversed, with high threshold voltages corresponding to MSB=“1” MSB and low threshold voltages corresponding to MSB=“0”. In such a situation, the soft metric value that depends on the count of comparison results should sometimes be inverted, so as to maintain the convention that a high metric value corresponds to “0” data. The decision whether or not to invert the metric value depends on the value of the previous bit. Equivalently, the value of the currently-read bit can be inverted instead of inverting the metric value. The conditional operation of inverting a value only if a previous value is equal to “1” can be implemented by performing an eXclusive-OR (XOR) operation between the current and previous bit values.
[0127] FIG. 7 is a block diagram that schematically illustrates an exemplary circuit for computing soft metrics in a multi-level cell, in accordance with an embodiment of the present invention. Although the description that follows refers to a hardware or firmware implementation, a similar mechanism can be implemented in software, or as a combination of software and hardware elements.
[0128] The circuit of FIG. 7 computes soft metrics of the LSBs and MSBs of a group of four-level cells, assuming the LSBs represent a certain memory page and the MSBs represent another page. The LSB page is read first and is refereed to as the previous page. The MSB page is read second and is referred to as the current page. The computation process of the metrics of the current page makes conditional inversion (XOR) operations depending on the bit values of the previous page.
[0129] The circuit comprises a XOR circuit 134, which performs a bit-wise XOR operation between a byte 130 of hard bit decisions from the current page (MSBs) and a byte 132 of previously-decoded data bits (LSBs) from the previous page. Thus, for a particular cell, when the previously-decoded LSB is “1”, the currently-read MSB is inverted. An adder 136 sums the results of the XOR operations. The adder output is accumulated as a soft metric 140 of the MSB. A vector 138 holds the accumulated metrics of the MSBs of the different cells. The same circuit can also be used to compute the soft metrics of the LSBs, which do not depend on any previous values. In order to compute the LSB soft metrics, byte 132 is filled with zeros so that the XOR operation is bypassed and byte 130 is provided to adder 136 unchanged.
[0130] The circuit of FIG. 7 refers to four-level, 2 bit/cell MLC. Similar circuits can be used, however, to compute soft metrics for other types of multi-level cells, such as eight-level, 3 bits/cell MLC.
[0131] In alternative embodiments, the soft metrics of individual bits of a multi-level cell can be calculated independently for different bits. These methods may be of particular benefit when the read data values of previous bits are not available when reading a certain bit. Referring to the 2 bit/cell example of FIG. 4 above, the soft metrics of the MSB may be computed without knowledge of the LSB. As noted above, the MSB value can be assumed to be “0” if the analog value falls between thresholds T11 . . . T15 and T31 . . . T35, and “1” otherwise. In order to compute a soft metric for such a reading process, the MSP may group the thresholds in pairs that move progressively inwards into the region in which MSB=“0”. The MSP counts the comparison results falling inside and/or outside the MSB=“0” interval using the different threshold pairs.
[0132] In the present example, the MSP forms the pairs (T14, T35), (T12, T33), (T11, T31), (T13, T32) and (T15, T34). For each pair, the MSP performs two read operations and checks whether the read value falls in the interval between the thresholds, or outside the interval. The MSP counts the number of threshold pairs in which the analog value falls between the two thresholds (indicating MSB=“0”) and/or the number of threshold pairs in which the analog value falls outside the interval between the two thresholds (indicating MSB=“1”). The MSP computes a soft metric based on the counts.
[0133] A similar method can be applied to eight-level, 3 bit/cell MLC. Assume, for example, an eight-level MLC device whose eight levels are denoted L1 . . . L8 and are mapped to the bit triplets ‘111’, ‘011’, ‘001’, ‘101’, ‘100’, ‘000’, ‘010’, ‘110’, respectively. The MSP can compute the soft metric of the MSB (leftmost bit in the triplet) of such a cell independently of the other bits by performing comparisons using four sets of multiple thresholds. Each threshold set is positioned between adjacent levels having different MSB values. In the present example, one set is positioned between levels L1 and L2, another set between L3 and L4, a third set between L5 and L6 and a fourth set between L7 and L8. The four threshold sets divide the analog value axis into five intervals denoted I1 . . . I5, such that the MSB has the same value within each interval.
[0134] Using this division, the MSP determines that the MSB is “0” if the read analog value read from the cell falls within interval I2 or I4, and “1” if the analog value falls within interval I1, I3 or I5. In order to compute the soft metric of the MSB, the MSP forms groups of four thresholds, with each group containing one threshold from each set. Moving from group to group, each threshold is moved in the direction in which the MSB value transition is from “1” to “0”. For each threshold group, the MSP performs four read operations and checks whether the read value falls in intervals corresponding to “1” or in intervals corresponding to “0”. The MSP counts the number of threshold groups in which the analog value falls in intervals that correspond to MSB=“0” and/or the number of groups in which the analog value falls in intervals that correspond to MSB=“1”. The MSP computes a soft metric based on the counts.
[0135] Typically but not necessarily, soft metrics that are based on counting comparison results of a given type assume that the read thresholds are positioned symmetrically around the midpoint between distributions.
Gradually Increasing the Number of Thresholds
[0136] The comparison and metric computation operations described above consume both time and computation resources, which grow with the number of thresholds. Therefore, it is sometimes advantageous to use only as many thresholds as needed to successfully reconstruct the data. In some embodiments, the MSP initially attempts to compute the soft metrics and decode the data with a relatively small number of thresholds, and increase their number only when needed.
[0137] For example, the MSP may make an initial attempt to decode the ECC using an initial set of read thresholds in which only a single threshold is positioned between each pair of adjacent nominal values (memory states). In these embodiments, the MSP reverts to multiple-threshold decoding upon failure of the initial decoding attempt.
[0138] FIG. 8 is a flow chart that schematically illustrates an exemplary method for reading data from analog memory cells by gradually increasing the number of thresholds, in accordance with another embodiment of the present invention. Initially, it is assumed that the MSP attempted to decode a particular codeword stored in a group of memory cells using soft metrics that were obtained using a certain number of thresholds, and that ECC decoding has failed. The metrics are assumed to be based on the count of comparison results, as explained above.
[0139] The method begins with the MSP adding one or more additional thresholds to the set of thresholds used, and reading the group of memory cells using the added thresholds, at a threshold addition step 142.
[0140] The MSP updates the count of comparison results (i.e., the number of “0” and/or “1” results out of the total), at a count updating step 144. The updated count reflects the comparison results of the previous thresholds as well as of the newly-added thresholds. The MSP then computes the soft metrics based on the updated accumulated count of comparison results, and a metric updating step 146.
[0141] In some cases, the MSP may compute the metrics from scratch at each iteration. Alternatively, the MSP may store the metric values and/or comparison result counts from previous iterations, and update them to account for the newly-added comparison results. Generally, the soft metric computed at a given iteration may depend on the current comparison result count, on previous counts and on previous metric values.
[0142] The MSP computes soft metrics based on the accumulated count of comparison results, at a metric computation step 146. Any suitable metric computation method can be used, such as the exemplary methods described above. The MSP attempts to decode the codeword using the soft metrics, at an ECC decoding step 148. The MSP checks whether the ECC decoding was successful, at an ECC checking step 150. If successful, the MSP extracts and outputs the data, at a data extraction step 152, and the method terminates.
[0143] If, on the other hand, ECC decoding fails, the method loops back to threshold addition step 142 above. The MSP adds one or more additional thresholds to the set of thresholds, computes soft metrics based on the extended set, and attempts to decode the ECC again.
[0144] The method of FIG. 8 enables the MSP to use only as many thresholds as needed to successfully decode the ECC. When distortion is not severe, most codewords can be decoded using a small number of thresholds, enabling a high overall or average reading speed.
[0145] Alternatively to continuing the iterations until successful decoding of the ECC, the MSP may evaluate any other suitable condition, and stop the iterative process when the condition is met. For example, the MSP may continue to add thresholds until reaching a maximum number of thresholds, or a maximum number of iterations.
[0146] In some embodiments, the ECC decoding process may comprise an iterative process. Iterative decoding processes are commonly used to decode codes such as LDPC and turbo codes. In these embodiments, the iterative decoding process is provided with increasingly-improving metrics, which are based on an increasing number of read thresholds. In other words, the iterative decoding process starts decoding using metrics, which are based on a certain initial number of thresholds. Subsequent iterations of the iterative decoding process are provided with metrics that are based on an increasing number of read thresholds, until the iterative decoding process converges to a valid codeword.
[0147] Additionally or alternatively to using an ECC in the method of FIG. 8 , the MSP may use an error detection code, such as a Cyclic Redundancy Check (CRC) or checksum. In such embodiments, the MSP iteratively adds read thresholds until the error detection code detects no errors. Thus, in the context of the present patent application and in the claims, the term “ECC” is used to address various types of error detection codes, as well. In some embodiments, the MSP may use an error detection code to determine when to stop adding new thresholds, even though the data is encoded using an ECC. This scheme may be advantageous, for example, when the ECC does not provide a reliable indication of decoding success or failure.
[0148] The MSP may use various methods and criteria for selecting how many thresholds to add at each iteration, and in which order. For example, thresholds can be added two at a time, gradually moving away from the initial threshold position in both directions. In other words, assuming the MSP initially attempts to use a threshold denoted T and that the thresholds are spaced at regular intervals of Δ, the threshold sets in the first four iterations are:
{T, T+Δ, T−Δ}
{T, T+Δ, T−2Δ, T−2Δ}
{T, T+Δ, T−Δ, T+2Δ, T-2Δ, T+3Δ, T−3Δ}
{T, T+Δ, T−Δ, T+2Δ, T−2Δ, T+3Δ, T−3Δ, T+4Δ, T−4Δ}
{T, T+Δ, T−Δ}
{T, T+Δ, T−2Δ, T−2Δ}
{T, T+Δ, T−Δ, T+2Δ, T-2Δ, T+3Δ, T−3Δ}
{T, T+Δ, T−Δ, T+2Δ, T−2Δ, T+3Δ, T−3Δ, T+4Δ, T−4Δ}
Metric Normalization and Interference Cancellation
[0149] When computing soft metrics that depend on varying numbers of thresholds, such as in the method of FIG. 8 above, the possible range of metric values may vary with the number of thresholds used. For example, when the soft metric comprises the count of comparison results, the metric values based on three thresholds will be in the range [0 . . . 3], whereas metric values based on five thresholds will be in the range [0 . . . 5]. This effect is generally undesirable. In other words, it is generally desired to provide the ECC decoder with metrics, which use the same dynamic range for quantifying confidence or certainty, regardless of the number of threshold comparisons on which the metric is based.
[0150] In some embodiments, the MSP normalizes the soft values read from the memory cells based on the number of thresholds. For example, the MSP may apply bit extension to the values to reach a certain constant number of bits, e.g., five-bits. For example, the bit-extended value may be given by
[0151]
wherein Val denotes the input soft value and N denotes the number of thresholds used to evaluate Val. Max Val denotes the maximum value of the bit-extended soft value, e.g., 31 for five-bit representation. Alternatively, the MSP may apply any other suitable data scaling mechanism.
wherein Val denotes the input soft value and N denotes the number of thresholds used to evaluate Val. Max Val denotes the maximum value of the bit-extended soft value, e.g., 31 for five-bit representation. Alternatively, the MSP may apply any other suitable data scaling mechanism.
[0152] In some embodiments, the MSP has information regarding the level of distortion or interference in the memory cells being read. Various methods can be used to estimate interference levels in memory cells. Exemplary methods are described in PCT Patent Application PCT/IL2007/000580, cited above and in PCT Patent Application PCT/IL2007/000576, entitled “Distortion Estimation and Cancellation in Memory Devices,” filed May 10, 2007, and PCT Patent Application PCT/IL2007/001059, entitled “Estimation of Non-Linear Distortion in Memory Devices,” filed Aug. 27, 2007, whose disclosures are incorporated herein by reference.
[0153] When an estimate of the interference is available to the MSP, the MSP may add the effect of the interference to the soft values, or otherwise modify the soft values based on the estimated interference, before these values are provided to the ECC decoder.
[0154] FIG. 9 is a diagram that schematically illustrates a process for reading data from analog memory cells, which involves data scaling and interference cancellation, in accordance with yet another embodiment of the present invention. Although the configuration of FIG. 9 is used to demonstrate both interference cancellation and scaling, each mechanism may be carried out with or without the other.
[0155] In the process of FIG. 9 , a scaling module 154 accepts the conditionally-inverted soft values read from the memory cells (e.g., the outputs of XOR circuit 134 of FIG. 7 above). Module 154 also accepts an indication of the iteration number and/or the number of thresholds that are currently used. Module 154 applies bit extension or other scaling to the input soft values. The amount of scaling depends on the input iteration number.
[0156] The scaled soft values are provided to an interference cancellation module 156, which also accepts estimates of the interference level in the respective memory cells. Module 156 subtracts or otherwise cancels out the interference estimates from the corresponding soft values, to produce soft values that are properly scaled and contain reduced levels of interference. The soft values are provided to a metric computation module 158, which computes the soft metrics and provides them to the ECC decoder.
Trading-Off Threshold Comparisons and Interference Estimation
[0157] Re-reading cells with additional thresholds and estimating the interference from neighboring memory cells are two operations that on one hand improve the reading performance, and on the other hand consume time and computational power. In some embodiments, the MSP may combine the two operations and trade-off one operation for another. For example, the MSP may determine at each iteration whether it is preferable to refine the decoding accuracy by re-reading the current page using an additional threshold, or to refine the interference estimation by reading (or re-reading) a group of interfering cells.
[0158] FIG. 10 is a flow chart that schematically illustrates a method for reading data from analog memory cells that involves trading-off re-reading and interference estimation, in accordance with another embodiment of the present invention.
[0159] The method begins with the MSP reading a page of memory cells, at a reading step 160. At each cycle of the process, the MSP may select to either (1) re-read the desired page using an additional threshold, or (2) read a page of interfering cells. The MSP may apply various policies or heuristics in determining which of the two actions to take at each cycle. The MSP may read different groups of interfering cells at different cycles.
[0160] For example, the MSP may alternate between the two operations, thus adding a threshold every two cycles and estimating interference every two cycles. Alternatively, the MSP may choose which action to take based on the estimated level of the distortion. For example, if recent interference estimations indicate that the level of interference is low, the MSP may give precedence to adding threshold comparisons, and refine the interference estimation at larger intervals. Further alternatively, the decision may depend on the type of page being read. For example, even- and odd-order pages may experience different interference levels, and the MSP may apply different decision logic for different page types. Pages located on the last word line in a block may also experience different interference levels and may be treated differently. Since the interference may depend on the order in which the pages were written, different trade-offs may apply to higher- and lower-number pages within a word line.
[0161] In some cases, memory cells within the desired page may cause interference to one another. Thus, the group of interfered cells and the group of interfering cells may sometimes overlap.
[0162] Based on the updated information, the MSP subtracts the interference estimation from the read soft values, at an interference cancellation step 162, and computes the soft metrics, at a metric calculation step 164. The MSP then decodes the ECC, at a decoding step 166, and checks whether ECC decoding was successful, at a success checking step 168.
[0163] If the ECC was decoded successfully, the method terminates, at a success termination step 170, and the MSP typically extracts and outputs the data. Otherwise, the MSP checks whether the number of iterations (cycles) exceeds a predetermined maximum number, at an iteration number checking step 172. If the maximum number of iterations was exceeded, the method terminates without successfully reading the data, at an error termination step 174. Otherwise, the method loops back to reading step 160 above, and the MSP again determines whether to add another threshold or refine the interference estimation in the next cycle.
[0164] In both iterative methods of FIGS. 8 and 10 above, the MSP may select the number of new thresholds that are added at a particular iteration based on the values read from the cells or the data represented by these values. For example, when the MSP detects severe ECC failure or an exceptionally high level of interference, it may decide to add a high number of thresholds. The MSP may also determine the values (i.e., positions) of the new thresholds based on the read values or read data. For example, the values of new thresholds that are added in response to ECC failure may be different from the values of thresholds added in response to high interference.
Performing Multiple Read Operations Internally to the Memory Device
[0165] When using the methods and systems described above, the multiple comparison results associated with the multiple thresholds are typically communicated from memory device 24 to MSP 52. The resulting communication bandwidth between the memory device and the MSP may become prohibitive, especially when using a large number of threshold sets and/or when the number of nominal levels per memory cell is high. In some practical cases, the communication bandwidth over the interface between the MSP and the memory device may become the limiting factor that determines the memory access speed of system 20. This effect becomes even more severe when a single MSP 52 is connected to multiple memory devices 24.
[0166] In alternative embodiments of the present invention, some of the re-reading functions are carried out internally to the memory device, so as to reduce the communication bandwidth between the memory device and the MSP.
[0167] FIG. 11 is a block diagram that schematically illustrates a system 200 for memory signal processing, in accordance with an alternative embodiment of the present invention. In the exemplary embodiment of FIG. 11 , multiple memory devices 204 are connected to an MSP 208 over an external bus 212. Each memory device 204 comprises a memory cell array 216 and a R/W unit 220, which are similar to array 28 and R/W unit 40 of FIG. 1 above, respectively.
[0168] Unlike the embodiment shown in FIG. 1 above, each memory device 204 comprises a threshold setting and metric calculation unit 224, also referred to as “metric calculation unit” for brevity. Unit 224 is connected to R/W unit 220 by an internal bus 228. When the memory device accepts a request to retrieve data from a group of memory cells (e.g., a page), unit 224 controls R/W unit 220 to set the appropriate threshold values and read the memory cells using the thresholds, such as using any of the methods described above. The R/W unit carries out the multiple comparison operations and sends the corresponding comparison results to unit 224. Unit 224 computes the soft metrics based on the comparison results, and sends the metric values over external bus 212 to MSP 208.
[0169] MSP 208 comprises an ECC decoder 232. The ECC decoder accepts the soft metrics sent from unit 224 of memory device 204 and decodes the ECC based on the metrics. The MSP typically outputs the decoded data to the host system. When MSP 208 controls multiple memory devices 204, a single ECC decoder may decodes the data sent from all the memory devices. Alternatively, multiple ECC decoders may be used.
[0170] When using the configuration of FIG. 11 , the communication bandwidth between the MSP and the memory device is significantly reduced in comparison with the configuration of FIG. 1 above, since individual comparison results are not communicated to the MSP. Instead, unit 224 sends the soft metric values, typically comprising a single value for each read memory cell. The large communication bandwidth needed to communicate the multiple comparison results is confined to internal bus 228, i.e., internally to the memory device. A high bandwidth bus of this sort is considerably simpler to implement internally to the memory device than between separate devices. Moreover, the traffic over the internal bus comprises only the traffic generated by the particular memory device, regardless of the number of memory devices controlled by the MSP.
[0171] The functional partitioning between R/W unit 220 and metric calculation unit 224 is an exemplary partitioning, which is chosen purely for the sake of conceptual clarity. In alternative embodiments, the reading, threshold comparison, threshold setting and metric computation functions can be partitioned in any other way, as desired. Thus, R/W unit 220, internal bus 228 and metric calculation unit 224 are collectively regarded as a reading circuit, which reads the analog memory cell and produces soft metrics.
[0172] As noted above, the soft metric computation sometimes takes into account estimation and cancellation of the interference in the read memory cells. In some embodiments, the interference estimation and cancellation functionality can also be carried out by the reading circuit internally to memory device 204, e.g., by unit 224. In these embodiments, unit 224 sends to the MSP soft metrics, in which the interference is already taken into account. Some aspects of carrying out signal processing functions internally to the memory device are described in U.S. Provisional Patent Application 60/917,653, cited above.
[0173] Although the embodiments described herein mainly address retrieving data from solid-state memory devices, the principles of the present invention can also be used for storing and retrieving data in Hard Disk Drives (HDD) and other data storage media and devices.
[0174] It will thus 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.
Claims
The invention claimed is:
1. A method for operating a memory, comprising:
storing data, which is encoded with an Error Correction Code (ECC), in analog memory cells of the memory by writing respective analog input values selected from a set of nominal values to the analog memory cells;
reading the stored data by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values;
computing soft metrics responsively to the multiple comparison results;
decoding the ECC using the soft metrics, so as to extract the data stored in the analog memory cells; and
making an initial attempt to decode the ECC using an initial set of the read thresholds, such that no more than one of the read thresholds in the initial set is positioned between each pair of the nominal values that are adjacent to one another, and comparing the analog output values to the multiple read thresholds upon a failure of the initial attempt.
2. The method according to claim 1, wherein each of the analog memory cells stores one or more bits of the data, and wherein each of the soft metrics corresponds to one of the bits.
3. The method according to claim 2, each of at least some of the analog memory cells stores two or more bits of the data, wherein reading the data comprises, for each of the at least some of the analog memory cells, reading the two or more data bits in respective two or more decoding stages, and wherein computing the soft metrics comprises modifying a soft metric of a first bit read in a first decoding stage responsively to a value of a second bit read in a second decoding stage that precedes the first decoding stage.
4. The method according to claim 3, wherein modifying the soft metric comprises conditionally inverting the soft metric of the first bit depending on the value of the second bit.
5. The method according to claim 1, wherein each comparison result has one of first and second possible values, and wherein computing the soft metrics comprises determining respective first and second counts of the comparison results having the first and second possible values, and computing the soft metrics based on the first and second counts.
6. The method according to claim 1, and comprising, upon failing to decode the ECC, adding one or more additional read thresholds to the multiple read thresholds, re-computing the soft metrics responsively to the additional read thresholds, and decoding the ECC using the re-computed soft metrics.
7. The method according to claim 6, wherein adding the additional threshold comprises progressively increasing a number of the read thresholds until a predetermined condition is met.
8. The method according to claim 1, wherein computing the soft metrics comprises normalizing the soft metrics so as not to depend on a number of the read thresholds.
9. The method according to claim 1, wherein performing the multiple read operations comprises positioning the multiple read thresholds at non-uniform intervals with respect to one another.
10. A method for operating a memory, comprising:
storing data, which is encoded with an Error Correction Code (ECC), in analog memory cells of the memory by writing respective analog input values selected from a set of nominal values to the analog memory cells;
reading the stored data by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values;
computing soft metrics responsively to the multiple comparison results; and
decoding the ECC using the soft metrics, so as to extract the data stored in the analog memory cells,
wherein reading the data from a first group of the analog memory cells further comprises estimating interference caused to the first group by a second group of the analog memory cells and canceling the estimated interference,
and wherein canceling the estimated interference comprises modifying the soft metrics associated with the first group responsively to the estimated interference.
11. A method for operating a memory, comprising:
storing data, which is encoded with an Error Correction Code (ECC), in analog memory cells of the memory by writing respective analog input values selected from a set of nominal values to the analog memory cells;
reading the stored data by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values;
computing soft metrics responsively to the multiple comparison results; and
decoding the ECC using the soft metrics, so as to extract the data stored in the analog memory cells,
wherein reading the data from a first group of the analog memory cells further comprises estimating interference caused to the first group by a second group of the analog memory cells and canceling the estimated interference,
and comprising, upon failing to decode the ECC in the first group, selecting whether to perform one of:
re-reading the data in the second group, so as to re-estimate and cancel the interference;
re-estimating the interference by reading the data in a third group of the memory cells; and
adding one or more additional read thresholds and re-reading the data in the first group using the additional read thresholds.
12. A data storage apparatus, comprising:
an interface, which is operative to communicate with a memory that includes a plurality of analog memory cells; and
a memory signal processor (MSP), which is connected to the interface and is coupled to store data, which is encoded with an Error Correction Code (ECC), in the analog memory cells by writing respective input analog values selected from a set of nominal values to the analog memory cells, to read the stored data by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values, to compute soft metrics responsively to the multiple comparison results, and to decode the ECC using the soft metrics, so as to extract the data stored in the analog memory cells
wherein the MSP is coupled to make an initial attempt to decode the ECC using an initial set of the read thresholds, such that no more than one of the read thresholds in the initial set is positioned between each pair of the nominal values that are adjacent to one another, and to compare the analog output values to the multiple read thresholds upon failure of the initial attempt.
13. The apparatus according to claim 12, wherein each of the analog memory cells stores one or more bits of the data, and wherein each of the soft metrics corresponds to one of the bits.
14. The apparatus according to claim 13, wherein each of at least some of the analog memory cells stores two or more bits of the data, and wherein the MSP is coupled to read the two or more data bits in respective two or more decoding stages, and to modify a soft metric of a first bit read in a first decoding stage responsively to a value of a second bit read in a second decoding stage that precedes the first decoding stage.
15. The apparatus according to claim 14, wherein the MSP is coupled to conditionally invert the soft metric of the first bit depending on the value of the second bit.
16. The apparatus according to claim 12, wherein each comparison result has one of first and second possible values, and wherein the MSP is coupled to determine respective first and second counts of the comparison results having the first and second possible values, and to compute the soft metrics based on the first and second counts.
17. The apparatus according to claim 12, wherein, upon failing to decode the ECC, the MSP is coupled to add one or more additional read thresholds to the multiple read thresholds, to re-compute the soft metrics responsively to the additional read thresholds and to decode the ECC using the re-computed soft metrics.
18. The apparatus according to claim 17, wherein the MSP is coupled to progressively increase a number of the read thresholds until a predetermined condition is met.
19. The apparatus according to claim 12, wherein the MSP is coupled to normalize the soft metrics so as not to depend on a number of the read thresholds.
20. The apparatus according to claim 12, wherein the MSP is coupled to position the multiple read thresholds at non-uniform intervals with respect to one another.
21. A data storage apparatus, comprising:
an interface, which is operative to communicate with a memory that includes a plurality of analog memory cells; and
a memory signal processor (MSP), which is connected to the interface and is coupled to store data, which is encoded with an Error Correction Code (ECC), in the analog memory cells by writing respective input analog values selected from a set of nominal values to the analog memory cells, to read the stored data by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values, to compute soft metrics responsively to the multiple comparison results, and to decode the ECC using the soft metrics, so as to extract the data stored in the analog memory cells,
wherein the MSP is coupled to estimate interference caused to a first group of the analog memory cells by a second group of the analog memory cells, and to cancel the estimated interference,
and wherein the MSP is coupled to modify the soft metrics associated with the first group responsively to the estimated interference.
22. A data storage apparatus, comprising:
an interface, which is operative to communicate with a memory that includes a plurality of analog memory cells; and
a memory signal processor (MSP), which is connected to the interface and is coupled to store data, which is encoded with an Error Correction Code (ECC), in the analog memory cells by writing respective input analog values selected from a set of nominal values to the analog memory cells, to read the stored data by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values, to compute soft metrics responsively to the multiple comparison results, and to decode the ECC using the soft metrics, so as to extract the data stored in the analog memory cells,
wherein the MSP is coupled to estimate interference caused to a first group of the analog memory cells by a second group of the analog memory cells, and to cancel the estimated interference,
and wherein, upon failing to decode the ECC in the first group, the MSP is coupled to select whether to perform one of:
re-reading the data in the second group, so as to re-estimate and cancel the interference;
re-estimating the interference by reading the data in a third group of the memory cells; and
adding one or more additional read thresholds and re-reading the data in the first group using the additional read thresholds.
23. A data storage apparatus, comprising:
a memory device, comprising:
a plurality of analog memory cells, which are configured to store data, which is encoded with an Error Correction Code (ECC) and written to the analog memory cells as respective analog input values selected from a set of nominal values; and
reading circuitry, which is coupled to read the stored data by performing multiple read operations that compare output analog values of the analog memory cells to different, respective read thresholds so as to produce multiple comparison results for each of the analog memory cells, wherein at least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values, to compute soft metrics responsively to the multiple comparison results, and to output the computed soft metrics; and
a Memory Signal Processor (MSP) device, which is connected to the memory device and is coupled to accept the soft metrics computed by the reading circuitry, and to decode the ECC using the soft metrics
wherein the MSP is coupled to make an initial attempt to decode the ECC using an initial set of the read thresholds, such that no more than one of the read thresholds in the initial set is positioned between each pair of the nominal values that are adjacent to one another, and to cause the reading circuitry to compare the analog output values to the multiple read thresholds upon failure of the initial attempt.
24. A method for operating a memory, comprising:
storing data, which is encoded with an Error Correction Code (ECC), in analog memory cells of the memory by writing respective analog input values to the analog memory cells;
reading the stored data by comparing analog output values of the analog memory cells to a set of read thresholds, so as to produce multiple comparison results for each of the analog memory cells;
computing soft metrics responsively to the multiple comparison results;
decoding the ECC using the soft metrics, so as to extract the data stored in the analog memory cells; and
upon a failure to successfully extract the data, extending the set of the read thresholds by adding one or more new read thresholds to the set, updating the multiple comparison results based on the extended set of the read thresholds, re-computing the soft metrics and re-decoding the ECC, so as to extract the data.
25. The method according to claim 24, wherein extending the set of the read thresholds comprises selecting the one or more new read thresholds responsively to the output analog values of the analog memory cells.
26. The method according to claim 25, wherein selecting the one or more new read thresholds comprises determining at least one property selected from a group of properties consisting of a number of the new read thresholds and values of the new read thresholds.
Patent Citations (432)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4556961(A) | 1985-12-01 | Iwahashi et al. | Applicant |
| US4558431(A) | 1985-12-01 | Satoh et al. | Applicant |
| US4661929(A) | 1987-04-01 | Aoki et al. | Applicant |
| US4768171(A) | 1988-08-01 | Tada | Applicant |
| US4811285(A) | 1989-03-01 | Walker et al. | Applicant |
| US4899342(A) | 1990-02-01 | Potter et al. | Applicant |
| US4910706(A) | 1990-03-01 | Hyatt | Applicant |
| US4993029(A) | 1991-02-01 | Galbraith et al. | Applicant |
| US5056089(A) | 1991-10-01 | Furuta et al. | Applicant |
| US5077722(A) | 1991-12-01 | Geist et al. | Applicant |
| US5126808(A) | 1992-06-01 | Montalvo et al. | Applicant |
| US5163021(A) | 1992-11-01 | Mehrotra et al. | Applicant |
| US5172338(A) | 1992-12-01 | Mehrotta et al. | Applicant |
| US5191584(A) | 1993-03-01 | Anderson | Applicant |
| US5200959(A) | 1993-04-01 | Gross et al. | Applicant |
| US5237535(A) | 1993-08-01 | Mielke et al. | Applicant |
| US5272669(A) | 1993-12-01 | Samachisa et al. | Applicant |
| US5276649(A) | 1994-01-01 | Hoshita et al. | Applicant |
| US5287469(A) | 1994-02-01 | Tsuboi | Applicant |
| US5365484(A) | 1994-11-01 | Cleveland et al. | Applicant |
| US5388064(A) | 1995-02-01 | Khan | Applicant |
| US5416646(A) | 1995-05-01 | Shirai | Applicant |
| US5416782(A) | 1995-05-01 | Wells et al. | Applicant |
| US5473753(A) | 1995-12-01 | Wells et al. | Applicant |
| US5479170(A) | 1995-12-01 | Cauwenberghs et al. | Applicant |
| US5508958(A) | 1996-04-01 | Fazio et al. | Applicant |
| US5519831(A) | 1996-05-01 | Holzhammer | Applicant |
| US5532962(A) | 1996-07-01 | Auclair et al. | Applicant |
| US5541886(A) | 1996-07-01 | Hasbun | Applicant |
| US5600677(A) | 1997-02-01 | Citta et al. | Applicant |
| US5657332(A) | 1997-08-01 | Auclair et al. | Applicant |
| US5675540(A) | 1997-10-01 | Roohparvar | Applicant |
| US5682352(A) | 1997-10-01 | Wong et al. | Examiner |
| US5696717(A) | 1997-12-01 | Koh | Applicant |
| US5726649(A) | 1998-03-01 | Tamaru et al. | Applicant |
| US5742752(A) | 1998-04-01 | De Koning | Applicant |
| US5751637(A) | 1998-05-01 | Chen et al. | Applicant |
| US5761402(A) | 1998-06-01 | Kaneda et al. | Applicant |
| US5801985(A) | 1998-09-01 | Roohparvar et al. | Applicant |
| US5838832(A) | 1998-11-01 | Barnsley | Applicant |
| US5860106(A) | 1999-01-01 | Domen et al. | Applicant |
| US5867114(A) | 1999-02-01 | Barbir | Applicant |
| US5867429(A) | 1999-02-01 | Chen et al. | Applicant |
| US5877986(A) | 1999-03-01 | Harari et al. | Applicant |
| US5901089(A) | 1999-05-01 | Korsh et al. | Applicant |
| US5909449(A) | 1999-06-01 | So et al. | Applicant |
| US5912906(A) | 1999-06-01 | Wu et al. | Applicant |
| US5930167(A) | 1999-07-01 | Lee et al. | Applicant |
| US5937424(A) | 1999-08-01 | Leak et al. | Applicant |
| US5942004(A) | 1999-08-01 | Cappelletti | Applicant |
| US5969986(A) | 1999-10-01 | Wong et al. | Applicant |
| US5991517(A) | 1999-11-01 | Harari et al. | Applicant |
| US5995417(A) | 1999-11-01 | Chen et al. | Applicant |
| US6009014(A) | 1999-12-01 | Hollmer et al. | Applicant |
| US6034891(A) | 2000-03-01 | Norman | Applicant |
| US6040993(A) | 2000-03-01 | Chen et al. | Applicant |
| US6041430(A) | 2000-03-01 | Yamauchi | Applicant |
| US6073204(A) | 2000-06-01 | Lakhani et al. | Applicant |
| US6101614(A) | 2000-08-01 | Gonzales et al. | Applicant |
| US6128237(A) | 2000-10-01 | Shirley et al. | Applicant |
| US6134140(A) | 2000-10-01 | Tanaka et al. | Applicant |
| US6134143(A) | 2000-10-01 | Norman | Applicant |
| US6134631(A) | 2000-10-01 | Jennings | Applicant |
| US6141261(A) | 2000-10-01 | Patti | Applicant |
| US6166962(A) | 2000-12-01 | Chen et al. | Applicant |
| US6178466(B1) | 2001-01-01 | Gilbertson et al. | Applicant |
| US6185134(B1) | 2001-02-01 | Tanaka et al. | Applicant |
| US6209113(B1) | 2001-03-01 | Roohparvar | Applicant |
| US6212654(B1) | 2001-04-01 | Lou et al. | Applicant |
| US6219276(B1) | 2001-04-01 | Parker | Applicant |
| US6219447(B1) | 2001-04-01 | Lee et al. | Applicant |
| US6222762(B1) | 2001-04-01 | Guterman et al. | Applicant |
| US6230233(B1) | 2001-05-01 | Lofgren et al. | Applicant |
| US6240458(B1) | 2001-05-01 | Gilbertson | Applicant |
| US6275419(B1) | 2001-08-01 | Guterman et al. | Applicant |
| US6279069(B1) | 2001-08-01 | Robinson et al. | Applicant |
| US6288944(B1) | 2001-09-01 | Kawamura | Applicant |
| US6292394(B1) | 2001-09-01 | Cohen et al. | Applicant |
| US6301151(B1) | 2001-10-01 | Engh et al. | Applicant |
| US6304486(B1) | 2001-10-01 | Yano | Applicant |
| US6307776(B1) | 2001-10-01 | So et al. | Applicant |
| US6317363(B1) | 2001-11-01 | Guterman et al. | Applicant |
| US6317364(B1) | 2001-11-01 | Guterman et al. | Applicant |
| US6345004(B1) | 2002-02-01 | Omura et al. | Applicant |
| US6360346(B1) | 2002-03-01 | Miyauchi et al. | Applicant |
| US6363008(B1) | 2002-03-01 | Wong | Applicant |
| US6363454(B1) | 2002-03-01 | Lakhani et al. | Applicant |
| US6366496(B1) | 2002-04-01 | Torelli et al. | Applicant |
| US6396742(B1) | 2002-05-01 | Korsh et al. | Applicant |
| US6397364(B1) | 2002-05-01 | Barkan | Applicant |
| US6405323(B1) | 2002-06-01 | Lin et al. | Applicant |
| US6418060(B1) | 2002-07-01 | Yong et al. | Applicant |
| US6442585(B1) | 2002-08-01 | Dean et al. | Applicant |
| US6456528(B1) | 2002-09-01 | Chen | Applicant |
| US6466476(B1) | 2002-10-01 | Wong et al. | Applicant |
| US6467062(B1) | 2002-10-01 | Barkan | Applicant |
| US6469931(B1) | 2002-10-01 | Ban et al. | Applicant |
| US6522580(B2) | 2003-02-01 | Chen et al. | Applicant |
| US6525952(B2) | 2003-02-01 | Araki et al. | Applicant |
| US6532556(B1) | 2003-03-01 | Wong et al. | Applicant |
| US6538922(B1) | 2003-03-01 | Khalid et al. | Applicant |
| US6558967(B1) | 2003-05-01 | Wong | Applicant |
| US6560152(B1) | 2003-05-01 | Cernea | Applicant |
| US6577539(B2) | 2003-06-01 | Iwahashi | Applicant |
| US6584012(B2) | 2003-06-01 | Banks | Applicant |
| US6615307(B1) | 2003-09-01 | Roohparvar | Applicant |
| US6621739(B2) | 2003-09-01 | Gonzalez et al. | Applicant |
| US6643169(B2) | 2003-11-01 | Rudelic et al. | Applicant |
| US6646913(B2) | 2003-11-01 | Micheloni et al. | Applicant |
| US6678192(B2) | 2004-01-01 | Gongwer et al. | Applicant |
| US6687155(B2) | 2004-02-01 | Nagasue | Applicant |
| US6707748(B2) | 2004-03-01 | Lin et al. | Applicant |
| US6708257(B2) | 2004-03-01 | Bao | Applicant |
| US6717847(B2) | 2004-04-01 | Chen | Applicant |
| US6731557(B2) | 2004-05-01 | Beretta | Applicant |
| US6738293(B1) | 2004-05-01 | Iwahashi | Applicant |
| US6751766(B2) | 2004-06-01 | Guterman et al. | Applicant |
| US6757193(B2) | 2004-06-01 | Chen et al. | Applicant |
| US6774808(B1) | 2004-08-01 | Hibbs et al. | Applicant |
| US6781877(B2) | 2004-08-01 | Cernea et al. | Applicant |
| US6807095(B2) | 2004-10-01 | Chen et al. | Applicant |
| US6809964(B2) | 2004-10-01 | Moschopoulos et al. | Applicant |
| US6829167(B2) | 2004-12-01 | Tu et al. | Applicant |
| US6845052(B1) | 2005-01-01 | Ho et al. | Applicant |
| US6851018(B2) | 2005-02-01 | Wyatt et al. | Applicant |
| US6856546(B2) | 2005-02-01 | Guterman et al. | Applicant |
| US6862218(B2) | 2005-03-01 | Guterman et al. | Applicant |
| US6870767(B2) | 2005-03-01 | Rudelic et al. | Applicant |
| US6894926(B2) | 2005-05-01 | Guterman et al. | Applicant |
| US6907497(B2) | 2005-06-01 | Hosono et al. | Applicant |
| US6930925(B2) | 2005-08-01 | Guo et al. | Applicant |
| US6934188(B2) | 2005-08-01 | Roohparvar | Applicant |
| US6937511(B2) | 2005-08-01 | Hsu et al. | Applicant |
| US6963505(B2) | 2005-11-01 | Cohen et al. | Applicant |
| US6972993(B2) | 2005-12-01 | Conley et al. | Applicant |
| US6988175(B2) | 2006-01-01 | Lasser | Applicant |
| US6992932(B2) | 2006-01-01 | Cohen | Applicant |
| US7002843(B2) | 2006-02-01 | Guterman et al. | Applicant |
| US7012835(B2) | 2006-03-01 | Gonzalez et al. | Applicant |
| US7020017(B2) | 2006-03-01 | Chen et al. | Applicant |
| US7023735(B2) | 2006-04-01 | Ban et al. | Applicant |
| US7031210(B2) | 2006-04-01 | Park et al. | Applicant |
| US7031214(B2) | 2006-04-01 | Tran | Applicant |
| US7031216(B2) | 2006-04-01 | You | Applicant |
| US7039846(B2) | 2006-05-01 | Hewitt et al. | Examiner |
| US7042766(B1) | 2006-05-01 | Wang et al. | Applicant |
| US7054193(B1) | 2006-05-01 | Wong | Applicant |
| US7054199(B2) | 2006-05-01 | Lee et al. | Applicant |
| US7057958(B2) | 2006-06-01 | So et al. | Applicant |
| US7065147(B2) | 2006-06-01 | Ophir et al. | Applicant |
| US7068539(B2) | 2006-06-01 | Guterman et al. | Applicant |
| US7071849(B2) | 2006-07-01 | Zhang | Applicant |
| US7079555(B2) | 2006-07-01 | Baydar et al. | Applicant |
| US7088615(B2) | 2006-08-01 | Guterman et al. | Applicant |
| US7099194(B2) | 2006-08-01 | Tu et al. | Applicant |
| US7102924(B2) | 2006-09-01 | Chen et al. | Applicant |
| US7113432(B2) | 2006-09-01 | Mokhlesi | Applicant |
| US7130210(B2) | 2006-10-01 | Bathul et al. | Applicant |
| US7139192(B1) | 2006-11-01 | Wong | Applicant |
| US7139198(B2) | 2006-11-01 | Guterman et al. | Applicant |
| US7151692(B2) | 2006-12-01 | Wu | Applicant |
| US7170802(B2) | 2007-01-01 | Cernea et al. | Applicant |
| US7173859(B2) | 2007-02-01 | Hemink | Applicant |
| US7177184(B2) | 2007-02-01 | Chen | Applicant |
| US7177195(B2) | 2007-02-01 | Gonzalez et al. | Applicant |
| US7177199(B2) | 2007-02-01 | Chen et al. | Applicant |
| US7177200(B2) | 2007-02-01 | Ronen et al. | Applicant |
| US7184338(B2) | 2007-02-01 | Nakagawa et al. | Applicant |
| US7187195(B2) | 2007-03-01 | Kim | Applicant |
| US7187592(B2) | 2007-03-01 | Guterman et al. | Applicant |
| US7190614(B2) | 2007-03-01 | Wu | Applicant |
| US7193898(B2) | 2007-03-01 | Cernea | Applicant |
| US7193921(B2) | 2007-03-01 | Choi et al. | Applicant |
| US7196928(B2) | 2007-03-01 | Chen | Applicant |
| US7197594(B2) | 2007-03-01 | Raz et al. | Applicant |
| US7200062(B2) | 2007-04-01 | Kinsely et al. | Applicant |
| US7221592(B2) | 2007-05-01 | Nazarian | Applicant |
| US7224613(B2) | 2007-05-01 | Chen et al. | Applicant |
| US7231474(B1) | 2007-06-01 | Helms et al. | Applicant |
| US7231562(B2) | 2007-06-01 | Ohlhoff et al. | Applicant |
| US7243275(B2) | 2007-07-01 | Gongwer et al. | Applicant |
| US7254690(B2) | 2007-08-01 | Rao | Applicant |
| US7257027(B2) | 2007-08-01 | Park | Applicant |
| US7259987(B2) | 2007-08-01 | Chen et al. | Applicant |
| US7266026(B2) | 2007-09-01 | Gongwer et al. | Applicant |
| US7274611(B2) | 2007-09-01 | Roohparvar | Applicant |
| US7277355(B2) | 2007-10-01 | Tanzawa | Applicant |
| US7280398(B1) | 2007-10-01 | Lee et al. | Applicant |
| US7280409(B2) | 2007-10-01 | Misumi et al. | Applicant |
| US7289344(B2) | 2007-10-01 | Chen | Applicant |
| US7301807(B2) | 2007-11-01 | Khalid et al. | Applicant |
| US7301817(B2) | 2007-11-01 | Li et al. | Applicant |
| US7308525(B2) | 2007-12-01 | Lasser et al. | Applicant |
| US7310255(B2) | 2007-12-01 | Chan | Applicant |
| US7310272(B1) | 2007-12-01 | Mokhlesi et al. | Applicant |
| US7310347(B2) | 2007-12-01 | Lasser | Applicant |
| US7321509(B2) | 2008-01-01 | Chen et al. | Applicant |
| US7342831(B2) | 2008-03-01 | Mokhlesi et al. | Applicant |
| US7345928(B2) | 2008-03-01 | Li | Applicant |
| US7349263(B2) | 2008-03-01 | Kim et al. | Applicant |
| US7356755(B2) | 2008-04-01 | Fackenthal | Applicant |
| US7363420(B2) | 2008-04-01 | Lin et al. | Applicant |
| US7388781(B2) | 2008-06-01 | Litsyn et al. | Applicant |
| US7397697(B2) | 2008-07-01 | So et al. | Applicant |
| US7408804(B2) | 2008-08-01 | Hemink et al. | Applicant |
| US7409473(B2) | 2008-08-01 | Conley et al. | Applicant |
| US7420847(B2) | 2008-09-01 | Li | Applicant |
| US7433231(B2) | 2008-10-01 | Aritome | Applicant |
| US7437498(B2) | 2008-10-01 | Ronen | Applicant |
| US7440324(B2) | 2008-10-01 | Mokhlesi | Applicant |
| US7441067(B2) | 2008-10-01 | Gorobetz et al. | Applicant |
| US7453737(B2) | 2008-11-01 | Ha | Applicant |
| US7460410(B2) | 2008-12-01 | Nagai et al. | Applicant |
| US7460412(B2) | 2008-12-01 | Lee et al. | Applicant |
| US7466592(B2) | 2008-12-01 | Mitani et al. | Applicant |
| US7468911(B2) | 2008-12-01 | Lutze et al. | Applicant |
| US7471581(B2) | 2008-12-01 | Tran et al. | Applicant |
| US7492641(B2) | 2009-02-01 | Hosono et al. | Applicant |
| US7508710(B2) | 2009-03-01 | Mokhlesi | Applicant |
| US7539062(B2) | 2009-05-01 | Doyle | Applicant |
| US7551492(B2) | 2009-06-01 | Kim | Applicant |
| US7570520(B2) | 2009-08-01 | Kamei et al. | Applicant |
| US7593259(B2) | 2009-09-01 | Kim et al. | Applicant |
| US7596707(B1) | 2009-09-01 | Vemula | Applicant |
| US7631245(B2) | 2009-12-01 | Lasser | Applicant |
| US7633798(B2) | 2009-12-01 | Sarin et al. | Applicant |
| US7633802(B2) | 2009-12-01 | Mokhlesi | Applicant |
| US7656734(B2) | 2010-02-01 | Thorp et al. | Applicant |
| US7660158(B2) | 2010-02-01 | Aritome | Applicant |
| US7660183(B2) | 2010-02-01 | Ware et al. | Applicant |
| US7742351(B2) | 2010-06-01 | Inoue et al. | Applicant |
| US7885119(B2) | 2011-02-01 | Li | Applicant |
| US2001/0002172(A1) | 2001-05-01 | Tanaka et al. | Applicant |
| US2001/0006479(A1) | 2001-07-01 | Ikehashi et al. | Applicant |
| US2002/0038440(A1) | 2002-03-01 | Barkan | Applicant |
| US2002/0118574(A1) | 2002-08-01 | Gongwer et al. | Applicant |
| US2002/0174295(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0196510(A1) | 2002-12-01 | Hietala et al. | Applicant |
| US2003/0002348(A1) | 2003-01-01 | Chen et al. | Applicant |
| US2003/0103400(A1) | 2003-06-01 | Van Tran | Applicant |
| US2003/0161183(A1) | 2003-08-01 | Van Tran | Applicant |
| US2003/0189856(A1) | 2003-10-01 | Cho et al. | Applicant |
| US2004/0057265(A1) | 2004-03-01 | Mirabel et al. | Applicant |
| US2004/0057285(A1) | 2004-03-01 | Cernea et al. | Applicant |
| US2004/0083333(A1) | 2004-04-01 | Chang et al. | Applicant |
| US2004/0083334(A1) | 2004-04-01 | Chang et al. | Applicant |
| US2004/0105311(A1) | 2004-06-01 | Cernea et al. | Applicant |
| US2004/0114437(A1) | 2004-06-01 | Li | Applicant |
| US2004/0160842(A1) | 2004-08-01 | Fukiage | Applicant |
| US2005/0007802(A1) | 2005-01-01 | Gerpheide | Applicant |
| US2005/0013165(A1) | 2005-01-01 | Ban | Applicant |
| US2005/0024941(A1) | 2005-02-01 | Lasser et al. | Applicant |
| US2005/0024978(A1) | 2005-02-01 | Ronen | Applicant |
| US2005/0086574(A1) | 2005-04-01 | Fackenthal | Applicant |
| US2005/0121436(A1) | 2005-06-01 | Kamitani et al. | Applicant |
| US2005/0157555(A1) | 2005-07-01 | Ono et al. | Applicant |
| US2005/0162913(A1) | 2005-07-01 | Chen | Applicant |
| US2005/0169051(A1) | 2005-08-01 | Khalid et al. | Applicant |
| US2005/0189649(A1) | 2005-09-01 | Maruyama et al. | Applicant |
| US2005/0213393(A1) | 2005-09-01 | Lasser | Applicant |
| US2005/0224853(A1) | 2005-10-01 | Ohkawa | Applicant |
| US2005/0240745(A1) | 2005-10-01 | Iyer et al. | Applicant |
| US2005/0243626(A1) | 2005-11-01 | Ronen | Applicant |
| US2006/0004952(A1) | 2006-01-01 | Lasser | Applicant |
| US2006/0028875(A1) | 2006-02-01 | Avraham et al. | Applicant |
| US2006/0028877(A1) | 2006-02-01 | Meir | Applicant |
| US2006/0101193(A1) | 2006-05-01 | Murin | Applicant |
| US2006/0107136(A1) | 2006-05-01 | Gongwer et al. | Applicant |
| US2006/0129750(A1) | 2006-06-01 | Lee et al. | Applicant |
| US2006/0133141(A1) | 2006-06-01 | Gorobets | Applicant |
| US2006/0156189(A1) | 2006-07-01 | Tomlin | Applicant |
| US2006/0179334(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0203546(A1) | 2006-09-01 | Lasser | Applicant |
| US2006/0218359(A1) | 2006-09-01 | Sanders et al. | Applicant |
| US2006/0221692(A1) | 2006-10-01 | Chen | Applicant |
| US2006/0221705(A1) | 2006-10-01 | Hemink et al. | Applicant |
| US2006/0221714(A1) | 2006-10-01 | Li et al. | Applicant |
| US2006/0239077(A1) | 2006-10-01 | Park et al. | Applicant |
| US2006/0256620(A1) | 2006-11-01 | Nguyen et al. | Applicant |
| US2006/0256626(A1) | 2006-11-01 | Werner et al. | Applicant |
| US2006/0256891(A1) | 2006-11-01 | Yuan et al. | Applicant |
| US2006/0271748(A1) | 2006-11-01 | Jain et al. | Applicant |
| US2006/0285392(A1) | 2006-12-01 | Incarnati et al. | Applicant |
| US2006/0285396(A1) | 2006-12-01 | Ha | Applicant |
| US2007/0006013(A1) | 2007-01-01 | Moshayedi et al. | Applicant |
| US2007/0019481(A1) | 2007-01-01 | Park | Applicant |
| US2007/0033581(A1) | 2007-02-01 | Tomlin et al. | Applicant |
| US2007/0047314(A1) | 2007-03-01 | Goda et al. | Applicant |
| US2007/0047326(A1) | 2007-03-01 | Nguyen et al. | Applicant |
| US2007/0050536(A1) | 2007-03-01 | Kolokowsky | Applicant |
| US2007/0058446(A1) | 2007-03-01 | Hwang et al. | Applicant |
| US2007/0061502(A1) | 2007-03-01 | Lasser et al. | Applicant |
| US2007/0067667(A1) | 2007-03-01 | Ikeuchi et al. | Applicant |
| US2007/0074093(A1) | 2007-03-01 | Lasser | Applicant |
| US2007/0086239(A1) | 2007-04-01 | Litsyn et al. | Applicant |
| US2007/0086260(A1) | 2007-04-01 | Sinclair | Applicant |
| US2007/0089034(A1) | 2007-04-01 | Litsyn et al. | Applicant |
| US2007/0091677(A1) | 2007-04-01 | Lasser et al. | Applicant |
| US2007/0091694(A1) | 2007-04-01 | Lee et al. | Applicant |
| US2007/0103978(A1) | 2007-05-01 | Conley et al. | Applicant |
| US2007/0103986(A1) | 2007-05-01 | Chen | Applicant |
| US2007/0109845(A1) | 2007-05-01 | Chen | Applicant |
| US2007/0109849(A1) | 2007-05-01 | Chen | Applicant |
| US2007/0115726(A1) | 2007-05-01 | Cohen et al. | Applicant |
| US2007/0118713(A1) | 2007-05-01 | Guterman et al. | Applicant |
| US2007/0143378(A1) | 2007-06-01 | Gorobetz | Applicant |
| US2007/0143531(A1) | 2007-06-01 | Atri | Applicant |
| US2007/0159889(A1) | 2007-07-01 | Kang et al. | Applicant |
| US2007/0159892(A1) | 2007-07-01 | Kang et al. | Applicant |
| US2007/0159907(A1) | 2007-07-01 | Kwak | Applicant |
| US2007/0168837(A1) | 2007-07-01 | Murin | Applicant |
| US2007/0171714(A1) | 2007-07-01 | Wu et al. | Applicant |
| US2007/0183210(A1) | 2007-08-01 | Choi et al. | Applicant |
| US2007/0189073(A1) | 2007-08-01 | Aritome | Applicant |
| US2007/0195602(A1) | 2007-08-01 | Fong et al. | Applicant |
| US2007/0206426(A1) | 2007-09-01 | Mokhlesi | Applicant |
| US2007/0208904(A1) | 2007-09-01 | Hsieh et al. | Applicant |
| US2007/0226599(A1) | 2007-09-01 | Motwani | Applicant |
| US2007/0236990(A1) | 2007-10-01 | Aritome | Applicant |
| US2007/0253249(A1) | 2007-11-01 | Kang et al. | Applicant |
| US2007/0256620(A1) | 2007-11-01 | Viggiano et al. | Applicant |
| US2007/0266232(A1) | 2007-11-01 | Rodgers et al. | Applicant |
| US2007/0271424(A1) | 2007-11-01 | Lee et al. | Applicant |
| US2007/0280000(A1) | 2007-12-01 | Fujiu et al. | Applicant |
| US2007/0291571(A1) | 2007-12-01 | Balasundaram | Applicant |
| US2008/0010395(A1) | 2008-01-01 | Mylly et al. | Applicant |
| US2008/0025121(A1) | 2008-01-01 | Tanzawa | Applicant |
| US2008/0043535(A1) | 2008-02-01 | Roohparvar | Applicant |
| US2008/0049504(A1) | 2008-02-01 | Kasahara et al. | Applicant |
| US2008/0049506(A1) | 2008-02-01 | Guterman | Applicant |
| US2008/0052446(A1) | 2008-02-01 | Lasser et al. | Applicant |
| US2008/0055993(A1) | 2008-03-01 | Lee | Applicant |
| US2008/0080243(A1) | 2008-04-01 | Edahiro et al. | Applicant |
| US2008/0082730(A1) | 2008-04-01 | Kim et al. | Applicant |
| US2008/0089123(A1) | 2008-04-01 | Chae et al. | Applicant |
| US2008/0104309(A1) | 2008-05-01 | Cheon et al. | Applicant |
| US2008/0104312(A1) | 2008-05-01 | Lasser | Applicant |
| US2008/0109590(A1) | 2008-05-01 | Jung et al. | Applicant |
| US2008/0115017(A1) | 2008-05-01 | Jacobson | Applicant |
| US2008/0123420(A1) | 2008-05-01 | Brandman et al. | Applicant |
| US2008/0126686(A1) | 2008-05-01 | Sokolov et al. | Applicant |
| US2008/0130341(A1) | 2008-06-01 | Shalvi et al. | Applicant |
| US2008/0148115(A1) | 2008-06-01 | Sokolov et al. | Applicant |
| US2008/0151618(A1) | 2008-06-01 | Sharon et al. | Applicant |
| US2008/0151667(A1) | 2008-06-01 | Miu et al. | Applicant |
| US2008/0158958(A1) | 2008-07-01 | Sokolov et al. | Applicant |
| US2008/0181001(A1) | 2008-07-01 | Shalvi | Applicant |
| US2008/0198650(A1) | 2008-08-01 | Shalvi et al. | Applicant |
| US2008/0198654(A1) | 2008-08-01 | Toda | Applicant |
| US2008/0209116(A1) | 2008-08-01 | Caulkins | Applicant |
| US2008/0209304(A1) | 2008-08-01 | Winarski et al. | Applicant |
| US2008/0215798(A1) | 2008-09-01 | Sharon et al. | Applicant |
| US2008/0219050(A1) | 2008-09-01 | Shalvi et al. | Applicant |
| US2008/0239093(A1) | 2008-10-01 | Easwar et al. | Applicant |
| US2008/0239812(A1) | 2008-10-01 | Abiko et al. | Applicant |
| US2008/0263262(A1) | 2008-10-01 | Sokolov et al. | Applicant |
| US2008/0282106(A1) | 2008-11-01 | Shalvi et al. | Applicant |
| US2009/0013233(A1) | 2009-01-01 | Radke | Applicant |
| US2009/0024905(A1) | 2009-01-01 | Shalvi et al. | Applicant |
| US2009/0034337(A1) | 2009-02-01 | Aritome | Applicant |
| US2009/0043831(A1) | 2009-02-01 | Antonopoulos et al. | Applicant |
| US2009/0043951(A1) | 2009-02-01 | Shalvi et al. | Applicant |
| US2009/0049234(A1) | 2009-02-01 | Oh et al. | Applicant |
| US2009/0073762(A1) | 2009-03-01 | Lee et al. | Applicant |
| US2009/0086542(A1) | 2009-04-01 | Lee et al. | Applicant |
| US2009/0089484(A1) | 2009-04-01 | Chu | Applicant |
| US2009/0091979(A1) | 2009-04-01 | Shalvi | Applicant |
| US2009/0094930(A1) | 2009-04-01 | Schwoerer | Applicant |
| US2009/0106485(A1) | 2009-04-01 | Anholt | Applicant |
| US2009/0112949(A1) | 2009-04-01 | Ergan et al. | Applicant |
| US2009/0132755(A1) | 2009-05-01 | Radke | Applicant |
| US2009/0144600(A1) | 2009-06-01 | Perlmutter et al. | Applicant |
| US2009/0150894(A1) | 2009-06-01 | Huang et al. | Applicant |
| US2009/0157964(A1) | 2009-06-01 | Kasorla et al. | Applicant |
| US2009/0158126(A1) | 2009-06-01 | Perlmutter et al. | Applicant |
| US2009/0168524(A1) | 2009-07-01 | Golov et al. | Applicant |
| US2009/0172257(A1) | 2009-07-01 | Prins et al. | Applicant |
| US2009/0172261(A1) | 2009-07-01 | Prins et al. | Applicant |
| US2009/0204824(A1) | 2009-08-01 | Lin et al. | Applicant |
| US2009/0204872(A1) | 2009-08-01 | Yu et al. | Applicant |
| US2009/0225595(A1) | 2009-09-01 | Kim | Applicant |
| US2009/0300227(A1) | 2009-12-01 | Nochimowski et al. | Applicant |
| US2009/0323412(A1) | 2009-12-01 | Mokhlesi et al. | Applicant |
| US2009/0327608(A1) | 2009-12-01 | Eschmann | Applicant |
| US2010/0017650(A1) | 2010-01-01 | Chin et al. | Applicant |
| US2010/0034022(A1) | 2010-02-01 | Dutta et al. | Applicant |
| US2010/0057976(A1) | 2010-03-01 | Lasser | Applicant |
| US2010/0061151(A1) | 2010-03-01 | Miwa et al. | Applicant |
| US2010/0142277(A1) | 2010-06-01 | Yang et al. | Applicant |
| US2010/0169743(A1) | 2010-07-01 | Vogan et al. | Applicant |
| EP783754(B1) | 1997-07-01 | Applicant | |
| EP1434236(B1) | 2004-06-01 | Applicant | |
| EP1605509(A1) | 2005-12-01 | Applicant | |
| WO9610256(A1) | 1996-04-01 | Applicant | |
| WO9828745(A1) | 1998-07-01 | Applicant | |
| WO2100112(A1) | 2002-12-01 | Applicant | |
| WO3100791(A1) | 2003-12-01 | Applicant | |
| WO2007046084(A2) | 2007-04-01 | Applicant | |
| WO2007132452(A2) | 2007-11-01 | Applicant | |
| WO2007132453 | 2007-11-01 | Applicant | |
| WO2007132456(A2) | 2007-11-01 | Applicant | |
| WO2007132457 | 2007-11-01 | Applicant | |
| WO2007132458(A2) | 2007-11-01 | Applicant | |
| WO2007146010 | 2007-12-01 | Applicant | |
| WO2008026203 | 2008-03-01 | Applicant | |
| WO2008053472(A2) | 2008-05-01 | Applicant | |
| WO2008053473(A2) | 2008-05-01 | Applicant | |
| WO2008068747(A2) | 2008-06-01 | Applicant | |
| WO2008077284(A1) | 2008-07-01 | Applicant | |
| WO2008083131(A2) | 2008-07-01 | Applicant | |
| WO2008099958(A1) | 2008-08-01 | Applicant | |
| WO2008111058(A2) | 2008-09-01 | Applicant | |
| WO2008124760(A2) | 2008-10-01 | Applicant | |
| WO2008139441(A2) | 2008-11-01 | Applicant | |
| WO2009037691(A2) | 2009-03-01 | Applicant | |
| WO2009037697(A2) | 2009-03-01 | Applicant | |
| WO2009038961(A2) | 2009-03-01 | Applicant | |
| WO2009050703(A2) | 2009-04-01 | Applicant | |
| WO2009053961(A2) | 2009-04-01 | Applicant | |
| WO2009053962(A2) | 2009-04-01 | Applicant | |
| WO2009053963(A2) | 2009-04-01 | Applicant | |
| WO2009063450(A2) | 2009-05-01 | Applicant | |
| WO2009072100(A2) | 2009-06-01 | Applicant | |
| WO2009072101(A2) | 2009-06-01 | Applicant | |
| WO2009072102(A2) | 2009-06-01 | Applicant | |
| WO2009072103(A2) | 2009-06-01 | Applicant | |
| WO2009072104(A2) | 2009-06-01 | Applicant | |
| WO2009072105(A2) | 2009-06-01 | Applicant | |
| WO2009074978(A2) | 2009-06-01 | Applicant | |
| WO2009074979(A2) | 2009-06-01 | Applicant | |
| WO2009078006(A2) | 2009-06-01 | Applicant | |
| WO2009095902(A2) | 2009-08-01 | Applicant |
Non-Patent Literature (107)
- US 7,161,836, 01/2007, Wan et al. (withdrawn)Applicant
- 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.Applicant
- U.S. Appl. No. 11/945,575 Official Action dated Aug. 24, 2010.Applicant
- U.S. Appl. No. 12/045,520 Official Action dated Nov. 16, 2010.Applicant
- U.S. Appl. No. 12/880,101 “Reuse of Host Hibernation Storage Space by Memory Controller”, filed on Sep. 12, 2010.Applicant
- U.S. Appl. No. 12/890,724 “Error Correction Coding Over Multiple Memory Pages”, filed on Sep. 27, 2010.Applicant
- U.S. Appl. No. 12/171,797 Official Action dated Aug. 25, 2010.Applicant
- U.S. Appl. No. 12/497,707 Official Action dated Sep. 15, 2010.Applicant
- U.S. Appl. No. 11/995,801 Official Action dated Oct. 15, 2010.Applicant
- Numonyx, “M25PE16: 16-Mbit, page-erasable serial flash memory with byte-alterability, 75 MHz SPI bus, standard pinout”, Apr. 2008.Applicant
- Bez et al., in “Introduction to Flash Memory,” Proceedings of the IEEE, vol. 91, No. 4, Apr. 2003, pp. 489-502.Applicant
- Eitan et al., “Multilevel Flash Cells and their Trade-Offs,” Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM)5 New Yor, NY, pp. 169-172.Applicant
- Eital 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), Tokyo, Japan, Sep. 21-24, 1999, pp. 522-524.Applicant
- Maayan et al., in “A 512 Mb NROM Flash Data Storage Memory with 8 MB/s Data Rate”, Proceedings of the 2002 IEEE International Solida-State Circuits Conference (ISSCC 2002), San Francisco, California, Feb. 3-7, 2002, pp. 100-101.Applicant
- Kim and Koh in “Future Memory Technology including Emerging New Memories,” Proceedings of the 24 International Conference on Microelectronics (MIEL), Nis, Serbia and Montenegro, May 16-19, 2004, vol. 1, pp. 377-384.Applicant
- Jung, et al., in “A 117 mm 3.3V Only 128Mb Multilevel NAND Flash Memory for Mass Storage Applications,” IEEE Journal of Solid State Circuits, (11:31), Nov. 1996, pp. 1575-1583.Applicant
- Takeuchi et al., in “A Multipage Cell Architecture for High-Speed Programming Multilevel NAND Flash Memories,” IEEE Journal of Solid-State Circuits, (33:8), Aug. 1998, pp. 1228-1238.Applicant
- Lee, et al., Effects of Floating Gate Interference on NAND Flash Memory Cell Operation, IEEE Electron Device Letters, (23:5), May 2002, pp. 264-266.Applicant
- U.S. Appl. No. 60/863,506 (Oct. 30, 2006).Applicant
- U.S. Appl. No. 60/867,399 (Nov. 28, 2006).Applicant
- U.S. Appl. No. 60/892,869 (Mar. 4, 2007).Applicant
- U.S. Appl. No. 60/894,456 (Mar. 13, 2007).Applicant
- U.S. Appl. No. 60/917,653 (May 12, 2007).Applicant
- U.S. Appl. No. 60/950,884 (Jul. 20, 2007).Applicant
- U.S. Appl. No. 60/951,215 (Jul. 22, 2007).Applicant
- Huffman, A., “Non-Volatile Memory Host Controller Interface (NVMHCI)”, Specification 1.0, Apr. 14, 2008.Applicant
- 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.Applicant
- U.S. Appl. No. 11/957,970 Official Action dated May 20, 2010.Applicant
- Shalvi et al., U.S. Appl. No. 12/822,207 “Adaptive Over-Provisioning in Memory Systems” filed on Jun. 24, 2010.Applicant
- U.S. Appl. No. 12/019,011 Official Action dated Nov. 20, 2009.Applicant
- 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.Applicant
- U.S. Appl. No. 11/949,135 Official Action dated Oct. 2, 2009.Applicant
- Agrell et al., “Closest Point Search in Lattices”, IEEE Transactions on Information Theory, vol. 48, No. 8, pp. 2201-2214, Aug. 2002.Applicant
- Blahut, R.E., “Theory and Practice of Error Control Codes,” Addison-Wesley, May 1984, section 3.2, pp. 47-48.Applicant
- Chang, L., “Hybrid Solid State Disks: Combining Heterogeneous NAND Flash in Large SSDs”, ASPDAC, Jan. 2008.Applicant
- 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.Applicant
- Databahn™, “Flash memory controller IP”, Denali Software, Inc., 1994 https://www.denali.com/en/products/databahn—flash.jsp.Applicant
- Datalight, Inc., “FlashFX Pro 3.1 High Performance Flash Manager for Rapid Development of Reliable Products”, Nov. 16, 2006.Applicant
- Duann, N., Silicon Motion Presentation “SLC & MLC Hybrid”, Flash Memory Summit, Santa Clara, USA, Aug. 2008.Applicant
- 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.Applicant
- 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.Applicant
- 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.Applicant
- 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.Applicant
- 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.Applicant
- Kawaguchi et al. 1995. A flash-memory based file system. In Proceedings of the USENIX 1995 Technical Conference , New Orleans, Louisiana. 155-164.Applicant
- 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.Applicant
- Onfi, “Open NAND Flash Interface Specification,” revision 1.0, Dec. 28, 2006.Applicant
- Phison Electronics Corporation, “PS8000 Controller Specification (for SD Card)”, revision 1.2, Document No. S-07018, Mar. 28, 2007.Applicant
- Shalvi, et al., “Signal Codes,” Proceedings of the 2003 IEEE Information Theory Workshop (ITW'2003), Paris, France, Mar. 31-Apr. 4, 2003.Applicant
- Shiozaki, A., “Adaptive Type-II Hybrid Broadcast ARQ System”, IEEE Transactions on Communications, vol. 44, Issue 4, pp. 420-422, Apr. 1996.Applicant
- 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.Applicant
- ST Microelectronics, “Bad Block Management in NAND Flash Memories”, Application note AN-1819, Geneva, Switzerland, May 2004.Applicant
- ST Microelectronics, “Wear Leveling in Single Level Cell NAND Flash Memories,” Application note AN-1822 Geneva, Switzerland, Feb. 2007.Applicant
- 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.Applicant
- International Application PCT/IL2007/000575 Patentability report dated Mar. 26, 2009.Applicant
- International Application PCT/IL2007/000575 Search Report dated May 30, 2008.Applicant
- International Application PCT/IL2007/000576 Patentability Report dated Mar. 19, 2009.Applicant
- International Application PCT/IL2007/000576 Search Report dated Jul. 7, 2008.Applicant
- International Application PCT/IL2007/000579 Patentability report dated Mar. 10, 2009.Applicant
- International Application PCT/IL2007/000579 Search report dated Jul. 3, 2008.Applicant
- International Application PCT/IL2007/000580 Patentability Report dated Mar. 10, 2009.Applicant
- International Application PCT/IL2007/000580 Search Report dated Sep. 11, 2008.Applicant
- International Application PCT/IL2007/000581 Patentability Report dated Mar. 26, 2009.Applicant
- International Application PCT/IL2007/000581 Search Report dated Aug. 25, 2008.Applicant
- International Application PCT/IL2007/001059 Patentability report dated Apr. 19, 2009.Applicant
- International Application PCT/IL2007/001059 Search report dated Aug. 7, 2008.Applicant
- International Application PCT/IL2007/001315 search report dated Aug. 7, 2008.Applicant
- International Application PCT/IL2007/001315 Patentability Report dated May 5, 2009.Applicant
- International Application PCT/IL2007/001316 Search report dated Jul. 22, 2008.Applicant
- International Application PCT/IL2007/001316 Patentability Report dated May 5, 2009.Applicant
- International Application PCT/IL2007/001488 Search report dated Jun. 20, 2008.Applicant
- International Application PCT/IL2008/000329 Search report dated Nov. 25, 2008.Applicant
- International Application PCT/IL2008/000519 Search report dated Nov. 20, 2008.Applicant
- International Application PCT/IL2008/001188 Search Report dated Jan. 28, 2009.Applicant
- International Application PCT/IL2008/001356 Search Report dated Feb. 3, 2009.Applicant
- International Application PCT/IL2008/001446 Search report dated Feb. 20, 2009.Applicant
- Sommer, N., U.S. Appl. No. 12/364,531 “Parameter Estimation Based on Error Correction Code Parity Check Equations” filed on Feb. 3, 2009.Applicant
- Perlmutter et al., U.S. Appl. No. 12/388,528 “Programming of Analog Memory Cells Using a Single Programming Pulse per State Transition” filed on Feb. 19, 2009.Applicant
- Perlmutter et al., U.S. Appl. No. 12/390,522 “Programming Analog Memory Cells for Reduced Variance After Retention” filed on Feb. 23, 2009.Applicant
- Perlmutter et al., U.S. Appl. No. 12/405,275 “Memory Device with Multiple-Accuracy Read Commands” filed on Mar. 17, 2009.Applicant
- Perlmutter et al., U.S. Appl. No. 12/397,368 “Efficient Readout from Analog Memory Cells Using Data Compression” filed on Mar. 4, 2009.Applicant
- Sommer, N., U.S. Appl. No. 12/171,797 “Memory Device with Non-Uniform Programming Levels” filed on Jul. 11, 2008.Applicant
- Shalvi et al., U.S. Appl. No. 12/251,471 “Compensation for Voltage Drifts in Analog Memory Cells” filed on Oct. 15, 2008.Applicant
- Jedec Standard JESD84-C44, “Embedded MultiMediaCard (e•MMC) Mechanical Standard, with Optional Reset Signal”, Jedec Solid State Technology Association, USA, Jul. 2009.Applicant
- Jedec, “UFS Specification”, version 0.1, Nov. 11, 2009.Applicant
- SD Group and SD Card Association, “SD Specifications Part 1 Physical Layer Specification”, version 3.01, draft 1.00, Nov. 9, 2009.Applicant
- Compaq et al., “Universal Serial Bus Specification”, revision 2.0, Apr. 27, 2000.Applicant
- Serial ATA International Organization, “Serial ATA Revision 3.0 Specification”, Jun. 2, 2009.Applicant
- 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.Applicant
- U.S. Appl. No. 12/251,471 Official Action dated Jan. 3, 2011.Applicant
- U.S. Appl. No. 12/388,528 Official Action dated Nov. 29, 2010.Applicant
- Super User Forums, “SD Card Failure, can't read superblock”, posted Aug. 8, 2010.Applicant
- Engineering Windows 7, “Support and Q&A for Solid-State Drives”, e7blog, May 5, 2009.Applicant
- Micron Technology Inc., “Memory Management in NAND Flash Arrays”, Technical Note, year 2005.Applicant
- 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.Applicant
- 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.Applicant
- “How to Resolve “Bad Super Block: Magic Number Wrong” in BSD”, Free Online Articles Director Article Base, posted Sep. 5, 2009.Applicant
- UBUNTU Forums, “Memory Stick Failed IO Superblock”, posted Nov. 11, 2009.Applicant
- U.S. Appl. No. 13/021,754, filed Feb. 6, 2011.Applicant
- U.S. Appl. No. 12/987,174, filed Jan. 10, 2011.Applicant
- U.S. Appl. No. 12/987,175, filed Jan. 10, 2011.Applicant
- U.S. Appl. No. 12/963,649, filed Dec. 9, 2010.Applicant
- U.S. Appl. No. 12/534,898 Official Action dated Mar. 23, 2011.Applicant
- U.S. Appl. No. 13/047,822 filed Mar. 15, 2011.Applicant
- U.S. Appl. No. 13/069,406 filed Mar. 23, 2011.Applicant
- U.S. Appl. No. 13/088,361 filed Apr. 17, 2011.Applicant
- Chinese Application # 200780026181.3 Official Action dated Apr. 8, 2011.Applicant