US 7,593,263 B2Grant
Memory device with reduced reading latency
Issue Date:2009-09-22
•40 Claims
•6 Drawing Sheets
Abstract
A method for data storage includes providing a memory, which includes first memory cells having a first reading latency and second memory cells having a second reading latency that is higher than the first reading latency. An item of data intended for storage in the memory is divided into first and second parts. The first part is stored in the first memory cells and the second part is stored in the second memory cells. In response to a request to retrieve the item of data from the memory, the first part is read from the first memory cells and provided as output. The second part is read from the second memory cells, and provided as output subsequently to outputting the first part.
Metadata
Assignee
- Anobit Technologies Ltd.
Inventors
- Dotan Sokolov
- Gil Semo
- Ofir Shalvi
Application Information
Application Number:US 11/958,011
Filing Date:2007-12-17
Priority Date:2006-12-17
Art Unit:2827
Classifications
IPC:
G11C16/04
Patent Drawings (6 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application claims the benefit of U.S. Provisional Patent Application 60/870,399, filed Dec. 17, 2006, and U.S. Provisional Patent Application 60/991,246, filed Nov. 30, 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 reducing the latency of reading data from memory devices.
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.
[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, April, 2003, pages 489-502, which is incorporated herein by reference. Multi-level Flash cells and devices are described, for example, by Eitan et al., in “Multilevel Flash Cells and their Trade-Offs,” Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), New York, N.Y., pages 169-172, which is incorporated herein by reference. The paper compares several kinds of multilevel Flash cells, such as common ground, DINOR, AND, NOR and NAND cells.
[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] Some known data storage methods store certain parts of the data in single-level cells and other parts of the data in multi-level cells. Such configurations are described, for example, in U.S. Pat. Nos. 5,541,886, 6,717,847 and 7,177,184, and in U.S. Patent Application Publication 2007/061502, whose disclosures are incorporated herein by reference.
SUMMARY OF THE INVENTION
[0008] Embodiments of the present invention provide a method for data storage, including:
[0009] providing a memory, which includes first memory cells having a first reading latency and second memory cells having a second reading latency that is higher than the first reading latency;
[0010] dividing an item of data intended for storage in the memory into first and second parts;
[0011] storing the first part in the first memory cells and the second part in the second memory cells; and
[0012] in response to a request to retrieve the item of data from the memory, reading the first part from the first memory cells and outputting the read first part, reading the second part from the second memory cells, and outputting the read second part subsequently to outputting the first part.
[0013] In some embodiments, reading the second part includes reading the second part concurrently with outputting the first part.
[0014] In an embodiment, the first and second memory cells are formed using respective, different first and second memory device technologies. In a disclosed embodiment, the first memory cells include NOR Flash cells and the second memory cells include NAND Flash cells. In another embodiment, the memory includes an array of analog memory cells, and the first and second memory cells include respective first and second groups of the memory cells in the array.
[0015] In another embodiment, storing the first part includes programming the first memory cells using a first number of nominal analog values to assume a respective first number of possible memory states, and storing the second part includes programming the second memory cells using a second number of the nominal analog values, which is greater than the first number, to assume a respective second number of the memory states. In an embodiment, the first memory cells include Single-Level Cells (SLC), and the second memory cells include Multi-Level Cells (MLC). In another embodiment, the first number of the nominal analog values is four, and the second number of the nominal analog values is eight.
[0016] In another embodiment, reading the first part includes comparing first analog values stored in the first memory cells to a first set of reading thresholds, reading the second part includes comparing second analog values stored in the second memory cells to a second set of the reading thresholds, and the method includes adjusting the second set of the reading thresholds responsively to the read first part. In some embodiments, storing the first part includes encoding the first part using an Error Correction Code (ECC), reading the first part includes decoding the ECC, and adjusting the second set of the reading thresholds includes detecting errors in the read first part that were corrected by the ECC and adjusting the second set responsively to the detected corrected errors.
[0017] In a disclosed embodiment, the first memory cells include Random Access Memory (RAM) cells. In an embodiment, the item of data includes user data of a given type, and dividing the item of the data includes dividing the user data of the given type such that each of the first and second parts includes a portion of the user data.
[0018] In another embodiment, the first and second memory cells are arranged in respective first and second sets of memory pages, dividing the item of the data includes dividing the item into multiple fragments, assigning a number of the fragments to the first part and a remaining number of the fragments to the second part, and storing the first and second parts includes storing the number of the fragments in a subset of the first set of the memory pages and storing the remaining number of the fragments in a subset of the second set of the memory pages.
[0019] In yet another embodiment, storing the first and second parts includes encoding the first part of the item using a first Error Correction Code (ECC) scheme having a first decoding latency, and encoding the second part of the item using a second ECC scheme having a second decoding latency, which is greater than the first decoding latency. In still another embodiment, encoding the first part includes applying a first ECC, and encoding the second part includes applying a second ECC that is different from the first ECC. Additionally or alternatively, the first ECC scheme has a first ECC block size, and the second ECC scheme has a second ECC block size that is larger that the first block size.
[0020] In an embodiment, storing the first part including selecting the first memory cells responsively to a level of distortion in the cells. Selecting the first memory cells may include selecting the cells based on a number of previous programming and erasures cycles of the cells.
[0021] There is additionally provided, in accordance with an embodiment of the present invention, apparatus for data storage, including:
[0022] a memory, which includes first memory cells having a first reading latency and second memory cells having a second reading latency that is higher than the first reading latency; and
[0023] a processor, which is coupled to divide an item of data intended for storage in the memory into first and second parts, to store the first part in the first memory cells and the second part in the second memory cells, and, in response to a request to retrieve the item of data from the memory, to read the first part from the first memory cells and output the read first part, to read the second part from the second memory cells, and to output the read second part subsequently to outputting the first part.
[0024] There is also provided, in accordance with an embodiment of the present invention apparatus for data storage, including:
[0025] an interface, which is coupled to communicate with a memory that includes first memory cells having a first reading latency and second memory cells having a second reading latency that is higher than the first reading latency; and
[0026] a processor, which is coupled to divide an item of data intended for storage in the memory into first and second parts, to store the first part in the first memory cells and the second part in the second memory cells, and, in response to a request to retrieve the item of data from the memory, to read the first part from the first memory cells and output the read first part, to read the second part from the second memory cells, and to output the read second part subsequently to outputting the first part.
[0027] There is further provided, in accordance with an embodiment of the present invention, a method for operating a memory that includes a plurality of analog memory cells, including:
[0028] storing first data in a first group of the analog memory cells by programming the cells of the first group using a first number of nominal analog values to assume a respective first number of possible memory states;
[0029] storing second data in a second group of the analog memory cells by programming the cells of the second group using a second number of the nominal analog values to assume a respective second number of the possible memory states, which is greater than the first number;
[0030] reading the first data by comparing first analog values stored in the cells of the first group to a first set of reading thresholds;
[0031] reading the second data by comparing second analog values stored in the cells of the second group to a second set of the reading thresholds; and
[0032] adjusting the second set of the reading thresholds responsively to the read first part.
[0033] There is also provided, in accordance with an embodiment of the present invention, a method for data storage, including:
[0034] providing a memory including a plurality of memory cells, wherein each memory cell stores at least first and second bits, such that the first bits of the memory cells have a first reading latency and the second bits of the memory cells have a second reading latency, which is higher than the first reading latency;
[0035] dividing an item of data intended for storage in the memory into first and second parts;
[0036] storing the first part in the first bits and the second part in the second bits of the memory cells; and
[0037] in response to a request to retrieve the item of data from the memory, reading the first part from the first bits and outputting the read first part, reading the second part from the second bits, and outputting the read second part subsequently to outputting the first part.
[0038] 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
[0039] FIGS. 1 and 2 are block diagrams that schematically illustrate systems for data storage and retrieval, in accordance with embodiments of the present invention;
[0040] FIG. 3 is a diagram that schematically illustrates a memory, in accordance with an embodiment of the present invention;
[0041] FIG. 4 is a flow chart that schematically illustrates a method for data storage and retrieval, in accordance with an embodiment of the present invention;
[0042] FIG. 5 is a timing diagram that schematically illustrates a method for data storage and retrieval, in accordance with an embodiment of the present invention;
[0043] FIGS. 6A-6D are diagrams that schematically illustrate voltage distributions in a memory cell array, in accordance with an embodiment of the present invention; and
[0044] FIG. 7 is a flow chart that schematically illustrates a method for data storage and retrieval, in accordance with another embodiment of the present invention.
DETAILED DESCRIPTION OF EMBODIMENTS
Overview
[0045] Retrieving data from memory devices inevitably involves some reading latency. The reading latency is typically measured from the moment the host requests a particular data item (e.g., a file) to the moment the requested data begins to appear on the host interface. Since some memory controllers and host applications are sensitive to high reading latency values, it is desirable to reduce the reading latency to a minimum.
[0046] In principle, low reading latency can be achieved by using expensive and/or low density memory devices. For example, SLC devices typically have smaller reading latencies than MLC devices, but at the expense of higher cost per bit and lower storage density. As another example, NOR Flash devices typically have smaller reading latencies than NAND Flash cells, but are more expensive.
[0047] Embodiments of the present invention that are described hereinbelow provide improved methods and systems for storing and retrieving data, which provide both low reading latency and low device cost. In some embodiments, a memory comprises two types of memory cells, one type having lower reading latency than the other. For example, the lower-latency cells may comprise NOR Flash cells, and the higher-latency cells may comprise NAND Flash cells. As another example, an array of Flash memory cells can be partitioned so that some cells are used as SLC to serve as lower-latency cells, and other cells are used as MLC to serve as higher-latency cells. Typically, most of the memory cells comprise higher-latency lower-cost cells, and only a small portion of the total memory comprises higher-cost low-latency cells.
[0048] A processor or controller interacts with the host application and with the memory. The processor stores data items accepted from the host in the memory, and retrieves data items from the memory and sends them to the host. When storing a data item in the memory, the processor divides the data item into two parts. The processor stores the first part in the lower-latency cells, and the second part in the higher-latency cells. When retrieving the data item from the memory, the processor initially reads the first part of the data item from the lower-latency cells and sends the first part to the host. After reading the first part and concurrently with outputting the first part to the host, the processor reads the second part of the data item from the higher-latency cells.
[0049] Using this technique, the reading latency seen by the host is reduced to the latency of the lower-latency cells, even though only a relatively small portion of the total memory comprises such low-latency cells. Thus, the methods and systems described herein achieve low reading latency and low cost simultaneously.
System Description
[0050] FIG. 1 is a block diagram that schematically illustrates a system 20 for data storage and retrieval, 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 (such as “disk-on-key” devices), Multi-Media Cards (MMC), systems and applications based on embedded MMC (eMMC™), Secure Digital (SD) cards, digital cameras, Solid State Drives (SSD), music and other media players such as MP3 or MP4 players, and/or any other system or device in which data is stored and retrieved.
[0051] 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.
[0052] 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.
[0053] 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 (R/W) 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 thus 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.
[0054] 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.
[0055] In some embodiments, 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. Unit 60 may use any suitable type of ECC. ECC schemes that may be used by unit 60 may comprise, for example, various block codes such as Bose-Chaudhuri-Hocquenghem (BCH) codes, Reed-Solomon (RS) codes, Low Density Parity Check (LDPC) codes, turbo codes or a turbo product codes (TPC). Alternatively, unit 60 may use a convolutional ECC, a concatenated ECC, a trellis code or other signal-space code, or a multi-level ECC.
[0056] In particular, MSP 52 carries out methods for reducing the latency of reading data from memory cells 32 of array 28, as will be described in detail below.
[0057] 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.
[0058] 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.
[0059] 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. 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.
[0060] 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.
[0061] 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.
[0062] Memory cells 32 of array 28 are arranged in a grid having multiple rows and columns. Each cell 32 typically 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.
[0063] The rows are commonly referred to as word lines and the columns are commonly referred to as bit lines of the memory array. The memory cell array is typically divided into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously. Pages are sometimes sub-divided into sectors. In some embodiments, each page comprises an entire row of the array. In alternative embodiments, each row (word line) can be divided into two or more pages. For example, in some SLC devices each row is divided into two pages, one comprising the odd-order cells and the other comprising the even-order cells. In a typical implementation, a two-bit-per-cell memory device may have four pages per row, a three-bit-per-cell memory device may have six pages per row, and a four-bit-per-cell memory device may have eight pages per row.
[0064] 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). Three-bit-per cell devices often have 192 pages per erasure block, and four-bit-per-cell devices often have 256 pages per block. Alternatively, other block sizes and configurations can also be used.
Low-Latency Storage and Retrieval
[0065] When retrieving data from memory, the host processor or application inevitably encounters some reading latency. Some memory controllers and host applications are sensitive to high reading latency values, and it is therefore desirable to keep the reading latency at a minimum.
[0066] As noted above, low reading latency can be achieved by using expensive and/or low density memory devices, such as NOR Flash cells instead of NAND cells, or SLC instead of MLC. The methods and systems described herein provide both low reading latency and low device cost simultaneously by splitting the storage of each data item between two types of memory cells, one type having lower reading latency than the other. The beginning of each data item is stored in low-latency cells and the remaining part of the data item is stored in higher-latency cells. When retrieving a data item, the beginning of the data item is first read from the low-latency cells and provided as output. In parallel to preparing and outputting the beginning of the data item, the remaining part is read from the higher-latency cells.
[0067] Each Data item that is stored using the methods described herein comprises data of a given type, such as text, binary data, digital video or audio media, digital voice, or any other suitable data type. This data is often referred to as user data or payload. The data item may also comprise metadata or header information. The methods described herein do not differentiate between headers, metadata and user data of the given type when dividing the data item between the lower-latency and higher-latency cells. Thus, parts of the user data are stored in both cell types.
[0068] The description that follows refers to a processor or controller, which carries out the methods described herein. The processor may comprise an MSP, such as in the configuration of FIG. 1 above, a dedicated memory controller device, a processor of the host system, or any other suitable processor or controller.
[0069] FIG. 2 is a block diagram that schematically illustrates a system 78 for data storage and retrieval, in accordance with an embodiment of the present invention. System 78 comprises a memory 80, which comprises a fast memory 82 and a slower memory 84. Memory 84 is also referred to as a “regular latency memory.” Memory 82 comprises lower-latency memory cells, while memory 84 comprises higher-latency memory cells. Typically, the number of lower-latency cells is considerably smaller than the number of higher-latency cells. A processor 86 stores and retrieves data in and out of memories 82 and 84 of memory 80.
[0070] The terms “slow,” “fast,” “regular,” “lower-latency” and “higher-latency” refer to the latency encountered by processor 86 when retrieving data that is stored in the cells of memories 82 and 84. These terms do not imply any absolute latency figures, but are used in a relative sense to define that memory 82 has a smaller reading latency than memory 84.
[0071] In some embodiments, memory 82 and memory 84 comprise memory cells of different technologies. For example, memory 82 may comprise a NOR Flash memory and memory 84 may comprise a NAND Flash memory. Alternatively, memory 82 may comprise a SLC memory and memory 84 may comprise a MLC memory. Further alternatively, any other suitable types of memory cells can be used as lower- and higher-latency cells. Memories 82 and 84 may comprise separate packaged memory devices, or separate dies that are packaged in a single device package.
[0072] In an alternative embodiment, memory 82 and memory 84 comprise cells of the same technology (e.g., different cells in the same memory cell array), which are configured or programmed differently and thus have different reading latencies. For example, memory cells that are physically similar to one another can be operated as either SLC or MLC, as appropriate.
[0073] More generally, the reading latency of analog memory cells often depends on the number of levels used for programming the cells. In other words, dense analog memory cells that are programmed with a large number of levels usually have a high reading latency, and vice versa. The dependence of the reading latency on the number of levels is explained in detail further below. Thus, analog memory cells (in the same array or in different arrays) can be programmed using different numbers of levels to provide different latency/density trade-offs.
[0074] In some multi-level memory cells, different bits within a given cell may have different reading latencies, such as because of the different number of threshold comparison operations carried out for reading different bits. In some embodiments, the processor writes data that is intended to have low reading latency in the lower-latency bits, and data that is intended to have higher reading latency in the higher-latency bits. In some memory configurations, some memory pages are mapped to the Least Significant Bits (LSB) of the memory cells, and other memory pages are mapped to bits of higher significance. Thus, the processor can write the first part of each data item in pages that are mapped to lower-latency bits.
[0075] The methods and systems described herein are not limited to the use of non-volatile memory technologies. For example, memory 82 may comprise a Random Access Memory (RAM), such as a Static RAM (SRAM). In these embodiments, processor 86 caches the beginning of each data item in memory 82. When retrieving the data item, the beginning of the data item is read from the SRAM with small latency, and the remaining part of the data item is fetched from memory 84 in parallel.
[0076] In some embodiments, the processor encodes the data using an Error Correction Code (ECC) prior to storing it in memory 80. In these embodiments, the processor may encode the parts of the data intended to have lower and higher reading latencies using different ECC schemes having different decoding latencies. For example, the first part of each data item can be encoded with relatively small ECC blocks, thus achieving low reading latency at the expense of higher error probability. The remaining part of the data item is encoded with larger ECC blocks, thus providing better error correction capability but higher reading latency.
[0077] Alternatively, the processor may use different codes for lower-latency and higher-latency storage. For example, the processor may encode the first part of each data item with a BCH code, and the second part with LDPC.
[0078] ECC schemes having higher decoding latencies often have better error correction capabilities, and vice versa. In some embodiments, the processor stores the low-latency data in memory cells that are expected to have less distortion, so as to match the strength of the ECC scheme with the properties of the cells. Any suitable criterion can be used for selecting the lower-distortion cells.
[0079] For example, cells that have gone through a smaller number of programming and erasure cycles are expected to have less distortion. Thus, the processor may assign memory cells for storing the data encoded with the different coding schemes based on the amount of wear the cells have gone through. The processor may designate the cells whose number of previous programming and erasure cycles is lower than a certain threshold (e.g., 100 cycles) for storing the first part of each data item. For this purpose, the processor may allow only limited access to a certain area of the memory, so as to preserve a certain number of “fresh” cells throughout the lifetime of the memory device.
[0080] FIG. 3 is a diagram that schematically illustrates a memory 90, which can be used to implement memory 80 of FIG. 2 above, in accordance with an embodiment of the present invention. Memory 90 comprises K fast pages 94 (i.e., pages of lower-latency cells) and N regular pages 98 (i.e., pages of higher-latency cells). Typically, K and N are chosen so that K<<N. The fast and regular pages may reside in a single cell array or in different arrays, in the same erasure block or in different blocks, or on separate dies.
[0081] When storing a certain data item Di, such as a file, in array 90, the processor assigns this data item Ki fast pages and Ni regular pages. The number of assigned fast and/or regular pages may differ from one data item to another. Typically, the total number of fast pages is considerably smaller than the total number of regular pages when summed over the collection of files stored in memory 90, i.e.,
[0082]
[0083] FIG. 4 is a flow chart that schematically illustrates a method for data storage and retrieval, in accordance with an embodiment of the present invention. The method begins with processor 86 accepting a data item Di (e.g., a file) for storage in memory 90, at an input step 100. The processor divides the data item into fragments, at a partitioning step 104. In the present example, each fragment contains an amount of data suitable for storage in a single page of memory 90. Alternatively, fragments may correspond to sectors, erasure blocks or any other suitable group of cells.
[0084] The processor stores the first Ki fragment of the data item in Ki fast pages of memory 90, at a fast page storage step 108. The processor stores the remaining fragment of the data item in Ni regular pages of memory 90, at a regular page storage step 112.
[0085] When the host requests processor 86 to retrieve data item Di, the processor first reads the data stored in the fast pages, and then the data stored in the regular pages, at a retrieval step 116. The processor initially reads the data stored in the fast pages, prepares them for output and outputs their content to the host. This operation has low reading latency. In parallel to preparing and outputting the data read from the fast pages, the processor reads the data stored in the regular pages. The processor then prepares and outputs the data read from the regular pages to the host. Thus, the reading latency seen by the host is the reading latency of the fast pages, even though most of the data of Di is stored in regular pages.
[0086] FIG. 5 is a timing diagram that schematically illustrates a method for data storage and retrieval, in accordance with an embodiment of the present invention. The top of the figure (above the horizontal time axis) shows the timing of memory access and data output operations performed by processor 86 when using a combination of fast and regular pages, as explained above. The bottom of the figure (below the horizontal axis) shows a scheme that uses only regular pages, as a reference.
[0087] The timing scheme at the top of the figure shows the process of retrieving a data item, which is stored in two fast pages 120A and 120B and three regular pages 120C . . . 120E. When the processor is requested to retrieve this data item, it initially fetches fast page 120A from the lower-latency memory, and then prepares and outputs this page to the host as an output page 124A. The first output page appears on the host interface at a reading latency denoted T1. In parallel to preparing and outputting output page 124A, the processor fetches fast page 120B from the lower-latency memory. The processor outputs this page as an output page 124B, immediately following output page 124A.
[0088] From this stage, the processor fetches and prepares regular pages 120C . . . 120E from the higher-latency memory, and outputs them as output pages 124C . . . 124E, respectively. Thus, the host is provided with a sequence of output pages 124A . . . 124E, which begins at a reading latency T1, the reading latency of the fast pages.
[0089] The bottom of FIG. 5 demonstrates the higher latency achieved when using only regular pages. In this scheme, the processor fetches a data item, which is stored in regular pages 128A . . . 128D, and outputs the data in respective output pages 132A . . . 132D. The data begins to appear on the host interface at a reading latency of T2, which is higher than T1. Note that in some embodiments, such as when the fast pages comprise SLC and the regular pages comprise MLC, the technique described above also reduces programming latency.
Adjusting Read Thresholds of Regular Pages Using Previously-Retrieved Fast Pages
[0090] FIGS. 6A-6D are diagrams that schematically illustrate voltage distributions in a memory cell array, in accordance with an embodiment of the present invention. FIGS. 6A and 6B show the voltage distributions in the higher-latency cells, while FIGS. 6C and 6D show the voltage distributions in the lower-latency cells. In the present example, the processor programs the higher-latency cells using eight possible levels, thus storing three bits per cell. The lower-latency cells are programmed using only four possible levels, thus storing two bits per cell.
[0091] Referring to FIG. 6A , data is stored in the higher-latency cells by programming the cells to eight possible levels denoted L0 . . . L7. The actual analog values (e.g., threshold voltages) of the cells vary statistically around these levels, in accordance with distributions 136A . . . 136H. Distributions 136A . . . 136H reflect the distribution of analog values immediately after the cells are programmed. Data is read from the higher-latency cells by comparing the analog values read from the cells to a set of seven reading thresholds denoted TH1 . . . TH7, which are positioned between the voltage distributions.
[0092] FIG. 6B shows the analog value distribution in the higher-latency cells, after the cells have aged, i.e., have gone through a certain retention period and/or various impairment effects (e.g., multiple programming and erasure cycles, interference from neighboring cells and/or temperature shift effects). The figure shows eight distributions 140A . . . 140H, which are typically wider than distributions 136A . . . 136H and are also shifted with respect to the nominal levels L0 . . . L7. Consequently, the optimal positions of the reading thresholds have also shifted, and are now denoted TH1′ . . . TH7′.
[0093] FIG. 6C shows the voltage distributions in the lower-latency cells, immediately after the cells are programmed. The figure shows four voltage distributions 144A . . . 144D, which correspond to the four levels used for programming these cells.
[0094] FIG. 6D shows the voltage distributions in the lower-latency cells after the cells have aged. The figure shows four distributions 148A . . . 148D, which are shifted with respect to the corresponding distributions 144A . . . 144D.
[0095] The error performance of the data retrieval process is highly sensitive to the correct positioning of the reading thresholds. As can be clearly seen in FIGS. 6A . . . 6D, the sensitivity to the positions of the reading thresholds increases sharply with the number of levels.
[0096] In some implementations, the positions of the reading thresholds are determined and possibly adjusted before data can be read successfully. When the number of levels is small, threshold adjustment may be coarse and can sometimes be omitted. When the number of levels is high, on the other hand, the reading thresholds are adjusted with high accuracy in order to successfully decode the data. The higher reading latency associated with cells having a large number of levels is partly due to the accurate threshold adjustment process that is needed for proper data retrieval.
[0097] In some embodiments of the present invention, the processor uses the decoding results of the lower-latency cells, which are decoded first, to adjust the reading thresholds of the higher-latency cells. Thus, the latency of the higher-latency cells can be reduced considerably.
[0098] FIG. 7 is a flow chart that schematically illustrates a method for data storage and retrieval, in which the decoding results of the higher-latency cells are adjusted based on the decoding results of the lower-latency cells, in accordance with an embodiment of the present invention.
[0099] The method begins with processor 86 programming the lower-latency cells using M levels, at a first programming step 150. The processor programs the higher-latency cells using N levels, N>M, at a second programming step 154. Specifically, the processor programs the lower-latency cells using a subset of the levels used for programming the higher-latency cells.
[0100] When retrieving a certain data item, the processor first retrieves and decodes the part of the data item that is stored in the low-latency cells, at a first decoding step 158. The processor decodes the data using a subset of the reading thresholds used for reading the higher-latency cells.
[0101] Referring to the example of FIGS. 6A-6D , the processor programs the higher-latency cells using eight levels and the lower-latency cells using four levels. The processor reads the data from the higher-latency cells using seven thresholds TH1 . . . TH7, and from the lower-latency cells using three thresholds TH2, TH4 and TH6.
[0102] Since the lower-latency cells are programmed with only four levels, the processor is likely to successfully decode the data from these cells, even when the reading thresholds are not set to their optimal positions. Typically, the number of errors resulting from non-optimal threshold positions is within the correction capability of the ECC.
[0103] In the higher-latency cells that are programmed with eight levels, however, the ECC may not be able to correct the errors caused by the non-optimal threshold positions. For example, in a certain implementation, an ECC having a correction capability of 16 errors per page is able to overcome ±60 mV threshold deviations in the four-level cells, but only ±20 mV threshold deviations in the eight-level cells.
[0104] Thus, processor 86 adjusts the reading thresholds of the higher-latency cells based on the decoding results of the low-latency cells, at a threshold adjustment step 162. This technique assumes that the impairment mechanisms, e.g., aging, are similar in the two cell types.
[0105] In some embodiments, the processor determines the desired threshold adjustment based on the errors in the low-latency cells that were corrected by the ECC. For example, the processor may adjust the reading thresholds based on a comparison between (1) the number of errors in which “1” data was corrected to “0” and (2) the number of errors in which “0” data was corrected to “1”. This comparison may indicate a non-optimal threshold position, as well as the direction and size of the desired adjustment. Alternatively, the processor may compare the number of “1” bits with the number of “0” in the decoded data. Assuming the stored data is balanced, an imbalance in the decoded data may indicate a non-optimal threshold position, and/or the direction and size of the appropriate correction.
[0106] Some aspects of threshold adjustment based on ECC results are described in PCT Application PCT/IL2007/001315, entitled “Reading Memory Cells using Multiple Thresholds,” filed Oct. 30, 2007, whose disclosure is incorporated herein by reference. Further alternatively, the processor may use any other suitable method for adjusting the reading thresholds of the higher-latency cells based on the data read from the lower-latency cells.
[0107] The processor reads the data from the high-latency cells using the adjusted reading thresholds. Since the threshold positions are improved by the adjustment process of step 162 above, the reading latency of the higher-latency cells can be reduced considerably. In some embodiments, the processor uses the adjusted thresholds as is. In an alternative embodiment, the processor carries out a short threshold adaptation process before reading the data from the higher-latency cells. The threshold adaptation process uses the adjusted thresholds produced at step 162 as initial conditions, and therefore its length is significantly reduced.
[0108] In some embodiments, the lower-latency memory cells can be programmed more accurately than the higher-latency memory cells. For example, when the cells are programmed using an iterative Program and Verify (P&V) process, as is known in the art, the lower-latency cell can be programmed using a smaller P&V step size. Programming of cells with high accuracy reduces the reading latency of these cells, as it relaxes the requirements from processes such as ECC decoding, threshold setting and interference cancellation.
[0109] Although the embodiments described herein mainly address storing data in 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. For example, the methods and systems described herein can be used in a system for accelerating file retrieval from HDDs. In such a configuration, data is stored in a system that combines a HDD (used as higher-latency memory) and a non-volatile memory device (used as lower-latency memory. Such a system would store a first part of each data item in the non-volatile memory, and a second part of the data item in the HDD. Thus, the data item can be rapidly retrieved by first reading the first part from the non-volatile memory, and reading the second part from the HDD in parallel to outputting the first part.
[0110] In some embodiments, such as in the HDD acceleration system described above, the entire data item may be stored in the higher-latency memory, in addition to storing the first part of the data item in the lower-latency memory.
[0111] 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 data storage, comprising:
providing a memory, which comprises first memory cells having a first reading latency and second memory cells having a second reading latency that is higher than the first reading latency;
dividing an item of data intended for storage in the memory into first and second parts;
storing the first part in the first memory cells and the second part in the second memory cells; and
in response to a request to retrieve the item of data from the memory, reading the first part from the first memory cells and outputting the read first part, reading the second part from the second memory cells, and outputting the read second part subsequently to outputting the first part.
2. The method according to claim 1, wherein reading the second part comprises reading the second part concurrently with outputting the first part.
3. The method according to claim 1, wherein the first and second memory cells are formed using respective, different first and second memory device technologies.
4. The method according to claim 3, wherein the first memory cells comprise NOR Flash cells and wherein the second memory cells comprise NAND Flash cells.
5. The method according to claim 1, wherein the memory comprises an array of analog memory cells, and wherein the first and second memory cells comprise respective first and second groups of the memory cells in the array.
6. The method according to claim 1, wherein storing the first part comprises programming the first memory cells using a first number of nominal analog values to assume a respective first number of possible memory states, and wherein storing the second part comprises programming the second memory cells using a second number of the nominal analog values, which is greater than the first number, to assume a respective second number of the memory states.
7. The method according to claim 6, wherein the first memory cells comprise Single-Level Cells (SLC), and wherein the second memory cells comprise Multi-Level Cells (MLC).
8. The method according to claim 6, wherein the first number of the nominal analog values comprises four, and the second number of the nominal analog values comprises eight.
9. The method according to claim 6, wherein reading the first part comprises comparing first analog values stored in the first memory cells to a first set of reading thresholds, wherein reading the second part comprises comparing second analog values stored in the second memory cells to a second set of the reading thresholds, and comprising adjusting the second set of the reading thresholds responsively to the read first part.
10. The method according to claim 9, wherein storing the first part comprises encoding the first part using an Error Correction Code (ECC), wherein reading the first part comprises decoding the ECC, and wherein adjusting the second set of the reading thresholds comprises detecting errors in the read first part that were corrected by the ECC and adjusting the second set responsively to the detected corrected errors.
11. The method according to claim 1, wherein the first memory cells comprise Random Access Memory (RAM) cells.
12. The method according to claim 1, wherein the item of data comprises user data of a given type, and wherein dividing the item of the data comprises dividing the user data of the given type such that each of the first and second parts comprises a portion of the user data.
13. The method according to claim 1, wherein the first and second memory cells are arranged in respective first and second sets of memory pages, wherein dividing the item of the data comprises dividing the item into multiple fragments, assigning a number of the fragments to the first part and a remaining number of the fragments to the second part, and wherein storing the first and second parts comprises storing the number of the fragments in a subset of the first set of the memory pages and storing the remaining number of the fragments in a subset of the second set of the memory pages.
14. The method according to claim 1, wherein storing the first and second parts comprise encoding the first part of the item using a first Error Correction Code (ECC) scheme having a first decoding latency, and encoding the second part of the item using a second ECC scheme having a second decoding latency, which is greater than the first decoding latency.
15. The method according to claim 14, wherein encoding the first part comprises applying a first ECC, and wherein encoding the second part comprises applying a second ECC that is different from the first ECC.
16. The method according to claim 14, wherein the first ECC scheme has a first ECC block size, and wherein the second ECC scheme has a second ECC block size that is larger that the first block size.
17. The method according to claim 14, wherein storing the first part comprises selecting the first memory cells responsively to a level of distortion in the cells.
18. The method according to claim 17, wherein selecting the first memory cells comprises selecting the cells based on a number of previous programming and erasures cycles of the cells.
19. Apparatus for data storage, comprising:
a memory, which comprises first memory cells having a first reading latency and second memory cells having a second reading latency that is higher than the first reading latency; and
a processor, which is coupled to divide an item of data intended for storage in the memory into first and second parts, to store the first part in the first memory cells and the second part in the second memory cells, and, in response to a request to retrieve the item of data from the memory, to read the first part from the first memory cells and output the read first part, to read the second part from the second memory cells, and to output the read second part subsequently to outputting the first part.
20. The apparatus according to claim 19, wherein the processor is coupled to read the second part concurrently with outputting the first part.
21. The apparatus according to claim 19, wherein the first and second memory cells are formed using respective, different first and second memory device technologies.
22. The apparatus according to claim 21, wherein the first memory cells comprise NOR Flash cells and wherein the second memory cells comprise NAND Flash cells.
23. The apparatus according to claim 19, wherein the memory comprises an array of analog memory cells, and wherein the first and second memory cells comprise respective first and second groups of the memory cells in the array.
24. The apparatus according to claim 19, wherein the processor is coupled to program the first memory cells using a first number of nominal analog values to assume a respective first number of possible memory states, and to program the second memory cells using a second number of the nominal analog values, which is greater than the first number, to assume a respective second number of the memory states.
25. The apparatus according to claim 24, wherein the first memory cells comprise Single-Level Cells (SLC), and wherein the second memory cells comprise Multi-Level Cells (MLC).
26. The apparatus according to claim 24, wherein the first number of the nominal analog values comprises four, and the second number of the nominal analog values comprises eight.
27. The apparatus according to claim 24, wherein the processor is coupled to read the first part by comparing first analog values stored in the first memory cells to a first set of reading thresholds, to read the second part by comparing second analog values stored in the second memory cells to a second set of the reading thresholds, and to adjust the second set of the reading thresholds responsively to the read first part.
28. The apparatus according to claim 27, wherein the processor is coupled to encode the first part using an Error Correction Code (ECC) when storing the first part, to decode the ECC when reading the first part, to detect errors in the read first part that were corrected by the ECC, and to adjust the second set responsively to the detected corrected errors.
29. The apparatus according to claim 19, wherein the first memory cells comprise Random Access Memory (RAM) cells.
30. The apparatus according to claim 19, wherein the item of data comprises user data of a given type, and wherein the processor is coupled to divide the user data of the given type such that each of the first and second parts comprises a portion of the user data.
31. The apparatus according to claim 19, wherein the first and second memory cells are arranged in respective first and second sets of memory pages, and wherein the processor is coupled to divide the item into multiple, fragments, to assign a number of the fragments to the first part and a remaining number of the fragments to the second part, to store the number of the fragments in a subset of the first set of the memory pages and to store the remaining number of the fragments in a subset of the second set of the memory pages.
32. The apparatus according to claim 19, wherein the processor is coupled to encode the first part of the item using a first Error Correction Code (ECC) scheme having a first decoding latency, and to encode the second part of the item using a second ECC scheme having a second decoding latency, which is greater than the first decoding latency.
33. The apparatus according to claim 32, wherein the processor is coupled to encode the first part with a first ECC, and to encode the second part with a second ECC that is different from the first ECC.
34. The apparatus according to claim 32, wherein the first ECC scheme has a first ECC block size, and wherein the second ECC scheme has a second ECC block size that is larger that the first block size.
35. The apparatus according to claim 32, wherein the processor is coupled to select the first memory cells responsively to a level of distortion in the cells.
36. The apparatus according to claim 35, wherein the processor is coupled to select the cells based on a number of previous programming and erasures cycles of the cells.
37. Apparatus for data storage, comprising:
an interface, which is coupled to communicate with a memory that includes first memory cells having a first reading latency and second memory cells having a second reading latency that is higher than the first reading latency; and
a processor, which is coupled to divide an item of data intended for storage in the memory into first and second parts, to store the first part in the first memory cells and the second part in the second memory cells, and, in response to a request to retrieve the item of data from the memory, to read the first part from the first memory cells and output the read first part, to read the second part from the second memory cells, and to output the read second part subsequently to outputting the first part.
38. A method for operating a memory that includes a plurality of analog memory cells, comprising:
storing first data in a first group of the analog memory cells by programming the cells of the first group using a first number of nominal analog values to assume a respective first number of possible memory states;
storing second data in a second group of the analog memory cells by programming the cells of the second group using a second number of the nominal analog values to assume a respective second number of the possible memory states, which is greater than the first number;
reading the first data by comparing first analog values stored in the cells of the first group to a first set of reading thresholds;
reading the second data by comparing second analog values stored in the cells of the second group to a second set of the reading thresholds; and
adjusting the second set of the reading thresholds responsively to the read first part.
39. The method according to claim 38, wherein storing the first data comprises encoding the first data using an Error Correction Code (ECC), wherein reading the first data comprises decoding the ECC, and wherein adjusting the second set of the reading thresholds comprises detecting errors in the read first data that were corrected by the ECC and adjusting the second set responsively to the detected corrected errors.
40. A method for data storage, comprising:
providing a memory comprising a plurality of memory cells, wherein each memory cell stores at least first and second bits, such that the first bits of the memory cells have a first reading latency and the second bits of the memory cells have a second reading latency, which is higher than the first reading latency;
dividing an item of data intended for storage in the memory into first and second parts;
storing the first part in the first bits and the second part in the second bits of the memory cells; and
in response to a request to retrieve the item of data from the memory, reading the first part from the first bits and outputting the read first part, reading the second part from the second bits, and outputting the read second part subsequently to outputting the first part.
Patent Citations (302)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4556961(A) | 1985-12-01 | Iwahashi et al. | Applicant |
| US4558431(A) | 1985-12-01 | Satoh | 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 |
| US5056089(A) | 1991-10-01 | Furuta et al. | Applicant |
| US5172338(A) | 1992-12-01 | Mehrotta et al. | 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 |
| US5388064(A) | 1995-02-01 | Khan | 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 |
| 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 |
| US5696717(A) | 1997-12-01 | Koh | Applicant |
| US5726649(A) | 1998-03-01 | Tamaru et al. | Applicant |
| US5751637(A) | 1998-05-01 | Chen 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 |
| 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 |
| US5942004(A) | 1999-08-01 | Cappelletti | Applicant |
| US5991517(A) | 1999-11-01 | Harari et al. | Applicant |
| US6009014(A) | 1999-12-01 | Hollmer et al. | Applicant |
| US6034891(A) | 2000-03-01 | Norman | 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 |
| US6166962(A) | 2000-12-01 | Chen 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 |
| 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 |
| US6363008(B1) | 2002-03-01 | Wong | Applicant |
| US6363454(B1) | 2002-03-01 | Lakhani 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 |
| 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 |
| 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 | Examiner |
| US6621739(B2) | 2003-09-01 | Gonzales et al. | Applicant |
| US6643169(B2) | 2003-11-01 | Rudelic et al. | Applicant |
| US6678192(B2) | 2004-01-01 | Gongwer et al. | 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 |
| US6781877(B2) | 2004-08-01 | Cernea et al. | Applicant |
| US6807095(B2) | 2004-10-01 | Chen 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 |
| US6963505(B2) | 2005-11-01 | Cohen | 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 | Gonzales 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 |
| US7054193(B1) | 2006-05-01 | Wong | 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 |
| 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 |
| 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 | Gonzales et al. | Applicant |
| US7177199(B2) | 2007-02-01 | Chen et al. | Applicant |
| US7177200(B2) | 2007-02-01 | Ronen et al. | Applicant |
| US7187195(B2) | 2007-03-01 | Kim | Applicant |
| US7187592(B2) | 2007-03-01 | Guterman et al. | 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 |
| 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 | Tanzana | Applicant |
| US7280398(B1) | 2007-10-01 | Lee et al. | Applicant |
| US7289344(B2) | 2007-10-01 | Chen | Applicant |
| US7301807(B2) | 2007-11-01 | Khalid 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 |
| 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 |
| US7397697(B2) | 2008-07-01 | So et al. | Applicant |
| US7408804(B2) | 2008-08-01 | Hemink et al. | Applicant |
| US7420847(B2) | 2008-09-01 | Li | Applicant |
| US7433231(B2) | 2008-10-01 | Aritome | Applicant |
| US7437498(B2) | 2008-10-01 | Ronen | Applicant |
| US7441067(B2) | 2008-10-01 | Gorobetz et al. | Applicant |
| US7453737(B2) | 2008-11-01 | Ha | Applicant |
| US7468911(B2) | 2008-12-01 | Lutze et al. | Applicant |
| US7471581(B2) | 2008-12-01 | Tran et al. | Applicant |
| US7508710(B2) | 2009-03-01 | Mokhlesi | Applicant |
| US2001/0006479(A1) | 2001-07-01 | Ikehashi et al. | 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 | Tran | Applicant |
| US2003/0189856(A1) | 2003-10-01 | Cho et al. | Applicant |
| US2003/0231183(A1) | 2003-12-01 | Ning et al. | Examiner |
| 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/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/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. | Examiner |
| 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/0203546(A1) | 2006-09-01 | Lasser | Applicant |
| US2006/0218359(A1) | 2006-09-01 | Sanders et al. | Applicant |
| US2006/0221705(A1) | 2006-10-01 | Hemink 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 | Examiner |
| 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/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/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/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. | Examiner |
| US2007/0280000(A1) | 2007-12-01 | Fujiu et al. | 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/0055993(A1) | 2008-03-01 | Lee | Applicant |
| US2008/0080243(A1) | 2008-04-01 | Edahiro et al. | Applicant |
| US2008/0104309(A1) | 2008-05-01 | Cheon et al. | 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/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/0209304(A1) | 2008-08-01 | Winarski et al. | Applicant |
| US2008/0219050(A1) | 2008-09-01 | Shalvi 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/0024905(A1) | 2009-01-01 | Shalvi et al. | 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/0089484(A1) | 2009-04-01 | Chu | Applicant |
| US2009/0091979(A1) | 2009-04-01 | Shalvi | Applicant |
| US2009/0106485(A1) | 2009-04-01 | Anholt | Examiner |
| US2009/0144600(A1) | 2009-06-01 | Perlmutter 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 | |
| WO2007046084(A2) | 2007-04-01 | Applicant | |
| WO2007132452(A2) | 2007-11-01 | Applicant | |
| WO2007132453(A2) | 2007-11-01 | Applicant | |
| WO2007132456(A2) | 2007-11-01 | Applicant | |
| WO2007132457(A2) | 2007-11-01 | Applicant | |
| WO2007132458(A2) | 2007-11-01 | Applicant | |
| WO2007146010(A2) | 2007-12-01 | Applicant | |
| WO2008026203(A2) | 2008-03-01 | Applicant | |
| WO2008053472 | 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 | |
| WO2008111058(A2) | 2008-09-01 | Applicant | |
| WO2008124760(A2) | 2008-10-01 | Applicant | |
| WO2008139441(A2) | 2008-11-01 | Applicant | |
| WO2009037691(A2) | 2009-03-01 | Applicant | |
| WO2009050703(A2) | 2009-04-01 | Applicant |
Non-Patent Literature (64)
- US 7,161,836, 01/2007, Wan et al. (withdrawn)Applicant
- Agrell et al., “Closest Point Search in Lattices”, IEEE Transactions on Information Theory, vol. 48, No. 8, pp. 2201-2214, Aug. 2002.Applicant
- Bez et al., “Introduction to Flash memory”, Proceedings of the IEEE, vol. 91, No. 4, pp. 489-502, Apr. 2003.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
- Eitan et al., “Can NROM, a 2-bit, Trapping Storage NVM Cell, Give a Real Challenge to Floating Gate Cells?”, Proceedings of the 1999 International Conference on Solid State Devices and Materials (SSDM), pp. 522-524, Tokyo, Japan 1999.Applicant
- Eitan et al., “Multilevel Flash Cells and their Trade-Offs”, Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), pp. 169-172, New York, USA 1996.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
- Jung et al., in “A 117 mm.sup.2 3.3V Only 128 Mb Multilevel NAND Flash Memory for Mass Storage Applications,” IEEE Journal of Solid State Circuits, (11:31), Nov. 1996, pp. 1575-1583.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
- Kim et al., “Future Memory Technology including Emerging New Memories”, Proceedings of the 24th International Conference on Microelectronics (MIEL), vol. 1, pp. 377-384, Nis, Serbia and Montenegro, May 16-19, 2004.Applicant
- Lee et al., “Effects of Floating Gate Interference on NAND Flash Memory Cell Operation”, IEEE Electron Device Letters, vol. 23, No. 5, pp. 264-266, May 2002.Applicant
- Maayan et al., “A 512 Mb NROM Flash Data Storage Memory with 8 MB/s Data Rate”, Proceedings of the 2002 IEEE International Solid-State circuits Conference (ISSCC 2002), pp. 100-101, San Francisco, USA, Feb. 3-7, 2002.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
- Takeuchi et al., “A Double Level VTH Select Gate Array Architecture for Multi-Level NAND Flash Memories”, Digest of Technical Papers, 1995 Symposium on VLSI Circuits, pp. 69-70, Jun. 8-10, 1995.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
- International Application PCT/IL2008/001446 “Optimized selection of memory chips in multi-chip memory devices” filed on Nov. 4, 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
- Kasorla et al, U.S. Appl. No. 12/332,370 “Efficient Data Storage in Multi-Plane Memory Devices” filed on Dec. 11, 2008.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
- Golov et al., U.S. Appl. No. 12/344,233 “Wear Level Estimation in Analog Memory Cells” filed on Dec. 25, 2008.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
- Perlmutter et al, U.S. Appl. No. 12/332,368 “Efficient Interference Cancellation in Analog Memory Cell Arrays” filed on Dec. 11, 2008.Applicant