The present invention relates generally to memory devices, and particularly to memory devices having non-uniform programming levels.
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 analog values is typically divided into regions, each region corresponding to one or more data bit values. Data is written to an analog memory cell by writing a nominal analog value that corresponds to the desired bit or bits.
Some memory devices, commonly referred to as Single-Level Cell (SLC) devices, store a single bit of information in each memory cell, i.e., each memory cell can be programmed to assume two possible programming levels. Higher-density devices, often referred to as Multi-Level Cell (MLC) devices, store two or more bits per memory cell, i.e., can be programmed to assume more than two possible programming levels.
Flash memory devices are described, for example, by Bez et al., in “Introduction to Flash Memory,” Proceedings of the IEEE, volume 91, number 4, April, 2003, pages 489-502, which is incorporated herein by reference. Multi-level Flash cells and devices are described, for example, by Eitan et al., in “Multilevel Flash Cells and their Trade-Offs,” Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), New York, N.Y., pages 169-172, which is incorporated herein by reference. The paper compares several kinds of multilevel Flash cells, such as common ground, DINOR, AND, NOR and NAND cells.
Eitan et al., describe another type of analog memory cell called Nitride Read Only Memory (NROM) in “Can NROM, a 2-bit, Trapping Storage NVM Cell, Give a Real Challenge to Floating Gate Cells?” Proceedings of the 1999 International Conference on Solid State Devices and Materials (SSDM), Tokyo, Japan, Sep. 21-24, 1999, pages 522-524, which is incorporated herein by reference. NROM cells are also described by Maayan et al., in “A 512 Mb NROM Flash Data Storage Memory with 8 MB/s Data Rate”, Proceedings of the 2002 IEEE International Solid-State Circuits Conference (ISSCC 2002), San Francisco, Calif., Feb. 3-7, 2002, pages 100-101, which is incorporated herein by reference. Other exemplary types of analog memory cells are Floating Gate (FG) cells, Ferroelectric RAM (FRAM) cells, magnetic RAM (MRAM) cells, Charge Trap Flash (CTF) and phase change RAM (PRAM, also referred to as Phase Change Memory—PCM) cells. FRAM, MRAM and PRAM cells are described, for example, by Kim and Koh in “Future Memory Technology including Emerging New Memories,” Proceedings of the 24th International Conference on Microelectronics (MIEL), Nis, Serbia and Montenegro, May 16-19, 2004, volume 1, pages 377-384, which is incorporated herein by reference.
Cho at al., describe a multi-level Flash device having non-uniform threshold voltage distributions in “Multi-Level NAND Flash Memory with Non-Uniform Threshold Voltage Distribution,” IEEE International Solid-State Circuits Conference (ISSCC), San Francisco, Calif., Feb. 5-7, 2001, pages 28-29 and 424, which is incorporated herein by reference. The threshold voltage distributions of the device are non-uniform and are designed to account for various impairments such as adjacent word line interference, program disturbance, floating gate disturbance and charge loss.
Embodiments of the present invention provide a method for storing data in a memory that includes a plurality of analog memory cells, the method including:
defining a set of programming levels that represent respective combinations of at least first and second bits and are represented by respective nominal storage values;
storing the data in the memory by mapping the data to storage values selected from among the nominal storage values and writing the storage values to the memory cells;
defining a condition over two or more bit-specific error rates applicable respectively to at least the first and second bits, wherein the bit-specific error rates include a first bit-specific error rate computed over the data stored by the first bits in the memory cells and a second bit-specific error rate computed, separately from the first bit-specific error rate, over the data stored by the second bits in the memory cells; and
setting the nominal storage values based on the bit-specific error rates so as to meet the condition.
In some embodiments, the condition states that the two or more bit-specific error rates are equal to one another. In another embodiment, the condition states that the two or more bit-specific error rates are do not exceed respective two or more target error rates. In yet another embodiment, setting the nominal storage values includes maximizing a spacing among the nominal storage values within a maximum allowed range of the storage values. Alternatively, setting the nominal storage values may include minimizing a range occupied by the storage values.
In a disclosed embodiment, setting the nominal storage values includes estimating the bit-specific error rates for an initial setting of the nominal storage values, evaluating the condition responsively to the estimated bit-specific error rates, and modifying the nominal storage values so as to meet the condition. Estimating the bit-specific error rates may include reading second storage values from the cells, reconstructing the data by processing the read second storage values, detecting bit errors in the reconstructed data and calculating the bit-specific error rates responsively to the detected bit errors.
In an embodiment, storing the data includes encoding the data with an Error Correction Code (ECC), reconstructing the data includes decoding the ECC, and detecting the bit errors includes comparing the reconstructed data before decoding the ECC with the reconstructed data after decoding the ECC.
In another embodiment, when one of the bit-specific error rates is to be increased with respect to the other bit-specific error rates in order to meet the condition, modifying the nominal storage values includes identifying a pair of the programming levels, such that a read error between the identified pair of the programming levels contributes to the one of the bit-specific error rates, and reducing a spacing between a pair of the nominal storage values that are associated with the identified pair of the programming levels.
In yet another embodiment, when one of the bit-specific error rates is to be reduced with respect to the other bit-specific error rates in order to meet the condition, modifying the nominal storage values includes identifying a pair of the programming levels, such that a read error between the identified pair of the programming levels contributes to the one of the bit-specific error rates, and increasing a spacing between a pair of the nominal storage values that are associated with the identified pair of the programming levels.
In still another embodiment, estimating the bit-specific error rates, evaluating the condition and modifying the nominal storage values include running a computerized simulation that simulates the memory and produces the nominal storage values. Alternatively, estimating the bit-specific error rates, evaluating the condition and modifying the nominal storage values may be performed when the memory is operating in a host system.
In some embodiments, storing the data includes encoding the data with an Error Correction Code (ECC), and the bit-specific error rates include at least one error rate type selected from a group of types consisting of a pre-ECC error rate measured before decoding the ECC and a post-ECC error rate measured after decoding the ECC. In an embodiment, the data is partitioned into memory pages, and each of the at least first and second bits stores a respective different memory page.
In another embodiment, the method includes reading second storage values from the cells and canceling a distortion in at least some of the second storage values, and setting the nominal storage values includes setting the nominal storage values so as to meet the condition with respect to the second storage values in which the distortion was canceled. In yet another embodiment, the condition is further defined over a throughput of reading the data from the memory, and setting the nominal storage values includes setting the values responsively to the throughput.
There is additionally provided, in accordance with an embodiment of the present invention, a data storage apparatus, including:
a memory, which includes a plurality of analog memory cells;
read/write (R/W) circuitry, which is coupled to accept a definition of a set of programming levels that represent respective combinations of at least first and second bits and are represented by respective nominal storage values, and to store the data in the memory by mapping the data to storage values selected from among the nominal storage values and writing the storage values to the memory cells; and
a processor, which is configured to define a condition over two or more bit-specific error rates applicable respectively to at least the first and second bits, wherein the bit-specific error rates include a first bit-specific error rate computed over the data stored by the first bits in the memory cells and a second bit-specific error rate computed, separately from the first bit-specific error rate, over the data stored by the second bits in the memory cells, and to set the nominal storage values based on the bit-specific error rates so as to meet the condition.
There is also provided, in accordance with an embodiment of the present invention, a data storage apparatus, including:
an interface, which is coupled to communicate with a memory that includes a plurality of analog memory cells; and
a processor, which is connected to the interface and is configured to define a set of programming levels that represent respective combinations of at least first and second bits and are represented by respective nominal storage values, to store the data in the memory by mapping the data to storage values selected from among the nominal storage values and writing the storage values to the memory cells, to define a condition over two or more bit-specific error rates applicable respectively to at least the first and second bits, wherein the bit-specific error rates include a first bit-specific error rate computed over the data stored by the first bits in the memory cells and a second bit-specific error rate computed, separately from the first bit-specific error rate, over the data stored by the second bits in the memory cells, and to set the nominal storage values based on the bit-specific error rates so as to meet the condition.
There is further provided, in accordance with an embodiment of the present invention, a memory, including:
a plurality of analog memory cells; and
read/write (R/W) circuitry, which is coupled to accept a set of nominal storage values, which correspond to respective programming levels representing respective combinations of at least first and second bits, and to store the data in the memory by mapping the data to storage values selected from among the nominal storage values and writing the storage values to the memory cells, wherein the nominal storage values meet a condition, which is defined over two or more bit-specific error rates applicable respectively to at least the first and second bits, wherein the bit-specific error rates include a first bit-specific error rate computed over the data stored by the first bits in the memory cells and a second bit-specific error rate computed, separately from the first bit-specific error rate, over the data stored by the second bits in the memory cells.
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 a typical MLC configuration, each memory cell stores two or more data bits, and the cells are read by comparing their threshold voltages to a set of reference levels. A read error occurs when the threshold voltage of a given cell falls on the wrong side of a reference level and is therefore associated with the wrong programming level. Read errors are most likely to occur between adjacent programming levels. When the assignment of bit values to programming levels uses “Gray coding,” each read error between adjacent levels affects only a single bit.
Since the number of possible error events that affect each bit may not be the same for each MLC bit, different bits may have different Bit Error Rates (BERs). In some memory configurations, different MLC bits may be mapped to different memory pages, and therefore different pages may have different BERs. Uneven BER is often undesirable, for example because it increases the maximum possible number of errors per page. When the stored data is encoded with an Error Correcting Code (BCC), the capability of the ECC decoder is typically designed for the worst-case pages, and therefore the uneven BER complicates the ECC decoder and reduces the error correction capability of the code. In pages other than the worst-case pages, the ECC redundancy is often over-specified.
Embodiments of the present invention that are described hereinbelow provide methods and systems for controlling the BER of different MLC bits. The methods and systems described herein use the fact that, for a given pair of adjacent programming levels, the likelihood of read errors increases as the separation between the levels decreases, and vice versa. Therefore, the error rate associated with each pair of adjacent programming levels can be controlled by adjusting the separation between them.
In the methods and systems described herein, a memory system comprises an array of multi-level analog memory cells, and Read/Write (R/W) circuitry that programs and reads the cells. The R/W circuitry programs the cells with programming levels that are spaced non-uniformly on the voltage axis. The BERs associated with the different MLC bits are adjusted by controlling the spacing between programming levels. In configurations that use Gray coding, each bit-specific BER can be controlled irrespective of other BERs. In other configurations, several BERs are controlled jointly. The BER adjustment process may be performed a-priori, i.e., during the design of the memory system, and/or at any stage along the lifetime of the system.
In some embodiments, the programming levels are spaced so that the BERs associated with the different bits are approximately equal to one another. When different bits are mapped to different memory pages, the spacing may thus be adjusted so that each page has approximately the same BER. As a result, the maximum possible number of errors per page decreases, and the ECC correction capability can be improved accordingly. Alternatively, the programming levels can be spaced so as to achieve different target BERs for the different bits, or in order to meet other kinds of conditions. Several examples of non-uniform programming level configurations for four-level and eight-level MLC are described herein.
System 20 comprises a memory device 24, which stores data in a memory cell array 28. The memory array comprises multiple analog memory cells 32. In the context of the present patent application and in the claims, the term “analog memory cell” is used to describe any memory cell that holds a continuous, analog value of a physical parameter, such as an electrical voltage or charge. Array 32 may comprise analog memory cells of any kind, such as, for example, NAND, NOR and CTF Flash cells, PCM, NROM, FRAM, MRAM and DRAM cells.
The charge levels stored in the cells and/or the analog voltages or currents written into and read out of the cells are referred to herein collectively as analog values or storage values. Although the embodiments described herein mainly address threshold voltages, the methods and systems described herein may be used with any other suitable kind of storage values.
System 20 stores data in the analog memory cells by programming the cells to assume respective memory states, which are also referred to as programming levels. The programming levels are selected from a finite set of possible levels, and each level corresponds to a certain nominal storage value. For example, a 2 bit/cell MLC can be programmed to assume one of four possible programming levels by writing one of four possible nominal storage values into the cell.
Memory device 24 comprises a reading/writing (R/W) unit 36, which converts data for storage in the memory device to analog storage values and writes them into memory cells 32. In alternative embodiments, the R/W unit does not perform the conversion, but is provided with voltage samples, i.e., with the storage values for storage in the cells. The R/W unit typically programs the cells using an iterative Program and Verify (P&N) 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.
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 encodes the data for storage using a suitable Error Correction Code (ECC) and decodes the ECC of data retrieved from the memory. In some embodiments, unit 48 produces the storage values for storing in the memory cells and provides these values to R/W unit 36. Alternatively, unit 48 provides the data for storage, and the conversion to storage values is carried out by the R/W unit internally to the memory device. Alternatively to using an MSP, the methods described herein can be carried out by any suitable type of memory controller that applies ECC to the data.
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
Memory cells 32 of array 28 are typically arranged in a grid having multiple rows and columns. Each cell 32 typically comprises a floating gate Metal-Oxide Semiconductor (MOS) transistor. A certain amount of electrical charge (electrons or holes) can be stored in a particular cell by applying appropriate voltage levels to the transistor gate, source and drain. The value stored in the cell can be read by measuring the threshold voltage of the cell, which is defined as the minimal voltage that needs to be applied to the gate of the transistor in order to cause the transistor to conduct. The read threshold voltage is indicative of the charge stored in the cell.
In a typical configuration of array 28, 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 array is typically divided into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously. Pages are sometimes sub-divided into sectors. In some embodiments, each page comprises an entire row of the array. In alternative embodiments, each row (word line) can be divided into two or more pages. For example, in some devices each row is divided into two pages, one comprising the odd-order cells and the other comprising the even-order cells. In a typical implementation, a two-bit-per-cell memory device may have four pages per row, a three-bit-per-cell memory device may have six pages per row, and a four-bit-per-cell memory device may have eight pages per row.
Erasing of cells is usually carried out in blocks that contain multiple pages. Typical memory devices may comprise several thousand erasure blocks. In a typical two-bit-per-cell MLC device, each erasure block is on the order of 32 word lines, each comprising several thousand cells. Each word line of such a device is often partitioned into four pages (odd/even order cells, least/most significant bit of the cells). Three-bit-per cell devices having 32 word lines per erasure block would have 192 pages per erasure block, and four-bit-per-cell devices would have 256 pages per block. Alternatively, other block sizes and configurations can also be used.
Some memory devices comprise two or more separate memory cell arrays, often referred to as planes. Since each plane has a certain “busy” period between successive write operations, data can be written alternately to the different planes in order to increase programming speed.
The different data bits stored in a given cell are often referred to as having different significances. For example, when a four-level cell stores “10” data, the “1” bit may be regarded as the Most Significant Bit (MSB), and the “0” bit may be regarded as the Least Significant Bit (LSB). In the context of the present patent application, terms such as “bit significance,” LSB and MSB are used for referring to certain bits of a cell or group of cells, and do not mean that some bits are more significant or important than others. Alternatively, other suitable conventions can be used. For example, the first bit may be referred to as “bit 0” and the second as “bit 1.”
In some embodiments, a group of memory cells stores multiple memory pages, such that each page is mapped to a different bit. For example, in a given word line, the LSBs of the cells may store a certain memory page, while another page may be stored in the MSBs. Similar mapping arrangements may be carried out in eight-level cells or in cells that store any other number of bits.
The cells are programmed to the different levels by writing nominal threshold voltages to the cells, with each nominal threshold voltage corresponding to a certain programming level. Distributions 56A . . . 56D demonstrate that the actual threshold voltages of the cells typically vary from the nominal threshold voltages due to various inaccuracies and impairments, such as charge loss due to aging, cell wearing due to previous programming and erasure operations, cross-coupling interference, programming disturb and other effects.
Data is read from the memory cells by comparing their threshold voltages to read reference levels (also referred to as read thresholds). In the example of
A read error occurs when the voltage read from a cell falls on the wrong side of a reference level, and is therefore associated with a wrong programming level. For example, the voltage of a cell that was originally programmed to store “10” data (i.e., programmed to level L1) may drift over time. If the voltage drifts and becomes, for example, lower than TH1, the cell will be read as storing “11” data. Thus, The MSB of this cell will be read correctly, but the LSB will have a read error.
Most read errors occur between adjacent programming levels. For this reason, the assignment of bit values to programming levels often uses “Gray coding,” in which adjacent programming levels are assigned bit combinations that differ in only a single bit. When using Gray coding, a read error between adjacent programming levels causes only a single bit error. In
When each cell stores multiple bits, different bits may have different Bit Error Rates (BER), since the number of possible error events that affect each bit may not be the same. Consider, for example, the scheme of
Thus, assuming the data stored in the memory cells is distributed approximately evenly among the programming levels, and assuming that errors between adjacent programming levels are dominant, the BER of the LSB is approximately double the BER of the MSB. When different memory pages are stored in different MLC bits, the average BER may differ from one page to another.
Having a BER that differs from one cell group to another is often undesirable. For example, when the data in each page is encoded by an ECC, the ECC is typically designed based on the expected raw, uncoded BER of the cells. When different pages have different BERs, the ECC typically has to cope with the uncoded BER of the worse-performing pages.
For a given pair of adjacent programming levels, the likelihood of read errors increases when the separation between the levels decreases, and vice versa. Therefore, the error rate associated with each pair of adjacent programming levels can be controlled by adjusting the separation between them.
Embodiments of the present invention provide methods and systems for controlling the BER of different MLC bits by programming the cells with programming levels that are spaced non-uniformly on the voltage axis. In some embodiments, the programming levels are spaced so that the BERs associated with the different bits are approximately equal to one another. Alternatively, the programming levels can be spaced so as to achieve different target BERs for the different bits, or in order to meet other kinds of conditions.
As noted above, each programming level represents a certain combination of bits and is represented by a nominal threshold voltage. In order to store a certain bit combination in a given cell, the R/W unit writes the nominal threshold voltage that corresponds to the desired bit combination, so as to program the cell to the appropriate programming level. The methods and systems described herein control the separation between programming levels by setting or adjusting the values of the nominal threshold voltages.
The bit-specific BERs can be calculated using any suitable method. For example, the error performance of the different bits can be estimated by simulation. Alternatively, when the threshold voltage distributions are known analytically, the bit-specific BERS can sometimes be computed or approximated analytically or numerically. Further alternatively, when the method is carried out during operation of the memory in a host system, the bit-specific error rates can be measured on training data or on actual data, such as by comparing the decoded data before and after ECC decoding.
The separation between distributions 68B and 68C in the non-uniform scheme is smaller than the spacing between the corresponding distributions 56B and 56C of the uniform scheme. In other words, the error rate associated with reference level TH2 (which, as explained above, affects only the MSB) has been increased in the non-uniform scheme in comparison with the uniform scheme.
On the other hand, the separation between levels L0 and L1 and the separation between levels L2 and L3 is higher in the non-uniform scheme than in the uniform scheme. Therefore, the error rates associated with reference levels TH1 and TH3 (which, as explained above, affect only the LSB) have been reduced in the non-uniform scheme in comparison with the uniform scheme.
In total, the non-uniform scheme has a higher MSB BER and a lower LSB BER in comparison with the uniform scheme. Adjusting the level separations appropriately can equalize the two BER values.
In the description that follows, the three bits stored in each cell are referred to as a MSB, a Central Significant Bit (CSB) and a LSB. The assignment of bit combinations to programming levels uses Gray coding, so that a read error between any given pair of adjacent levels affects only one of the three bits. The bits affected by each type of read error are given in the following table:
Out of the seven possible error types (seven pairs of adjacent programming levels), four error types affect the LSB, two types affect the CSB, and only a single error type affects the MSB. Errors in the MSB are particularly rare, since six out of the eight programming levels have only adjacent levels that are mapped to the same MSB value. If these eight-level cells were to use uniformly-spaced programming levels, the ratio between the LSB BER, CSB BER and MSB BER would have been approximately 4:2:1.
In order to equalize the BERs of the three bits, the programming levels in the scheme of
Determining the relative level separations typically depends on the target BERs of the pages. In some embodiments, the target BERs are chosen such that after the relative level separations are determined, the level positions occupy the entire allowed voltage range. This technique maintains a similar voltage range as some conventional schemes that use uniformly-spaced programming levels. The worst-case BER is improved with respect to these uniform schemes, thus allowing the ECC scheme to use less redundancy bits.
Alternatively, the target BERs of the different pages can be chosen to be the same as the worst-case BER of the conventional schemes that use uniformly-spaced levels. In these embodiments, the ECC scheme typically uses a similar number of redundancy bits as the comparable uniform schemes. When using the methods described herein, however, the non-uniform programming levels occupy a smaller voltage range than the range occupied by the comparable uniform scheme. The use of a smaller voltage range can be a significant advantage, since some memory technologies have limits on the allowed voltage range. Additionally, some impairment mechanisms (e.g. program disturb) are more severe when the voltage range is larger.
The following example demonstrates the use of non-uniform programming levels for decreasing the voltage range. Consider a conventional uniformly-spaced scheme, which is used as a reference, in which the BER of the worst-case page is 1.3·10−3. The reference scheme is a 3 bits/cell scheme, which comprises eight voltage levels and uses Gray mapping, as shown in
The LSB page in the present example has the worst BER. Solving Q(Δ/2)=1.3-10−3, we get Δ=6. Thus, the voltage range between the lowest and highest voltage level positions is 7*6=42. On the other hand, when using the non-uniform spacing schemes described herein, a spacing of 6 is used only for the levels that affect the LSB page, i.e., for the spacing between levels L0-L1, L2-L3, L4-L5 and L6-L7. For the levels that affect the CSB page, the level separations are determined by solving Q(Δ/2)/2=1.3·10−3, which gives Δ=5.6. This spacing applies to the spacing between levels L1-L2 and L5-L6. Finally, for the levels that affect the MSB, the level separations are determined by solving Q(Δ/2)/4=1.3·10−3, which gives Δ=5.12. This spacing applies only to the spacing between levels L3-L4. Using the three different level separations, the voltage range between the lowest and highest voltage level positions is given by 4*6+2*5.6+5.12=40.32. In comparison with the reference uniformly-spaced scheme, the non-uniform scheme can reduce the voltage range from 42 to 40.32, i.e., by 4%, using the same ECC and for the same target BER.
Other conditions that use the allowed voltage range as a constraint can also be used. Note that the calculations given above assume that all programming levels have approximately the same distribution width. If different levels have different distribution widths, the ratios among the BERs of the LSB, CSB and MSB pages (for uniform level spacing) may vary from the 4:2:1 ratios, as determined by the actual level distributions.
The methods and systems described herein can be used not only for equalizing the different bit-specific BERs but to achieve other criteria, as well. In general, the separation between programming levels can be set according to various other conditions that are defined in terms of the bit-specific error rates. For example, a certain condition may state that each bit-specific BER should not exceed a respective target error rate. The target error rates may differ from one another. Such a condition may be advantageous, for example, when different pages store different types of data having different reliability requirements.
In some embodiments, the ECC decoding process decodes the ECC by processing soft metrics. Methods for soft ECC decoding in memory devices are described, for example, in PCT Application WO 2007/132457, entitled “Combined Distortion Estimation and Error Correction Coding for Memory Devices, filed May 10, 2007, whose disclosure is incorporated herein by reference. When soft ECC decoding is used, equalizing the BER before ECC decoding (referred to as pre-ECC BER) does not necessarily produce optimal programming level positions. In these scenarios, choosing the programming level positions such that the post-ECC BER (i.e., the BER after soft ECC decoding) will be equal for all pages is sometimes advantageous. Thus, the bit-specific error rates and the target condition defined over these error rates may be specified in terms of pre-ECC BER, post-ECC BER, or both. Another possible criterion is to equalize the Shannon capacity for all pages.
The examples given above refer to Gray-coded configurations, in which the level spacing can be adjusted separately for each bit. However, the methods and systems described herein can also be used in configurations that do not use Gray coding. In these cases, the level separations are typically determined jointly for a number of bits, analytically or by simulation. For high BER values, the level positions should also take into account errors among non-adjacent programming levels, and the level separations should then be designed jointly, in a similar manner to the non-Gray case.
The methods described herein may be applied a-priori, i.e., during a design phase of the memory. Additionally or alternatively, the spacing between programming levels can be adjusted during operation of the memory device in a host system, such as by the MSP or by a suitable memory controller. Thus, the separation between programming levels can track changes in voltage distributions and/or data characteristics that occur throughout the lifetime of the memory.
The methods described herein can be combined with distortion cancellation. In some embodiments, the MSP applies techniques for reducing or canceling various types of distortion in the cell voltages, such as cross-coupling, disturb noise or any other kind of distortion. Distortion cancellation techniques are described, for example, in PCT Application WO 2007/132457, cited above, PCT Application WO 2007/132453, entitled “Distortion Estimation and Cancellation in Memory Devices,” filed May 10, 2007, and PCT Application WO 2007/132452, entitled “Reducing Programming Error in Memory Devices,” filed May 10, 2007, whose disclosures are incorporated herein by reference. When applying distortion cancellation, the MSP may determine the positions of the programming levels such that the desired criterion (e.g. equal BER for MSB, CSB, and LSB pages) is satisfied after distortion cancellation has been performed.
When some residual distortion is not canceled, the programming level positions are typically chosen such that the desired criterion (e.g. equal BER for all pages) is satisfied in the presence of the remaining distortion. For example, in some. NAND Flash memory devices, the voltage levels tend to shift over time due to leakage of electric charge from the floating gates of the cells. Different programming levels may suffer from different amounts of shift. In some embodiments, the level positions are designed such that at the worst expected scenario, after the levels have already shifted, the desired criterion is satisfied.
In some embodiments, such as when the MSP applies soft decoding and/or distortion cancellation, the memory cells are typically read more than once using different reference levels. In these embodiments, the number of re-read operations that are applied to a certain page may depend on the separation between the programming levels that affect this page. For example, a larger separation between programming levels may enable the MSP to reduce the number of re-read operations, and vice versa. The number of re-read operations determines the achievable read throughput. Therefore, in some embodiments, the condition that determines the programming level positions may take the read throughput into account. For example, the programming level positions may be set so that a certain minimum read throughput is maintained while still meeting the target BERs.
Although the embodiments described herein refer to four-level and eight-level MLC, the methods and systems described herein can be used in any other type of MLC storing any number of bits. Although the embodiments described herein mainly address data storage in solid-state memory devices, the principles of the present invention can also be used for data storage in other types of storage devices, such as Hard Disk Drives (HDD).
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/949,515, filed Jul. 13, 2007 and U.S. Provisional Patent Application 61/022,343, filed Jan. 20, 2008, 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 |
5172338 | Mehrotra 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 |
5541886 | Hasbun | Jul 1996 | A |
5600677 | Citta et al. | Feb 1997 | A |
5657332 | Auclair et al. | Aug 1997 | A |
5675540 | Roohparvar | Oct 1997 | A |
5682352 | Wong et al. | Oct 1997 | A |
5696717 | Koh | Dec 1997 | A |
5726649 | Tamaru et al. | Mar 1998 | A |
5742752 | De Koning | Apr 1998 | A |
5751637 | Chen et al. | May 1998 | A |
5761402 | Kaneda et al. | Jun 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 |
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 |
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 | Gonzalez et al. | Sep 2003 | B2 |
6643169 | Rudelic 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 |
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 | Gonzalez et al. | Mar 2006 | B2 |
7020017 | Chen et al. | Mar 2006 | B2 |
7023735 | Ban et al. | Apr 2006 | B2 |
7031210 | Park et al. | Apr 2006 | B2 |
7031214 | Tran | Apr 2006 | B2 |
7031216 | You | Apr 2006 | B2 |
7039846 | Hewitt et al. | May 2006 | B2 |
7042766 | Wang et al. | May 2006 | B1 |
7054193 | Wong | May 2006 | B1 |
7054199 | Lee et al. | May 2006 | B2 |
7057958 | So et al. | Jun 2006 | B2 |
7065147 | Ophir et al. | Jun 2006 | B2 |
7068539 | Guterman et al. | Jun 2006 | B2 |
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 | Gonzalez et al. | Feb 2007 | B2 |
7177199 | Chen et al. | Feb 2007 | B2 |
7177200 | Ronen et al. | Feb 2007 | B2 |
7184338 | Nakagawa et al. | Feb 2007 | B2 |
7187195 | Kim | Mar 2007 | B2 |
7187592 | Guterman et al. | Mar 2007 | B2 |
7190614 | Wu | Mar 2007 | B2 |
7193898 | Cernea | Mar 2007 | B2 |
7193921 | Choi et al. | Mar 2007 | B2 |
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 | Tanzawa | 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 |
7397697 | So et al. | Jul 2008 | B2 |
7408804 | Hemink 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 |
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 |
7570520 | Kamei et al. | Aug 2009 | B2 |
7593259 | Kim et al. | Sep 2009 | B2 |
7596707 | Vemula | Sep 2009 | B1 |
7631245 | Lasser | 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 |
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 |
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 | 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 |
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 |
20060203546 | Lasser | Sep 2006 | A1 |
20060218359 | Sanders et al. | Sep 2006 | A1 |
20060221705 | Hemink et al. | Oct 2006 | A1 |
20060221714 | Li et al. | Oct 2006 | A1 |
20060239077 | Park et al. | 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 |
20070118713 | Guterman et al. | May 2007 | A1 |
20070143378 | Gorobets | 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 |
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 |
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 |
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 |
20080263262 | Sokolov et al. | Oct 2008 | A1 |
20080282106 | Shalvi et al. | Nov 2008 | 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 |
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 |
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 |
20100142277 | Yang et al. | Jun 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 |
2007046084 | Apr 2007 | WO |
2007132456 | Nov 2007 | WO |
2007132458 | Nov 2007 | WO |
WO 2007132452 | Nov 2007 | WO |
WO 2007132453 | Nov 2007 | WO |
WO 2007132457 | 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 |
Number | Date | Country | |
---|---|---|---|
60949515 | Jul 2007 | US | |
61022343 | Jan 2008 | US |