Efficient readout schemes for analog memory cell devices using multiple read threshold sets

Information

  • Patent Grant
  • 8174857
  • Patent Number
    8,174,857
  • Date Filed
    Wednesday, December 30, 2009
    15 years ago
  • Date Issued
    Tuesday, May 8, 2012
    12 years ago
Abstract
A method for data readout includes storing two or more candidate sets of read thresholds for reading from a memory device that includes a plurality of analog memory cells. A group of the memory cells from which data is to be read is identified. An order is defined among the candidate sets of the read thresholds responsively to a criterion defined over the group of the memory cells. Data readout from the group of the memory cells is attempted by iterating over the candidate sets according to the order, until the data is read successfully.
Description
FIELD OF THE INVENTION

The present invention relates generally to memory devices, and particularly to methods and systems for reading data from analog memory cells.


BACKGROUND OF THE INVENTION

Several types of memory devices, such as Flash memories, use arrays of analog memory cells for storing data. Each analog memory cell stores a quantity of an analog value, also referred to as a storage value, such as an electrical charge or voltage. This analog value represents the information stored in the cell. In Flash memories, for example, each analog memory cell holds a certain amount of electrical charge. The range of possible analog values is typically divided into intervals, each interval corresponding to one or more data bit values. Data is written to an analog memory cell by writing a nominal analog value that corresponds to the desired bit or bits.


Some memory devices, commonly referred to as Single-Level Cell (SLC) devices, store a single bit of information in each memory cell, i.e., each memory cell can be programmed to assume either of two possible programming levels. Higher-density devices, often referred to as Multi-Level Cell (MLC) devices, store two or more bits per memory cell, i.e., can be programmed to assume more than two possible programming levels.


SUMMARY OF THE INVENTION

An embodiment of the present invention provides a method for data readout, including:


storing two or more candidate sets of read thresholds for reading from a memory device that includes a plurality of analog memory cells;


identifying a group of the memory cells from which data is to be read;


defining an order among the candidate sets of the read thresholds responsively to a criterion defined over the group of the memory cells; and


attempting to read data from the group of the memory cells by iterating over the candidate sets according to the order, until the data is read successfully.


In some embodiments, defining the order includes causing a first candidate set, which has a first likelihood of reading the data successfully, to appear in the order before a second candidate set, which has a second likelihood, smaller than the first likelihood, of reading the data successfully. In an embodiment, the candidate sets include at least first and second candidate sets defined respectively for first and second life-cycle stages of the memory cells, and the criterion is defined over a current life-cycle stage of the group of the memory cells. In a disclosed embodiment, the candidate sets include at least first and second candidate sets defined respectively for first and second temperatures of the memory cells, and the criterion is defined over a current temperature of the group of the memory cells.


In another embodiment, the candidate sets include at least first and second candidate sets defined respectively for first and second levels of interference affecting the memory cells, and the criterion is defined over a current interference level affecting the group of the memory cells. In yet another embodiment, the candidate sets include at least first and second candidate sets defined respectively for first and second locations of the memory cells in the memory device, and the criterion is defined over a location of the group of the memory cells in the memory device. In some embodiments, the method includes recording in a data structure an identity of a successful candidate set using which the data was read successfully from the group, and, when preparing to perform subsequent readout from the group, defining the order for performing the subsequent readout responsively to the successful candidate set recorded in the data structure.


There is additionally provided, in accordance with an embodiment of the present invention, a data storage apparatus, including:


a plurality of analog memory cells; and


circuitry, which is configured to store two or more candidate sets of read thresholds for reading from the analog memory cells, to identify a group of the memory cells from which data is to be read, to define an order among the candidate sets of the read thresholds responsively to a criterion defined over the group of the memory cells, and to attempt to read data from the group of the memory cells by iterating over the candidate sets according to the order, until the data is read successfully.


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





BRIEF DESCRIPTION OF THE DRAWINGS


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



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



FIGS. 3-6 are flow charts that schematically illustrate methods for reading data from analog memory cells, in accordance with embodiments of the present invention.





DETAILED DESCRIPTION OF EMBODIMENTS
Overview

Embodiments of the present invention that are described hereinbelow provide improved methods and systems for data readout from analog memory cells. In some embodiments, a memory system comprises a memory controller and a memory device that includes multiple analog memory cells. The controller and the memory device support an interface, over which the controller notifies the memory device of the programming status of certain groups of memory cells. For example, when the memory cells are arranged in word lines, each word line storing multiple memory pages, the programming status of a given word line can indicate which memory pages are actually programmed in this word line. When reading a requested memory page from a group of memory cells, the memory device selects an appropriate reading configuration based on the programming status reported by the controller.


In some embodiments, the controller indicates to the memory device the programming status of the same group of memory cells (e.g., word line) from which the requested page is to be read. This technique reduces the readout time, because the memory device does not need to determine the programming status by reading the memory cells. The memory device may modify various properties of the readout process, such as the positions of read thresholds, based on the reported programming status.


In another disclosed method, when intending to read a memory page from a given group of memory cells, the controller indicates to the memory device the programming status of one or more neighboring cell groups (e.g., neighboring word lines). The memory device then selects the reading configuration based on the programming status of the neighboring cell groups. In alternative embodiments, the memory device reads the programming status directly from the neighboring cell groups, irrespective of reports from the controller.


The programming status of a neighboring cell group is important in the readout process because it is often indicative of the level of interference that is potentially caused by this neighboring cell group. The memory device can match the reading configuration to this expected interference, for example by selecting appropriate read thresholds and/or selectively activating an interference cancellation process. As a result, reading performance is improved. Moreover, the computational complexity and latency associated with interference cancellation can be reduced, because interference cancellation is invoked only when strong interference is likely to be present.


In some embodiments, the memory system stores multiple sets of candidate read thresholds for reading the analog memory cells. Each candidate set of read thresholds is best suited for readout under certain circumstances (e.g., start-of-life of the memory cells, end-of-life of the memory cells, low temperature, high temperature, strong interference or weak interference). When intending to read a group of memory cells, the system evaluates a predefined criterion with respect to this cell group, and then defines an order among the candidate sets of read thresholds based on the criterion. Typically, the criterion is defined so that candidate sets that are most likely to enable successful readout appear early in the order. The system attempts to read the memory cells by iterating over the candidate sets according to the above-defined order. Since the order is defined so as to match the current circumstances of the cell group in question, readout is likely to succeed after a small number of attempts. As a result, the average number of read operations and the average reading time are reduced.


System Description


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


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


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


System 20 stores data in the analog memory cells by programming the cells to assume respective memory states, which are also referred to as programming levels. The programming levels are selected from a finite set of possible levels, and each level corresponds to a certain nominal storage value. For example, a 2 bit/cell MLC can be programmed to assume one of four possible programming levels by writing one of four possible nominal storage values into the cell.


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


The storage and retrieval of data in and out of memory device 24 is performed by a Memory Signal Processor (MSP) 40. MSP 40 comprises an interface 44 for communicating with memory device 24, and a signal processing unit 48, which processes the data that is written into and read from device 24. In some embodiments, unit 48 produces the storage values for storing in the memory cells and provides these values to R/W unit 36. Alternatively, unit 48 provides the data for storage, and the conversion to storage values is carried out by the R/W unit internally to the memory device. Alternatively to using an MSP, the methods described herein can be carried out by any suitable type of memory controller. In some embodiments, unit 48 encodes the data for storage with an Error Correction Code (ECC), and decodes the ECC of data that is read from memory.


MSP 40 communicates with a host 52, for accepting data for storage in the memory device and for outputting data retrieved from the memory device. MSP 40, and in particular unit 48, may be implemented in hardware. Alternatively, MSP 40 may comprise a microprocessor that runs suitable software, or a combination of hardware and software elements.


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


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


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


In an example configuration of array 28, memory cells 32 are arranged in multiple rows and columns, and each memory cell comprises a floating-gate transistor. The gates of the transistors in each row are connected by word lines, and the sources of the transistors in each column are connected by bit lines. The memory array is typically divided into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously.


