The present invention relates generally to memory devices, and particularly to methods and systems for retrieving data from multi-level analog memory cells.
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. The storage 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 storage 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 storage value that corresponds to the desired bit or bits.
Some memory devices, which are 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.
Flash memory devices are described, for example, by Bez et al., in “Introduction to Flash Memory,” Proceedings of the IEEE, volume 91, number 4, April, 2003, pages 489-502, which is incorporated herein by reference. Multi-level Flash cells and devices are described, for example, by Eitan et al., in “Multilevel Flash Cells and their Trade-Offs,” Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), New York, N.Y., pages 169-172, which is incorporated herein by reference. The paper compares several kinds of multilevel Flash cells, such as common ground, DINOR, AND, NOR and NAND cells.
Eitan et al., describe another type of analog memory cell called Nitride Read Only Memory (NROM) in “Can NROM, a 2-bit, Trapping Storage NVM Cell, Give a Real Challenge to Floating Gate Cells?” Proceedings of the 1999 International Conference on Solid State Devices and Materials (SSDM), Tokyo, Japan, Sep. 21-24, 1999, pages 522-524, which is incorporated herein by reference. NROM cells are also described by Maayan et al., in “A 512 Mb NROM Flash Data Storage Memory with 8 MB/s Data Rate”, Proceedings of the 2002 IEEE International Solid-State Circuits Conference (ISSCC 2002), San Francisco, Calif., Feb. 3-7, 2002, pages 100-101, which is incorporated herein by reference. Other exemplary types of analog memory cells are Floating Gate (FG) cells, Ferroelectric RAM (FRAM) cells, magnetic RAM (MRAM) cells, Charge Trap Flash (CTF) and phase change RAM (PRAM, also referred to as Phase Change Memory—PCM) cells. FRAM, MRAM and PRAM cells are described, for example, by Kim and Koh in “Future Memory Technology including Emerging New Memories,” Proceedings of the 24th International Conference on Microelectronics (MIEL), Nis, Serbia and Montenegro, May 16-19, 2004, volume 1, pages 377-384, which is incorporated herein by reference.
Analog memory cells are commonly read by comparing their storage values to one or more read thresholds. Some known methods and systems read analog memory cells using multiple read thresholds. For example, PCT International Publication WO 2007/132457, whose disclosure is incorporated herein by reference, describes a method for operating a memory device. The method includes encoding data using an Error Correction Code (ECC) and storing the encoded data as first analog values in respective analog memory cells of the memory device. Second analog values are then read from the respective memory cells. A distortion present in the second analog values is estimated, and error correction metrics are computed responsively to the estimated distortion. The second analog values are processed using the error correction metrics in an ECC decoding process, so as to reconstruct the data. In some embodiments, the error correction metrics are computed by combining multiple instances of the second storage values, which are obtained by using respective different sets of read thresholds.
PCT International Publication WO 2008/053472, whose disclosure is incorporated herein by reference, describes a method for operating a memory. The method includes storing data, which is encoded with an ECC, in analog memory cells of the memory by writing respective analog input values selected from a set of nominal values to the analog memory cells. The stored data is read by performing multiple read operations that compare analog output values of the analog memory cells to different, respective read thresholds. At least two of the read thresholds are positioned between a pair of the nominal values that are adjacent to one another in the set of the nominal values.
The two PCT Publications cited above are assigned to the assignee of the present patent application and were published after the priority date of the present patent application.
An embodiment of the present invention provides a method for data storage, including:
storing data in a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
after storing the data, reading the first data bits from the memory cells by executing at least the second built-in command.
In some embodiments, reading the first data bits by executing at least the second built-in command includes reading multiple instances of the first data bits using the respective second thresholds. In an embodiment, the multiple instances of the first data bits are processed so as to adjust the first thresholds. Additionally or alternatively, the multiple instances of the first data bits are processed so as to cancel interference in the analog memory cells. Further additionally or alternatively, storing the data includes encoding the data with an Error Correction Code (ECC), and the method includes processing the multiple instances of the first data bits so as to compute soft decoding metrics for decoding the ECC.
In a disclosed embodiment, reading the first data bits by executing at least the second built-in command includes making an attempt to read the first data bits using the first built-in command, and reverting to read the first data bits using the second built-in command responsively to a failure of the attempt.
In another embodiment, each of the analog memory cells further stores a third data bit, the memory has a third built-in command for reading the third data bits of the memory cells by comparing the storage values of the memory cells to a third number of third thresholds, such that the third number is larger than the second number, and reading the first data bits includes executing both the second and the third built-in commands.
In yet another embodiment, storing the data includes writing to the memory cells nominal storage values selected from a group of possible nominal storage values corresponding to the respective programming levels, and executing at least the second built-in command includes positioning the second thresholds between a pair of the nominal storage values that are adjacent to one another in the group of the possible nominal storage values. In still another embodiment, the storage values of the memory cells that assume a given programming level are distributed over a range, and executing at least the second built-in command includes positioning at least one of the second thresholds within the range. In an embodiment, the second built-in command reads the second data bits independently of the first data bits.
There is additionally provided, in accordance with an embodiment of the present invention, a method for data storage, including:
storing data in a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to one or more first thresholds, and a second built-in command for reading the second data bits of the memory cells independently of the first data bits by comparing the storage values of the memory cells to a plurality of second thresholds; and
after storing the data, reading the first data bits from the memory cells by executing at least the second built-in command.
There is also provided, in accordance with an embodiment of the present invention, apparatus for data storage, including:
an interface, which is operative to communicate with a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command.
There is further provided, in accordance with an embodiment of the present invention, apparatus for data storage, including:
a memory including multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to a first number of first thresholds, and a second built-in command for reading the second data bits of the memory cells by comparing the storage values of the memory cells to a second number of second thresholds, such that the first number is less than the second number; and
a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command.
There is additionally provided, in accordance with an embodiment of the present invention, apparatus for data storage, including:
an interface, which is operative to communicate with a memory that includes multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to one or more first thresholds, and a second built-in command for reading the second data bits of the memory cells independently of the first data bits by comparing the storage values of the memory cells to a plurality of second thresholds; and
a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command.
There is also provided, in accordance with an embodiment of the present invention, apparatus for data storage, including:
a memory including multi-bit analog memory cells, each of which stores at least first and second data bits by assuming one of a predefined plurality of programming levels associated with respective storage values, the memory having at least a first built-in command for reading the first data bits of the memory cells by comparing the storage values of the memory cells to one or more first thresholds, and a second built-in command for reading the second data bits of the memory cells independently of the first data bits by comparing the storage values of the memory cells to a plurality of second thresholds; and
a processor, which is coupled to store data in the memory cells and, after storing the data, to read the first data bits from the memory cells by executing at least the second built-in command.
The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:
In many MLC device configurations, different bits are read from the memory cells using respective, different sets of read thresholds. For example, in an eight-level MLC configuration, each memory cell stores three bits, which are referred to as a Least Significant Bit (LSB), a Central Significance Bit (CSB) and a Most Significant Bit (MSB). In a common reading scheme, the LSB is read using a single threshold, the CSB is read using a set of two thresholds, and the MSB is read using a different set that includes four thresholds.
Some MLC devices support composite built-in read commands for reading a certain bit from a group of memory cells. For example, in the 3 bits/cell configuration described above, the memory device may support three built-in commands (e.g., “read the LSBs from the group of cells X,” “read the CSBs from the group of cells X,” and “read the MSBs from the group of cells X,”). Typically, the threshold values to be used by the memory device are specified in the command. In response to receiving one of these commands, the memory device automatically sets the appropriate read thresholds for reading the requested bit, performs the appropriate threshold comparison operations and outputs the read results.
When using such built-in commands, the entire operation sequence for reading a given bit (which often involves multiple read operations that use multiple thresholds) is triggered by a single instruction. Thus, the use of built-in commands reduces the memory access overhead and the communication throughput to and from the memory device, in comparison with single-threshold read commands.
In various situations and applications, there is a need to re-read a given bit in a group of memory cells multiple times using multiple different thresholds. Reading a given bit using different thresholds may be carried out, for example, in order to adjust or optimize the read threshold values, in order to estimate and cancel interference and/or in order to compute soft metrics for decoding an Error Correction Code (ECC) that encodes the data. Embodiments of the present invention that are described hereinbelow provide highly-efficient methods and systems for re-reading analog memory cells using different thresholds, by utilizing built-in multiple-threshold commands supported by the memory device.
In some embodiments, a Memory Signal Processor (MSP) stores data in a memory device, which comprises an array of multi-bit analog memory cells. The memory device supports one or more built-in read commands for reading respective data bits from the cells. Each built-in read command uses a respective set of one or more read thresholds.
In order to read a given bit using multiple thresholds, the MSP sends the memory device a built-in read command specifying the desired multiple thresholds. The memory device executes the command, and thus re-reads the given bit using the desired multiple thresholds. Using this technique, the MSP re-reads a given bit multiple times by issuing only a single instruction, rather than using multiple single-threshold commands. As a result, the number of memory access operations performed by the MSP and the data throughput over the interface between the memory device and the MSP are reduced considerably. Typically, the re-reading functionality is transparent to the memory device and may be applied to legacy memory devices.
In some embodiments, the command issued for re-reading a given bit has a number of thresholds that is higher than the number of thresholds normally used for reading this bit. For example, the memory device typically comprises a built-in command that is predefined for reading the LSB using a single threshold. When using the disclosed methods, the LSB can be read four times from a group of cells by (1) issuing a built-in read command that is predefined for reading the MSB, and (2) specifying the four desired re-reading thresholds in the command.
In some embodiments, the MSP initially reads a given bit using the built-in command that is predefined for reading this bit, and reverts to a built-in command having a higher number of thresholds if the initial reading attempt fails. In some embodiments, the multiple thresholds used for re-reading are positioned between adjacent programming levels. Alternatively, one or more of the thresholds can be positioned within a storage value interval that is occupied by a programming level. This sort of threshold setting is useful, for example, for obtaining statistical information regarding the storage value distribution.
System 20 comprises a memory device 24, which stores data in a memory cell array 28. The memory cell 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. Memory cells 32 comprise Multi-Level Cells (MLC, also referred to as multi-bit cells), each storing multiple data bits.
The charge levels stored in the cells and/or the analog voltages or currents written into and read out of the cells are referred to herein collectively as analog values or storage values. Although the embodiments described herein mainly address threshold voltages, the methods and systems described herein may be used with any other suitable kind of storage values.
System 20 stores data in the analog memory cells by programming the cells to assume respective memory states, which are also referred to as programming levels. The programming levels are selected from a finite set of possible levels, and each level corresponds to a certain nominal storage value. For example, a 2 bit/cell MLC can be programmed to assume one of four possible programming levels by writing one of four possible nominal storage values to the cell.
Memory device 24 comprises a reading/writing (R/W) unit 36, which converts data for storage in the memory device to 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. The R/W unit typically (although not necessarily) programs the cells using an iterative Program and Verify (P&V) process, as is known in the art. 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. Memory device 24 comprises one or more page buffers 38, which are used for caching data pages during data storage and retrieval.
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. In some embodiments, unit 48 encodes the data for storage using an Error Correction Code (ECC) or Error Detection Code (EDC), and decodes the ECC or EDC of the data retrieved from the 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
In the exemplary system configuration shown in
Typically, the MSP (or any other controller or processor that carries out some or all of 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 a typical configuration, memory cells 32 of array 28 are arranged in a grid having multiple rows and columns, commonly referred to as word lines and bit lines, respectively. The array is typically partitioned into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously. Word lines are typically erased in blocks, referred to as erasure blocks, which are erased simultaneously.
The storage values read from memory cells 32 often vary from the nominal values, such as because of programming inaccuracies, reading inaccuracies and various distortion mechanisms. Thus, the storage values of the cells in a given programming level are distributed over a certain range in accordance with a certain statistical distribution. Typically, R/W unit 36 reads data from cells 32 by comparing the storage values of the cells to one or more read thresholds, in order to determine the programming level assumed by each cell. Such read operations are applied simultaneously to a group of memory cells within a certain word line.
Memory cells 32 comprise Multi-Level Cells (MLC), with each cell 32 storing two or more bits of data. For N bits/cell memory cells, each programming level represents a certain combination of N bit values. Determining the programming level assumed by a given cell is therefore equivalent to decoding the N data bits stored in the cell.
The storage values in each programming level are distributed in accordance with a certain statistical distribution 60. In some cases, such as when the level of distortion in the cells is particularly high, adjacent distributions 60 may overlap one another. R/W unit reads the data from the memory cells by comparing their storage values to a set of read thresholds 64A . . . 64G.
Although the description that follows refers mainly to the eight-level cell configuration of
In some embodiments, R/W unit 36 reads each bit of memory cells 32 (e.g., BIT1, BIT2 and BIT3 in
Some memory devices support built-in read commands for retrieving given bits from a group of memory cells. In such memory devices, the R/W unit automatically sets the appropriate read thresholds for reading the requested bit, performs the appropriate threshold comparison operations, processes the comparison results (interim read results) to determine the bit values of the cells, and sends the bit values (final read results) to the MSP or controller.
For example, in the configuration of
The use of such built-in read commands is advantageous over simpler commands that perform only a single threshold comparison since it (1) reduces the number of memory device access operations and (2) reduces the amount of data transferred from the memory device to the MSP considerably. For example, reading BIT3 from a group of 8192 cells using single-threshold read commands would cause 4.8192=32768 interim read results to be transferred to the MSP. The MSP would then process these 32768 results (four single-threshold read results for every cell), to produce the requested 8192 final read results. Using built-in multi-threshold read commands, on the other hand, the 32768 interim read results are obtained and processed internally to the memory device, and only the final 8192 read results are transferred to the MSP. Using single-threshold read commands, the memory device is accessed seven times. Using the built-in multi-threshold commands, on the other hand, the memory device is accessed only once.
In various situations and applications, MSP 40 performs multiple re-read operations of a given bit in a group of memory cells, using multiple different thresholds. Embodiments of the present invention, which are explained and demonstrated below, provide methods and systems that perform such re-read operations efficiently, by utilizing the built-in multiple-threshold commands supported by the memory device.
MSP 40 may re-read a given bit (i.e., read multiple instances of the given bit) with different thresholds for various purposes. For example, distributions 60 may drift, widen or otherwise change over time, such as because of aging or interference. When distributions 60 change, the optimal positions of the read thresholds often change, as well. In some embodiments, the MSP re-reads a given bit using multiple thresholds, and processes the multiple read results of this bit to optimize the threshold positions. Such techniques are described, for example, in PCT International Publications WO 2007/132457 and WO 2008/053472, cited above.
As another example, the MSP may re-read a given bit in a group of memory cells with different thresholds in order to cancel cross-coupling interference from other cells. In some embodiments, the MSP selects the least-interfered read results on a cell-by-cell basis. Some cross-coupling cancellation methods, which use multiple read results that are obtained using multiple read thresholds, are described in PCT International Publications WO 2007/132457 and WO 2008/053472, cited above.
As yet another example, the MSP may employ an ECC scheme that uses soft decoding metrics. In these embodiments, the MSP computes soft metrics of a given bit in a group of memory cells, and decodes the ECC using the soft metrics. The MSP computes the soft metrics by re-reading the bits in question using multiple different thresholds, and processes the multiple read results to produce the metrics. Soft metric computation techniques of this sort are described, for example, in PCT International Publications WO 2007/132457 and WO 2008/053472, cited above.
In some embodiments, the MSP instructs R/W unit 36 to perform the seven re-read operations using the built-in multi-threshold read operations supported by the memory device. In the present example, the MSP sends three read commands to the memory device:
By executing these three multi-threshold read commands, the R/W unit compares the storage values of the cells to seven thresholds and transfers three sets of read results to the MSP. The read results can be used by the MSP for adjusting threshold positions, for performing interference cancellation, for computing soft metrics or for any other purpose.
In the present example, the built-in commands supported by the memory device are predefined to read BIT1 using a single threshold, BIT2 using two thresholds and BIT3 using four thresholds. In the process described above, however, BIT1 is read using the built-in commands that are predefined for reading BIT2 and BIT3. These commands have a higher number of thresholds than the number that is predefined for reading BIT1.
In some embodiments, the values of the thresholds to be used are specified as part of the built-in read command. Alternatively, the values can be provided to the memory device in a separate command that is sent adjacently to the built-in read command, or using any other suitable means.
At some point in time, MSP 40 initiates a process of reading BIT1 from a group of memory cells 32 using multiple thresholds. The process may be initiated in order to adjust read threshold positions, in order to cancel cross-coupling interference, in order to compute soft metrics, or for any other reason.
The MSP sets the values of the read thresholds in the BIT1, BIT2 and BIT3 built-in read commands, at a threshold setting step 74. The MSP positions the seven thresholds to fall between programming levels L4 and L5, as shown in
R/W unit 36 in memory device 24 executes the three commands. The R/W unit executes the BIT1 command at a first bit reading step 78, the BIT2 command at a second bit reading step 82, and the BIT3 command at a third bit reading step 86. The BIT1, BIT2 and BIT3 commands use one, two and four thresholds, respectively. Since, as noted above, each read command reads a given bit independently of the other bits, steps 78-86 can be executed in any order.
Device 24 sends the BIT1 read results produced by the three built-in read operations (which comprise results originating from seven thresholds) to the MSP, at a result reporting step 90. The MSP applies the desired processing (e.g., threshold adjustment, cross-coupling interference cancellation or soft metric computation) to the returned read results.
In some embodiments, the MSP initially reads a given bit using the built-in command that is originally predefined for reading this bit, and reverts to a command having a higher number of thresholds if the initial reading attempt fails. The command that the MSP reverts to comprises a command that is originally predefined for reading another bit of the memory cells, and is referred to herein as an alternative command.
The MSP may use any suitable criteria for determining read failures, such as a failure to decode an ECC that decodes the retrieved data, an error indication of an EDC, an intolerable error level in the reconstructed data or a distortion level that exceeds a certain tolerable level.
In some embodiments, the MSP sets the thresholds of the alternative command to fall in the vicinity of the threshold used in the initial unsuccessful attempt. For example, the MSP may apply the method of
In some embodiments, the MSP comprises logic (in hardware or software) for converting the read results of one built-in command to the format of another built-in command, so that the read results can be interpreted correctly. For example, when reading BIT1 using the BIT2 built-in command, the MSP may comprise logic for separating the read results of the BIT2 read command into two single-bit read results having two different thresholds, so as to appear to subsequent processes as read results of two BIT1 read commands.
As another example, the MSP may comprise logic that generates, in response to the read results of the BIT2 read command, a BIT1-equivalent stream having different thresholds for different cells. As noted above, using different thresholds for different cells is useful, for example, in interference cancellation processes. Alternatively, the MSP may carry out interference cancellation computations directly on the read results of the BIT1 and BIT2 built-in commands.
In some embodiments, one or more of the thresholds in the alternative command are set to fall in the vicinity of the initial threshold, while one or more other thresholds are set to fall in any other suitable region of the storage value axis. Unlike the previous example, in which the number of thresholds was increased to improve the reading performance of BIT1, in the present embodiment the added threshold or thresholds are used to sample the storage value distribution at an additional point. The additional thresholds may be positioned between programming levels and thus assist in subsequently reading other bits from the memory cells. Alternatively, the additional thresholds may be positioned within the distribution of a given programming level, and therefore improve the statistical information of the MSP regarding this distribution.
Upon a failure of the initial attempt, the MSP makes a second attempt to read BIT1. In the second attempt, the MSP instructs the R/W unit to use the BIT2 read commands that compares the storage values of the cells to two thresholds 98. In the example of
The method of
The MSP then checks whether the initial read attempt was successful, at a success checking step 104. As noted above, the success criterion may depend on successful ECC or EDC decoding, on distortion measurement or on any other factor. If the initial attempt was successful, the MSP reconstructs the read data, outputs the result and terminates, at a termination step 108.
Otherwise, i.e., if the initial read attempt failed, the system re-reads BIT1 using the built-in BIT2 read command. The MSP specifies two thresholds for this command, at a threshold setting step 112. The two thresholds comprise (1) a corrected or adjusted threshold for reading BIT1, and (2) a second threshold positioned within another distribution. The first threshold is used for re-reading BIT1, while the second threshold is used for improving the statistical knowledge of the MSP regarding the storage value distributions in the memory cells. Referring to
The MSP sends the command to the memory device, and R/W unit 36 executes the command, at an execution step 116. The R/W unit sends the read results to the MSP. The MSP reconstructs the data, outputs the result and terminates at step 108.
The principles of the present invention can be used to define and execute various sequences of read operations that use the built-in read commands supported by the memory device. Such read sequences may improve the reading speed and/or quality under different scenarios.
In response to the two failures, the MSP makes a third attempt to read both BIT1 and BIT2 by issuing a single BIT3 read command, which uses four thresholds 128. Thresholds 128 are positioned so that the results of the BIT3 command, when combined with the results of the failed BIT1 and BIT2 commands, enable successful decoding of BIT1 and BIT2. This scheme is thus able to decode BIT1 and BIT2 after a failure by issuing only a single additional read command. In comparison with known methods, this scheme provides smaller read latency and less communication throughput between the MSP and the memory device.
In order to adjust this ill-positioned threshold and successfully read BIT3, the MSP carries out a fourth read attempt. The MSP sends another BIT3 read command, this time with four thresholds denoted “IV” in the figure. Two thresholds of the new command are positioned around the failed threshold. Thus, the thresholds of the BIT3 read commands can be adjusted using the additional information obtained by the fourth read attempt.
In this example, it is known a-priori that the left-most threshold used for reading BIT3 (the threshold between levels L1 and L2) is ill-positioned or unknown. Consequently, the entire read sequence is designed a-priori to provide additional resolution in the vicinity of this threshold. The combined results of the four read attempts enable successful decoding of BIT1 . . . BIT3, regardless of the actual optimal position of the left-most threshold.
Although the embodiments described herein mainly address read operations 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.
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.
This application claims the benefit of U.S. Provisional Patent Application 60/981,113, filed Oct. 19, 2007, and U.S. Provisional Patent Application 60/989,129, filed Nov. 20, 2007, whose disclosures are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4556961 | Iwahashi et al. | Dec 1985 | A |
4558431 | Satoh | Dec 1985 | 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 |
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 |
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 |
5801985 | Roohparvar et al. | Sep 1998 | A |
5838832 | Barnsley | Nov 1998 | A |
5860106 | Domen et al. | Jan 1999 | A |
5867114 | Barbir | 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 |
5969986 | Wong et al. | Oct 1999 | A |
5991517 | Harari et al. | Nov 1999 | A |
5995417 | Chen et al. | Nov 1999 | A |
6009014 | Hollmer et al. | Dec 1999 | 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 |
6166962 | Chen et al. | Dec 2000 | A |
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 |
6275419 | Guterman et al. | 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 |
6396742 | Korsh et al. | May 2002 | B1 |
6397364 | Barkan | May 2002 | B1 |
6405323 | Lin et al. | Jun 2002 | B1 |
6418060 | Yong et al. | Jul 2002 | B1 |
6442585 | Dean et al. | Aug 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 |
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 |
6558967 | Wong | May 2003 | B1 |
6560152 | Cernea | May 2003 | B1 |
6577539 | Iwahashi | Jun 2003 | B2 |
6584012 | Banks | Jun 2003 | B2 |
6615307 | Roohparvar | Sep 2003 | B1 |
6621739 | Gonzales et al. | Sep 2003 | B2 |
6643169 | Rudelic et al. | Nov 2003 | B2 |
6646913 | Micheloni et al. | Nov 2003 | B2 |
6678192 | Gongwer 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 |
6807095 | Chen et al. | Oct 2004 | B2 |
6809964 | Moschopoulos et al. | Oct 2004 | B2 |
6829167 | Tu et al. | Dec 2004 | B2 |
6845052 | Ho et al. | Jan 2005 | B1 |
6851018 | Wyatt et al. | Feb 2005 | B2 |
6856546 | Guterman et al. | Feb 2005 | B2 |
6862218 | Guterman et al. | Mar 2005 | B2 |
6870767 | Rudelic et al. | Mar 2005 | B2 |
6894926 | Guterman et al. | May 2005 | B2 |
6907497 | Hosono et al. | Jun 2005 | B2 |
6930925 | Guo et al. | Aug 2005 | B2 |
6934188 | Roohparvar | Aug 2005 | B2 |
6937511 | Hsu et al. | Aug 2005 | B2 |
6963505 | Cohen | Nov 2005 | B2 |
6972993 | Conley et al. | Dec 2005 | B2 |
6988175 | Lasser | Jan 2006 | B2 |
6992932 | Cohen | Jan 2006 | B2 |
7002843 | Guterman 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 |
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 |
7151692 | Wu | Dec 2006 | 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 |
7196928 | Chen | Mar 2007 | B2 |
7197594 | Raz et al. | Mar 2007 | B2 |
7200062 | Kinsely 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 |
7257027 | Park | Aug 2007 | B2 |
7259987 | Chen et al. | Aug 2007 | B2 |
7266026 | Gongwer et al. | 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 |
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 |
7310272 | Mokhlesi et al. | Dec 2007 | B1 |
7310347 | Lasser | Dec 2007 | B2 |
7321509 | Chen et al. | Jan 2008 | B2 |
7342831 | Mokhlesi 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 |
7388781 | Litsyn et al. | Jun 2008 | B2 |
7397697 | So 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 |
7420847 | Li | Sep 2008 | B2 |
7433231 | Aritome | Oct 2008 | B2 |
7437498 | Ronen | Oct 2008 | B2 |
7440324 | Mokhlesi | Oct 2008 | B2 |
7441067 | Gorobetz et al. | Oct 2008 | B2 |
7453737 | Ha | Nov 2008 | B2 |
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 |
7492641 | Hosono et al. | Feb 2009 | B2 |
7508710 | Mokhlesi | Mar 2009 | B2 |
7539062 | Doyle | May 2009 | B2 |
7551492 | Kim | Jun 2009 | B2 |
7568135 | Cornwell et al. | Jul 2009 | B2 |
7570520 | Kamei et al. | Aug 2009 | B2 |
7593259 | Kim et al. | Sep 2009 | B2 |
7596707 | Vemula | Sep 2009 | B1 |
7631245 | Lasser | Dec 2009 | B2 |
7633798 | Sarin et al. | Dec 2009 | B2 |
7633802 | Mokhlesi | Dec 2009 | B2 |
7656734 | Thorp et al. | Feb 2010 | B2 |
7660158 | Aritome | Feb 2010 | B2 |
7660183 | Ware et al. | Feb 2010 | B2 |
7742351 | Inoue et al. | Jun 2010 | B2 |
7761624 | Karamcheti et al. | Jul 2010 | B2 |
7810017 | Radke | Oct 2010 | B2 |
7848149 | Gonzalez et al. | Dec 2010 | B2 |
7885119 | Li | Feb 2011 | B2 |
20010002172 | Tanaka et al. | May 2001 | A1 |
20010006479 | Ikehashi et al. | Jul 2001 | A1 |
20020038440 | Barkan | Mar 2002 | A1 |
20020118574 | Gongwer et al. | Aug 2002 | A1 |
20020133684 | Anderson | Sep 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 |
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 |
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 |
20080270730 | Lasser et al. | Oct 2008 | A1 |
20080282106 | Shalvi 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 |
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 |
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 |
20100110580 | Takashima | May 2010 | A1 |
20100131697 | Alrod et al. | May 2010 | A1 |
20100142268 | Aritome | Jun 2010 | A1 |
20100142277 | Yang et al. | Jun 2010 | A1 |
20100169743 | Vogan et al. | Jul 2010 | A1 |
Number | Date | Country |
---|---|---|
0783754 | Jul 1997 | EP |
1434236 | Jun 2004 | EP |
1605509 | Dec 2005 | EP |
9610256 | Apr 1996 | WO |
9828745 | Jul 1998 | WO |
02100112 | Dec 2002 | WO |
03100791 | Dec 2003 | WO |
2007046084 | Apr 2007 | WO |
2007132452 | Nov 2007 | WO |
2007132453 | Nov 2007 | WO |
2007132456 | Nov 2007 | WO |
2007132458 | Nov 2007 | WO |
WO-2007132457 | Nov 2007 | WO |
2007146010 | Dec 2007 | WO |
2008026203 | Mar 2008 | WO |
2008053473 | May 2008 | WO |
WO-2008053472 | 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 |
Number | Date | Country | |
---|---|---|---|
20090106485 A1 | Apr 2009 | US |
Number | Date | Country | |
---|---|---|---|
60981113 | Oct 2007 | US | |
60989129 | Nov 2007 | US |