The present invention relates generally to memory devices, and particularly to methods and systems for programming 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 holds a certain level of a given physical quantity such as an electrical charge or voltage, which represents the data stored in the cell. The levels of this physical quantity are also referred to as storage values or analog values. 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 a programming state that represents 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, 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.
Various methods and systems for programming memory cells are known in the art. For example, PCT International Publication WO 2008/083131, whose disclosure is incorporated herein by reference, describes a method for programming non-volatile storage elements. A trial programming process is performed for a first set of one or more non-volatile storage elements to test usage of the non-volatile storage system. Based on this trial programming, a programming signal is calibrated by adjusting its initial magnitude. The calibrated programming signal is then used to program a second set of non-volatile storage elements.
PCT International Publication WO 2008/124760, whose disclosure is incorporated herein by reference, describes a predictive programming mode for programming an array of non-volatile memory cells, which are individually programmable to one of a range of threshold voltage levels. A predetermined function predicts what programming voltage level needs to be applied in order to program a given memory cell to a given target threshold voltage level. In an embodiment, the predetermined function is linear and is calibrated for each memory cell under programming by one or more checkpoints. The checkpoint is an actual programming voltage that programs the memory cell in question to a verified designated threshold voltage level.
An embodiment of the present invention provides a method for data storage in analog memory cells, including:
defining multiple programming states for storing data in the analog memory cells, such that the programming states represent respective combinations of more than one bit and correspond to respective, different levels of a physical quantity stored in the memory cells; and
storing the data in the memory cells by applying to the memory cells programming pulses that cause the levels of the physical quantity stored in the memory cells to transition between the programming states, such that a given transition is caused by only a single programming pulse.
In some embodiments, the method includes measuring respective values of a property of the memory cells, and setting respective amplitudes of the programming pulses applied to the memory cells responsively to the measured values of the property. In a disclosed embodiment, setting the amplitudes includes setting a first amplitude of a first programming pulse for causing a transition between a given pair of the programming states in a first memory cell, and setting a second amplitude, different from the first amplitude, of a second programming pulse for causing the transition between the given pair of the programming states in a second memory cell, different from the first memory cell.
In an embodiment, the property includes a responsiveness of the memory cells to the programming pulses. Additionally or alternatively, the property may include a number of prior Programming and Erasure (P/E) cycles applied to the memory cells. Further additionally or alternatively, the property may include a temperature of the memory cells. In another embodiment, the memory cells are divided into multiple groups, and setting the amplitudes includes setting a respective common amplitude for the memory cells in each of the groups. In some embodiments, the method includes setting one or more reading parameters responsively to the measured values of the property, and reading the data from the memory cells using the reading parameters. The reading parameters may include respective positions of one or more read thresholds that are used for reading the data from the memory cells. In some embodiments, setting the amplitudes includes applying respective calibration pulses to the memory cells, sensing the respective levels of the physical quantity that are stored in the memory cells by the calibration pulses, and calculating the amplitudes based on the sensed levels of the physical quantity.
In an embodiment, the method includes retrieving the data from the memory cells by sensing the respective levels of the physical quantity so as to determine the programming states of the memory cells, and reconstructing the data based on the determined programming states. In a disclosed embodiment, storing the data includes encoding the data with an Error Correction Code (ECC), and reconstructing the data includes decoding the ECC. In another embodiment, reconstructing the data includes canceling interference that distorts the levels of the physical quantity of the memory cells. In yet another embodiment, retrieving the data includes determining the programming states by comparing the sensed levels of the physical quantity to one or more read thresholds, and adjusting respective positions of the read thresholds so as to successfully reconstruct the data.
There is additionally provided, in accordance with an embodiment of the present invention, a method for data storage in analog memory cells, including:
defining multiple programming states for storing data in the analog memory cells, such that the programming states represent respective combinations of more than one bit and correspond to respective, different levels of a physical quantity stored in the memory cells; and
storing the data in the memory cells by applying to the memory cells programming pulses that cause the levels of the physical quantity stored in the memory cells to transition between the programming states, such that a given transition is caused by one or more programming pulses that are applied without verifying the levels of the physical quantities caused by the programming pulses.
There is also provided, in accordance with an embodiment of the present invention, a data storage apparatus, including:
a plurality of analog memory cells, for which multiple programming states are defined, such that the programming states represent respective combinations of more than one bit and correspond to respective, different levels of a physical quantity stored in the memory cells; and
circuitry, which is coupled to the memory cells and is configured to store data in the memory cells by applying to the memory cells programming pulses that cause the levels of the physical quantity stored in the memory cells to transition between the programming states, such that a given transition is caused by only a single programming pulse.
The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:
Analog memory cells typically hold certain levels of a physical quantity (e.g., electrical charge), which represent the data stored in the cells. Multiple programming states are typically defined, such that each programming state represents a certain stored data value and corresponds to a certain level of the physical quantity.
Analog memory cells are often programmed by applying programming pulses to the cells. The programming pulses change the levels of the physical quantity stored in the cells, and thus transition the cells from one programming state to another. In some cases, a programming operation transitions a given memory cell from an erased state to a non-erased state. In other cases, e.g., in a multi-level cell, the memory cell may already be programmed to a certain non-erased state, and the programming operation transitions the cell to another programming state.
Embodiments of the present invention that are described hereinbelow provide improved methods and systems for programming analog memory cells. The methods and systems described herein are particularly suitable for MLC devices, i.e., memory cells that store more than one bit per cell, but can be used with SLC devices, as well. The methods and systems described herein program the memory cells such that a given state transition is carried out by applying only a single programming pulse. Unlike some known programming methods that apply sequences of programming pulses and/or verify the cell values after programming, the methods and systems described herein apply the single programming pulses in open loop, without verification. As a result, high programming speed can be achieved.
In many practical cases, however, the responsiveness of memory cells to programming pulses may differ considerably from one cell or cell group to another. In such cases, applying programming pulses in open loop may cause the levels of the physical quantity stored in the cells to have a wide distribution, which increases the likelihood of read errors. Several methods for narrowing and controlling the mean values of these distributions, without compromising the speed of open-loop single-pulse programming, are described herein.
In some embodiments, the amplitudes of the programming pulses are adjusted prior to data storage based on various properties of the memory cells. When using such an adjustment process, the amplitudes of the programming pulses applied to a given memory cell or group of cells are matched to the properties of that memory cell or cell group. Thus, the physical quantity levels assumed by the cells in response to the programming operation have a relatively narrow distribution having a controlled mean value, even though the responsiveness of different cells or groups of cells to programming may vary considerably. Additionally or alternatively, techniques such as read threshold tracking and Error Correction Coding (ECC) may be used to achieve good error performance in the presence of the relatively wide distributions caused by open-loop programming.
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 level of a physical quantity, 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 may comprise Single-Level Cells (SLC) or Multi-Level Cells (MLC, also referred to as multi-bit 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 states are selected from a finite set of possible states, and each state corresponds to a certain nominal storage value. For example, a 2 bit/cell MLC can be programmed to assume one of four possible programming states by writing one of four possible nominal storage values to the cell. The number of bits stored in each cell is not necessarily integer. In other words, the number of programming states may not necessarily be a power of 2. For example, three programming states can be defined per memory 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. 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 R/W unit typically reads data from cells 32 by comparing the storage values of the cells to one or more read thresholds. Data is typically written to and read from the memory cells in groups that are referred to as pages. In some embodiments, the R/W unit can erase a group of cells 32 by applying one or more negative erasure pulses to the cells.
The storage and retrieval of data in and out of memory device 24 is performed by a memory controller 40. In some embodiments, controller 40 produces the storage values for storing in the memory cells and provides these values to R/W unit 36. Alternatively, controller 40 may provide the data for storage, and the conversion to storage values is carried out by the R/W unit internally to the memory device.
Memory controller 40 communicates with a host 44, for accepting data for storage in the memory device and for outputting data retrieved from the memory device. In some embodiments, some or even all of the functions of controller 40 may be implemented in hardware. Alternatively, controller 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, commonly referred to as word lines and bit lines, respectively. The array is typically divided into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously. Cells are typically erased in groups of word lines that are referred to as erasure blocks. In some embodiments, a given memory devices comprises multiple memory cell arrays, which may be fabricated on separate dies.
R/W unit 36 programs memory cells 32 by applying programming pulses (e.g., voltage pulses) to the cells. For example, when cells 32 comprise floating-gate Flash cells, the R/W unit applies programming pulses to the gates of the cells. In a typical Flash device configuration, the gates of multiple cells are connected to a common word line, and the R/W unit is able to program multiple cells in parallel by applying programming pulses to the word line.
A given programming pulse causes a given memory cell to assume a given storage value, which corresponds to a certain level of a physical quantity. For example, in a Flash memory cell, a given programming pulse causes the memory cell to accumulate a given amount of electrical charge, so as to assume a given threshold voltage. The description that follows refers mainly to Flash cells whose charge levels (or threshold voltages) represent stored data. Alternatively, however, the methods and systems described herein can be used with various other sorts of analog memory cells that hold various other kinds of physical quantities and storage values.
Memory cells 32, or groups of cells 32, may differ from one another in their responsiveness to programming pulses. The term “responsiveness to programming” is used to describe the extent to which a given memory cell reacts to a given programming pulse in assuming its intended physical quantity level or storage value. When a programming pulse having a given amplitude is applied to multiple memory cells, some cells (referred to as low-responsiveness cells) may accumulate less charge and assume a lower threshold voltage, while other cells (referred to as high-responsiveness cells) may accumulate more charge and assume a higher threshold voltage. In other words, responsiveness to programming is a relative measure, which compares the physical quantities or storage values assumed by different cells or groups of cells in response to a certain programming pulse or pulses.
The difference in responsiveness to programming pulses among different cells is one of the factors that cause the storage values of the cells to vary from their intended target levels after programming. The storage values in a group of N-level memory cells will typically be distributed around the N nominal storage values that represent the N programming states.
The variance of the storage value distributions, and the separation between the distributions, have a considerable detrimental effect on the storage reliability of the memory cells, i.e., on the probability of read errors. As noted above, reading data from the memory cells is typically performed by comparing their storage values to one or more read thresholds, attempting to associate the read storage values to the programming states correctly. When the distributions are wide and/or closely-spaced, the likelihood of storage values to fall on the wrong side of a read threshold increases. This effect is particularly severe in multi-level memory cells, in which the separation between adjacent programming states is relatively small.
For a given memory cell, a given programming operation can be viewed as a transition from one programming state of the cell to another. Consider, for example, a four-level cell in which four programming states denoted L1 . . . L4 are represented by four respective nominal threshold voltages. Such a cell can store two data bits. In the present example, memory states L1 . . . L4 represent the bit combinations “11”, “10”, “00” and “01”, respectively. State L1 also represents an erased state (i.e., when a block of cells is erased, the cells in the block are set to state L1, which is often represented by a negative threshold voltage). In this example, programming an erased cell to store “01” data can be viewed as a transition from state L1 to state L4. When a cell is already at state L3 (i.e., holds the data “00”, the cell can be programmed to store “01” using a transition from state L3 to state L4.
Embodiments of the present invention provide improved methods and systems for programming analog memory cells. The methods and systems described herein carry out a given state transition by applying only a single programming pulse. As a result, programming operations applied to the memory cells are extremely fast and enable high programming speed. In some embodiments, the amplitude of the programming pulse applied to a given cell is pre-calculated based on certain properties of the cell, so as to control the mean value and reduce the variance of the resulting storage value distributions.
In an example calibration process, controller 40 applies calibration pulses having known amplitudes to cells or groups of cells. The memory controller then reads the storage values assumed by the cells in response to the calibration pulses. Using the read results, the memory controller assesses the responsiveness of each cell or group of cells to programming. The calibration results may be stored in memory controller 40 or in memory device 24 for later use.
The calibration process may be performed at any desired stage during the lifetime of device 24, such as during production, during power-up or initialization of the memory device in a host system, or even during normal operation of the memory device in the host system (e.g., during idle periods in which memory access operations are not performed).
The memory controller may assess the responsiveness to programming of individual cells, or collectively for groups of cells, e.g., word lines. In an example embodiment, the memory controller may hold a nominal pulse amplitude that is to be applied to a certain word line in order to cause a certain state transition. Based on the calibration results, the memory controller may compute an offset from the nominal pulse amplitude for each word line. The offset corresponding to a given word line can be used to scale the programming pulses applied to this word line.
When intending to store data in memory cells 32, memory controller 40 calculates the appropriate amplitudes of the programming pulses to be applied to the memory cells based on the calibration results, at an amplitude calculation step 54. The memory controller programs the cells by applying the programming pulses, at a programming step 58. Each cell is programmed by applying a single programming pulse. In other words, each transition between programming states in a given cell is performed by applying a single programming pulse.
When programming the cells, the memory controller sets the amplitudes of the programming pulses to the values calculated at step 54 above. Since the amplitude of each programming pulse is matched to the properties of the cell in which the pulse is applied, the distribution of storage values assumed by the cells is relatively narrow. As a result, the likelihood of subsequent read errors is reduced.
In the description above, the amplitudes of programming pulses are adjusted based on the estimated programming responsiveness of the cells. Additionally or alternatively, system 20 may calculate the pulse amplitudes based on any other suitable property of cells 32, such as, for example, the number of Programming and Erasure (P/E) cycles the cells have gone through, or the temperature of the memory device. Since the programming responsiveness of the cells may vary with the number of P/E cycles, the calibration process described above may be repeated periodically in order to account for these changes. When the memory device employs wear leveling techniques that distribute P/E cycles evenly among different cell groups, periodic calibration may be performed for the entire memory device. When different cell groups differ from one another considerably in the number of P/E cycles, each cell group can be calibrated at suitable time intervals, as appropriate.
Further additionally or alternatively, the dependence of the calibration results (e.g., offsets to programming pulse amplitudes) on the number of P/E cycles can be studied and modeled a-priori, and then compensated for during operation without a need for periodic calibration. This a-priori modeled dependence can also be used as side information that assists or complements the periodic calibration process.
In some embodiments, system 20 employs certain techniques for enhancing the performance of reading data from memory cells 32, in conjunction with the single-pulse programming schemes described above. These reading techniques may either replace the pre-programming calibration processes described above, or complement such calibration processes. In either case, such reading techniques are able to reliably reconstruct the stored data even though the storage value distributions in cells 32 may have relatively high variances. Moreover, reading techniques are sometimes used to compensate for cross-coupling interference from neighboring cells, which may be present in the storage values of cells 32.
For example, memory controller 40 may encode the stored data using an Error Correction Code (ECC), such as a Low-Density Parity Check (LDPC) code, a Bose-Chaudhuri-Hocquenghem (BCH) code or any other suitable ECC. Additionally or alternatively, the memory controller may employ methods for canceling cross-coupling interference and other distortion in the storage values of the memory cells. Further additionally or alternatively, the memory controller may apply methods that adaptively track and adjust the values of the read thresholds used for reading the data from the memory cells.
In some embodiments, the memory controller may use a separate set of reading parameters (e.g., read thresholds) for each group of cells (e.g., for each word line, block or memory cell array). In some embodiments, the reading parameters (e.g., values of read thresholds) can be set based on the calibration results described above.
Techniques for adaptively adjusting read threshold values are described, for example, in PCT International Publications WO 2008/053472 and WO 2008/111058, whose disclosures are incorporated herein by reference. Techniques for estimating and cancelling distortion in memory cells are described, for example, in PCT International Publications WO 2007/132452, WO 2007/132453, WO 2007/132457 and WO 2008/026203, whose disclosures are incorporated herein by reference. ECC techniques for use in analog memory cells are described, for example, in PCT International Publication WO 2007/132457, cited above.
In the description of
When programming is initiated, all cells are assumed to be erased, i.e., in state E. Programming of the first page is shown in the top half of the figure. The first page is programmed by applying a single pulse (denoted PULSE1 in the figure) to the cells in which the first bit is “0”. After this programming operation, the cells in which the first bit is “0” are transitioned to state L2, while the cells in which the first bit is “1” remain in state E.
The second bit is programmed as follows: For cells that are in state E and in which the second bit is “0”, a single pulse denoted PULSE2 is applied, causing these cells to transition to state L1. For cells that are in state E and in which the second bit is “1”, no pulse is applied and these cells remain in state E. For cells that are in state L2 and in which the second bit is “1”, a single pulse denoted PULSE3 is applied, causing these cells to transition to state L3. For cells that are in state L2 and in which the second bit is “0”, no pulse is applied and these cells remain in state L2. Thus, the group of four-level cells is programmed to store two memory pages by selectively applying three programming pulses, such that each state transition is carried out using only a single programming pulse.
In the present example, the nominal storage values of states L1, L2 and L3 are 1V, 2V and 3V, respectively. The amplitudes of pulses PULSE1, PULSE2 and PULSE3 are set, using the calibration methods described above, to 17V, 16V and 18V, respectively. The three pulses are assumed to have the same time duration. In alternative embodiments, any other suitable values can also be used. Note that the programming order shown in
It will 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 61/030,240, filed Feb. 21, 2008, and U.S. Provisional Patent Application 61/031,712, filed Feb. 27, 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 | 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 |
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 | 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 |
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 | 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 | 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 |
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 | 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 |
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 |
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 |
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 |
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 |
2007046084 | Apr 2007 | WO |
2007132452 | Nov 2007 | WO |
2007132453 | Nov 2007 | WO |
2007132456 | Nov 2007 | WO |
2007132457 | Nov 2007 | WO |
2007132458 | Nov 2007 | WO |
2007146010 | Dec 2007 | WO |
2008026203 | Mar 2008 | WO |
2008053472 | May 2008 | WO |
2008053473 | May 2008 | WO |
2008068747 | Jun 2008 | WO |
2008077284 | Jul 2008 | WO |
2008083131 | Jul 2008 | WO |
2008099958 | Aug 2008 | WO |
2008111058 | Sep 2008 | WO |
2008124760 | Oct 2008 | WO |
2008139441 | Nov 2008 | WO |
2009037691 | Mar 2009 | WO |
2009037697 | Mar 2009 | WO |
2009038961 | Mar 2009 | WO |
2009050703 | Apr 2009 | WO |
2009053961 | Apr 2009 | WO |
2009053962 | Apr 2009 | WO |
2009053963 | Apr 2009 | WO |
2009063450 | May 2009 | WO |
2009072100 | Jun 2009 | WO |
2009072101 | Jun 2009 | WO |
2009072102 | Jun 2009 | WO |
2009072103 | Jun 2009 | WO |
2009072104 | Jun 2009 | WO |
2009072105 | Jun 2009 | WO |
2009074978 | Jun 2009 | WO |
2009074979 | Jun 2009 | WO |
2009078006 | Jun 2009 | WO |
2009095902 | Aug 2009 | WO |
Number | Date | Country | |
---|---|---|---|
20090213653 A1 | Aug 2009 | US |
Number | Date | Country | |
---|---|---|---|
61030240 | Feb 2008 | US | |
61031712 | Feb 2008 | US |