Pages are sometimes sub-divided into sectors. In some embodiments, each page occupies an entire row of the array, i.e., an entire word line. For two-bit-per-cell devices, for example, each word line stores two pages. In alternative embodiments, each row (word line) can be divided into two or more pages. For example, in some devices each row is divided into two pages, one comprising the odd-order cells and the other comprising the even-order cells. In an example implementation, a two-bit-per-cell memory device may have four pages per row, a three-bit-per-cell memory device may have six pages per row, and a four-bit-per-cell memory device may have eight pages per row.


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



FIG. 2 is a graph showing threshold voltage distribution in a group of analog memory cells 32 of memory device 24, in accordance with an embodiment of the present invention. In the present example, the memory cells comprise eight-level MLC, each storing three bits. Each memory cell is programmed to one of eight predefined programming states denoted S1 . . . S8, with each programming state representing a respective combination of three bits. Each programming state corresponds to a certain interval on the threshold voltage (VTH) axis.


The memory cells that are programmed to the different memory states have threshold voltages that are statistically distributed in accordance with distributions 60. The three bits stored in a given memory cell are referred to herein as a Least Significant Bit (LSB), a Center Significant Bit (CSB) and a Most Significant Bit (MSB). For example, the memory cells that are programmed with “001” (LSB=″0″, CSB=″0″, MSB=″1″) are associated with programming state S5. The terms LSB, CSB and MSB are used only as a reference to specific MLC bits within the memory cell, and do not imply that certain bits are more important than others. Any other suitable terminology can also be used.


R/W unit 36 typically reads data from a group of memory cells by comparing their threshold voltages to one or more read thresholds, in order to identify the programming state of each read memory cell. The read thresholds are typically positioned in boundary regions between adjacent programming states, in order to differentiate between the threshold voltage intervals of different programming states. In the example of FIG. 2, the R/W unit can read the three bits from a group of memory cells by comparing their threshold voltages to seven read thresholds 64.


In many practical scenarios, the shapes and positions of distributions 60 often vary with time, for example because of electrical charge leakage and other impairments. Distributions 60 may also vary with operating conditions, such as temperature. Therefore, R/W unit 36 sometimes modifies the positions of the read thresholds in order to track the current positions of the threshold voltage distributions and maintain low read error probability. The R/W unit may use any suitable method for adaptively modifying the read threshold positions. Example methods are described in PCT International Publications WO 2007/132457, WO 2008/053472 and WO 2008/111058, whose disclosures are incorporated herein by reference.


In a typical implementation, different MLC bits in a given group of memory cells correspond to different memory pages. For example, a group of eight-level memory cells can be used for storing three memory pages, one page in the cell LSBs, another page in the CSBs, and a third page in the MSBs of the cells. These memory pages are referred to herein as an LSB page, CSB page and MSB page, respectively. Similarly, a group of four-level memory cells can be used for storing two memory pages, one page in the cell LSBs and another page in the cell MSBs. generally, a group of N bits/cell memory cells is typically capable of storing N memory pages. Within a given group of memory cells, programming typically progresses from LSB to MSB.


In some cases, however, a given group of N bits/cell memory cells (e.g., a word line) can be programmed with less than N pages, either temporarily or permanently. Such a group of memory cells is referred to herein as partially programmed. A group of N bits/cell memory cells in which all N pages are programmed is referred to herein as fully programmed. For example, a group of 3 bits/cell memory cell can be partially programmed with only the LSB page or with only the LSB and CSB pages.


When a group of memory cells is programmed with only the LSB page, the threshold voltages of these memory cells populate only two programming states. When a group of memory cells is programmed with only the LSB and CSB pages, the threshold voltages of the memory cells populate four programming states. The positions of the programming states in a partially-programmed group of memory cells are not necessarily a subset of the full set of programming states. The shape (e.g., variance) of the threshold voltage distributions may also differ depending on whether the group of cells is fully programmed or partially programmed. Typically, the threshold voltages (e.g., the average or maximum threshold voltage) in a partially-programmed group of memory cells are considerably lower than those of a fully-programmed group of memory cells.


Typically, R/W unit 36 programs and reads memory pages from groups of memory cells using a predefined set of read and write commands. Typically, a different read command is defined for reading each page type (e.g., an LSB read command, a CSB read command and an MSB read command), since the R/W unit performs different operation sequences when reading different types of pages. Similarly, a different write command is defined for programming each page type (e.g., an LSB write command, a CSB write command and an MSB write command).


Typically, each type of read command uses a certain subset of the read thresholds for reading the appropriate page type. In the configuration of FIG. 2, for example, the LSB read command uses a single read threshold positioned between programming states S4 and S5. The CSB read command uses two read thresholds, which are positioned between programming states S2 and S3 and between programming states S6 and S7. The MSB read command uses four read thresholds, which are positioned between programming states S1 and S2, between programming states S3 and S4, between programming states S5 and S6 and between programming states S6 and S7.


Efficient Controller-Assisted Readout

As explained above, the shapes and positions of the threshold voltage distributions that correspond to a given page type may vary depending on whether the memory cells are partially programmed or fully programmed. Therefore, when reading a given page from a given group of cells, R/W unit 36 may select the reading configuration for reading the page depending on the programming status of the group of cells. In particular, the R/W unit may select the reading configuration depending on which pages are programmed in that group. For example, when reading the CSB page from a certain group of cells, the R/W unit may select a certain reading configuration if all three pages (LSB, CSB and MSB) have been programmed, and a different reading configuration if only the LSB and CSB have been programmed.


The R/W unit may vary the reading configuration by varying any suitable attribute of the read commands based on the programming status of the cell group. In some embodiments, the R/W unit may vary the positions of the read thresholds depending on which pages have been programmed. For example, the R/W unit may execute a CSB read command with a certain set of read thresholds when all three pages (LSB, CSB and MSB) are programmed, and a different set of read thresholds when only the LSB and CSB are programmed. As another example, the R/W unit may modify the readout integration time (i.e., the time duration over which the bit line currents or voltages are sensed and integrated) based on the programming status of the cell group. Certain aspects of the integration time used for reading analog memory cells are also addressed in PCT International Publication WO 2008/053473, whose disclosure is incorporated herein by reference.


In some embodiments, the reading configuration is modified by the MSP, either in addition to or instead of modifying the reading configuration by the R/W unit. For example, in many practical cases, a page that belongs to a partially-programmed word line is likely to have fewer errors than a page that belongs to a fully-programmed word line. In some embodiments, the MSP modifies the ECC decoding scheme for decoding the ECC of a given page, based on the programming status of the word line to which the page belongs. For example, the MSP may apply a simpler ECC decoding scheme (e.g., a scheme that is capable of correcting fewer errors and has a shorter decoding time) for decoding a page that belongs to a partially-programmed word line, and a more complex ECC decoding scheme for decoding a page that is part of a fully-programmed word line. Using this technique, the ECC decoding time and the power consumption of the ECC decoder can be reduced. Additionally or alternatively, the R/W unit may select the reading configuration in any other suitable manner, depending on which pages are actually programmed in the memory cell group in question.


In some embodiments, memory device 24 receives an indication of the programming status of the cell group from MSP 40. The MSP typically keeps record of the programming status of the different cell groups (e.g., which pages have already been programmed in each word line), and can therefore provide this information to the memory device.


In these embodiments, the MSP and the memory device support an interface (e.g., a command interface or signal interface) that enables this sort of notification. In some embodiments, the MSP indicates the programming status of the cell group as part of the read command it sends to the memory device. For example, a command interface between the MSP and the memory device may support a read command that specifies (1) the word line to be read, (2) the page type (e.g., LSB, CSB or MSB page) to be read from this word line, and (3) the programming status of this word line (e.g., which of the LSB, CSB and MSB pages are programmed). Alternatively, the MSP may indicate the programming status of the cell group to the memory device in a separate command, or using any other suitable mechanism.


