US 8,019,589 B2Grant
Memory apparatus operable to perform a power-saving operation
Issue Date:2011-09-13
•17 Claims
•19 Drawing Sheets
Abstract
A memory subsystem is provided including an interface circuit adapted for communication with a system and a majority of address or control signals of a first number of memory circuits. The interface circuit includes emulation logic for emulating at least one memory circuit of a second number.
Metadata
Assignee
- Google Inc.
Inventors
- Suresh Natarajan Rajan
- Keith R. Schakel
- Michael John Sebastian Smith
- David T. Wang
- Frederick Daniel Weber
Application Information
Application Number:US 11/929,320
Filing Date:2007-10-30
Priority Date:2006-07-31
Art Unit:2128
Classifications
IPC:
G06F9/44G11C8/00
Patent Drawings (19 sheets)
Description
Related Application
[0001] This application is a continuation of commonly-assigned U.S. patent application Ser. No. 11/762,010 entitled “Memory Device with Emulated Characteristics” filed Jun. 12, 2007 by Rajan, et al., which, in turn, is a continuation-in-part of commonly-assigned U.S. patent application Ser. No. 11/461,420 entitled “System and Method for Simulating a Different Number of Memory Circuits” filed Jul. 31, 2006 by Rajan, et al., which are incorporated by reference as if fully set forth herein.
Background of the Invention
[0002] 1. Technical Field of the Invention
[0003] This invention relates generally to digital memory such as used in computers, and more specifically to organization and design of memory modules such as DIMMs.
[0004] 2. Background Art
[0005] Digital memories are utilized in a wide variety of electronic systems, such as personal computers, workstations, servers, consumer electronics, printers, televisions, and so forth. Digital memories are manufactured as monolithic integrated circuits (“ICs” or “chips”). Digital memories come in several types, such as dynamic random access memory (DRAM), static random access memory (SRAM), flash memory, electrically erasable programmable read only memory (EEPROM), and so forth.
[0006] In some systems, the memory chips are coupled directly into the system such as by being soldered directly to the system's main motherboard. In other systems, groups of memory chips are first coupled into memory modules, such as dual in-line memory modules (DIMMs), which are in turn coupled into a system by means of slots, sockets, or other connectors. Some types of memory modules include not only tire memory chips themselves, but also some additional logic which interfaces the memory chips to the system. This logic may perform a variety of low level functions, such as buffering or latching signals between the chips and the system, but it may also perform higher level functions, such as telling the system what are the characteristics of the memory chips. These characteristics may include, for example, memory capacity, speed, latency, interface protocol, and so forth.
[0007] Memory capacity requirements of such systems are increasing rapidly. However, other industry trends such as higher memory bus speeds, small form factor machines, etc. are reducing the number of memory module slots, sockets, connectors, etc. that are available in such systems. There is, therefore, pressure for manufacturers to use large capacity memory modules in such systems.
[0008] However, there is also an exponential relationship between a memory chip's capacity and its price. As a result, large capacity memory modules may be cost prohibitive in some systems.
[0009] What is needed, then, is an effective way to make use of low cost memory chips in manufacturing high capacity memory modules.
Summary
[0010] A memory subsystem is provided including an interface circuit adapted for communication with a system and a majority of address or control signals of a first number of memory circuits. The interface circuit includes emulation logic for emulating at least one memory circuit of a second number.
Brief Description of the Drawings
[0011] FIG. 1 shows a system coupled to multiple memory circuits and an interface circuit according to one embodiment of this invention.
[0012] FIG. 2 shows a buffered stack of DRAM circuits each having a dedicated data path from the buffer chip and sharing a single address, control, and clock bus.
[0013] FIG. 3 shows a buffered stack of DRAM circuits having two address, control, and clock busses and two data busses.
[0014] FIG. 4 shows a buffered stack of DRAM circuits having one address, control, and clock bus and two data busses.
[0015] FIG. 5 shows a buffered stack of DRAM circuits having one address, control, and clock bus and one data bus.
[0016] FIG. 6 shows a buffered stack of DRAM circuits in which the buffer chip is located in the middle of the stack of DRAM chips.
[0017] FIG. 7 is a flow chart showing one method of storing information.
[0018] FIG. 8 shows a high capacity DIMM using buffered stacks of DRAM chips according to one embodiment of this invention.
[0019] FIG. 9 is a timing diagram showing one embodiment of how the buffer chip makes a buffered stack of DRAM circuits appear to the system or memory controller to use longer column address strobe (CAS) latency DRAM chips than is actually used by the physical DRAM chips.
[0020] FIG. 10 shows a timing diagram showing the write data timing expected by DRAM in a buffered stack, in accordance with another embodiment of this invention.
[0021] FIG. 11 is a timing diagram showing how write control signals are delayed by a buffer chip in accordance with another embodiment of this invention.
[0022] FIG. 12 is a timing diagram showing early write data from a memory controller or an advanced memory buffer (AMB) according to yet another embodiment of this invention.
[0023] FIG. 13 is a timing diagram showing address bus conflicts caused by delayed write operations.
[0024] FIG. 14 is a timing diagram showing variable delay of an activate operation through a buffer chip.
[0025] FIG. 15 is a timing diagram showing variable delay of a precharge operation through a buffer chip.
[0026] FIG. 16 shows a buffered stack of DRAM circuits and the buffer chip which presents them to the system as if they were a single, larger DRAM circuit, in accordance with one embodiment of this invention.
[0027] FIG. 17 is a flow chart showing a method of refreshing a plurality of memory circuits, in accordance with one embodiment of this invention.
[0028] FIG. 18 shows a block diagram of another embodiment of the invention.
Detailed Description
[0029] The invention will be understood more fully from the detailed description given below and from the accompanying drawings of embodiments of the invention which, however, should not be taken to limit the invention to the specific embodiments described, but are for explanation and understanding only.
[0030] FIG. 1 illustrates a system 100 including a system device 106 coupled to an interlace circuit 102, which is in turn coupled to a plurality of physical memory circuits 104A-N. The physical memory circuits may be any type of memory circuits. In some embodiments, each physical memory circuit is a separate memory chip. For example, each may be a DDR2 DRAM. In some embodiments, the memory circuits may be symmetrical, meaning each has the same capacity, type, speed, etc., while in other embodiments they may be asymmetrical. For ease of illustration only, three such memory circuits are shown, but actual embodiments may use any plural number of memory circuits. As will be discussed below, the memory chips may optionally be coupled to a memory module (not shown), such as a DIMM.
[0031] The system device may be any type of system capable of requesting and/or initiating a process that results in an access of the memory circuits. The system may include a memory controller (not shown) through which it accesses the memory circuits.
[0032] The interface circuit may include any circuit or logic capable of directly or indirectly communicating with the memory circuits, such as a buffer chip, advanced, memory buffer (AMB) chip, etc. The interface circuit interfaces a plurality of signals 108 between the system device and the memory circuits. Such signals may include, for example, data signals, address signals, control signals, clock signals, and so forth. In some embodiments, all of the signals communicated between the system device and the memory circuits are communicated via the interface circuit. In other embodiments, some other signals 110 are communicated directly between the system device (or some component thereof, such as a memory controller, an AMB, or a register) and the memory circuits, without passing through the interface circuit. In some such embodiments, the majority of signals are communicated via the interface circuit, such that L>M.
[0033] As will be explained in greater detail below, the interface circuit presents to the system device an interface to emulated memory devices which differ in some aspect from the physical memory circuits which are actually present. For example, the interface circuit may tell the system device that the number of emulated memory circuits is different than the actual number of physical memory circuits. The terms “emulating”, “emulated”, “emulation”, and the like will be used in this disclosure to signify emulation, simulation, disguising, transforming, converting, and the like, which results in at least one characteristic of the memory circuits appearing to the system device to be different than the actual, physical characteristic. In some embodiments, the emulated characteristic may be electrical in nature, physical in nature, logical in nature, pertaining to a protocol, etc. An example of an emulated electrical characteristic might be a signal, or a voltage level. An example of an emulated physical characteristic might be a number of pins or wires, a number of signals, or a memory capacity. An example of an emulated protocol characteristic might be a timing, or a specific protocol such as DDR3.
[0034] In the case of an emulated signal such signal may be a control signal such as an address signal, a data signal, or a control signal associated with an activate operation, precharge operation, write operation, mode register read operation, refresh operation, etc. The interface circuit may emulate the number of signals, type of signals, duration of signal assertion, and so forth. It may combine multiple signals to emulate another signal.
[0035] The interface circuit may present to the system device an emulated interface to e.g. DDR3 memory, while the physical memory chips are, in fact, DDR2 memory. The interface circuit may emulate an interface to one version of a protocol such as DDR2 with 5-5-5 latency timing, while the physical memory chips are built to another version of the protocol such as DDR2 with 3-3-3 latency timing. The interface circuit may emulate an interface to a memory having a first capacity that is different than the actual combined capacity of the physical memory chips.
[0036] An emulated timing may relate to latency of e.g. a column address strobe (CAS) latency, a row address to column address latency (tRCD), a row precharge latency (tRP), an activate to precharge latency (tRAS), and so forth. CAS latency is related to the timing of accessing a column of data. tRCD is the latency required between the row address strobe (RAS) and CAS. tRP is the latency required to terminate an open row and open access to the next row. tRAS is the latency required to access a certain row of data between an activate operation and a precharge operation.
[0037] The interface circuit may be operable to receive a signal from the system device and communicate the signal to one or more of the memory circuits after a delay (which, may be hidden from the system device). Such delay may be fixed, or in some embodiments it may be variable. If variable, the delay may depend on e.g. a function of the current signal or a previous signal, a combination of signals, or the like. The delay may include a cumulative delay associated with any one or more of the signals. The delay may result in a time shift of the signal forward or backward in time with respect to other signals. Different delays may be applied to different signals. The interface circuit may similarly be operable to receive a signal from a memory circuit and communicate the signal to the system device after a delay.
[0038] The interface circuit may take the form of or incorporate, or be incorporated into, a register, an AMB, a buffer, or the like, and may comply with Joint Electron Device Engineering Council (JEDEC) standards, and may have forwarding, storing, and/or buffering capabilities.
[0039] In some embodiments, the interface circuit may perform operations without the system device's knowledge. One particularly useful such operation is a power-saving operation. The interface circuit may identify one or more of the memory circuits which are not currently being accessed by the system device, and perform the power saving operation on those. In one such embodiment, the identification may involve determining whether any page (or other portion) of memory is being accessed. The power saving operation may be a power down operation, such as a precharge power down operation.
[0040] The interface circuit may include one or more devices which together perform the emulation and related operations. The interface circuit may be coupled or packaged with the memory devices, or with the system device or a component thereof or separately. In one embodiment, the memory circuits and the interface circuit are coupled to a DIMM.
[0041] FIG. 2 illustrates one embodiment of a system 200 including a system device (e.g. host system 204, etc.) which communicates address, control, clock, and data signals with a memory subsystem 201 via an interface.
[0042] The memory subsystem includes a buffer chip 202 which presents the host system with emulated interface to emulated memory, and a plurality of physical memory circuits which, in the example shown, are DRAM chips 206A-D. In one embodiment, the DRAM chips are stacked, and the buffer chip is placed electrically between them and die host system. Although the embodiments described here show the stack, consisting of multiple DRAM circuits, a stack may refer to any collection of memory circuits (e.g. DRAM circuits, flash memory circuits, or combinations of memory circuit technologies, etc.).
[0043] The buffer chip buffers communicates signals between the host system and the DRAM chips, and presents to the host system an emulated interface to present the memory as though it were a smaller number of larger capacity DRAM chips, although in actuality there is a larger number of smaller capacity DRAM chips in the memory subsystem. For example, there may be eight 512 Mb physical DRAM chips, but the buffer chip buffers and emulates them to appear as a single 4 Gb DRAM chip, or as two 2 Gb DRAM chips. Although the drawing shows four DRAM chips, this is for ease of illustration only; the invention is, of course, not limited to using four DRAM chips.
[0044] In the example shown, the buffer chip is coupled to send address, control, and clock signals 208 to the DRAM chips via a single, shared address, control, and clock bus, but each DRAM chip has its own, dedicated data path for sending and receiving data signals 210 to/from the buffer chip.
[0045] Throughout this disclosure, the reference number 1 will be used to denote the interface between the host system and the buffer chip, the reference number 2 will be used to denote the address, control, and clock interface between the buffer chip and the physical memory circuits, and the reference number 3 will be used to denote the data interface between the buffer chip and the physical memory circuits, regardless of the specifics of how any of those interfaces is implemented in the various embodiments and configurations described below. In the configuration shown in FIG. 2 , there is a single address, control, and clock interface channel 2 and four data interface channels 3; this implementation may thus be said to have a “1A4D” configuration (wherein “1A” means one address, control, and clock channel in interface 2, and “4D” means four data channels in interface 3).
[0046] In the example shown, the DRAM chips are physically arranged on a single side of the buffer chip. The buffer chip may, optionally, be a part of the stack of DRAM chips, and may optionally be the bottommost chip in the stack. Or, it may be separate from the stack.
[0047] FIG. 3 illustrates another embodiment of a system 301 in which the buffer chip 303 is interfaced to a host system 304 and is coupled to the DRAM chips 307A-307D somewhat differently than in the system of FIG. 2 . There are a plurality of shared address, control, and clock busses 309A and 309B, and a plurality of shared data busses 305A and 305B. Each shared bus has two or more DRAM chips coupled to it. As shown, the sharing need not necessarily be the same in the data busses as it is in the address, control, and clock busses. This embodiment has a “2A2D” configuration.
[0048] FIG. 4 illustrates another embodiment of a system 411 in which the buffer chip 413 is interfaced to a host system 404 and is coupled to the DRAM chips 417A-417D somewhat differently than in the system of FIGS. 2 or 3. There is a shared address, control, and clock bus 419, and a plurality of shared data busses 415A and 41.5B. Each shared bus has two or more DRAM chips coupled to it. This implementation has a “1A2D” configuration.
[0049] FIG. 5 illustrates another embodiment of a system 521 in which the buffer chip 523 is interfaced to a host system 504 and is coupled to the DRAM chips 527A-527D somewhat differently than in the system of FIGS. 2 through 4 . There is a shared address, control, and clock bus 529, and a shared data bus 525. This implementation has a “1A1D” configuration.
[0050] FIG. 6 illustrates another embodiment of a system 631 in which the buffer chip 633 is interfaced to a host system 604 and is coupled to the DRAM chips 637A-637D somewhat differently than in the system of FIGS. 2 through 5 . There is a plurality of shared address, control, and clock busses 639A and 639B, and a plurality of dedicated data paths 635. Each shared bus has two or more DRAM chips coupled to it. Further, in the example shown, the DRAM chips are physically arranged on both sides of the butler chip. There may be, for example, sixteen DRAM chips, with the eight DRAM chips on each side of the buffer chip arranged in two stacks of four chips each. This implementation has a “2A4D” configuration.
[0051] FIGS. 2 through 6 are not intended to be an exhaustive listing of all possible permutations of data paths, busses, and buffer chip configurations, and are only illustrative of some ways in which the host system device can be in electrical contact only with the load of the buffer chip and thereby be isolated from whatever physical memory circuits, data paths, busses, etc. exist on the (logical) other side of the butler chip.
[0052] FIG. 7 illustrates one embodiment of a method 700 for storing at least a portion of information received in association with a first operation, for use in performing a second operation. Such a method may be practiced in a variety of systems, such as, but not limited to, those of FIGS. 1-6 . For example, the method may be performed by the interface circuit of FIG. 1 or the buffer chip of FIG. 2 .
[0053] Initially, first information is received (702) in association with a first operation to be performed on at least one of the memory circuits (DRAM chips). Depending on the particular implementation, the first information may be received prior to, simultaneously with, or subsequent to the instigation of the first operation. The first operation may be, for example, a row operation, in which case the first information may include e.g. address values received by the buffer chip via the address bus from the host system. At least a portion of the first information is then stored (704).
[0054] The buffer chip also receives (706) second information associated with a second operation. For convenience, this receipt is shown as being after the storing of the first information, but it could also happen prior to or simultaneously with the storing. The second operation may be, for example, a column operation.
[0055] Then, the buffer chip performs (708) the second operation, utilizing the stored portion of the first information, and the second information.
[0056] If the buffer chip is emulating a memory device which has a larger capacity than each of the physical DRAM chips in the stack, the buffer chip may receive from the host system's memory controller more address bits than are required to address any given one of the DRAM chips. In this instance, the extra address bits may be decoded by the buffer chip to individually select the DRAM chips, utilizing separate chip select signals (not shown) to each of the DRAM chips in the stack.
[0057] For example, a stack of four x4 1 Gb DRAM chips behind the buffer chip may appear to the host system as a single x4 4 Gb DRAM circuit, in which case the memory controller may provide sixteen row address bits and three bank address bits during a row operation (e.g. an activate operation), and provide eleven column address bits and three bank address bits during a column operation (e.g. a read or write operation). However, the individual DRAM chips in the stack may require only fourteen row address bits and three bank address bits for a row operation, and eleven column address bits and three bank address bits during a column operation. As a result, during a row operation (the first operation in the method 702), the buffer chip may receive two address bits more than are needed by any of the DRAM chips. The buffer chip stores (704) these two extra bits during the row operation (in addition to using them to select the correct one of the DRAM chips), then uses them later, during the column operation, to select the correct one of the DRAM chips.
[0058] The mapping between a system address (from the host system to the buffer chip) and a device address (front the buffer chip to a DRAM chip) may be performed in various manners. In one embodiment, lower order system row address and bank address bits may be mapped directly to the device row address and bank address bits, with the most significant system row address bits (and, optionally, the most significant bank address bits) being stored for use in the subsequent column operation. In one such embodiment, what is stored is the decoded version of those bits; in other words, the extra bits may be stored either prior to or after decoding. The stored bits may be stored, for example, in an internal lookup table (not shown) in the buffer chip, for one or more clock cycles.
[0059] As another example, the buffer chip may have four 512 Mb DRAM chips with which it emulates a single 2 Gb DRAM chip. The system will present fifteen row address bits, from which the buffer chip may use the fourteen low order bits (or, optionally, some other set of fourteen bits) to directly address the DRAM chips. The system will present three bank address bits, from which the buffer chip may use the two low order bits (or, optionally, some other set of two bits) to directly address the DRAM chips. During a row operation, the most significant bank address bit (or other unused bit) and the most significant row address bit (or other unused bit) are used to generate the four DRAM chip select signals, and are stored for later reuse. And during a subsequent column operation, the stored bits are again used to generate the four DRAM chip select signals. Optionally, the unused bank address is not stored during the row operation, as it will be re-presented during the subsequent column operation.
[0060] As yet another example, addresses may be mapped between four 1 Gb DRAM circuits to emulate a single 4 Gb DRAM circuit. Sixteen row address bits and three bank address bits come from the host system, of which the low order fourteen address bits and all three bank address bits are mapped directly to the DRAM circuits. During a row operation, the two most significant row address bits are decoded to generate four chip select signals, and are stored using tire bank address bits as the index. During the subsequent column operation, the stored row address bits are again used to generate the four chip select signals.
[0061] A particular mapping technique may be chosen, to ensure that there are no unnecessary combinational logic circuits in the critical timing path between the address input pins and address output pins of the buffer chip. Corresponding combinational logic circuits may instead be used to generate the individual chip select signals. This may allow the capacitive loading on the address outputs of the buffer chip to be much higher than the loading on the individual chip select signal outputs of the buffer chip.
[0062] In another embodiment, the address mapping may be performed by the buffer chip using some of the bank address signals from the host system to generate the chip select signals. The buffer chip may store the higher order row address bits during a row operation, using the bank address as the index, and then use the stored address bits as part of the DRAM circuit bank address during a column operation.
[0063] For example, four 512 Mb DRAM chips maybe used in emulating a single 2 Gb DRAM. Fifteen row address bits come from the host system, of which the low order fourteen are mapped directly to the DRAM chips. Three bank address bits come from the host system, of which the least significant bit is used as a DRAM circuit bank address bit for the DRAM chips. The most significant row address bit may be used as an additional DRAM circuit bank address bit. During a row operation, the two most significant bank address bits are decoded to generate the four chip select signals. The most significant row address bit may be stored during the row operation, and reused during the column operation with the least significant bank address bit, to form the DRAM circuit bank address.
[0064] The column address from the host system memory controller may be mapped directly as the column address to the DRAM chips in the stack, since each of the DRAM chips may have the same page size, regardless any differences in the capacities of the (asymmetrical) DRAM chips.
[0065] Optionally, address bit A[10] may be used by the memory controller to enable or disable auto-precharge during a column operation, in which case the buffer chip may forward that bit to the DRAM circuits without any modification during a column operation.
[0066] In various embodiments, it may be desirable to determine whether the simulated DRAM circuit behaves according to a desired DRAM standard or other design specification. Behavior of many DRAM circuits is specified by the JEDEC standards, and it may be desirable to exactly emulate a particular JEDEC standard DRAM. The JEDEC standard defines control signals that a DRAM circuit must accept and the behavior of the DRAM circuit as a result of such control signals. For example, the JEDEC specification for DDR2 DRAM is known as JESD79-2B. If it is desired to determine whether a standard is met, the following algorithm may be used. Using a set of software verification tools, it checks for formal verification of logic, that protocol behavior of the simulated DRAM circuit is the same as the desired standard or other design specification. Examples of suitable verification tools include: Magellan, supplied by Synopsys, Inc. of 700 E. Middlefield Rd., Mt. View, Calif. 94043; Incisive, supplied by Cadence Design Systems, Inc., of 2655 Sealy Ave., San Jose, Calif. 95134; tools supplied by Jasper Design Automation, Inc. of 100 View St. #100, Mt. View, Calif. 94041; Verix, supplied by Real Intent, Inc., of 505 N. Mathilda Ave. #210, Sunnyvale, Calif. 94085; 0-In, supplied by Mentor Graphics Corp. of 8005 SW Boeckman Rd., Wilsonville, Oreg. 97070; and others. These software verification tools use written assertions that correspond to the rules established by the particular DRAM protocol and specification. These written assertions are further included in the code that forms the logic description for the buffer chip. By writing assertions that correspond to the desired behavior of the emulated DRAM circuit, a proof may be constructed that determines whether the desired design requirements are met.
[0067] For instance, an assertion may be written that no two DRAM control signals are allowed to be issued to an address, control, and clock bus at the same time. Although one may know which of the various buffer chip/DRAM stack configurations and address mappings (such as those described above) are suitable, the verification process allows a designer to prove that the emulated DRAM circuit exactly meets the required standard etc. If, for example, an address mapping that uses a common bus for data and a common bus for address, results in a control and clock bus that does not meet a required specification, alternative designs for buffer chips with other bus arrangements or alternative designs for the sideband signal interconnect between two or more buffer chips may be used and tested for compliance. Such sideband signals convey the power management signals, for example.
[0068] FIG. 8 illustrates a high capacity DIMM 800 using a plurality of buffered stacks of DRAM circuits 802 and a register device 804, according to one embodiment of this invention. The register performs the addressing and control of the buffered stacks. In some embodiments, the DIMM may be an FB-DIMM, in which case the register is an AMB. In one embodiment the emulation is performed at the DIMM level.
[0069] FIG. 9 is a timing diagram illustrating a timing design 900 of a buffer chip which makes a buffered stack of DRAM chips mimic a larger DRAM circuit having longer CAS latency, in accordance with another embodiment of this invention. Any delay through a buffer chip may be made transparent to the host system's memory controller, by using such a method. Such a delay may be a result of the buffer chip being located electrically between the memory bus of the host system and the stacked DRAM circuits, since some or all of the signals that connect the memory bus to the DRAM circuits pass through the buffer chip. A finite amount of time may be needed for these signals to traverse through the buffer chip. With the exception of register chips and AMBs, industry standard memory protocols may not comprehend the buffer chip that sits between the memory bus and the DRAM chips. Industry standards narrowly define the properties of a register chip and an AMB, but not the properties of the buffer chip of this embodiment. Thus, any signal delay caused by the buffer chip may cause a violation of the industry standard protocols.
[0070] In one embodiment, the buffer chip may cause a one-half clock cycle delay between the buffer chip receiving address and control signals from the host system memory controller (or, optionally, from a register chip or an AMB), and the address and control signals being valid at the inputs of the stacked DRAM circuits. Data signals may also have a one-half clock cycle delay in either direction to/from the host system. Other amounts of delay are, of course, possible, and the half-clock cycle example is for illustration only.
[0071] The cumulative delay through the buffer chip is the sum of a delay of the address and control signals and a delay of the data signals. FIG. 9 illustrates an example where the buffer chip is using DRAM chips having a native CAS latency of i clocks, and the buffer chip delay is j clocks, thus the buffer chip emulates a DRAM having a CAS latency of i+j clocks. In the example shown, the DRAM chips have a native CAS latency 906 of four clocks (from t1 to t5), and the total latency through the buffer chip is two clocks (one clock delay 902 from t0 to t1 for address and control signals, plus one clock delay 904 from t5 to t6 for data signals), and the buffer chip emulates a DRAM having a six clock CAS latency 908.
[0072] In FIG. 9 (and other timing diagrams), the reference numbers 1, 2, and/or 3 at the left margin indicate which of the interfaces correspond to the signals or values illustrated on the associated waveforms. For example, in FIG. 9 ; the “Clock” signal shown as a square wave on the uppermost waveform is indicated as belonging to the interface 1 between the host system and the buffer chip; the “Control Input to Buffer” signal is also part of the interface 1; the “Control Input to DRAM” waveform is part of the interface 2 from the buffer chip to the physical memory circuits; the “Data Output from DRAM” waveform is part of the interface 3 from the physical memory circuits to the butter chip; and the “Data Output from Buffer” shown in the lowermost waveform is part of the interface 1 from the buffer chip to the host system.
[0073] FIG. 10 is a timing diagram illustrating a timing design 1000 of write data timing expected by a DRAM circuit in a buffered stack. Emulation of a larger capacity DRAM circuit having higher CAS latency (as in FIG. 9 ) may, in some implementations, create a problem with the timing of write operations. For example, with respect to a buffered stack of DDR2 SDRAM chips with a read CAS latency of four clocks which are used in emulating a single larger DDR2 SDRAM with a read CAS latency of six clocks, the DDR2 SDRAM protocol may specify that the write CAS latency 1002 is one less than the read CAS latency. Therefore, since the buffered stack appears as a DDR2 SDRAM with a read CAS latency of six clocks, the memory controller may use a buffered stack write CAS latency of five clocks 1004 when scheduling a write operation to the memory.
[0074] In the specific example shown, the memory controller issues the write operation at t0. After a one clock cycle delay through the buffer chip, the write operation is issued to the DRAM chips at t1. Because the memory controller believes it is connected to memory having a read CAS latency of six clocks and thus a write CAS latency of five clocks, it issues the write data at time t0+5=t5. But because the physical DRAM chips have a read CAS latency of four clocks and thus a write CAS latency of three clocks, they expect to receive the write data at time t1+3=t4. Hence the problem, which the buffer chip may alleviate by delaying write operations.
[0075] The waveform “Write Data Expected by DRAM” is not shown as belonging to interface 1, interface 2, or interface 3, for the simple reason that there is no such signal present in any of those interfaces. That waveform represents only what is expected by the DRAM, not what is actually provided to the DRAM.
[0076] FIG. 11 is a timing illustrating a timing design 1100 showing how the butter chip does this. The memory controller issues the write operation at t0. In FIG. 10 , the write operation appeared at the DRAM circuits one clock later at t1, clue to the inherent delay through the buffer chip. But in FIG. 11 , in addition to the inherent one clock delay, the buffer chip has added an extra two clocks of delay to the write operation, which is not issued to the DRAM chips until t0+1+2=t3. Because the DRAM chips receive the write operation at t3 and have a write CAS latency of three clocks, they expect to receive the write data at t3+3=t6. Because the memory controller issued the write operation at t0, and it expects a write CAS latency of five clocks, it issues the write data at time t0+5=t5. After a one clock delay through the buffer chip, the write data arrives at the DRAM chips at t5+1=t6, and the timing problem is solved.
[0077] It should be noted that extra delay of j clocks (beyond the inherent delay) which the buffer chip deliberately adds before issuing the write operation to the DRAM is the sum j clocks of the inherent delay of the address and control signals and the inherent delay of the data signals. In the example shown, both those inherent delays are one clock, so j=2.
[0078] FIG. 12 is a timing diagram illustrating operation of an FB-DIMM's AMB, which may be designed to send write data earlier to buffered stacks instead of delaying the write address and operation (as in FIG. 11 ). Specifically, it may use an early write CAS latency 1202 to compensate the timing of the buffer chip write operation. If the buffer chip has a cumulative (address and data) inherent delay of two clocks, the AMB may send the write data to the buffered stack two clocks early. This may not be possible in the case of registered DIMMs, in which the memory controller sends the write data directly to the buffered stacks (rather than via the AMB). In another embodiment, the memory controller itself could be designed to send write data early, to compensate for the j clocks of cumulative inherent delay caused by the buffer chip.
[0079] In the example shown, the memory controller issues the write operation at t0. After a one clock inherent delay through the buffer chip, the write operation arrives at the DRAM at t1. The DRAM expects the write data at t1+3=t4. The industry specification would suggest a nominal write data time of t0+5=t5, but the AMB (or memory controller), which already has the write data (which are provided with the write operation), is configured to perform an early write at t5−2=t3. After the inherent delay 1203 through the buffer chip, the write data arrive at the DRAM at t3+1=t4, exactly when the DRAM expects it—specifically, with a three-cycle DRAM Write CAS latency 1204 which is equal to the three-cycle Early Write CAS Latency 1202.
[0080] FIG. 13 is a timing diagram 1300 illustrating bus conflicts which can be caused by delayed write operations. The delaying of write addresses and write operations may be performed by a buffer chip, a register, an AMB, etc. in a manner that is completely transparent to the memory controller of the host system. And, because the memory controller is unaware of this delay, it may schedule subsequent operations such as activate or precharge operations, which may collide with the delayed writes on the address bus to the DRAM chips in the stack.
[0081] An example is shown, in which the memory controller issues a write operation 1302 at time t0. The buffer chip or AMB delays the write operation, such that it appears on the bus to the DRAM chips at time t3. Unfortunately, at time t2 the memory controller issued an activate operation (control signal) 1304 which, after a one-clock inherent delay through the buffer chip, appears on the bus to the DRAM chips at time t3, colliding with the delayed write.
[0082] FIGS. 14 and 15 are a timing diagram 1400 and a timing diagram 1500 illustrating methods of avoiding such collisions. If the cumulative latency through the buffer chip is two clock cycles, and the native read CAS latency of the DRAM chips is four clock cycles, then in order to hide the delay of the address and control signals and the data signals through the buffer chip, the buffer chip presents the host system with an interface to an emulated memory having a read CAS latency of six clock cycles. And if the tRCD and tRP of the DRAM chips are four clock cycles each, the buffer chip tells the host system that they are six clock cycles each in order to allow the buffer chip to delay the activate and precharge operations to avoid collisions in a manner that is transparent to the host system.
[0083] For example, a buffered stack that uses 4-4-4 DRAM chips (that is, CAS latency=4, tRCD=4, and tRP=4) may appear to the host system as one larger DRAM that uses 6-6-6 timing.
[0084] Since the buffered stack appears to the host system's memory controller as having a tRCD of six clock cycles, the memory controller may schedule a column operation to a bank six clock cycles (at time t6) after an activate (row) operation (at time t0) to the same bank. However, the DRAM chips in the stack actually have a tRCD of four clock cycles. This gives the buffer chip time to delay the activate operation by up to two clock cycles, avoiding any conflicts on the address bus between the buffer chip and the DRAM chips, while ensuring correct read and write timing on the channel between the memory controller and the buffered stack.
[0085] As shown, the buffer chip may issue the activate operation to die DRAM chips one, two, or three clock cycles after it receives the activate operation from the memory controller, register, or AMB. The actual delay selected may depend on the presence or absence of other DRAM operations that may conflict with the activate operation, and may optionally change from one activate operation to another. In other words, the delay may be dynamic A one-clock delay (1402A, 1502A) may be accomplished simply by the inherent delay through the buffer chip. A two-clock delay (1402B, 1502B) may be accomplished by adding one clock of additional delay to the one-clock inherent delay, and a three-clock delay (1402C, 1502C) may be accomplished by adding two clocks of additional delay to the one-clock inherent delay. A read, write, or activate operation issued by the memory controller at time t6 will, after a one-clock inherent delay through the buffer chip, be issued to the DRAM chips at time t7. A preceding activate or precharge operation issued by the memory controller at time t0 will, depending upon the delay, be issued to the DRAM chips at time t1, t2, or t3, each of which is at least the tRCD or tRP of four clocks earlier than the t7 issuance of the read, write, or activate operation.
[0086] Since the buffered stack appears to the memory controller to have a tRP of six clock cycles, the memory controller may schedule a subsequent activate (row) operation to a bank a minimum of six clock cycles after issuing a precharge operation to that bank. However, since the DRAM circuits in the stack actually have a tRP of four clock cycles, the buffer chip may have the ability to delay issuing the precharge operation to the DRAM chips by up to two clock cycles, in order to avoid any conflicts on the address bus, or in order to satisfy the tRAS requirements of the DRAM chips.
[0087] In particular, if the activate operation to a bank was delayed to avoid an address bus conflict, then the precharge operation to the same bank may be delayed by the buffer chip to satisfy the tRAS requirements of the DRAM. The buffer chip may issue the precharge operation to the DRAM chips one, two, or three clock cycles after it is received. The delay selected may depend on the presence or absence of address bus conflicts or tRAS violations, and may change from one precharge operation to another.
[0088] FIG. 16 illustrates a buffered stack 1600 according to one embodiment of this invention. The buffered stack includes four 512 Mb DDR2 DRAM circuits (chips) 1602 which a buffer chip 1604 maps to a single 2 Gb DDR2 DRAM.
[0089] Although the multiple DRAM chips appear to the memory controller as though they were a single, larger DRAM, the combined power dissipation of the actual DRAM chips may be much higher than the power dissipation of a monolithic DRAM of the same capacity. In other words, the physical DRAM may consume significantly more power than would be consumed by the emulated DRAM.
[0090] As a result, a DIMM containing multiple buffered stacks may dissipate much more power than a standard DIMM of the same actual capacity using monolithic DRAM circuits. This increased power dissipation may limit the widespread adoption of DIMMs that use buffered stacks. Thus, it is desirable to have a power management technique which reduces the power dissipation of DIMMs that use buffered stacks.
[0091] In one such technique, the DRAM circuits may be opportunistically placed in low power states or modes. For example, the DRAM circuits may be placed in a precharge power down mode using the clock enable (CKE) pin of the DRAM circuits.
[0092] A single rank registered DIMM (R-DIMM) may contain a plurality of buffered stacks, each including four x4 512 Mb DDR2 SDRAM chips and appear (to the memory controller via emulation by the buffer chip) as a single x4 2 Gb DDR2 SDRAM. The JEDEC standard indicates that a 2 Gb DDR2 SDRAM may generally have eight banks, shown in FIG. 16 as Bank 0 to Bank 7. Therefore, the buffer chip may map each 512 Mb DRAM chip in the stack to two banks of the equivalent 2 Gb DRAM, as shown; the first DRAM chip 1602A is treated as containing banks 0 and 1, 1602B is treated as containing banks 2 and 4, and so forth.
[0093] The memory controller may open and close pages in the DRAM banks based on memory requests it receives from the rest of the host system, in some embodiments, no more than one page may be able to be open in a bank at any given time. In the embodiment shown in FIG. 16 , each DRAM chip may therefore have up to two pages open at a time. When a DRAM chip has no open pages, the power management scheme may place it in the precharge power down mode.
[0094] The clock enable inputs of the DRAM chips may be controlled by the buffer chip, or by another chip (not shown) on the R-DIMM, or by an AMB (not shown) in the case of an FB-DIMM, or by the memory controller, to implement the power management technique. The power management technique may be particularly effective if it implements a closed page policy.
[0095] Another optional power management technique may include mapping a plurality of DRAM circuits to a single bank of the larger capacity emulated DRAM. For example, a buffered stack (not shown) of sixteen x4 256 Mb DDR2 SDRAM chips may be used in emulating a single x4 4 Gb DDR2 SDRAM. The 4 Gb DRAM is specified by JEDEC as having eight banks of 512 Mbs each, so two of the 256 Mb DRAM chips may be mapped by the buffer chip to emulate each bank (whereas in FIG. 16 one DRAM was used to emulate two banks).
[0096] However, since only one page can be open in a bank at any given time, only one of the two DRAM chips emulating that bank can be in the active state at any given time. If the memory controller opens a page in one of the two DRAM chips, the other may be placed in the precharge power clown mode. Thus, if a number p of DRAM chips are used to emulate one bank, at least p-1 of them may be in a power down mode at any given time; in other words, at least p-1 of the p chips are always in power down mode, although the particular powered down chips will tend to change over time, as the memory controller opens and closes various pages of memory.
[0097] As a caveat on the term “always” in the preceding paragraph, the power saving operation may comprise operating in precharge power down mode except when refresh is required.
[0098] FIG. 17 is a flow chart 1700 illustrating one embodiment of a method of refreshing a plurality of memory circuits. A refresh control signal is received (1702) e.g. from a memory controller which intends to refresh an emulated memory circuit. In response to receipt of the refresh control signal, a plurality of refresh control signals are sent (1704) e.g. by a buffer chip to a plurality of physical memory circuits at different times. These refresh control signals may optionally include the received refresh control signal or an instantiation or copy thereof. They may also, or instead, include refresh control signals that are different in at least one aspect (format, content, etc.) from the received signal.
[0099] In some embodiments, at least one first refresh control signal may be sent to a first subset of the physical memory circuits at a first time, and at least one second refresh control signal may be sent to a second subset of the physical memory circuits at a second time. Each refresh signal may be sent to one physical memory circuit, or to a plurality of physical memory circuits, depending upon the particular implementation.
[0100] The refresh control signals may be sent to the physical memory circuits after a delay in accordance with a particular timing. For example, the timing in which they are sent to the physical memory circuits may be selected to minimize an electrical current drawn by the memory, or to minimize a power consumption of the memory. This may be accomplished by staggering a plurality of refresh control signals. Or, the timing may be selected to comply with e.g. a tRFC parameter associated with the memory circuits.
[0101] To this end, physical DRAM circuits may receive periodic refresh operations to maintain integrity of data stored therein. A memory controller may initiate refresh operations by issuing refresh control signals to the DRAM circuits with sufficient frequency to prevent any loss of data in the DRAM circuits. After a refresh control signal is issued, a minimum time tRFC may be required to elapse before another control signal may be issued to that DRAM circuit. The tRFC parameter value may increase as the size of the DRAM circuit increases.
[0102] When the buffer chip receives a refresh control signal from the memory controller, it may refresh the smaller DRAM circuits within the span of time specified by the tRFC of the emulated DRAM circuit. Since the tRFC of the larger, emulated DRAM is longer than the tRFC of the smaller, physical DRAM circuits, it may not be necessary to issue any or all of the refresh control signals to the physical DRAM circuits simultaneously. Refresh control signals may be issued separately to individual DRAM circuits or to groups of DRAM circuits, provided that the tRFC requirements of all physical DRAMs has been met by the time the emulated DRAM's tRFC has elapsed. In use, the refreshes may be spaced in time to minimize the peak current draw of the combination buffer chip and DRAM circuit set during a refresh operation.
[0103] FIG. 18 illustrates one embodiment of an interface circuit such as may be utilized in any of the above-described memory systems, for interfacing between a system and memory circuits. The interface circuit may be included in the buffer chip, for example.
[0104] The interface circuit includes a system address signal interface for sending/receiving address signals to/from the host system, a system control signal interface for sending/receiving control signals to/from the host system, a system clock signal interface for sending/receiving clock signals to/from the host system, and a system data signal interface for sending/receiving data signals to/from the host system. The interface circuit further includes a memory address signal interface for sending/receiving address signals to/from the physical memory, a memory control signal interface for sending/receiving control signals to/from the physical memory, a memory clock signal interface for sending/receiving clock signals to/from the physical memory, and a memory data signal interface for sending/receiving data signals to/from the physical memory.
[0105] The host system includes a set of memory attribute expectations, or built-in parameters of the physical memory with which it has been designed to work (or with which it has been told, e.g. by the buffer circuit, it is working). Accordingly, the host system includes a set of memory interaction attributes, or built-in parameters according to which the host system has been designed to operate in its interactions with the memory. These memory interaction attributes and expectations will typically, but not necessarily, be embodied in the host system's memory controller.
[0106] In addition to physical storage circuits or devices, the physical memory itself has a set of physical attributes.
[0107] These expectations and attributes may include, by way of example only, memory timing, memory capacity, memory latency, memory functionality, memory type, memory protocol, memory power consumption, memory current requirements, and so forth.
[0108] The interface circuit includes memory physical attribute storage for storing values or parameters of various physical attributes of the physical memory circuits. The interface circuit further includes system emulated attribute storage. These storage systems may be read/write capable stores, or they may simply be a set of hard-wired logic or values, or they may simply be inherent in the operation of the interface circuit.
[0109] The interface circuit includes emulation logic which operates according to the stored memory physical attributes and the stored system emulation attributes, to present to the system an interface to an emulated memory which differs in at least one attribute from the actual physical memory. The emulation logic may, in various embodiments, alter a timing, value, latency, etc. of any of the address, control, clock, and/or data signals it sends to or receives from the system and/or the physical memory. Some such signals may pass through unaltered, while others may be altered. The emulation logic may be embodied as, for example, hardwired logic, a state machine, software executing on a processor, and so forth.
Conclusion
[0110] When one component is said to be “adjacent” another component, it should not be interpreted to mean that there is absolutely nothing between the two components, only that they are in the order indicated.
[0111] The physical memory circuits employed in practicing this invention may be any type of memory whatsoever, such as: DRAM, DDR DRAM, DDR2 DRAM, DDR3 DRAM, SDRAM, QDR DRAM, DRDRAM, FPM DRAM, VDRAM, EDO DRAM, BEDO DRAM, MDRAM, SGRAM, MR AM, IRAM, NAND flash, NOR flash, PSRAM, wetware memory, etc.
[0112] The physical memory circuits may be coupled to any type of memory module, such as: DIMM, R-DIMM, SO-DIMM, FB-DIMM, unbuffered DIMM, etc.
[0113] The system device which accesses the memory may be any type of system device, such as: desktop computer, laptop computer, workstation, server, consumer electronic device, television, personal digital assistant (PDA), mobile phone, printer or other peripheral device, etc.
[0114] The various features illustrated in the figures may be combined in many ways, and should not be interpreted as though limited to the specific embodiments in which they were explained and shown.
[0115] Those skilled in the art, having the benefit of this disclosure, will appreciate that many other variations from the foregoing description and drawings may be made within the scope of the present invention. Indeed, the invention is not limited to the details described above. Rather, it is the following claims including any amendments thereto that define the scope of the invention.
Claims
What is claimed is:
1. A memory apparatus for use with a host system, the memory apparatus comprising:
a plurality of memory circuits on a registered dual in-line memory module (R-DIMM); and
one or more components electrically couplable to the host system, the one or more components being operable to present to the host system a simulated memory circuit where there is a difference in at least one aspect between the simulated memory circuit and one or more memory circuits of the plurality of memory circuits,
wherein each memory circuit of the plurality of memory circuits is electrically coupled to at least one of the one or more components, where the one or more components are further operable to identify at least one memory circuit of the plurality of memory circuits that is not being accessed; and
a chip on the R-DIMM operable to perform a power-saving operation on the at least one memory circuit identified as not being accessed.
2. The memory apparatus of claim 1, where the one or more components comprise a register or a buffer.
3. The memory apparatus of claim 1, where the simulated memory circuit presents a simulated control interface and a simulated data interface between the host system and the plurality of memory circuits.
4. The memory apparatus of claim 3, where the simulated control interface is configured to send and receive control, command, and clock signals, and the simulated data interface is configured to send and receive data signals.
5. The memory apparatus of claim 1, where the plurality of memory circuits comprise a stack of dynamic random access memory (DRAM) circuits on the R-DIMM.
6. The memory apparatus of claim 5, where the stack further includes the one or more components.
7. The memory apparatus of claim 1, where the power-saving operation comprises placing the at least one memory circuit identified as not being accessed in a precharge power down mode.
8. The memory apparatus of claim 7, where the one or more components are operable to place each memory circuit identified as not being accessed in a precharge power down mode by controlling a respective clock enable input of each memory circuit identified as not being accessed.
9. The memory apparatus of claim 1, where the one or more components are operable to identify the at least one memory circuit of the plurality of memory circuits as not being accessed based on how many pages are open in each respective memory circuit of the plurality of memory circuits.
10. The memory apparatus of claim 1, where the first components and second components are operable to perform the power saving operation by controlling a respective clock-enable pin of the at least one memory circuit identified as not being accessed.
11. The memory apparatus of claim 1, where the first components and second components are further operable to select one or more of the plurality of memory circuits by generating one or more chip select signals and to perform an operation on the one or more selected memory circuits.
12. A memory apparatus for use with a host system, the memory apparatus comprising:
an interface circuit; and
a plurality of memory circuits, each memory circuit of the plurality of memory circuits being electrically coupled to the interface circuit,
where the interface circuit is operable to present to the host system a simulated memory circuit, where there is a difference in at least one aspect between the simulated memory circuit and at least one of the plurality of memory circuits, and
where the interface circuit is further operable to identify at least one memory circuit of the plurality of memory circuits as not being accessed and to perform a power-saving operation on the at least one memory circuit identified as not being accessed.
13. The memory apparatus of claim 12, where the interface circuit includes one or more registers and one or more buffer chips,
where the one or more registers are operable to present a control interface between the host system and the plurality of memory circuits, and
where the one or more buffer chips are operable to present a data interface between the host system and the plurality of memory circuits.
14. The memory apparatus of claim 12, where the interface circuit comprises a plurality of components, the plurality of components including one or more registers and one or more buffers,
where the one or more registers are operable to present a control interface and an address interface between the host system and the plurality of memory circuits, and
where the one or more buffers are operable to present a data interface between the host system and the plurality of memory circuits.
15. The memory apparatus of claim 12, where the power-saving operation comprises placing the at least one memory circuit identified as not being accessed in a precharge power down mode.
16. The memory apparatus of claim 15, where the interface circuit is operable to place each memory circuit identified as not being accessed in a precharge power down mode by controlling a respective clock enable input of each memory circuit identified as not being accessed.
17. The memory apparatus of claim 12, where the interface circuit is operable to identify the at least one of the plurality of memory circuits as not being accessed based on how many pages are open in each respective memory circuit of the plurality of memory circuits.
Patent Citations (698)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3800292(A) | 1974-03-01 | Curley et al. | Applicant |
| US4069452(A) | 1978-01-01 | Conway et al. | Applicant |
| US4334307(A) | 1982-06-01 | Bourgeois et al. | Applicant |
| US4345319(A) | 1982-08-01 | Bernardini et al. | Applicant |
| US4392212(A) | 1983-07-01 | Miyasaka et al. | Applicant |
| US4525921(A) | 1985-07-01 | Carson et al. | Applicant |
| US4566082(A) | 1986-01-01 | Anderson | Applicant |
| US4592019(A) | 1986-05-01 | Huang et al. | Applicant |
| US4646128(A) | 1987-02-01 | Carson et al. | Applicant |
| US4698748(A) | 1987-10-01 | Juzswik et al. | Applicant |
| US4706166(A) | 1987-11-01 | Go | Applicant |
| US4710903(A) | 1987-12-01 | Hereth et al. | Applicant |
| US4764846(A) | 1988-08-01 | Go | Applicant |
| US4780843(A) | 1988-10-01 | Tietjen | Applicant |
| US4794597(A) | 1988-12-01 | Ooba et al. | Applicant |
| US4796232(A) | 1989-01-01 | House | Applicant |
| US4841440(A) | 1989-06-01 | Yonezu et al. | Applicant |
| US4862347(A) | 1989-08-01 | Rudy | Applicant |
| US4887240(A) | 1989-12-01 | Garverick et al. | Applicant |
| US4899107(A) | 1990-02-01 | Corbett et al. | Applicant |
| US4912678(A) | 1990-03-01 | Mashiko | Applicant |
| US4922451(A) | 1990-05-01 | Lo et al. | Applicant |
| US4935734(A) | 1990-06-01 | Austin | Applicant |
| US4937791(A) | 1990-06-01 | Steele et al. | Applicant |
| US4956694(A) | 1990-09-01 | Eide | Applicant |
| US4959774(A) | 1990-09-01 | Davis | Examiner |
| US4982265(A) | 1991-01-01 | Watanabe et al. | Applicant |
| US4983533(A) | 1991-01-01 | Go | Applicant |
| US5025364(A) | 1991-06-01 | Zellmer | Applicant |
| US5072424(A) | 1991-12-01 | Brent et al. | Applicant |
| US5083266(A) | 1992-01-01 | Watanabe | Applicant |
| US5104820(A) | 1992-04-01 | Go et al. | Applicant |
| US5220672(A) | 1993-06-01 | Nakao et al. | Applicant |
| US5241266(A) | 1993-08-01 | Ahmad et al. | Applicant |
| US5252807(A) | 1993-10-01 | Chizinsky | Applicant |
| US5257233(A) | 1993-10-01 | Schaefer | Applicant |
| US5278796(A) | 1994-01-01 | Tillinghast et al. | Applicant |
| US5282177(A) | 1994-01-01 | McLaury | Applicant |
| US5332922(A) | 1994-07-01 | Oguchi et al. | Applicant |
| US5347428(A) | 1994-09-01 | Carson et al. | Applicant |
| US5384745(A) | 1995-01-01 | Konishi et al. | Applicant |
| US5388265(A) | 1995-02-01 | Volk | Applicant |
| US5390334(A) | 1995-02-01 | Harrison | Applicant |
| US5408190(A) | 1995-04-01 | Wood et al. | Applicant |
| US5453434(A) | 1995-09-01 | Albaugh et al. | Applicant |
| US5467455(A) | 1995-11-01 | Gay et al. | Applicant |
| US5498886(A) | 1996-03-01 | Hsu et al. | Applicant |
| US5502333(A) | 1996-03-01 | Bertin et al. | Applicant |
| US5513135(A) | 1996-04-01 | Dell et al. | Applicant |
| US5513339(A) | 1996-04-01 | Agrawal et al. | Applicant |
| US5519832(A) | 1996-05-01 | Warchol | Applicant |
| US5526320(A) | 1996-06-01 | Zagar et al. | Applicant |
| US5530836(A) | 1996-06-01 | Busch et al. | Applicant |
| US5559990(A) | 1996-09-01 | Cheng et al. | Applicant |
| US5563086(A) | 1996-10-01 | Bertin et al. | Applicant |
| US5566344(A) | 1996-10-01 | Hall et al. | Applicant |
| US5581779(A) | 1996-12-01 | Hall et al. | Applicant |
| US5590071(A) | 1996-12-01 | Kolor et al. | Applicant |
| US5598376(A) | 1997-01-01 | Merritt et al. | Applicant |
| US5604714(A) | 1997-02-01 | Manning et al. | Applicant |
| US5606710(A) | 1997-02-01 | Hall et al. | Applicant |
| US5608262(A) | 1997-03-01 | Degani et al. | Applicant |
| US5610864(A) | 1997-03-01 | Manning | Applicant |
| US5623686(A) | 1997-04-01 | Hall et al. | Applicant |
| US5627791(A) | 1997-05-01 | Wright et al. | Applicant |
| US5640337(A) | 1997-06-01 | Huang et al. | Applicant |
| US5640364(A) | 1997-06-01 | Merritt et al. | Applicant |
| US5652724(A) | 1997-07-01 | Manning | Applicant |
| US5654204(A) | 1997-08-01 | Anderson | Applicant |
| US5661677(A) | 1997-08-01 | Rondeau et al. | Applicant |
| US5661695(A) | 1997-08-01 | Zagar et al. | Applicant |
| US5668773(A) | 1997-09-01 | Zagar et al. | Applicant |
| US5675549(A) | 1997-10-01 | Ong et al. | Applicant |
| US5682354(A) | 1997-10-01 | Manning | Applicant |
| US5692121(A) | 1997-11-01 | Bozso et al. | Applicant |
| US5692202(A) | 1997-11-01 | Kardach et al. | Applicant |
| US5696732(A) | 1997-12-01 | Zagar et al. | Applicant |
| US5702984(A) | 1997-12-01 | Bertin et al. | Applicant |
| US5703813(A) | 1997-12-01 | Manning et al. | Applicant |
| US5706247(A) | 1998-01-01 | Merritt et al. | Applicant |
| USRE35733(E) | 1998-02-01 | Hernandez et al. | Applicant |
| US5717654(A) | 1998-02-01 | Manning | Applicant |
| US5721859(A) | 1998-02-01 | Manning | Applicant |
| US5724288(A) | 1998-03-01 | Cloud et al. | Applicant |
| US5729503(A) | 1998-03-01 | Manning | Applicant |
| US5729504(A) | 1998-03-01 | Cowles | Applicant |
| US5742792(A) | 1998-04-01 | Yanai et al. | Applicant |
| US5748914(A) | 1998-05-01 | Barth et al. | Applicant |
| US5752045(A) | 1998-05-01 | Chen | Applicant |
| US5757703(A) | 1998-05-01 | Merritt et al. | Applicant |
| US5761703(A) | 1998-06-01 | Bolyn | Applicant |
| US5781766(A) | 1998-07-01 | Davis | Applicant |
| US5787457(A) | 1998-07-01 | Miller et al. | Applicant |
| US5798961(A) | 1998-08-01 | Heyden et al. | Applicant |
| US5802010(A) | 1998-09-01 | Zagar et al. | Applicant |
| US5802555(A) | 1998-09-01 | Shigeeda | Applicant |
| US5812488(A) | 1998-09-01 | Zagar et al. | Applicant |
| US5831833(A) | 1998-11-01 | Shirakawa et al. | Applicant |
| US5831931(A) | 1998-11-01 | Manning | Applicant |
| US5831932(A) | 1998-11-01 | Merritt et al. | Applicant |
| US5834838(A) | 1998-11-01 | Anderson | Applicant |
| US5835435(A) | 1998-11-01 | Bogin et al. | Applicant |
| US5838165(A) | 1998-11-01 | Chatter | Applicant |
| US5838177(A) | 1998-11-01 | Keeth | Applicant |
| US5841580(A) | 1998-11-01 | Farmwald et al. | Applicant |
| US5843799(A) | 1998-12-01 | Hsu et al. | Applicant |
| US5843807(A) | 1998-12-01 | Burns | Applicant |
| US5845108(A) | 1998-12-01 | Yoo et al. | Applicant |
| US5850368(A) | 1998-12-01 | Ong et al. | Applicant |
| US5859792(A) | 1999-01-01 | Rondeau et al. | Applicant |
| US5860106(A) | 1999-01-01 | Domen et al. | Applicant |
| US5870347(A) | 1999-02-01 | Keeth et al. | Applicant |
| US5870350(A) | 1999-02-01 | Bertin et al. | Applicant |
| US5872907(A) | 1999-02-01 | Griess et al. | Applicant |
| US5875142(A) | 1999-02-01 | Chevallier | Applicant |
| US5878279(A) | 1999-03-01 | Athenes | Applicant |
| US5884088(A) | 1999-03-01 | Kardach et al. | Applicant |
| US5901105(A) | 1999-05-01 | Ong et al. | Applicant |
| US5903500(A) | 1999-05-01 | Tsang et al. | Applicant |
| US5905688(A) | 1999-05-01 | Park | Applicant |
| US5907512(A) | 1999-05-01 | Parkinson et al. | Applicant |
| US5915105(A) | 1999-06-01 | Farmwald et al. | Applicant |
| US5915167(A) | 1999-06-01 | Leedy | Applicant |
| US5917758(A) | 1999-06-01 | Keeth | Applicant |
| US5923611(A) | 1999-07-01 | Ryan | Applicant |
| US5926435(A) | 1999-07-01 | Park et al. | Applicant |
| US5929650(A) | 1999-07-01 | Pappert et al. | Applicant |
| US5946265(A) | 1999-08-01 | Cowles | Applicant |
| US5949254(A) | 1999-09-01 | Keeth | Applicant |
| US5953263(A) | 1999-09-01 | Farmwald et al. | Applicant |
| US5954804(A) | 1999-09-01 | Farmwald et al. | Applicant |
| US5962435(A) | 1999-10-01 | Mao et al. | Applicant |
| US5963429(A) | 1999-10-01 | Chen | Applicant |
| US5963463(A) | 1999-10-01 | Rondeau et al. | Applicant |
| US5963504(A) | 1999-10-01 | Manning | Applicant |
| US5966724(A) | 1999-10-01 | Ryan | Applicant |
| US5966727(A) | 1999-10-01 | Nishino | Applicant |
| US5969996(A) | 1999-10-01 | Muranaka et al. | Applicant |
| US5973392(A) | 1999-10-01 | Senba et al. | Applicant |
| US5995424(A) | 1999-11-01 | Lawrence et al. | Applicant |
| US5995443(A) | 1999-11-01 | Farmwald et al. | Applicant |
| US6001671(A) | 1999-12-01 | Fjelstad | Applicant |
| US6002613(A) | 1999-12-01 | Cloud et al. | Applicant |
| US6002627(A) | 1999-12-01 | Chevallier | Applicant |
| US6014339(A) | 2000-01-01 | Kobayashi et al. | Applicant |
| US6016282(A) | 2000-01-01 | Keeth | Applicant |
| US6026050(A) | 2000-02-01 | Baker et al. | Applicant |
| US6029250(A) | 2000-02-01 | Keeth | Applicant |
| US6032214(A) | 2000-02-01 | Farmwald et al. | Applicant |
| US6032215(A) | 2000-02-01 | Farmwald et al. | Applicant |
| US6034916(A) | 2000-03-01 | Lee | Applicant |
| US6034918(A) | 2000-03-01 | Farmwald et al. | Applicant |
| US6035365(A) | 2000-03-01 | Farmwald et al. | Applicant |
| US6038195(A) | 2000-03-01 | Farmwald et al. | Applicant |
| US6038673(A) | 2000-03-01 | Benn et al. | Applicant |
| US6044032(A) | 2000-03-01 | Li | Applicant |
| US6047073(A) | 2000-04-01 | Norris et al. | Applicant |
| US6047344(A) | 2000-04-01 | Kawasumi et al. | Applicant |
| US6053948(A) | 2000-04-01 | Vaidyanathan et al. | Applicant |
| US6069504(A) | 2000-05-01 | Keeth | Applicant |
| US6073223(A) | 2000-06-01 | McAllister et al. | Applicant |
| US6075730(A) | 2000-06-01 | Barth et al. | Applicant |
| US6075744(A) | 2000-06-01 | Tsern et al. | Applicant |
| US6078546(A) | 2000-06-01 | Lee | Applicant |
| US6079025(A) | 2000-06-01 | Fung | Applicant |
| US6084434(A) | 2000-07-01 | Keeth | Applicant |
| US6088290(A) | 2000-07-01 | Ohtake et al. | Applicant |
| US6091251(A) | 2000-07-01 | Wood et al. | Applicant |
| USRE36839(E) | 2000-08-01 | Simmons et al. | Applicant |
| US6101152(A) | 2000-08-01 | Farmwald et al. | Applicant |
| US6101564(A) | 2000-08-01 | Athenes et al. | Applicant |
| US6101612(A) | 2000-08-01 | Jeddeloh | Applicant |
| US6108795(A) | 2000-08-01 | Jeddeloh | Applicant |
| US6111812(A) | 2000-08-01 | Gans et al. | Applicant |
| US6134638(A) | 2000-10-01 | Olarig et al. | Applicant |
| US6166991(A) | 2000-12-01 | Phelan | Applicant |
| US6182184(B1) | 2001-01-01 | Farmwald et al. | Applicant |
| US6208168(B1) | 2001-03-01 | Rhee | Applicant |
| US6216246(B1) | 2001-04-01 | Shau | Applicant |
| US6226709(B1) | 2001-05-01 | Goodwin et al. | Applicant |
| US6240048(B1) | 2001-05-01 | Matsubara | Applicant |
| US6243282(B1) | 2001-06-01 | Rondeau et al. | Applicant |
| US6260097(B1) | 2001-07-01 | Farmwald et al. | Applicant |
| US6260154(B1) | 2001-07-01 | Jeddeloh | Applicant |
| US6262938(B1) | 2001-07-01 | Lee et al. | Applicant |
| US6266285(B1) | 2001-07-01 | Farmwald et al. | Applicant |
| US6266292(B1) | 2001-07-01 | Tsern et al. | Applicant |
| US6274395(B1) | 2001-08-01 | Weber | Applicant |
| US6279069(B1) | 2001-08-01 | Robinson et al. | Applicant |
| US6295572(B1) | 2001-09-01 | Wu | Applicant |
| US6298426(B1) | 2001-10-01 | Ajanovic | Applicant |
| US6304511(B1) | 2001-10-01 | Gans et al. | Applicant |
| US6307769(B1) | 2001-10-01 | Nuxoll et al. | Applicant |
| US6314051(B1) | 2001-11-01 | Farmwald et al. | Applicant |
| US6317352(B1) | 2001-11-01 | Halbert et al. | Applicant |
| US6317381(B1) | 2001-11-01 | Gans et al. | Applicant |
| US6324120(B2) | 2001-11-01 | Farmwald et al. | Applicant |
| US6326810(B1) | 2001-12-01 | Keeth | Applicant |
| US6327664(B1) | 2001-12-01 | Dell et al. | Applicant |
| US6330683(B1) | 2001-12-01 | Jeddeloh | Applicant |
| US6336174(B1) | 2002-01-01 | Li et al. | Applicant |
| US6338108(B1) | 2002-01-01 | Motomura | Applicant |
| US6338113(B1) | 2002-01-01 | Kubo et al. | Applicant |
| US6341347(B1) | 2002-01-01 | Joy et al. | Applicant |
| US6343042(B1) | 2002-01-01 | Tsern et al. | Applicant |
| US6353561(B1) | 2002-03-01 | Funyu et al. | Applicant |
| US6356105(B1) | 2002-03-01 | Volk | Applicant |
| US6356500(B1) | 2002-03-01 | Cloud et al. | Applicant |
| US6362656(B2) | 2002-03-01 | Rhee | Applicant |
| US6363031(B2) | 2002-03-01 | Phelan | Applicant |
| US6378020(B2) | 2002-04-01 | Farmwald et al. | Applicant |
| US6381188(B1) | 2002-04-01 | Choi et al. | Applicant |
| US6381668(B1) | 2002-04-01 | Lunteren | Applicant |
| US6414868(B1) | 2002-07-01 | Wong et al. | Applicant |
| US6421754(B1) | 2002-07-01 | Kau et al. | Applicant |
| US6424532(B2) | 2002-07-01 | Kawamura | Applicant |
| US6426916(B2) | 2002-07-01 | Farmwald et al. | Applicant |
| US6429029(B1) | 2002-08-01 | Eldridge et al. | Applicant |
| US6430103(B2) | 2002-08-01 | Nakayama et al. | Applicant |
| US6437600(B1) | 2002-08-01 | Keeth | Applicant |
| US6438057(B1) | 2002-08-01 | Ruckerbauer | Applicant |
| US6442698(B2) | 2002-08-01 | Nizar | Applicant |
| US6445591(B1) | 2002-09-01 | Kwong | Applicant |
| US6452863(B2) | 2002-09-01 | Farmwald et al. | Applicant |
| US6453400(B1) | 2002-09-01 | Maesako et al. | Applicant |
| US6453402(B1) | 2002-09-01 | Jeddeloh | Applicant |
| US6453434(B2) | 2002-09-01 | Delp et al. | Applicant |
| US6455348(B1) | 2002-09-01 | Yamaguchi | Applicant |
| US6457095(B1) | 2002-09-01 | Volk | Applicant |
| US6459651(B1) | 2002-10-01 | Lee et al. | Applicant |
| US6473831(B1) | 2002-10-01 | Schade | Applicant |
| US6480929(B1) | 2002-11-01 | Gauthier et al. | Applicant |
| US6489669(B2) | 2002-12-01 | Shimada et al. | Applicant |
| US6493789(B2) | 2002-12-01 | Ware et al. | Applicant |
| US6496440(B2) | 2002-12-01 | Manning | Applicant |
| US6496897(B2) | 2002-12-01 | Ware et al. | Applicant |
| US6498766(B2) | 2002-12-01 | Lee et al. | Applicant |
| US6510097(B2) | 2003-01-01 | Fukuyama | Applicant |
| US6510503(B2) | 2003-01-01 | Gillingham et al. | Applicant |
| US6512392(B2) | 2003-01-01 | Fleury et al. | Applicant |
| US6521984(B2) | 2003-02-01 | Matsuura | Applicant |
| US6526471(B1) | 2003-02-01 | Shimomura et al. | Applicant |
| US6526484(B1) | 2003-02-01 | Stacovsky et al. | Applicant |
| US6546446(B2) | 2003-04-01 | Farmwald et al. | Applicant |
| US6553450(B1) | 2003-04-01 | Dodd et al. | Applicant |
| US6560158(B2) | 2003-05-01 | Choi et al. | Applicant |
| US6563337(B2) | 2003-05-01 | Dour | Applicant |
| US6563759(B2) | 2003-05-01 | Yahata et al. | Applicant |
| US6564281(B2) | 2003-05-01 | Farmwald et al. | Applicant |
| US6564285(B1) | 2003-05-01 | Mills et al. | Applicant |
| US6574150(B2) | 2003-06-01 | Suyama et al. | Applicant |
| US6584037(B2) | 2003-06-01 | Farmwald et al. | Applicant |
| US6587912(B2) | 2003-07-01 | Leddige et al. | Applicant |
| US6590822(B2) | 2003-07-01 | Hwang et al. | Applicant |
| US6594770(B1) | 2003-07-01 | Sato et al. | Applicant |
| US6597616(B2) | 2003-07-01 | Tsern et al. | Applicant |
| US6614700(B2) | 2003-09-01 | Dietrich et al. | Applicant |
| US6618791(B1) | 2003-09-01 | Dodd et al. | Applicant |
| US6621760(B1) | 2003-09-01 | Ahmad et al. | Applicant |
| US6630729(B2) | 2003-10-01 | Huang | Applicant |
| US6631086(B1) | 2003-10-01 | Bill et al. | Applicant |
| US6650588(B2) | 2003-11-01 | Yamagata | Applicant |
| US6650594(B1) | 2003-11-01 | Lee et al. | Applicant |
| US6657634(B1) | 2003-12-01 | Sinclair et al. | Applicant |
| US6657918(B2) | 2003-12-01 | Foss et al. | Applicant |
| US6657919(B2) | 2003-12-01 | Foss et al. | Applicant |
| US6658016(B1) | 2003-12-01 | Dai et al. | Applicant |
| US6658530(B1) | 2003-12-01 | Robertson et al. | Applicant |
| US6665224(B1) | 2003-12-01 | Lehmann et al. | Applicant |
| US6665227(B2) | 2003-12-01 | Fetzer | Applicant |
| US6668242(B1) | 2003-12-01 | Reynov et al. | Applicant |
| US6674154(B2) | 2004-01-01 | Minamio et al. | Applicant |
| US6683372(B1) | 2004-01-01 | Wong et al. | Applicant |
| US6684292(B2) | 2004-01-01 | Piccirillo et al. | Applicant |
| US6697295(B2) | 2004-02-01 | Farmwald et al. | Applicant |
| US6701446(B2) | 2004-03-01 | Tsern et al. | Applicant |
| US6705877(B1) | 2004-03-01 | Li et al. | Applicant |
| US6708144(B1) | 2004-03-01 | Merryman et al. | Applicant |
| US6710430(B2) | 2004-03-01 | Minamio et al. | Applicant |
| US6713856(B2) | 2004-03-01 | Tsai et al. | Applicant |
| US6714891(B2) | 2004-03-01 | Dendinger | Applicant |
| US6724684(B2) | 2004-04-01 | Kim | Applicant |
| US6731527(B2) | 2004-05-01 | Brown | Applicant |
| US6742098(B1) | 2004-05-01 | Halbert et al. | Applicant |
| US6744687(B2) | 2004-06-01 | Koo et al. | Applicant |
| US6747887(B2) | 2004-06-01 | Halbert et al. | Applicant |
| US6751696(B2) | 2004-06-01 | Farmwald et al. | Applicant |
| US6754129(B2) | 2004-06-01 | Khateri et al. | Applicant |
| US6754132(B2) | 2004-06-01 | Kyung | Applicant |
| US6762948(B2) | 2004-07-01 | Kyun et al. | Applicant |
| US6766469(B2) | 2004-07-01 | Larson et al. | Applicant |
| US6779097(B2) | 2004-08-01 | Gillingham et al. | Applicant |
| US6785767(B2) | 2004-08-01 | Coulson | Applicant |
| US6791877(B2) | 2004-09-01 | Miura et al. | Applicant |
| US6795899(B2) | 2004-09-01 | Dodd et al. | Applicant |
| US6799241(B2) | 2004-09-01 | Kahn et al. | Applicant |
| US6801989(B2) | 2004-10-01 | Johnson et al. | Applicant |
| US6807598(B2) | 2004-10-01 | Farmwald et al. | Applicant |
| US6807655(B1) | 2004-10-01 | Rehani et al. | Applicant |
| US6816991(B2) | 2004-11-01 | Sanghani | Applicant |
| US6819602(B2) | 2004-11-01 | Seo et al. | Applicant |
| US6819617(B2) | 2004-11-01 | Hwang et al. | Applicant |
| US6820163(B1) | 2004-11-01 | McCall et al. | Applicant |
| US6820169(B2) | 2004-11-01 | Wilcox et al. | Applicant |
| US6826104(B2) | 2004-11-01 | Kawaguchi et al. | Applicant |
| US6839290(B2) | 2005-01-01 | Ahmad et al. | Applicant |
| US6845027(B2) | 2005-01-01 | Mayer et al. | Applicant |
| US6845055(B1) | 2005-01-01 | Koga et al. | Applicant |
| US6847582(B2) | 2005-01-01 | Pan | Applicant |
| US6850449(B2) | 2005-02-01 | Takahashi | Applicant |
| US6862249(B2) | 2005-03-01 | Kyung | Applicant |
| US6862653(B1) | 2005-03-01 | Dodd et al. | Applicant |
| US6878570(B2) | 2005-04-01 | Lyu et al. | Applicant |
| US6894933(B2) | 2005-05-01 | Kuzmenka et al. | Applicant |
| US6898683(B2) | 2005-05-01 | Nakamura | Applicant |
| US6908314(B2) | 2005-06-01 | Brown | Applicant |
| US6912778(B2) | 2005-07-01 | Ahn et al. | Applicant |
| US6914786(B1) | 2005-07-01 | Paulsen et al. | Applicant |
| US6917219(B2) | 2005-07-01 | New | Applicant |
| US6922371(B2) | 2005-07-01 | Takahashi et al. | Applicant |
| US6938119(B2) | 2005-08-01 | Kohn et al. | Applicant |
| US6943450(B2) | 2005-09-01 | Fee et al. | Applicant |
| US6944748(B2) | 2005-09-01 | Sanches et al. | Applicant |
| US6947341(B2) | 2005-09-01 | Stubbs et al. | Applicant |
| US6951982(B2) | 2005-10-01 | Chye et al. | Applicant |
| US6952794(B2) | 2005-10-01 | Lu | Applicant |
| US6961281(B2) | 2005-11-01 | Wong et al. | Applicant |
| US6968416(B2) | 2005-11-01 | Moy | Applicant |
| US6968419(B1) | 2005-11-01 | Holman | Applicant |
| US6970968(B1) | 2005-11-01 | Holman | Applicant |
| US6980021(B1) | 2005-12-01 | Srivastava et al. | Applicant |
| US6986118(B2) | 2006-01-01 | Dickman | Applicant |
| US6992950(B2) | 2006-01-01 | Foss et al. | Applicant |
| US7000062(B2) | 2006-02-01 | Perego et al. | Applicant |
| US7003618(B2) | 2006-02-01 | Perego et al. | Applicant |
| US7003639(B2) | 2006-02-01 | Tsern et al. | Applicant |
| US7007095(B2) | 2006-02-01 | Chen et al. | Applicant |
| US7007175(B2) | 2006-02-01 | Chang et al. | Applicant |
| US7010642(B2) | 2006-03-01 | Perego et al. | Applicant |
| US7010736(B1) | 2006-03-01 | Teh et al. | Applicant |
| US7024518(B2) | 2006-04-01 | Halbert et al. | Applicant |
| US7026708(B2) | 2006-04-01 | Cady et al. | Applicant |
| US7028215(B2) | 2006-04-01 | Depew et al. | Applicant |
| US7028234(B2) | 2006-04-01 | Huckaby et al. | Applicant |
| US7035150(B2) | 2006-04-01 | Streif et al. | Applicant |
| US7043599(B1) | 2006-05-01 | Ware et al. | Applicant |
| US7045396(B2) | 2006-05-01 | Crowley et al. | Applicant |
| US7045901(B2) | 2006-05-01 | Lin et al. | Applicant |
| US7053470(B1) | 2006-05-01 | Sellers et al. | Applicant |
| US7053478(B2) | 2006-05-01 | Roper et al. | Applicant |
| US7058776(B2) | 2006-06-01 | Lee | Applicant |
| US7058863(B2) | 2006-06-01 | Kouchi et al. | Applicant |
| US7061823(B2) | 2006-06-01 | Faue et al. | Applicant |
| US7066741(B2) | 2006-06-01 | Burns et al. | Applicant |
| US7075175(B2) | 2006-07-01 | Kazi et al. | Applicant |
| US7079396(B2) | 2006-07-01 | Gates et al. | Applicant |
| US7079441(B1) | 2006-07-01 | Partsch et al. | Applicant |
| US7079446(B2) | 2006-07-01 | Murtagh et al. | Applicant |
| US7085152(B2) | 2006-08-01 | Ellis et al. | Applicant |
| US7085941(B2) | 2006-08-01 | Li | Applicant |
| US7089438(B2) | 2006-08-01 | Raad | Applicant |
| US7093101(B2) | 2006-08-01 | Aasheim et al. | Applicant |
| US7103730(B2) | 2006-09-01 | Saxena et al. | Applicant |
| US7119428(B2) | 2006-10-01 | Tanie et al. | Applicant |
| US7120727(B2) | 2006-10-01 | Lee et al. | Applicant |
| US7126399(B1) | 2006-10-01 | Lee | Applicant |
| US7127567(B2) | 2006-10-01 | Ramakrishnan et al. | Applicant |
| US7133960(B1) | 2006-11-01 | Thompson et al. | Applicant |
| US7136978(B2) | 2006-11-01 | Miura et al. | Applicant |
| US7149145(B2) | 2006-12-01 | Kim et al. | Applicant |
| US7149824(B2) | 2006-12-01 | Johnson | Applicant |
| US7173863(B2) | 2007-02-01 | Conley et al. | Applicant |
| US7200021(B2) | 2007-04-01 | Raghuram | Applicant |
| US7205789(B1) | 2007-04-01 | Karabatsos | Applicant |
| US7210059(B2) | 2007-04-01 | Jeddeloh | Applicant |
| US7215561(B2) | 2007-05-01 | Park et al. | Applicant |
| US7218566(B1) | 2007-05-01 | Totolos, Jr. et al. | Applicant |
| US7224595(B2) | 2007-05-01 | Dreps et al. | Applicant |
| US7228264(B2) | 2007-06-01 | Barrenscheen et al. | Applicant |
| US7231562(B2) | 2007-06-01 | Ohlhoff et al. | Applicant |
| US7233541(B2) | 2007-06-01 | Yamamoto et al. | Applicant |
| US7234081(B2) | 2007-06-01 | Nguyen et al. | Applicant |
| US7243185(B2) | 2007-07-01 | See et al. | Applicant |
| US7245541(B2) | 2007-07-01 | Janzen | Applicant |
| US7254036(B2) | 2007-08-01 | Pauley et al. | Applicant |
| US7266639(B2) | 2007-09-01 | Raghuram | Applicant |
| US7269042(B2) | 2007-09-01 | Kinsley et al. | Applicant |
| US7269708(B2) | 2007-09-01 | Ware | Applicant |
| US7274583(B2) | 2007-09-01 | Park et al. | Applicant |
| US7286436(B2) | 2007-10-01 | Bhakta et al. | Applicant |
| US7289386(B2) | 2007-10-01 | Bhakta et al. | Applicant |
| US7296754(B2) | 2007-11-01 | Nishizawa et al. | Applicant |
| US7299330(B2) | 2007-11-01 | Gillingham et al. | Applicant |
| US7302598(B2) | 2007-11-01 | Suzuki et al. | Applicant |
| US7307863(B2) | 2007-12-01 | Yen et al. | Applicant |
| US7317250(B2) | 2008-01-01 | Koh et al. | Applicant |
| US7363422(B2) | 2008-04-01 | Perego et al. | Applicant |
| US7366947(B2) | 2008-04-01 | Gower et al. | Applicant |
| US7379316(B2) | 2008-05-01 | Rajan | Applicant |
| US7386656(B2) | 2008-06-01 | Rajan et al. | Applicant |
| US7392338(B2) | 2008-06-01 | Rajan et al. | Applicant |
| US7408393(B1) | 2008-08-01 | Jain et al. | Applicant |
| US7409492(B2) | 2008-08-01 | Tanaka et al. | Applicant |
| US7428644(B2) | 2008-09-01 | Jeddeloh et al. | Applicant |
| US7437579(B2) | 2008-10-01 | Jeddeloh et al. | Applicant |
| US7457122(B2) | 2008-11-01 | Lai et al. | Applicant |
| US7464225(B2) | 2008-12-01 | Tsern | Applicant |
| US7472220(B2) | 2008-12-01 | Rajan et al. | Applicant |
| US7474576(B2) | 2009-01-01 | Co et al. | Applicant |
| US7480147(B2) | 2009-01-01 | Hoss et al. | Applicant |
| US7480774(B2) | 2009-01-01 | Ellis et al. | Applicant |
| US7496777(B2) | 2009-02-01 | Kapil | Applicant |
| US7515453(B2) | 2009-04-01 | Rajan | Applicant |
| US7532537(B2) | 2009-05-01 | Solomon et al. | Applicant |
| US7539800(B2) | 2009-05-01 | Dell et al. | Applicant |
| US7573136(B2) | 2009-08-01 | Jiang et al. | Applicant |
| US7580312(B2) | 2009-08-01 | Rajan et al. | Applicant |
| US7581121(B2) | 2009-08-01 | Barth et al. | Applicant |
| US7581127(B2) | 2009-08-01 | Rajan et al. | Applicant |
| US7590796(B2) | 2009-09-01 | Rajan et al. | Applicant |
| US7599205(B2) | 2009-10-01 | Rajan | Applicant |
| US7606245(B2) | 2009-10-01 | Ma et al. | Applicant |
| US7609567(B2) | 2009-10-01 | Rajan et al. | Applicant |
| US7613880(B2) | 2009-11-01 | Miura et al. | Applicant |
| US7724589(B2) | 2010-05-01 | Rajan et al. | Applicant |
| US7730338(B2) | 2010-06-01 | Rajan et al. | Applicant |
| US7761724(B2) | 2010-07-01 | Rajan et al. | Applicant |
| US2001/0000822(A1) | 2001-05-01 | Dell et al. | Applicant |
| US2001/0003198(A1) | 2001-06-01 | Wu | Applicant |
| US2001/0011322(A1) | 2001-08-01 | Stolt et al. | Applicant |
| US2001/0021106(A1) | 2001-09-01 | Weber et al. | Applicant |
| US2001/0046163(A1) | 2001-11-01 | Yanagawa | Applicant |
| US2002/0004897(A1) | 2002-01-01 | Kao et al. | Applicant |
| US2002/0015340(A1) | 2002-02-01 | Batinovich | Applicant |
| US2002/0019961(A1) | 2002-02-01 | Blodgett | Applicant |
| US2002/0034068(A1) | 2002-03-01 | Weber et al. | Applicant |
| US2002/0038405(A1) | 2002-03-01 | Leddige et al. | Applicant |
| US2002/0041507(A1) | 2002-04-01 | Woo et al. | Applicant |
| US2002/0051398(A1) | 2002-05-01 | Mizugaki | Applicant |
| US2002/0060945(A1) | 2002-05-01 | Ikeda | Applicant |
| US2002/0064073(A1) | 2002-05-01 | Chien | Applicant |
| US2002/0064083(A1) | 2002-05-01 | Ryu et al. | Applicant |
| US2002/0089831(A1) | 2002-07-01 | Forthun | Applicant |
| US2002/0089970(A1) | 2002-07-01 | Asada et al. | Applicant |
| US2002/0121650(A1) | 2002-09-01 | Minamio et al. | Applicant |
| US2002/0121670(A1) | 2002-09-01 | Minamio et al. | Applicant |
| US2002/0124195(A1) | 2002-09-01 | Nizar | Applicant |
| US2002/0129204(A1) | 2002-09-01 | Leighnor et al. | Applicant |
| US2002/0145900(A1) | 2002-10-01 | Schaefer | Applicant |
| US2002/0165706(A1) | 2002-11-01 | Raynham | Applicant |
| US2002/0174274(A1) | 2002-11-01 | Wu et al. | Applicant |
| US2002/0184438(A1) | 2002-12-01 | Usui | Applicant |
| US2003/0002262(A1) | 2003-01-01 | Benisek et al. | Applicant |
| US2003/0011993(A1) | 2003-01-01 | Summers et al. | Applicant |
| US2003/0021175(A1) | 2003-01-01 | Tae Kwak | Applicant |
| US2003/0026155(A1) | 2003-02-01 | Yamagata | Applicant |
| US2003/0026159(A1) | 2003-02-01 | Frankowsky et al. | Applicant |
| US2003/0035312(A1) | 2003-02-01 | Halbert et al. | Applicant |
| US2003/0041295(A1) | 2003-02-01 | Hou et al. | Applicant |
| US2003/0061458(A1) | 2003-03-01 | Wilcox et al. | Applicant |
| US2003/0093614(A1) | 2003-05-01 | Kohn et al. | Applicant |
| US2003/0101392(A1) | 2003-05-01 | Lee | Applicant |
| US2003/0105932(A1) | 2003-06-01 | David et al. | Applicant |
| US2003/0117875(A1) | 2003-06-01 | Lee et al. | Applicant |
| US2003/0123389(A1) | 2003-07-01 | Russell et al. | Applicant |
| US2003/0126338(A1) | 2003-07-01 | Dodd et al. | Applicant |
| US2003/0131160(A1) | 2003-07-01 | Hampel et al. | Applicant |
| US2003/0145163(A1) | 2003-07-01 | Seo et al. | Applicant |
| US2003/0158995(A1) | 2003-08-01 | Lee et al. | Applicant |
| US2003/0164539(A1) | 2003-09-01 | Yau | Applicant |
| US2003/0182513(A1) | 2003-09-01 | Dodd et al. | Applicant |
| US2003/0183934(A1) | 2003-10-01 | Barrett | Applicant |
| US2003/0189868(A1) | 2003-10-01 | Riesenman et al. | Applicant |
| US2003/0189870(A1) | 2003-10-01 | Wilcox | Applicant |
| US2003/0191888(A1) | 2003-10-01 | Klein | Applicant |
| US2003/0191915(A1) | 2003-10-01 | Saxena et al. | Applicant |
| US2003/0200382(A1) | 2003-10-01 | Wells et al. | Applicant |
| US2003/0200474(A1) | 2003-10-01 | Li | Applicant |
| US2003/0205802(A1) | 2003-11-01 | Segaram et al. | Applicant |
| US2003/0223290(A1) | 2003-12-01 | Park et al. | Applicant |
| US2003/0227798(A1) | 2003-12-01 | Pax | Applicant |
| US2003/0229821(A1) | 2003-12-01 | Ma | Applicant |
| US2003/0231542(A1) | 2003-12-01 | Zaharinova-Papazova et al. | Applicant |
| US2004/0016994(A1) | 2004-01-01 | Huang | Applicant |
| US2004/0034732(A1) | 2004-02-01 | Valin et al. | Applicant |
| US2004/0034755(A1) | 2004-02-01 | LaBerge et al. | Applicant |
| US2004/0037133(A1) | 2004-02-01 | Park et al. | Applicant |
| US2004/0044808(A1) | 2004-03-01 | Salmon et al. | Applicant |
| US2004/0047228(A1) | 2004-03-01 | Chen | Applicant |
| US2004/0064647(A1) | 2004-04-01 | DeWhitt et al. | Applicant |
| US2004/0064767(A1) | 2004-04-01 | Huckaby et al. | Applicant |
| US2004/0083324(A1) | 2004-04-01 | Rabinovitz et al. | Applicant |
| US2004/0088475(A1) | 2004-05-01 | Streif et al. | Applicant |
| US2004/0117723(A1) | 2004-06-01 | Foss | Applicant |
| US2004/0123173(A1) | 2004-06-01 | Emberling et al. | Applicant |
| US2004/0125635(A1) | 2004-07-01 | Kuzmenka | Applicant |
| US2004/0133736(A1) | 2004-07-01 | Kyung | Applicant |
| US2004/0139359(A1) | 2004-07-01 | Samson et al. | Applicant |
| US2004/0145963(A1) | 2004-07-01 | Byon | Applicant |
| US2004/0174765(A1) | 2004-09-01 | Seo et al. | Applicant |
| US2004/0177079(A1) | 2004-09-01 | Gluhovsky et al. | Applicant |
| US2004/0184324(A1) | 2004-09-01 | Pax | Applicant |
| US2004/0186956(A1) | 2004-09-01 | Perego et al. | Applicant |
| US2004/0188704(A1) | 2004-09-01 | Halbert et al. | Applicant |
| US2004/0196732(A1) | 2004-10-01 | Lee | Applicant |
| US2004/0205433(A1) | 2004-10-01 | Gower et al. | Applicant |
| US2004/0208173(A1) | 2004-10-01 | Di Gregorio | Applicant |
| US2004/0225858(A1) | 2004-11-01 | Brueggen | Applicant |
| US2004/0228166(A1) | 2004-11-01 | Braun et al. | Applicant |
| US2004/0228203(A1) | 2004-11-01 | Koo | Applicant |
| US2004/0230932(A1) | 2004-11-01 | Dickmann | Applicant |
| US2004/0236877(A1) | 2004-11-01 | Burton | Applicant |
| US2004/0250989(A1) | 2004-12-01 | Im et al. | Applicant |
| US2004/0256638(A1) | 2004-12-01 | Perego et al. | Applicant |
| US2004/0260957(A1) | 2004-12-01 | Jeddeloh et al. | Applicant |
| US2004/0264255(A1) | 2004-12-01 | Royer | Applicant |
| US2004/0268161(A1) | 2004-12-01 | Ross | Applicant |
| US2005/0018495(A1) | 2005-01-01 | Bhakta et al. | Applicant |
| US2005/0021874(A1) | 2005-01-01 | Georgiou et al. | Applicant |
| US2005/0027928(A1) | 2005-02-01 | Avraham et al. | Applicant |
| US2005/0028038(A1) | 2005-02-01 | Pomaranski et al. | Applicant |
| US2005/0044303(A1) | 2005-02-01 | Perego et al. | Applicant |
| US2005/0044305(A1) | 2005-02-01 | Jakobs et al. | Applicant |
| US2005/0047192(A1) | 2005-03-01 | Matsui et al. | Applicant |
| US2005/0071543(A1) | 2005-03-01 | Ellis et al. | Applicant |
| US2005/0078532(A1) | 2005-04-01 | Ruckerbauer et al. | Applicant |
| US2005/0081085(A1) | 2005-04-01 | Ellis et al. | Applicant |
| US2005/0102590(A1) | 2005-05-01 | Norris et al. | Applicant |
| US2005/0108460(A1) | 2005-05-01 | David | Applicant |
| US2005/0127531(A1) | 2005-06-01 | Tay et al. | Applicant |
| US2005/0132158(A1) | 2005-06-01 | Hampel et al. | Applicant |
| US2005/0135176(A1) | 2005-06-01 | Ramakrishnan et al. | Applicant |
| US2005/0138267(A1) | 2005-06-01 | Bains et al. | Applicant |
| US2005/0138304(A1) | 2005-06-01 | Ramakrishnan et al. | Applicant |
| US2005/0139977(A1) | 2005-06-01 | Nishio et al. | Applicant |
| US2005/0141199(A1) | 2005-06-01 | Chiou et al. | Applicant |
| US2005/0149662(A1) | 2005-07-01 | Perego et al. | Applicant |
| US2005/0152212(A1) | 2005-07-01 | Yang et al. | Applicant |
| US2005/0156934(A1) | 2005-07-01 | Perego et al. | Applicant |
| US2005/0166026(A1) | 2005-07-01 | Ware et al. | Applicant |
| US2005/0193163(A1) | 2005-09-01 | Perego et al. | Applicant |
| US2005/0194676(A1) | 2005-09-01 | Fukuda et al. | Applicant |
| US2005/0194991(A1) | 2005-09-01 | Dour et al. | Applicant |
| US2005/0195629(A1) | 2005-09-01 | Leddige et al. | Applicant |
| US2005/0201063(A1) | 2005-09-01 | Lee et al. | Applicant |
| US2005/0204111(A1) | 2005-09-01 | Natarajan | Applicant |
| US2005/0210196(A1) | 2005-09-01 | Perego et al. | Applicant |
| US2005/0223179(A1) | 2005-10-01 | Perego et al. | Applicant |
| US2005/0232049(A1) | 2005-10-01 | Park | Applicant |
| US2005/0235119(A1) | 2005-10-01 | Sechrest et al. | Applicant |
| US2005/0235131(A1) | 2005-10-01 | Ware | Applicant |
| US2005/0237838(A1) | 2005-10-01 | Kwak et al. | Applicant |
| US2005/0243635(A1) | 2005-11-01 | Schaefer | Applicant |
| US2005/0259504(A1) | 2005-11-01 | Murtugh et al. | Applicant |
| US2005/0265506(A1) | 2005-12-01 | Foss et al. | Applicant |
| US2005/0269715(A1) | 2005-12-01 | Yoo | Applicant |
| US2005/0278474(A1) | 2005-12-01 | Perersen et al. | Applicant |
| US2005/0281096(A1) | 2005-12-01 | Bhakta et al. | Applicant |
| US2005/0281123(A1) | 2005-12-01 | Bell et al. | Applicant |
| US2005/0285174(A1) | 2005-12-01 | Saito et al. | Applicant |
| US2005/0289292(A1) | 2005-12-01 | Morrow et al. | Applicant |
| US2005/0289317(A1) | 2005-12-01 | Liou et al. | Applicant |
| US2006/0002201(A1) | 2006-01-01 | Janzen | Applicant |
| US2006/0010339(A1) | 2006-01-01 | Klein | Applicant |
| US2006/0026484(A1) | 2006-02-01 | Hollums | Applicant |
| US2006/0038597(A1) | 2006-02-01 | Becker et al. | Applicant |
| US2006/0039204(A1) | 2006-02-01 | Cornelius | Examiner |
| US2006/0039205(A1) | 2006-02-01 | Cornelius | Examiner |
| US2006/0041711(A1) | 2006-02-01 | Miura et al. | Applicant |
| US2006/0041730(A1) | 2006-02-01 | Larson | Applicant |
| US2006/0044909(A1) | 2006-03-01 | Kinsley et al. | Applicant |
| US2006/0049502(A1) | 2006-03-01 | Goodwin et al. | Applicant |
| US2006/0050574(A1) | 2006-03-01 | Streif et al. | Applicant |
| US2006/0056244(A1) | 2006-03-01 | Ware | Applicant |
| US2006/0062047(A1) | 2006-03-01 | Bhakta et al. | Examiner |
| US2006/0085616(A1) | 2006-04-01 | Zeighami et al. | Applicant |
| US2006/0087900(A1) | 2006-04-01 | Bucksch et al. | Applicant |
| US2006/0090031(A1) | 2006-04-01 | Kirshenbaum et al. | Applicant |
| US2006/0090054(A1) | 2006-04-01 | Choi et al. | Applicant |
| US2006/0106951(A1) | 2006-05-01 | Bains | Applicant |
| US2006/0112214(A1) | 2006-05-01 | Yeh | Applicant |
| US2006/0112219(A1) | 2006-05-01 | Chawla et al. | Applicant |
| US2006/0117152(A1) | 2006-06-01 | Amidi et al. | Applicant |
| US2006/0117160(A1) | 2006-06-01 | Jackson et al. | Applicant |
| US2006/0118933(A1) | 2006-06-01 | Haba | Applicant |
| US2006/0129712(A1) | 2006-06-01 | Raghuram | Applicant |
| US2006/0129755(A1) | 2006-06-01 | Raghuram | Applicant |
| US2006/0136791(A1) | 2006-06-01 | Nierle | Applicant |
| US2006/0149982(A1) | 2006-07-01 | Vogt | Applicant |
| US2006/0176744(A1) | 2006-08-01 | Stave | Applicant |
| US2006/0179333(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0179334(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0180926(A1) | 2006-08-01 | Mullen et al. | Applicant |
| US2006/0181953(A1) | 2006-08-01 | Rotenberg et al. | Applicant |
| US2006/0195631(A1) | 2006-08-01 | Rajamani | Applicant |
| US2006/0206738(A1) | 2006-09-01 | Jeddeloh et al. | Applicant |
| US2006/0236165(A1) | 2006-10-01 | Cepulis et al. | Applicant |
| US2006/0236201(A1) | 2006-10-01 | Gower et al. | Applicant |
| US2006/0248387(A1) | 2006-11-01 | Nicholson et al. | Applicant |
| US2006/0262586(A1) | 2006-11-01 | Solomon et al. | Applicant |
| US2006/0294295(A1) | 2006-12-01 | Fukuzo | Applicant |
| US2007/0005998(A1) | 2007-01-01 | Jain et al. | Applicant |
| US2007/0050530(A1) | 2007-03-01 | Rajan | Applicant |
| US2007/0058471(A1) | 2007-03-01 | Rajan et al. | Applicant |
| US2007/0088995(A1) | 2007-04-01 | Tsern et al. | Applicant |
| US2007/0091696(A1) | 2007-04-01 | Niggemeier et al. | Applicant |
| US2007/0106860(A1) | 2007-05-01 | Foster, Sr. et al. | Applicant |
| US2007/0136537(A1) | 2007-06-01 | Doblar et al. | Applicant |
| US2007/0162700(A1) | 2007-07-01 | Fortin et al. | Applicant |
| US2007/0188997(A1) | 2007-08-01 | Hockanson et al. | Applicant |
| US2007/0192563(A1) | 2007-08-01 | Rajan et al. | Applicant |
| US2007/0195613(A1) | 2007-08-01 | Rajan et al. | Applicant |
| US2007/0204075(A1) | 2007-08-01 | Rajan et al. | Applicant |
| US2007/0216445(A1) | 2007-09-01 | Raghavan et al. | Applicant |
| US2007/0247194(A1) | 2007-10-01 | Jain | Applicant |
| US2007/0288683(A1) | 2007-12-01 | Panabaker et al. | Applicant |
| US2007/0288686(A1) | 2007-12-01 | Arcedera et al. | Applicant |
| US2007/0288687(A1) | 2007-12-01 | Panabaker et al. | Applicant |
| US2008/0002447(A1) | 2008-01-01 | Gulachenski et al. | Applicant |
| US2008/0010435(A1) | 2008-01-01 | Smith et al. | Applicant |
| US2008/0025108(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0025122(A1) | 2008-01-01 | Schakel et al. | Applicant |
| US2008/0025136(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0025137(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0027697(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0027702(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0027703(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0028135(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0028136(A1) | 2008-01-01 | Schakel et al. | Applicant |
| US2008/0028137(A1) | 2008-01-01 | Schakel et al. | Applicant |
| US2008/0031030(A1) | 2008-02-01 | Rajan et al. | Applicant |
| US2008/0031072(A1) | 2008-02-01 | Rajan et al. | Applicant |
| US2008/0037353(A1) | 2008-02-01 | Rajan et al. | Applicant |
| US2008/0056014(A1) | 2008-03-01 | Rajan et al. | Applicant |
| US2008/0062773(A1) | 2008-03-01 | Rajan et al. | Applicant |
| US2008/0065820(A1) | 2008-03-01 | Gillingham et al. | Applicant |
| US2008/0082763(A1) | 2008-04-01 | Rajan et al. | Applicant |
| US2008/0086588(A1) | 2008-04-01 | Danilak et al. | Applicant |
| US2008/0089034(A1) | 2008-04-01 | Hoss et al. | Applicant |
| US2008/0098277(A1) | 2008-04-01 | Hazelzet | Applicant |
| US2008/0103753(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0104314(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0109206(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0109595(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0109597(A1) | 2008-05-01 | Schakel et al. | Applicant |
| US2008/0109598(A1) | 2008-05-01 | Schakel et al. | Applicant |
| US2008/0115006(A1) | 2008-05-01 | Smith et al. | Applicant |
| US2008/0120443(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0120458(A1) | 2008-05-01 | Gillingham et al. | Applicant |
| US2008/0123459(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126687(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126688(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126689(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126690(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126692(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0133825(A1) | 2008-06-01 | Rajan et al. | Applicant |
| US2008/0159027(A1) | 2008-07-01 | Kim | Applicant |
| US2008/0170425(A1) | 2008-07-01 | Rajan | Applicant |
| US2008/0239857(A1) | 2008-10-01 | Rajan et al. | Applicant |
| US2008/0239858(A1) | 2008-10-01 | Rajan et al. | Applicant |
| US2009/0024789(A1) | 2009-01-01 | Rajan et al. | Applicant |
| US2009/0024790(A1) | 2009-01-01 | Rajan et al. | Applicant |
| US2009/0109613(A1) | 2009-04-01 | Legen et al. | Applicant |
| US2009/0216939(A1) | 2009-08-01 | Smith et al. | Applicant |
| US2009/0285031(A1) | 2009-11-01 | Rajan et al. | Applicant |
| US2009/0290442(A1) | 2009-11-01 | Rajan | Applicant |
| US2010/0005218(A1) | 2010-01-01 | Gower et al. | Examiner |
| US2010/0020585(A1) | 2010-01-01 | Rajan | Applicant |
| US2010/0257304(A1) | 2010-10-01 | Rajan et al. | Applicant |
| US2010/0271888(A1) | 2010-10-01 | Rajan | Applicant |
| US2010/0281280(A1) | 2010-11-01 | Rajan et al. | Applicant |
| DE102004051345 | 2006-05-01 | Applicant | |
| DE102004053316 | 2006-05-01 | Applicant | |
| DE102005036528 | 2007-02-01 | Applicant | |
| EP644547 | 1995-03-01 | Applicant | |
| JP62121978 | 1987-06-01 | Applicant | |
| JP1171047 | 1989-07-01 | Applicant | |
| JP3-029357 | 1991-02-01 | Applicant | |
| JP3029357 | 1991-02-01 | Applicant | |
| JP3/276487 | 1991-12-01 | Applicant | |
| JP3286234 | 1991-12-01 | Applicant | |
| JP7-141870 | 1995-06-01 | Applicant | |
| JP8/077097 | 1996-03-01 | Applicant | |
| JP8077097 | 1996-03-01 | Applicant | |
| JP11-149775 | 1999-06-01 | Applicant | |
| JP2002025255 | 2002-01-01 | Applicant | |
| JP3304893(B2) | 2002-05-01 | Applicant | |
| JP2006236388 | 2006-09-01 | Applicant | |
| KR1020040062717 | 2004-07-01 | Applicant | |
| WO95/05676 | 1995-02-01 | Applicant | |
| WO9900734 | 1999-01-01 | Applicant | |
| WO1/90900 | 2001-11-01 | Applicant | |
| WO1/97160 | 2001-12-01 | Applicant | |
| WO2007002324 | 2007-01-01 | Applicant | |
| WO2007/028109 | 2007-03-01 | Applicant | |
| WO2007/038225 | 2007-04-01 | Applicant | |
| WO2007/095080 | 2007-08-01 | Applicant | |
| WO2008063251 | 2008-05-01 | Applicant |
Non-Patent Literature (115)
- Office Action from U.S. Appl. No. 11/461,427 mailed on Sep. 5, 2008.Applicant
- Final Office Action from U.S. Appl. No. 11/461,430 mailed on Sep. 8, 2008.Applicant
- Notice of Allowance from U.S. Appl. No. 11/474,075 mailed on Nov. 26, 2008.Applicant
- Office Action from U.S. Appl. No. 11/474,076 mailed on Nov. 3, 2008.Applicant
- Office Action from U.S. Appl. No. 11/524,811 mailed on Sep. 17, 2008.Applicant
- Kellerbauer “Die Schnelle Million,” with translation, “The quick million.”.Applicant
- Wu et al., “cNVy: A Non-Volatile, Main Memory Storage System,” to appear in ASPLOS VI.Applicant
- “Using Two Chip Selects to Enable Quad Rank,” IP.com PriorArtDatabase, copyright IP.com, Inc. 2004.Applicant
- “BIOS and Kernel Developer's Guide (BKDG) for AMD Family 10h Processors,” AMD, 31116 Rev 3.00, Sep. 7, 2007.Applicant
- Skerlj et al., “Buffer Device for Memory Modules (DIMM)” Qimonda 2006, p. 1.Applicant
- Written Opinion from PCT Application No. PCT/US06/24360 mailed on Jan. 8, 2007.Applicant
- Preliminary Report On Patentability from PCT Application No. PCT/US06/24360 mailed on Jan. 10, 2008.Applicant
- Written Opinion from International PCT Application No. PCT/US06/34390 mailed on Nov. 21, 2007.Applicant
- International Search Report from PCT Application No. PCT/US06/34390 mailed on Nov. 21, 2007.Applicant
- Non-final Office Action from U.S. Appl. No. 11/461,430 mailed on Feb. 19, 2009.Applicant
- Final Office Action from U.S. Appl. No. 11/461,435 mailed on Jan. 28, 2009.Applicant
- Non-final Office Action from U.S. Appl. No. 11/461,437 mailed on Jan. 26, 2009.Applicant
- Non-final Office Action from U.S. Appl. No. 11/939,432 mailed on Feb. 6, 2009.Applicant
- Wu et al., “eNVy: A Non-Volatile, Main Memory Storage System,” ASPLOS-VI Proceedings—Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, San Jose, California, Oct. 4-7, 1994. SIGARCH Computer Architecture News 22(Special Issue Oct. 1994).Applicant
- German Office Action From German Patent Application No. 11 2006 002 300.4-55 Mailed Jun. 5, 2009 (With Translation).Applicant
- Non-Final Office Action From U.S. Appl. No. 11/461,430 Mailed Feb. 19, 2009.Applicant
- Final Office Action From U.S. Appl. No. 11/461,435 Mailed Jan. 28, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/461,437 Mailed Jan. 26, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/461,441 Mailed Apr. 2, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/611,374 Mailed Mar. 23, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/762,010 Mailed Mar. 20, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/939,432 Mailed Feb. 6, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 12/111,819 Mailed Apr. 27, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 12/111,828 Mailed Apr. 17, 2009.Applicant
- Fang et al., W. Power Complexity Analysis of Adiabatic SRAM, 6th Int. Conference on ASIC, vol. 1, Oct. 2005, pp. 334-337.Applicant
- Pavan et al., P. A Complete Model of E2PROM Memory Cells for Circuit Simulations, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, No. 8, Aug. 2003, pp. 1072-1079.Applicant
- German Office Action From German Patent Application No. 11 2006 001 810.8-55 Mailed Apr. 20, 2009 (With Translation).Applicant
- Great Britain Office Action from GB Patent Application No. GB0800734.6 Mailed Mar. 1, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/461,420 Mailed Apr. 28, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/553,372 Mailed Mar. 12, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/553,399 Mailed Mar. 22, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/588,739 Mailed Dec. 29, 2009.Applicant
- Notice of Allowance from U.S. Appl. No. 11/611,374 Mailed Apr. 5, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/828,181 Mailed Mar. 2, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/828,182 Mailed Mar. 29, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/858,518 Mailed Apr. 21, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,432 Mailed Jan. 14, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,571 Mailed Mar. 3, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,631 Mailed Mar. 3, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,636 Mailed Mar. 9, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,655 Mailed Mar. 3, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/939,432 Mailed Dec. 1, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/939,432 Mailed Apr. 12, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 12/111,819 Mailed Mar. 10, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/507,682 Mailed Mar. 8, 2010.Applicant
- Great Britain Office Action from GB Patent Application No. GB0803913.3 Mailed Mar. 1, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/461,435 Dated May 13, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/515,167 Dated Jun. 3, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/515,223 Dated Jul. 30, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/553,390 Dated Jun. 24, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Jul. 19, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/672,921 Dated Jul. 23, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/702,960 Dated Jun. 21, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/762,010 Dated Jul. 2, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/763,365 Dated Jun. 29, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,500 Dated Jun. 24, 2010.Applicant
- Office Action from U.S. Appl. No. 12/574,628 Dated Jun. 10, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/461,420 Dated Jul. 23, 2009.Applicant
- Notice of Allowance from U.S. Appl. No. 11/461,430 Dated Sep. 9, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/461,435 Dated Aug. 5, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/515,167 Dated Sep. 25, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/515,223 Dated Sep. 22, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/538,041 Dated Jun. 10, 2009.Applicant
- Non-Final Office Action from U.S. Appl.No. 11/553,372 Dated Jun. 25, 2009.Applicant
- Notice of Allowance from U.S. Appl. No. 11/553,372 Dated Sep. 30, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/553,390 Dated Sep. 9, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/553,399 Dated Jul. 7, 2009.Applicant
- Notice of Allowance from U.S. Appl. No. 11/553,399 Dated Oct. 13, 2009.Applicant
- Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Sep. 15, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/702,960 Dated Sep. 25, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/702,981 Dated Aug. 19, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/762,013 Dated Jun. 5, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/763,365 Dated Oct. 28, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/858,518 Dated Aug. 14, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,500 Dated Oct. 13, 2009.Applicant
- Notice of Allowance from U.S. Appl. No. 11/939,432 Dated Sep. 24, 2009.Applicant
- Non-Final Office Action from U.S. App. No. 11/941,589 Dated Oct. 1, 2009.Applicant
- Supplemental European Search Report and Search Opinion issued Sep. 21, 2009 in European Application No. 07870726.2, 8 pp.Applicant
- Wu et al., “eNVy: a Non-Volatile, Main Memory Storage System”, ASPLOS-VI Proceedings, Oct. 4-7, 1994, pp. 86-97.Applicant
- Buffer Device for Memory Modules (DIMM), IP.com Prior Art Database, <URL: http://ip.com/Ipcom/000144850>, Feb. 10, 2007, 1 pg.Applicant
- German Office Action from German Patent Application No. 11 2006 002 300.4-55 Dated May 11, 2009 (With Translation).Applicant
- International Preliminary Examination Report From PCT Application No. PCT/US07/016385 Dated Feb. 3, 2009.Applicant
- Search Report and Written Opinion From PCT Application No. PCT/US07/03460 Dated on Feb. 14, 2008.Applicant
- Notice of Allowance from U.S. Appl. No. 11/553,372 Dated Aug. 4, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/553,399 Dated Dec. 3, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Oct. 29, 2010.Applicant
- Final Office Action from Application No. 11/672,924 Dated Sep. 7, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/702,981 Dated Mar. 11, 2009.Applicant
- Notice of Allowance from U.S. Appl. No. 11/762,010 Dated Oct. 22, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/762,013 Dated Aug. 17, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/762,013 Dated Dec. 7, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/763,365 Dated Oct. 20, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/855,805 Dated Sep. 21, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/858,518 Dated Sep. 8, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,225 Dated Aug. 27, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,261 Dated Sep. 7, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,286 Dated Aug. 20, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,403 Dated Aug. 31, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,417 Dated Aug. 31, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,432 Dated Aug. 20, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,450 Dated Aug. 20, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,483 Dated Oct. 7, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,631 Dated Nov. 18, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,655 Dated Nov. 22, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/939,440 Dated Sep. 17, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/941,589 Dated Oct. 25, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/057,306 Dated Oct. 8, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/203,100 Dated Dec. 1, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/769,428 Dated Nov. 8, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/838,896 Dated Sep. 3, 2010.Applicant