In some memory devices, the programming status of each word line is stored in one or more status flags in the memory cells of the word line. It is possible in principle for the R/W unit to read these status flags and set the reading configuration accordingly. This scheme, however, involves reading additional memory cells before setting the reading configuration, and therefore increases the overall sense time. By using the disclosed method that reports the programming status from the MSP, the memory device can avoid reading this information from the memory device, and thus reduce the overall sense time. In an example Flash memory device, the reduction in sense time is on the order of 25 μS.



FIG. 3 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. The method begins with MSP 40 receiving from host 52 a request to retrieve certain data, at a host requesting step 70. The requested data is assumed to be stored in one or more memory pages in memory device 24.


The MSP sends to memory device 24 (using unit 48 via interface 44) a read command for retrieving one of the requested pages, at a read requesting step 74. The MSP also notifies the memory device of the programming status of the word line of the requested page. In particular, the programming status indicates which pages in this word line are programmed. The programming status notification may be part of the read command or it may be provided to the memory device separately.


R/W unit 36 in memory device 24 selects and sets the reading configuration for reading the requested page based on the reported programming status, at a reading setup step 78. For example, the R/W unit may select and set the read thresholds for reading the requested page based on the programming status indicated by the MSP. The R/W unit then reads the requested page using the selected reading configuration, at a reading step 82. The read page is provided to the MSP. When the data requested by the host spans multiple pages, the process of steps 74-82 is typically repeated for each page. The MSP sends the read data to the host.


Consider, for example, a 2 bits/cell memory device, which stores two pages in each word line. In some embodiments, this memory device can be optimized to have minimal read latency in reading the fully-programmed word lines, or in reading the partially-programmed word lines. When the memory device is optimized for short reading latency in reading the fully-programmed word lines, the latency in reading the partially-programmed word lines will typically be increased, and vice versa. In many practical implementations, most of the word lines are fully programmed and only few word lines are partially programmed, so that optimization for short reading latency in reading the fully-programmed word lines may be preferred.


In some cases, however, there is a benefit in optimizing the device for minimal reading latency in reading partially-programmed word lines. For example, management data is sometimes stored in MLC devices using only the LSB pages (while refraining from programming the respective MSB pages of these word lines) so as to achieve higher storage reliability. When using this technique, a large number of word lines may be partially programmed, so that optimization for short reading latency in reading the partially-programmed word lines may be preferred. The method of FIG. 3 can be used with either kind of optimization. Similar considerations and optimizations can be applied in other kinds of MLC devices, such as when storing 2 bits/cell in a 3 bits/cell device.


In some embodiments, R/W unit 36 selects the reading configuration for reading a given page based on the programming status of one or more neighboring cell groups, e.g., neighboring word lines. (This scheme can be applied additionally or alternatively to setting the reading configuration based on the programming status of the cell group from which the requested page is read.) The programming status of a neighboring cell group affects the readout process from the given cell group because it is indicative of the level of interference that is potentially caused by this neighboring cell group.


Typically, the memory cells in a partially-programmed neighboring word line are expected to cause less interference to the given cell group in comparison with a fully-programmed neighboring word line, for several reasons. For example, the memory cells in a partially-programmed neighboring word line usually have relatively low threshold voltages, and are therefore expected to cause less interference. Moreover, some memory devices program each word line using an iterative Programming and Verification (P&V) process, and employ a page programming order that is optimized for interference. In such devices, when a word line is partially programmed, its interference to the previous word line is usually already cancelled by the P&V programming process of the previous word line.


In some embodiments, when intending to read a given page from a given cell group, the MSP notifies the memory device of the programming status of one or more neighboring cell groups (e.g., neighboring word lines). The memory device (and in particular R/W unit 36) selects the reading configuration for reading the given page based on the reported status of the neighboring cell groups. The MSP may send the programming status of the neighboring cell groups to the memory device as part of the read command, or separately. As explained above, the MSP and the memory device may support a command or signal interface for this purpose.


R/W unit 36 in memory device 24 may select and set the reading configuration based on the reported programming status of neighboring cell groups in any suitable manner. In some embodiments, the R/W unit may select the read thresholds for reading the given page based on the programming status of neighboring cell groups. For example, the R/W unit may select a set of read thresholds that is best suited for strong interference scenarios when the reported programming status indicates that neighboring cell groups are fully programmed. When the programming status indicates that neighboring cell groups are not programmed or only partially programmed, the R/W unit may select another set of read thresholds that is suitable for low interference scenarios.


As another example, the R/W unit may decide whether or not to apply an interference cancellation process to the read memory page, based on the programming status of neighboring cell groups. Applying interference cancellation typically involves reading one or more neighboring memory cell groups in order to assess the interference they cause. Having access to the programming status of neighboring cell groups enables the R/W unit to read a certain neighboring cell group selectively, e.g., only when the programming status indicates that this cell group is likely to cause strong interference.


For example, the R/W unit may read a certain neighboring cell group only, and apply interference cancellation using this neighboring cell group, only if the neighboring cell group is fully programmed or programmed with at least a certain number of pages. For example, in a 3 bits/cell device, the R/W unit may read and perform interference cancellation using a certain neighboring word line only if at least the LSB and CSB pages in that word line are programmed. If only the LSB is programmed, reading and interference cancellation may be skipped. Thus, by having the programming status of neighboring cell groups reported to the memory device, the R/W unit and/or the MSP may activate interference cancellation only when necessary. Therefore, the average number of read operations and/or the average number of computations is reduced.


As noted above, some memory devices store the programming status of each word line in one or more status flags in the memory cells of the word line. It is possible in principle for the R/W unit to read the status flags of the neighboring word lines and set the reading configuration from the given word line accordingly. This scheme, however, involves performing additional reading operations from the neighboring word lines, and therefore increases the overall reading time. By reporting the programming status of neighboring word lines from the MSP, the memory device can avoid reading this information from the neighboring lines, and thus reduce the overall sense time.


When carrying out the above-described method, any suitable interference cancellation method can be used. Example methods are described in PCT International Publications WO 2007/132453 and WO 2008/026203 and U.S. Patent Application Publication 2009/0158126, whose disclosures are incorporated herein by reference, and in PCT International Publication WO 2007/132457, cited above.


Additionally or alternatively, memory device 24 may select any other suitable property of the reading configuration based on the programming status of neighboring cell groups, using any other suitable criteria. In some embodiments, the criteria may attempt to minimize the average readout time, the maximum readout time, or both.



FIG. 4 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. The method begins with MSP 40 receiving from host 52 a request to retrieve certain data, at a data requesting step 90. The requested data is assumed to be stored in one or more memory pages in memory device 24. The MSP sends to memory device 24 (using unit 48 via interface 44) a read command for retrieving one of the requested pages, at a read command sending step 94. The MSP notifies the memory device of the programming status of one or more word lines that neighbor the word line of the requested page, at a neighbor status reporting step 98. The programming status typically indicates which pages in the neighboring word lines are programmed. As noted above, the programming status notification may be part of the read command or it may be provided to the memory device separately.


R/W unit 36 in memory device 24 selects and sets the reading configuration for reading the requested page based on the reported programming status of the neighboring word lines, at a reading selection step 102. The R/W unit then reads the requested page using the selected reading configuration, at a reading step 106. The read page is provided to the MSP. When the data requested by the host spans multiple pages, the process of steps 94-106 is typically repeated for each page. The MSP sends the retrieved data to the host.


In alternative embodiments, R/W unit 36 in memory device 24 obtains the programming status of the neighboring word lines by reading the status flags of these word lines, independently of the MSP. The R/W unit then selects the reading configuration based on the read programming status of the neighboring word lines.



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. The method begins with R/W unit 36 receiving a read command from MSP 40, at a read requesting step 110. The read command addresses a given page that is stored in a given word line. The R/W unit reads the status flags of one or more neighboring word lines, at a neighbor status reading step 114. Based on the read status flags, R/W unit 36 determines which pages in each neighboring word lines are programmed. Based on this information, the R/W unit selects the appropriate reading configuration, at a configuration selection step 118. The R/W unit then reads the given page from the given word line using the selected reading configuration, at a readout step 122. The read page is provided from the memory device to the MSP. When carrying out the method of FIG. 5, any of the selection criteria and reading configurations described with respect to FIG. 4 above can be used.


Adaptive Ordering of Read Threshold Sets

As explained above, the threshold voltage distributions in memory cells 32 may vary with time and/or operating conditions. The threshold voltage distributions may also differ among different cell groups in the memory device, such as between odd- and even-order cells in a word line, or between a word line at the edge of an erasure block and a word line at the interior of the block. Variations in the threshold voltage distributions may also occur as a result of interference or for any other reason. Because of these variations, in many cases a single set of read thresholds does not provide adequate reading performance under all circumstances.


In some embodiments, system 20 holds two or more candidate sets of read thresholds. Typically, each candidate set of read thresholds performs well under certain circumstances and may perform poorly under other circumstances. For example, system 20 may hold multiple candidate sets of read thresholds that match different stages in the life cycle of the memory device (e.g., a start-of-life set, a mid-life set and an end-of-life set). Additionally or alternatively, the system may hold candidate sets of read thresholds that are suitable for different temperatures, different levels of interference from neighboring cells, different locations in the memory array, and/or any other conditions. Some candidate sets may represent combinations of conditions, e.g., a candidate set that is best suited for end-of-life at high temperature.


In many cases, however, the number of candidate sets is large, and trying them sequentially in order to find the best-performing set for a given read operation increases the reading time considerably. Therefore, in some embodiments system 20 evaluates a criterion with respect to the memory cells in question, and then orders the candidate sets according to this criterion. The order is defined so that candidate sets that are more likely to provide good reading performance appear first. Ideally, the candidate sets are ordered in descending order of their likelihood to read the memory cells successfully.


When attempting to read the memory cells, system 20 iterates over the candidate sets, i.e., tries the candidate sets one by one, according to the above-described order. Since the candidate sets that are most likely to succeed are attempted first, the average number of attempts is considerably reduced because of the adaptive ordering. As a result, the average reading time is reduced.


System 20 may use various criteria for ordering the candidate sets of read thresholds when intending to read a given group of memory cells. The order may depend, for example, on the current wear level of the cell group in question (e.g., the number of programming and erasure cycles the cell group has gone through). In this example, if the cell group to be read is relatively aged, end-of-life candidate sets will appear early in the order, and vice versa. As another example, the order may depend on the current temperature of the memory device. In this example, if the memory device currently operates at high temperature, candidate sets suitable for high temperature will appear first in the order, and vice versa.


As yet another example, the order may depend on the location of the cell group in array 28. For example, if the cell group is located in the first or last word line of an erasure block, candidate set that are suitable for such locations will appear first. The order may alternatively depend on the level of interference inflicted on the cell group. If the cell group in question suffers from severe interference, candidate sets suitable for high interference will appear first, and vice versa. The level of interference can be assessed using various means. For example, the memory device may read the status flags of neighboring word lines in order to determine which pages in those word lines are already programmed. The programming status of neighboring word lines, as explained above, can be used as an indication of the interference level in the cell group. Alternatively, the programming status of neighboring word lies can be reported to the memory device by the MSP. Additionally or alternatively, the ordering of the candidate sets of read thresholds may depend on any other suitable criterion defined with respect to the cell group to be read.



FIG. 6 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. The method begins with system 20 storing multiple candidate sets of read thresholds, at a candidate storage step 130. When intending to read certain data, system 20 identifies a given group of memory cells from which the data is to be read. The system then evaluates a criterion that is defined with respect to the memory cells in this group, at a criterion evaluation step 134. The system may evaluate any of the criteria described above, or any other suitable criterion. System 20 arranges the candidate sets of read thresholds in a certain order, based on the evaluated criterion, at an ordering step 138.


System 20 starts with the first candidate set in the order. R/W unit 36 sets this threshold set and attempts to read the memory cells in the group, at a readout attempting step 142. The system checks whether the readout attempt was successful, at a success checking step 146. In some embodiments, the stored data is encoded with an Error Correction Code (ECC) or Error Detection Code (EDC), and the system decodes the ECC or EDC when reading the data. If the ECC or EDC is decoded without errors, the readout attempt is regarded as successful. If the readout attempt is successful, system 20 outputs the read data, at a success termination step 150, and the method terminates.


If, on the other hand, the readout attempt failed, system 20 checks whether all candidate sets in the order were already attempted, at a set checking step 154. If all candidate sets have been attempted without success, the system reports failure, at a failure termination step 158, and the method terminates. If not all candidate sets have been attempted, system 20 selects and sets the next candidate set according to the order, at a set incrementing step 162. The method then loops back to step 142 above, in which the system attempts to read the data using the next candidate set of read thresholds.


The method of FIG. 6 can be carried out by MSP 40, by R/W unit 36, or jointly by the MSP and the R/W unit. For example, the MSP may define the order of candidate sets, and send the desired order to the memory device as part of the read command. In this example, the memory device may attempt readout according to the order sent by the MSP, and return the read results once the readout is successful. (The memory device may use any suitable internal indications for successful readout, such as the number of “1” and/or “0” values in the read page.) In alternative embodiments, any other suitable partitioning of functions between the MSP and the memory device can be defined.


In some embodiments, MSP 40 and/or R/W unit 36 may record the set of read thresholds for which readout was successful, for future use. The MSP and/or R/W unit may attempt this read threshold set first when performing subsequent read operations from the cell group in question. Since this read threshold set was provided successful readout in a certain read operation from the cell group, it is likely to be successful in the next readout operation from this cell group. In alternative embodiments, the MSP and/or R/W unit may consider this read threshold set in any other way when defining the order for performing subsequent read operations from the cell group, e.g., by placing it in one of the first places in the order, but not necessarily in the first place.


Typically, the MSP and/or the memory device holds a data structure that holds the values of the previously-successful read thresholds for each cell group (e.g., for each erasure block). When preparing to perform readout from a given cell group, the MSP and/or R/W unit retrieves the previously-successful read threshold values from the data structure, and uses them when defining the order of candidate read threshold sets.


Although the embodiments described herein mainly address solid state memory devices, the methods and systems described herein can also be used in other types of storage devices, such as Hard Disk Drives (HDD). Although the embodiments described herein refer mainly to MLC devices, the methods and systems described herein can be used with SLC devices, as well.


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
  • 1. A method for data readout, comprising: storing two or more candidate sets of read thresholds for reading from a memory device that includes a plurality of analog memory cells;identifying a group of the memory cells from which data is to be read;defining an order among the candidate sets of the read thresholds responsively to a criterion defined over the group of the memory cells; andattempting to read data from the group of the memory cells by iterating over the candidate sets according to the order, until the data is read successfully.
  • 2. The method according to claim 1, wherein defining the order comprises causing a first candidate set, which has a first likelihood of reading the data successfully, to appear in the order before a second candidate set, which has a second likelihood, smaller than the first likelihood, of reading the data successfully.
  • 3. The method according to claim 1, wherein the candidate sets comprise at least first and second candidate sets defined respectively for first and second life-cycle stages of the memory cells, and wherein the criterion is defined over a current life-cycle stage of the group of the memory cells.
  • 4. The method according to claim 1, wherein the candidate sets comprise at least first and second candidate sets defined respectively for first and second temperatures of the memory cells, and wherein the criterion is defined over a current temperature of the group of the memory cells.
  • 5. The method according to claim 1, wherein the candidate sets comprise at least first and second candidate sets defined respectively for first and second levels of interference affecting the memory cells, and wherein the criterion is defined over a current interference level affecting the group of the memory cells.
  • 6. The method according to claim 1, wherein the candidate sets comprise at least first and second candidate sets defined respectively for first and second locations of the memory cells in the memory device, and wherein the criterion is defined over a location of the group of the memory cells in the memory device.
  • 7. The method according to claim 1, and comprising: recording in a data structure an identity of a successful candidate set using which the data was read successfully from the group; andwhen preparing to perform subsequent readout from the group, defining the order for performing the subsequent readout responsively to the successful candidate set recorded in the data structure.
  • 8. A data storage apparatus, comprising: a plurality of analog memory cells; andcircuitry, which is configured to store two or more candidate sets of read thresholds for reading from the analog memory cells, to identify a group of the memory cells from which data is to be read, to define an order among the candidate sets of the read thresholds responsively to a criterion defined over the group of the memory cells, and to attempt to read data from the group of the memory cells by iterating over the candidate sets according to the order, until the data is read successfully.
  • 9. The apparatus according to claim 8, wherein the order causes a first candidate set, which has a first likelihood of reading the data successfully, to appear in the order before a second candidate set, which has a second likelihood, smaller than the first likelihood, of reading the data successfully.
  • 10. The apparatus according to claim 8, wherein the candidate sets comprise at least first and second candidate sets defined respectively for first and second life-cycle stages of the memory cells, and wherein the criterion is defined over a current life-cycle stage of the group of the memory cells.
  • 11. The apparatus according to claim 8, wherein the candidate sets comprise at least first and second candidate sets defined respectively for first and second temperatures of the memory cells, and wherein the criterion is defined over a current temperature of the group of the memory cells.
  • 12. The apparatus according to claim 8, wherein the candidate sets comprise at least first and second candidate sets defined respectively for first and second levels of interference affecting the memory cells, and wherein the criterion is defined over a current interference level affecting the group of the memory cells.
  • 13. The apparatus according to claim 8, wherein the candidate sets comprise at least first and second candidate sets defined respectively for first and second locations of the memory cells in the memory device, and wherein the criterion is defined over a location of the group of the memory cells in the memory device.
  • 14. The apparatus according to claim 8, wherein the circuitry is configured to record in a data structure an identity of a successful candidate set using which the data was read successfully from the group, and, when preparing to perform subsequent readout from the group, to define the order for performing the subsequent readout responsively to the successful candidate set recorded in the data structure.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Patent Application 61/141,830, filed Dec. 31, 2008, U.S. Provisional Patent Application 61/256,200, filed Oct. 29, 2009, U.S. Provisional Patent Application 61/264,673, filed Nov. 26, 2009, and U.S. Provisional Patent Application 61/265,763, filed Dec. 2, 2009, whose disclosures are incorporated herein by reference. This application is related to a U.S. patent application entitled “Efficient Readout Schemes for Analog Memory Cell Devices,” filed on even date, which is assigned to the assignee of the present patent application and whose disclosure is incorporated herein by reference

US Referenced Citations (540)
Number Name Date Kind
3668631 Griffith et al. Jun 1972 A
3668632 Oldham Jun 1972 A
4058851 Scheuneman Nov 1977 A
4112502 Scheuneman Sep 1978 A
4394763 Nagano et al. Jul 1983 A
4413339 Riggle et al. Nov 1983 A
4556961 Iwahashi et al. Dec 1985 A
4558431 Satoh Dec 1985 A
4608687 Dutton Aug 1986 A
4654847 Dutton Mar 1987 A
4661929 Aoki et al. Apr 1987 A
4768171 Tada Aug 1988 A
4811285 Walker et al. Mar 1989 A
4899342 Potter et al. Feb 1990 A
4910706 Hyatt Mar 1990 A
4993029 Galbraith et al. Feb 1991 A
5056089 Furuta et al. Oct 1991 A
5077722 Geist et al. Dec 1991 A
5126808 Montalvo et al. Jun 1992 A
5163021 Mehrotra et al. Nov 1992 A
5172338 Mehrotta et al. Dec 1992 A
5182558 Mayo Jan 1993 A
5182752 DeRoo et al. Jan 1993 A
5191584 Anderson Mar 1993 A
5200959 Gross et al. Apr 1993 A
5237535 Mielke et al. Aug 1993 A
5272669 Samachisa et al. Dec 1993 A
5276649 Hoshita et al. Jan 1994 A
5287469 Tsuboi Feb 1994 A
5365484 Cleveland et al. Nov 1994 A
5388064 Khan Feb 1995 A
5416646 Shirai May 1995 A
5416782 Wells et al. May 1995 A
5446854 Khalidi et al. Aug 1995 A
5450424 Okugaki et al. Sep 1995 A
5469444 Endoh et al. Nov 1995 A
5473753 Wells et al. Dec 1995 A
5479170 Cauwenberghs et al. Dec 1995 A
5508958 Fazio et al. Apr 1996 A
5519831 Holzhammer May 1996 A
5532962 Auclair et al. Jul 1996 A
5541886 Hasbun Jul 1996 A
5600677 Citta et al. Feb 1997 A
5638320 Wong et al. Jun 1997 A
5657332 Auclair et al. Aug 1997 A
5675540 Roohparvar Oct 1997 A
5682352 Wong et al. Oct 1997 A
5687114 Khan Nov 1997 A
5696717 Koh Dec 1997 A
5726649 Tamaru et al. Mar 1998 A
5726934 Tran et al. Mar 1998 A
5742752 De Koning Apr 1998 A
5748533 Dunlap et al. May 1998 A
5748534 Dunlap et al. May 1998 A
5751637 Chen et al. May 1998 A
5761402 Kaneda et al. Jun 1998 A
5798966 Keeney Aug 1998 A
5799200 Brant et al. Aug 1998 A
5801985 Roohparvar et al. Sep 1998 A
5838832 Barnsley Nov 1998 A
5860106 Domen et al. Jan 1999 A
5867114 Barbir Feb 1999 A
5867428 Ishii et al. Feb 1999 A
5867429 Chen et al. Feb 1999 A
5877986 Harari et al. Mar 1999 A
5889937 Tamagawa Mar 1999 A
5901089 Korsh et al. May 1999 A
5909449 So et al. Jun 1999 A
5912906 Wu et al. Jun 1999 A
5930167 Lee et al. Jul 1999 A
5937424 Leak et al. Aug 1999 A
5942004 Cappelletti Aug 1999 A
5946716 Karp et al. Aug 1999 A
5969986 Wong et al. Oct 1999 A
5982668 Ishii et al. Nov 1999 A
5991517 Harari et al. Nov 1999 A
5995417 Chen et al. Nov 1999 A
6009014 Hollmer et al. Dec 1999 A
6009016 Ishii et al. Dec 1999 A
6023425 Ishii et al. Feb 2000 A
6034891 Norman Mar 2000 A
6040993 Chen et al. Mar 2000 A
6041430 Yamauchi Mar 2000 A
6073204 Lakhani et al. Jun 2000 A
6101614 Gonzales et al. Aug 2000 A
6128237 Shirley et al. Oct 2000 A
6134140 Tanaka et al. Oct 2000 A
6134143 Norman Oct 2000 A
6134631 Jennings Oct 2000 A
6141261 Patti Oct 2000 A
6151246 So et al. Nov 2000 A
6157573 Ishii et al. Dec 2000 A
6166962 Chen et al. Dec 2000 A
6169691 Pasotti et al. Jan 2001 B1
6178466 Gilbertson et al. Jan 2001 B1
6185134 Tanaka et al. Feb 2001 B1
6209113 Roohparvar Mar 2001 B1
6212654 Lou et al. Apr 2001 B1
6219276 Parker Apr 2001 B1
6219447 Lee et al. Apr 2001 B1
6222762 Guterman et al. Apr 2001 B1
6230233 Lofgren et al. May 2001 B1
6240458 Gilbertson May 2001 B1
6259627 Wong Jul 2001 B1
6275419 Guterman et al. Aug 2001 B1
6278632 Chevallier Aug 2001 B1
6279069 Robinson et al. Aug 2001 B1
6288944 Kawamura Sep 2001 B1
6292394 Cohen et al. Sep 2001 B1
6301151 Engh et al. Oct 2001 B1
6304486 Yano Oct 2001 B1
6307776 So et al. Oct 2001 B1
6317363 Guterman et al. Nov 2001 B1
6317364 Guterman et al. Nov 2001 B1
6345004 Omura et al. Feb 2002 B1
6360346 Miyauchi et al. Mar 2002 B1
6363008 Wong Mar 2002 B1
6363454 Lakhani et al. Mar 2002 B1
6366496 Torelli et al. Apr 2002 B1
6385092 Ishii et al. May 2002 B1
6392932 Ishii et al. May 2002 B1
6396742 Korsh et al. May 2002 B1
6397364 Barkan May 2002 B1
6405323 Lin et al. Jun 2002 B1
6405342 Lee Jun 2002 B1
6418060 Yong et al. Jul 2002 B1
6442585 Dean et al. Aug 2002 B1
6445602 Kokudo et al. Sep 2002 B1
6452838 Ishii et al. Sep 2002 B1
6456528 Chen Sep 2002 B1
6466476 Wong et al. Oct 2002 B1
6467062 Barkan Oct 2002 B1
6469931 Ban et al. Oct 2002 B1
6490236 Fukuda et al. Dec 2002 B1
6522580 Chen et al. Feb 2003 B2
6525952 Araki et al. Feb 2003 B2
6532556 Wong et al. Mar 2003 B1
6538922 Khalid et al. Mar 2003 B1
6549464 Tanaka et al. Apr 2003 B2
6553510 Pekny et al. Apr 2003 B1
6558967 Wong May 2003 B1
6560152 Cernea May 2003 B1
6567311 Ishii et al. May 2003 B2
6577539 Iwahashi Jun 2003 B2
6584012 Banks Jun 2003 B2
6615307 Roohparvar Sep 2003 B1
6621739 Gonzales et al. Sep 2003 B2
6640326 Buckingham et al. Oct 2003 B1
6643169 Rudelic et al. Nov 2003 B2
6646913 Micheloni et al. Nov 2003 B2
6678192 Gongwer et al. Jan 2004 B2
6683811 Ishii et al. Jan 2004 B2
6687155 Nagasue Feb 2004 B2
6707748 Lin et al. Mar 2004 B2
6708257 Bao Mar 2004 B2
6714449 Khalid Mar 2004 B2
6717847 Chen Apr 2004 B2
6731557 Beretta May 2004 B2
6738293 Iwahashi May 2004 B1
6751766 Guterman et al. Jun 2004 B2
6757193 Chen et al. Jun 2004 B2
6774808 Hibbs et al. Aug 2004 B1
6781877 Cernea et al. Aug 2004 B2
6804805 Rub Oct 2004 B2
6807095 Chen et al. Oct 2004 B2
6807101 Ooishi et al. Oct 2004 B2
6809964 Moschopoulos et al. Oct 2004 B2
6819592 Noguchi et al. Nov 2004 B2
6829167 Tu et al. Dec 2004 B2
6845052 Ho et al. Jan 2005 B1
6851018 Wyatt et al. Feb 2005 B2
6851081 Yamamoto Feb 2005 B2
6856546 Guterman et al. Feb 2005 B2
6862218 Guterman et al. Mar 2005 B2
6870767 Rudelic et al. Mar 2005 B2
6870773 Noguchi et al. Mar 2005 B2
6873552 Ishii et al. Mar 2005 B2
6879520 Hosono et al. Apr 2005 B2
6882567 Wong Apr 2005 B1
6894926 Guterman et al. May 2005 B2
6907497 Hosono et al. Jun 2005 B2
6925009 Noguchi et al. Aug 2005 B2
6930925 Guo et al. Aug 2005 B2
6934188 Roohparvar Aug 2005 B2
6937511 Hsu et al. Aug 2005 B2
6958938 Noguchi et al. Oct 2005 B2
6963505 Cohen Nov 2005 B2
6972993 Conley et al. Dec 2005 B2
6988175 Lasser Jan 2006 B2
6992932 Cohen Jan 2006 B2
6999344 Hosono et al. Feb 2006 B2
7002843 Guterman et al. Feb 2006 B2
7006379 Noguchi et al. Feb 2006 B2
7012835 Gonzales et al. Mar 2006 B2
7020017 Chen et al. Mar 2006 B2
7023735 Ban et al. Apr 2006 B2
7031210 Park et al. Apr 2006 B2
7031214 Tran Apr 2006 B2
7031216 You Apr 2006 B2
7039846 Hewitt et al. May 2006 B2
7042766 Wang et al. May 2006 B1
7054193 Wong May 2006 B1
7054199 Lee et al. May 2006 B2
7057958 So et al. Jun 2006 B2
7065147 Ophir et al. Jun 2006 B2
7068539 Guterman et al. Jun 2006 B2
7071849 Zhang Jul 2006 B2
7072222 Ishii et al. Jul 2006 B2
7079555 Baydar et al. Jul 2006 B2
7088615 Guterman et al. Aug 2006 B2
7099194 Tu et al. Aug 2006 B2
7102924 Chen et al. Sep 2006 B2
7113432 Mokhlesi Sep 2006 B2
7130210 Bathul et al. Oct 2006 B2
7139192 Wong Nov 2006 B1
7139198 Guterman et al. Nov 2006 B2
7145805 Ishii et al. Dec 2006 B2
7151692 Wu Dec 2006 B2
7170781 So et al. Jan 2007 B2
7170802 Cernea et al. Jan 2007 B2
7173859 Hemink Feb 2007 B2
7177184 Chen Feb 2007 B2
7177195 Gonzales et al. Feb 2007 B2
7177199 Chen et al. Feb 2007 B2
7177200 Ronen et al. Feb 2007 B2
7184338 Nakagawa et al. Feb 2007 B2
7187195 Kim Mar 2007 B2
7187592 Guterman et al. Mar 2007 B2
7190614 Wu Mar 2007 B2
7193898 Cernea Mar 2007 B2
7193921 Choi et al. Mar 2007 B2
7196644 Anderson et al. Mar 2007 B1
7196928 Chen Mar 2007 B2
7196933 Shibata Mar 2007 B2
7197594 Raz et al. Mar 2007 B2
7200062 Kinsely et al. Apr 2007 B2
7210077 Brandenberger et al. Apr 2007 B2
7221592 Nazarian May 2007 B2
7224613 Chen et al. May 2007 B2
7231474 Helms et al. Jun 2007 B1
7231562 Ohlhoff et al. Jun 2007 B2
7243275 Gongwer et al. Jul 2007 B2
7254690 Rao Aug 2007 B2
7254763 Aadsen et al. Aug 2007 B2
7257027 Park Aug 2007 B2
7259987 Chen et al. Aug 2007 B2
7266026 Gongwer et al. Sep 2007 B2
7266069 Chu Sep 2007 B2
7269066 Nguyen et al. Sep 2007 B2
7272757 Stocken Sep 2007 B2
7274611 Roohparvar Sep 2007 B2
7277355 Tanzana Oct 2007 B2
7280398 Lee et al. Oct 2007 B1
7280409 Misumi et al. Oct 2007 B2
7280415 Hwang et al. Oct 2007 B2
7283399 Ishii et al. Oct 2007 B2
7289344 Chen Oct 2007 B2
7301807 Khalid et al. Nov 2007 B2
7301817 Li et al. Nov 2007 B2
7308525 Lasser et al. Dec 2007 B2
7310255 Chan Dec 2007 B2
7310269 Shibata Dec 2007 B2
7310271 Lee Dec 2007 B2
7310272 Mokhesi et al. Dec 2007 B1
7310347 Lasser Dec 2007 B2
7321509 Chen et al. Jan 2008 B2
7328384 Kulkarni et al. Feb 2008 B1
7342831 Mokhlesi et al. Mar 2008 B2
7343330 Boesjes et al. Mar 2008 B1
7345924 Nguyen et al. Mar 2008 B2
7345928 Li Mar 2008 B2
7349263 Kim et al. Mar 2008 B2
7356755 Fackenthal Apr 2008 B2
7363420 Lin et al. Apr 2008 B2
7365671 Anderson Apr 2008 B1
7388781 Litsyn et al. Jun 2008 B2
7397697 So et al. Jul 2008 B2
7405974 Yaoi et al. Jul 2008 B2
7405979 Ishii et al. Jul 2008 B2
7408804 Hemink et al. Aug 2008 B2
7408810 Aritome et al. Aug 2008 B2
7409473 Conley et al. Aug 2008 B2
7409623 Baker et al. Aug 2008 B2
7420847 Li Sep 2008 B2
7433231 Aritome Oct 2008 B2
7433697 Karaoguz et al. Oct 2008 B2
7434111 Sugiura et al. Oct 2008 B2
7437498 Ronen Oct 2008 B2
7440324 Mokhlesi Oct 2008 B2
7440331 Hemink Oct 2008 B2
7441067 Gorobetz et al. Oct 2008 B2
7447970 Wu et al. Nov 2008 B2
7450421 Mokhlesi et al. Nov 2008 B2
7453737 Ha Nov 2008 B2
7457163 Hemink Nov 2008 B2
7457897 Lee et al. Nov 2008 B1
7460410 Nagai et al. Dec 2008 B2
7460412 Lee et al. Dec 2008 B2
7466592 Mitani et al. Dec 2008 B2
7468907 Kang et al. Dec 2008 B2
7468911 Lutze et al. Dec 2008 B2
7471581 Tran et al. Dec 2008 B2
7483319 Brown Jan 2009 B2
7487329 Hepkin et al. Feb 2009 B2
7492641 Hosono et al. Feb 2009 B2
7508710 Mokhlesi Mar 2009 B2
7526711 Orio Apr 2009 B2
7539061 Lee May 2009 B2
7539062 Doyle May 2009 B2
7551492 Kim Jun 2009 B2
7558109 Brandman et al. Jul 2009 B2
7558839 McGovern Jul 2009 B1
7568135 Cornwell et al. Jul 2009 B2
7570520 Kamei et al. Aug 2009 B2
7590002 Mokhlesi et al. Sep 2009 B2
7593259 Kim Sep 2009 B2
7594093 Kancherla Sep 2009 B1
7596707 Vemula Sep 2009 B1
7609787 Jahan et al. Oct 2009 B2
7613043 Cornwell et al. Nov 2009 B2
7616498 Mokhlesi et al. Nov 2009 B2
7619918 Aritome Nov 2009 B2
7631245 Lasser Dec 2009 B2
7633798 Sarin et al. Dec 2009 B2
7633802 Mokhlesi Dec 2009 B2
7639532 Roohparvar et al. Dec 2009 B2
7644347 Alexander et al. Jan 2010 B2
7656734 Thorp et al. Feb 2010 B2
7660158 Aritome Feb 2010 B2
7660183 Ware et al. Feb 2010 B2
7661054 Huffman et al. Feb 2010 B2
7665007 Yang et al. Feb 2010 B2
7680987 Clark et al. Mar 2010 B1
7733712 Walston et al. Jun 2010 B1
7742351 Inoue et al. Jun 2010 B2
7761624 Karamcheti et al. Jul 2010 B2
7810017 Radke Oct 2010 B2
7848149 Gonzales et al. Dec 2010 B2
7869273 Lee et al. Jan 2011 B2
7885119 Li Feb 2011 B2
7928497 Yaegashi Apr 2011 B2
7930515 Gupta et al. Apr 2011 B2
7945825 Cohen et al. May 2011 B2
7978516 Olbrich et al. Jul 2011 B2
8014094 Jin Sep 2011 B1
8037380 Cagno et al. Oct 2011 B2
8040744 Gorobets et al. Oct 2011 B2
20010002172 Tanaka et al. May 2001 A1
20010006479 Ikehashi et al. Jul 2001 A1
20020038440 Barkan Mar 2002 A1
20020056064 Kidorf et al. May 2002 A1
20020118574 Gongwer et al. Aug 2002 A1
20020133684 Anderson Sep 2002 A1
20020166091 Kidorf et al. Nov 2002 A1
20020174295 Ulrich et al. Nov 2002 A1
20020196510 Hietala et al. Dec 2002 A1
20030002348 Chen et al. Jan 2003 A1
20030103400 Van Tran Jun 2003 A1
20030161183 Van Tran Aug 2003 A1
20030189856 Cho et al. Oct 2003 A1
20040057265 Mirabel et al. Mar 2004 A1
20040057285 Cernea et al. Mar 2004 A1
20040083333 Chang et al. Apr 2004 A1
20040083334 Chang et al. Apr 2004 A1
20040105311 Cernea et al. Jun 2004 A1
20040114437 Li Jun 2004 A1
20040160842 Fukiage Aug 2004 A1
20040223371 Roohparvar Nov 2004 A1
20050007802 Gerpheide Jan 2005 A1
20050013165 Ban Jan 2005 A1
20050024941 Lasser et al. Feb 2005 A1
20050024978 Ronen Feb 2005 A1
20050030788 Parkinson et al. Feb 2005 A1
20050086574 Fackenthal Apr 2005 A1
20050121436 Kamitani et al. Jun 2005 A1
20050157555 Ono et al. Jul 2005 A1
20050162913 Chen Jul 2005 A1
20050169051 Khalid et al. Aug 2005 A1
20050189649 Maruyama et al. Sep 2005 A1
20050213393 Lasser Sep 2005 A1
20050224853 Ohkawa Oct 2005 A1
20050240745 Iyer et al. Oct 2005 A1
20050243626 Ronen Nov 2005 A1
20060004952 Lasser Jan 2006 A1
20060028875 Avraham et al. Feb 2006 A1
20060028877 Meir Feb 2006 A1
20060101193 Murin May 2006 A1
20060106972 Gorobets et al. May 2006 A1
20060107136 Gongwer et al. May 2006 A1
20060129750 Lee et al. Jun 2006 A1
20060133141 Gorobets Jun 2006 A1
20060156189 Tomlin Jul 2006 A1
20060179334 Brittain et al. Aug 2006 A1
20060190699 Lee Aug 2006 A1
20060203546 Lasser Sep 2006 A1
20060218359 Sanders et al. Sep 2006 A1
20060221692 Chen Oct 2006 A1
20060221705 Hemink et al. Oct 2006 A1
20060221714 Li et al. Oct 2006 A1
20060239077 Park et al. Oct 2006 A1
20060239081 Roohparvar Oct 2006 A1
20060256620 Nguyen et al. Nov 2006 A1
20060256626 Werner et al. Nov 2006 A1
20060256891 Yuan et al. Nov 2006 A1
20060271748 Jain et al. Nov 2006 A1
20060285392 Incarnati et al. Dec 2006 A1
20060285396 Ha Dec 2006 A1
20070006013 Moshayedi et al. Jan 2007 A1
20070019481 Park Jan 2007 A1
20070033581 Tomlin et al. Feb 2007 A1
20070047314 Goda et al. Mar 2007 A1
20070047326 Nguyen et al. Mar 2007 A1
20070050536 Kolokowsky Mar 2007 A1
20070058446 Hwang et al. Mar 2007 A1
20070061502 Lasser et al. Mar 2007 A1
20070067667 Ikeuchi et al. Mar 2007 A1
20070074093 Lasser Mar 2007 A1
20070086239 Litsyn et al. Apr 2007 A1
20070086260 Sinclair Apr 2007 A1
20070089034 Litsyn et al. Apr 2007 A1
20070091677 Lasser et al. Apr 2007 A1
20070091694 Lee et al. Apr 2007 A1
20070103978 Conley et al. May 2007 A1
20070103986 Chen May 2007 A1
20070109845 Chen May 2007 A1
20070109849 Chen May 2007 A1
20070115726 Cohen et al. May 2007 A1
20070118713 Guterman et al. May 2007 A1
20070143378 Gorobetz Jun 2007 A1
20070143531 Atri Jun 2007 A1
20070159889 Kang et al. Jul 2007 A1
20070159892 Kang et al. Jul 2007 A1
20070159907 Kwak Jul 2007 A1
20070168837 Murin Jul 2007 A1
20070171714 Wu et al. Jul 2007 A1
20070183210 Choi et al. Aug 2007 A1
20070189073 Aritome Aug 2007 A1
20070195602 Fong et al. Aug 2007 A1
20070206426 Mokhlesi Sep 2007 A1
20070208904 Hsieh et al. Sep 2007 A1
20070226599 Motwani Sep 2007 A1
20070236990 Aritome Oct 2007 A1
20070253249 Kang et al. Nov 2007 A1
20070256620 Viggiano et al. Nov 2007 A1
20070263455 Cornwell et al. Nov 2007 A1
20070266232 Rodgers et al. Nov 2007 A1
20070271424 Lee et al. Nov 2007 A1
20070280000 Fujiu et al. Dec 2007 A1
20070291571 Balasundaram Dec 2007 A1
20070297234 Cernea et al. Dec 2007 A1
20080010395 Mylly et al. Jan 2008 A1
20080025121 Tanzawa Jan 2008 A1
20080043535 Roohparvar Feb 2008 A1
20080049504 Kasahara et al. Feb 2008 A1
20080049506 Guterman Feb 2008 A1
20080052446 Lasser et al. Feb 2008 A1
20080055993 Lee Mar 2008 A1
20080080243 Edahiro et al. Apr 2008 A1
20080082730 Kim et al. Apr 2008 A1
20080089123 Chae et al. Apr 2008 A1
20080104309 Cheon et al. May 2008 A1
20080104312 Lasser May 2008 A1
20080109590 Jung et al. May 2008 A1
20080115017 Jacobson May 2008 A1
20080123420 Brandman et al. May 2008 A1
20080126686 Sokolov et al. May 2008 A1
20080130341 Shalvi et al. Jun 2008 A1
20080148115 Sokolov et al. Jun 2008 A1
20080151618 Sharon et al. Jun 2008 A1
20080151667 Miu et al. Jun 2008 A1
20080158958 Sokolov et al. Jul 2008 A1
20080181001 Shalvi Jul 2008 A1
20080198650 Shalvi et al. Aug 2008 A1
20080198654 Toda Aug 2008 A1
20080209116 Caulkins Aug 2008 A1
20080209304 Winarski et al. Aug 2008 A1
20080215798 Sharon et al. Sep 2008 A1
20080219050 Shalvi et al. Sep 2008 A1
20080239093 Easwar et al. Oct 2008 A1
20080239812 Abiko et al. Oct 2008 A1
20080253188 Aritome Oct 2008 A1
20080263262 Sokolov et al. Oct 2008 A1
20080263676 Mo et al. Oct 2008 A1
20080270730 Lasser et al. Oct 2008 A1
20080282106 Shalvi et al. Nov 2008 A1
20080288714 Salomon et al. Nov 2008 A1
20090013233 Radke Jan 2009 A1
20090024905 Shalvi et al. Jan 2009 A1
20090034337 Aritome Feb 2009 A1
20090043831 Antonopoulos et al. Feb 2009 A1
20090043951 Shalvi et al. Feb 2009 A1
20090049234 Oh et al. Feb 2009 A1
20090073762 Lee et al. Mar 2009 A1
20090086542 Lee et al. Apr 2009 A1
20090089484 Chu Apr 2009 A1
20090091979 Shalvi Apr 2009 A1
20090094930 Schwoerer Apr 2009 A1
20090106485 Anholt Apr 2009 A1
20090112949 Ergan et al. Apr 2009 A1
20090132755 Radke May 2009 A1
20090144600 Perlmutter et al. Jun 2009 A1
20090150894 Huang et al. Jun 2009 A1
20090157950 Selinger Jun 2009 A1
20090157964 Kasorla et al. Jun 2009 A1
20090158126 Perlmutter et al. Jun 2009 A1
20090168524 Golov et al. Jul 2009 A1
20090172257 Prins et al. Jul 2009 A1
20090172261 Prins et al. Jul 2009 A1
20090193184 Yu et al. Jul 2009 A1
20090199074 Sommer et al. Aug 2009 A1
20090204824 Lin et al. Aug 2009 A1
20090204872 Yu et al. Aug 2009 A1
20090213653 Perlmutter et al. Aug 2009 A1
20090213654 Perlmutter et al. Aug 2009 A1
20090225595 Kim Sep 2009 A1
20090228761 Perlmutter et al. Sep 2009 A1
20090240872 Perlmutter et al. Sep 2009 A1
20090265509 Klein Oct 2009 A1
20090300227 Nochimowski et al. Dec 2009 A1
20090323412 Mokhlesi et al. Dec 2009 A1
20090327608 Eschmann Dec 2009 A1
20100017650 Chin et al. Jan 2010 A1
20100034022 Dutta et al. Feb 2010 A1
20100057976 Lasser Mar 2010 A1
20100061151 Miwa et al. Mar 2010 A1
20100082883 Chen et al. Apr 2010 A1
20100083247 Kanevsky et al. Apr 2010 A1
20100091535 Sommer et al. Apr 2010 A1
20100110580 Takashima May 2010 A1
20100131697 Alrod et al. May 2010 A1
20100142268 Aritome Jun 2010 A1
20100142277 Yang et al. Jun 2010 A1
20100169547 Ou Jul 2010 A1
20100169743 Vogan et al. Jul 2010 A1
20100174847 Paley et al. Jul 2010 A1
20110066793 Burd Mar 2011 A1
20110075482 Shepard et al. Mar 2011 A1
20110107049 Kwon et al. May 2011 A1
20110199823 Bar-Or et al. Aug 2011 A1
20110302354 Miller Dec 2011 A1
Foreign Referenced Citations (43)
Number Date Country
0783754 Jul 1997 EP
1434236 Jun 2004 EP
1605509 Dec 2005 EP
9610256 Apr 1996 WO
9828745 Jul 1998 WO
02100112 Dec 2002 WO
03100791 Dec 2003 WO
2007046084 Apr 2007 WO
2007132452 Nov 2007 WO
2007132453 Nov 2007 WO
2007132456 Nov 2007 WO
2007132457 Nov 2007 WO
2007132458 Nov 2007 WO
2007146010 Dec 2007 WO
2008026203 Mar 2008 WO
2008053472 May 2008 WO
2008053473 May 2008 WO
2008068747 Jun 2008 WO
2008077284 Jul 2008 WO
2008083131 Jul 2008 WO
2008099958 Aug 2008 WO
2008111058 Sep 2008 WO
2008124760 Oct 2008 WO
2008139441 Nov 2008 WO
2009037691 Mar 2009 WO
2009037697 Mar 2009 WO
2009038961 Mar 2009 WO
2009050703 Apr 2009 WO
2009053961 Apr 2009 WO
2009053962 Apr 2009 WO
2009053963 Apr 2009 WO
2009063450 May 2009 WO
2009072100 Jun 2009 WO
2009072101 Jun 2009 WO
2009072102 Jun 2009 WO
2009072103 Jun 2009 WO
2009072104 Jun 2009 WO
2009072105 Jun 2009 WO
2009074978 Jun 2009 WO
2009074979 Jun 2009 WO
2009078006 Jun 2009 WO
2009095902 Aug 2009 WO
2011024015 Mar 2011 WO
Provisional Applications (4)
Number Date Country
61141830 Dec 2008 US
61256200 Oct 2009 US
61264673 Nov 2009 US
61265763 Dec 2009 US