Memory module and method having improved signal routing topology

Information

  • Patent Grant
  • 7746095
  • Patent Number
    7,746,095
  • Date Filed
    Monday, June 8, 2009
    16 years ago
  • Date Issued
    Tuesday, June 29, 2010
    15 years ago
Abstract
A registered memory module includes several memory devices coupled to a register through a plurality of transmission lines forming a symmetrical tree topology. The tree includes several branches each of which includes two transmission lines coupled only at its ends to either another transmission line or one of the memory devices. The branches are arranged in several layers of hierarchy, with the transmission lines in branches having the same hierarchy having the same length. Each transmission line preferably has a characteristic impedance that is half the characteristic impedance of any pair of downstream transmission lines to which it is coupled to provide impedance matching. A dedicated transmission line is used to couple an additional memory device, which may or may not be an error checking memory device, to the register.
Description
TECHNICAL FIELD

The present invention relates to memory systems, and, more particularly, to memory modules having transmission lines coupled to a large number of memory devices.


BACKGROUND OF THE INVENTION

Memory devices are in widespread use in a variety of processor-based systems, such as computer systems. In some cases, memory devices can be mounted on the same circuit board as a processor and a memory controller, which is generally used to couple the memory devices to the processor. However, in most cases, the memory devices are part of a memory module in which several memory devices are mounted on a common substrate, such as a printed circuit board. The memory modules are generally plugged into sockets mounted on a motherboard to establish communication with a memory controller and processor. Such memory modules are commonly used in computer systems as system memory in which the memory modules are dynamic random access memory (“DRAMs”) devices.


Although the memory devices in a memory module may be coupled directly to a memory controller, in one type of memory module, known as a “registered” memory module, the memory devices are coupled to a register that is, in turn, coupled to the memory controller. More specifically, in a registered DRAM module, the command and address lines from the memory controller are coupled to a register. The register stores memory commands and addresses coupled through the command and address lines, respectively, and then couples the commands and addresses to the memory devices. Data signals are typically coupled directly to and from the memory devices without being registered. By registering the command and address signals, they can be coupled to the memory module for a relatively short period of time since it is not necessary to wait for the memory devices to latch the command and address signals. Also, registering the command and address signals avoids excessive loading of the command and address lines because the command and address lines are coupled to only a single device, i.e., the register, rather than to multiple devices, i.e., all of the memory devices.


The manner in which each of the command and address lines are routed from the register to the memory devices can significantly affect the performance of the memory module. One coupling topology, known as a “daisy chain” topology, is shown in FIG. 1A. In a daisy chain topology, a first transmission line 10, which may be a command signal line or an address signal line, extends from a register 16 to one end of a second transmission line 20 (which is a single conductor, but functions as separate segments or transmission lines 20a-g). Respective transmission lines 30a-h are coupled to spaced apart locations of the transmission lines 20(a-g). The transmission lines 30a-h each extend to an input terminal of respective memory devices 36a-h, which, in this case are DRAM devices.


A “hybrid tree” topology shown in FIG. 1B differs from the daisy chain topology of FIG. 1A in that the first transmission line 10 is coupled to the center of the second transmission line 20a rather than to one of its ends. In alternative embodiments of a hybrid tree topology, the first transmission line 10 may be coupled to locations of the second transmission lines 20(a-d) other than either one end or the center of the second transmission line 20. Like the daisy chain topology shown in FIG. 1A, respective transmission lines 30a-h are coupled to spaced apart locations of the transmission lines 20a-d and extend to input terminals of the respective memory devices 36a-h.


Still another hybrid tree topology shown in FIG. 1C uses two separate transmission lines 20a,b coupled to the transmission lines 30a-d, 30e-h. Transmission lines 20a and 20b are made up of transmission lines 20aa, 20ab, 20ac, 20ad, 20ba, 20bb, 20bc and 20bd respectively. The transmission lines 20a,b are, in turn, coupled to the first transmission line 10 through a third transmission line 40, which joins the first transmission line 10 at the center of the transmission line 40. Transmission line 40 is made up of transmission lines 44a and 44b. Transmission lines 44a and 44b are coupled to the transmission lines 20a,b at the ends of the transmission line 40 by respective transmission lines 44a,b.


The daisy chain and hybrid tree topologies shown in FIGS. 1A-1C can provide adequate performance at relatively slow speeds, but they provide less than optimum performance at higher operating speeds. In particular, signals coupled through the transmission line 20 (or transmission lines 20a,b in the case of the topology shown in FIG. 1C) reflect from the junctions with the transmission lines 30a-h as well as from the junction between each of the transmission lines 30a-h and its respective memory devices 36a-h, respectively. These reflections produce destructive and constructive interference at each of the junctions between the transmission line 20 and the transmission lines 30a-h that can seriously degrade signals coupled to the memory devices 36. The hybrid tree topologies shown in FIGS. 1B and 1C place the transmission lines 30a-h closer to the ends of the transmission line 20 compared to the daisy chain topology shown in FIG. 1A. Therefore, the hybrid tree topologies tend to provide better performance than the daisy chain topology. However, the hybrid tree topologies still provide less than optimum performance. Further, the hybrid tree topology shown in FIG. 1C also produces reflections from the junctions between the transmission lines 20a,b and the transmission lines 44a,b.


Although the signal reflection problems have been described in the context of registered memory modules, the same problem can exist in other types of memory modules. For example, in a memory hub module, signals are coupled from a memory hub in the module to each of several memory devices in the module. Also, in a buffered memory module, signals are coupled from respective buffers in the module to each of several memory devices in the module. Reflections produced in these types of memory modules can degrade performance in essentially the same manner as described above.


There is therefore a need for a connection topology for routing signals to memory devices in memory modules that can avoid signal degradation caused by reflections generated at the junctions between transmission lines and memory device terminals and between different transmission lines.


BRIEF SUMMARY OF THE INVENTION

A signal routing topology and method couples signals between an active memory component, such as a register, and a plurality of memory devices using transmission lines. The transmission lines are each connected at only its ends to either an input terminal of one of the memory devices or to an end of another of the transmission lines. The transmission lines form a symmetrical tree having several levels of hierarchy, with the transmission lines in the same level of hierarchy having the same length. The transmission lines are preferably impedance matched to pairs of transmission lines to which they are coupled. In the event the memory module contains an odd-numbered memory device, such as an error checking memory device, the odd-numbered memory device is coupled to the active memory component through a dedicated transmission line.





BRIEF DESCRIPTION OF THE DRAWINGS


FIGS. 1A-1C are schematic diagrams showing topologies for routing signal lines from registers to memory devices in conventional registered memory modules.



FIG. 2 is a schematic diagram showing one topology for routing transmission lines from a register to memory devices in a registered memory module according to one embodiment of the invention.



FIG. 3 is a schematic diagram showing a topology for routing transmission lines from a register to memory devices in a registered memory module having error checking capabilities according to another embodiment of the invention.



FIG. 4 is a block diagram of a computer system including registered memory modules in accordance with the present invention.





DETAILED DESCRIPTION

A topology for routing signals from a register to memory devices in a registered memory module according to one embodiment of the invention is shown in FIG. 2. The memory module 50 includes a register 58 and four dynamic random access memory (“DRAM”) devices 60a-d. A large number of address and command lines are coupled from the register 58 to the DRAM devices 60a-d, although the signal lines for routing only one of these signals are shown in FIG. 2. The register 58 includes an output buffer 62 for each signal that is coupled to a first transmission line 64. The end of the first transmission line 64 is coupled to a first branch 70 that consists of two transmission lines 72, 74. The branch 70 is symmetrical in that both of the transmission lines 72, 74 have the same electrical and physical characteristics, particularly the same length. The ends of the transmission lines 72, 74 are coupled to a second pair of branches 80, 82, respectively. The branches 80, 82 are symmetrical internally and with each other as they are each formed by two transmission lines 86, 88 and 90, 92, respectively, having the same length. Although it is necessary that the transmission lines 86, 88 and 90, 92 of the respective branches 80, 82 all be of the same length, it is not necessary that the lengths of these transmission lines 86, 88, 90, 92 be equal to the lengths of the transmission lines 72, 74 in the branch 70. Finally, the end of each of the transmission lines 86, 88, 90, 92 is coupled to a respective one of the DRAMs 60a-d.


In operation, a signal is coupled through the first transmission line 64 to the transmission lines 72, 74 of the first branch 70. If these transmission lines are of the same impedance there is a mismatch and some of the energy reflected and some of the energy is passed. When the signal reaches the ends of the transmission lines 72, 74, it is again reflected from the junctions with the branches 80, 82, respectively. As a result, the signal is coupled to the branches 80, 82 with less magnitude. The reflections of the signal are then coupled back through the transmission lines 72, 74 to the junction of the transmission line 64. The reflected signals reach the junction with the transmission line 64 at the same time so that they appear as a single transmission line coupling to a higher impedance transmission line. This acts to reflect in phase increasing the voltage that eventually reaches the DRAMs. In a similar manner, the signal coupled to the branches 80, 82 have a relatively large magnitude at the ends of the transmission lines 86, 88 and 90, 92 because of their reflection from an input terminal of the DRAMs 60a-d. An open circuit reflects the signal resulting in an apparent doubling of the voltage. The signals reflected from the DRAMs 60a-d reach the junctions to the transmission lines 72, 74 at the same time because the lengths of the transmission lines 86, 88, 90, 92 are all identical. As a result, the impedance of the transmission lines 86, 88 and 90, 92 at their junction to the transmission lines 72, 74, respectively, appear to have a lower impedance coupling to a higher impedance resulting in an in phase reflection back to the DRAMs resulting in more signal at the DRAMs. The signals reflected through the transmission lines 86, 88 and 90, 92 are also coupled through the transmission lines 72, 74, respectively, of the first branch 70 where they reach the junction to the first transmission line 64 at the same time. Again another reflection back towards the DRAMs. The result of all these reflections is a stairstep of increasing voltage at the DRAMs.


Using a tree of transmission lines in which each branch is entirely symmetrical maximizes the magnitude of signals coupled to the DRAMs 60a-d and minimizes the magnitude of reflections reflected from the end of each transmission line. By coupling the DRAMs 60a-d only to the ands of the transmission lines, the destructive interference away from the ends of the transmission lines, which reduces signal amplitude, is avoided.


The symmetrical tree used in the memory module 50 of FIG. 2 includes branches with only two levels of hierarchy, namely the first branch 70 with a first level of hierarchy and the second branches 80, 82 with a second level of hierarchy. However, since each branch consists of two transmission lines each coupled to either a transmission line or a memory device at only its end, a memory module having 2N of the memory devices will have N hierarchies of branches.


The reflections from the junctions between the transmission lines 86, 88 and 90, 92 and the transmission lines 72, 74, respectively, and from the junctions between the transmission lines 72, 74 and the transmission line 64 can be reduced even further by impedance matching the transmission lines. More specifically, as is well known in the art, each transmission line has a characteristic impedance. As is also well-known in the art, signals coupled through a transmission line are reflected from impedance discontinuities in the line. Therefore, such reflections can be avoided by avoiding impedance discontinuities. If the first transmission line 64 has an impedance of R (e.g., 17.5 ohms), the transmission lines 72, 74 in the first branch should each have an impedance of 2R (i.e., 35 ohms) since two resistors in parallel have an impedance of half the impedance of each resistor. Similarly, the transmission lines 86, 88, 90, 92 should each have an impedance of 4R (i.e., 70 ohms).


Although impedance matching of the transmission lines used in a symmetrical tree in accordance with the invention is desirable, it is not necessary. Furthermore, it may not be practical to provide impedance matching where the tree includes a large number of branch hierarchies because the practical range of impedance values that can be obtained is very limited. With commonly used conductive materials mounted on commonly used substrates, the transmission lines formed by the conductive materials become excessively wide at impedance values much less than 15 ohms, and they become excessively narrow at impedance values much larger than 80 ohms.


Data are commonly stored in a memory module using an even number of memory devices, and, more commonly, a number of memory devices equal to powers of two, i.e. 2, 4, 8, etc. However, some memory modules include error checking and/or correcting (“ECC”) capabilities, which generally requires an additional memory device. The use of an odd number of memory devices, such as an ECC memory device, precludes coupling the memory devices through a symmetrical tree. However, the benefits of a symmetrical tree can be obtained using the topography shown in FIG. 3. FIG. 3 shows the same components of a memory module that are shown in FIG. 3 with the addition of an ECC DRAM 90. Therefore, in the interest of brevity, all of the component shown in FIG. 3 have been provided with the same reference numerals, and an explanation of their structure in operation will not be repeated. Although ECC capabilities can be obtained using the odd-numbered ECC DRAM 90 as shown in FIG. 3, ECC capabilities can also be obtained by simply using one of the DRAMs 60a-d to store ECC data.


The ECC DRAM 90 is coupled to the output of the buffer 62 through a dedicated transmission line 94 extending from a location at or near the buffer 62 to a terminal of the DRAM 90. By placing the junction between the transmission line 94 and the first transmission line 64 near the buffer 62, the magnitude of any reflections from the junction that are coupled through the tree is relatively small. The transmission line 94 preferably has a length that is equal to the combined length of the transmission lines between the buffer 62 and the DRAMs 60a-d so that a signal from the buffer 62 reaches the ECC DRAM 90 at the same time the signal reaches the DRAMs 60a-d. Also, any reflections from the DRAMs 60a-d reach the buffer 62 at the same time that any reflection from the ECC DRAM 90 reaches the buffer 62 so that the transmission lines to ECC DRAM 90 and DRAMs 60a-d can be considered to be in parallel. If the output impedance of buffer 62 is equal to this parallel impedance then signals reflected from the DRAMs 60a-d and 90 are not reflected from the output of the buffer 62.


A computer system 100 according to one embodiment of the invention is shown in FIG. 4. The computer system 100 includes a processor 104 for performing various computing functions, such as executing specific software to perform specific calculations or tasks. The processor 104 includes a processor bus 106 that normally includes an address bus, a control bus, and a data bus. The processor bus 106 is typically coupled to cache memory 108, which, is typically static random access memory (“SRAM”). Finally, the processor bus 106 is coupled to a system controller 110, which is also sometimes referred to as a bus bridge.


The system controller 110 serves as a communications path to the processor 104 for a variety of other components. More specifically, the system controller 110 includes a graphics port that is typically coupled to a graphics controller 112, which is, in turn, coupled to a video terminal 114. The system controller 110 is also coupled to one or more input devices 118, such as a keyboard or a mouse, to allow an operator to interface with the computer system 100. Typically, the computer system 100 also includes one or more output devices 120, such as a printer, coupled to the processor 104 through the system controller 110. One or more data storage devices 124 are also typically coupled to the processor 104 through the system controller 110 to allow the processor 104 to store data or retrieve data from internal or external storage media (not shown). Examples of typical storage devices 124 include hard and floppy disks, tape cassettes, and compact disk read-only memories (CD-ROMs).


The system controller 110 includes a memory controller 128 that is coupled to several registered memory modules 130a,b . . . n, which serve as system memory for the computer system 100. The memory modules 130 are coupled to the memory controller 128 through a bus system 134. The memory modules 130 are shown coupled to the memory controller 128 in a multi-drop arrangement in which the single bus system 134 is coupled to all of the memory modules 130. However, it will be understood that other topologies may also be used.


Each of the memory modules 130 includes a register 140 for storing command and address signals as well as eight memory devices 148, which, in the example illustrated in FIG. 4, are synchronous dynamic random access memory (“SDRAM”) devices. However, a fewer or greater number of memory devices 148 may be used, and memory devices other than SDRAM devices may also be used. The register 140 is coupled to each of the system memory devices 148 through symmetrical tree 150 in accordance with the present invention. An error checking and/or correcting memory device is included in the memory module 130n, in which the topography shown in FIG. 3 is preferably used.


From the foregoing it will be appreciated that, although specific embodiments of the invention have been described herein for purposes of illustration, various modifications may be made without deviating from the spirit and scope of the invention. For example, transmission line topologies according to the present invention can be used to couple signals to memory devices other than DRAMs and to memory devices from components other than registers. As previously mentioned, transmission line topologies according to the present invention can be used to route signals to memory devices from buffers or memory hubs, for example. Accordingly, the invention is not limited except as by the appended claims.

Claims
  • 1. A memory module, comprising: a plurality of memory devices;a component having a plurality of input terminals and a plurality of output terminals; anda symmetrical tree coupling each of several of the output terminals of the component to respective input terminals of the memory devices, the symmetrical tree comprising at least one branch, each branch including a pair of transmission lines coupled to each other at one end and to either a transmission line of another branch or one of the memory devices at another end, each of the transmission lines having a characteristic impedance, the transmission lines being arranged in a plurality of hierarchies with the transmission lines in the same hierarchy having substantially the same characteristic impedance.
  • 2. The memory module of claim 1, further comprising an initial transmission line coupling the component to one of the branches of the symmetrical tree.
  • 3. The memory module of claim 2 wherein the initial transmission line is coupled only to either the component or to one of the branches of the symmetrical tree.
  • 4. The memory module of claim 1 wherein each of the memory devices comprise a respective dynamic random access memory device.
  • 5. The memory module of claim 1 wherein the component comprises an active memory component.
  • 6. The memory module of claim 5 wherein the active memory component comprises a memory hub.
  • 7. The memory module of claim 5 wherein the active memory component comprises a buffer.
  • 8. The memory module of claim 1 wherein the transmission lines in each of the branches are configured so that respective propagation times during which a signal may propagate through the symmetrical tree from the component to each of the memory devices is substantially the same.
  • 9. A module, comprising: a plurality of first devices;a second device; anda symmetrical tree coupled to the second device, the symmetrical tree comprising a plurality of branches each of which comprises a pair of transmission lines coupled to each other and to another transmission line at one end and to either a transmission line of another branch or one of the first devices at another end, the transmission lines being arranged in a plurality of hierarchies with the transmission lines in the same hierarchy having substantially the same length.
  • 10. The module of claim 9, further comprising an initial transmission line having a first end coupled to the second device and a second end coupled to one of the branches of the symmetrical tree, the initial transmission line being coupled only to the second device and to the one of the branches.
  • 11. The module of claim 9 wherein each of the first devices comprise a memory device, and wherein the second component comprises a memory hub.
  • 12. The module of claim 9 wherein the second device comprises a buffer.
  • 13. The module of claim 9, further comprising: an third device; anda dedicated transmission line coupling the second device to the third device.
  • 14. The module of claim 13 wherein the dedicated transmission line is coupled only to the second device and the third device.
  • 15. The module of claim 13 wherein the third device comprises a respective one of the second devices.
  • 16. The memory module of claim 9 wherein both of the transmission lines in each of the hierarchies have the same length.
  • 17. A module, comprising: a plurality of first devices;a second device; anda symmetrical tree coupled to the second device, the symmetrical tree comprising at least one branch that comprises a pair of transmission lines coupled to each other and to another transmission line at one end and to either a transmission line of another branch or one of the first devices at another end, each of the transmission lines having a characteristic impedance, the transmission lines being arranged in a plurality of hierarchies with the transmission lines in the same hierarchy having substantially the same characteristic impedance.
  • 18. The module of claim 17 wherein each of the first devices comprise a memory device, and wherein the second device comprises a memory hub.
  • 19. The module of claim 17 wherein each of the first devices comprise a memory device, and wherein the second device comprises a register for storing address and command signals and outputting the stored address and command signals to the memory devices.
  • 20. The module of claim 17 wherein the characteristic impedance of each transmission line in each branch is approximately twice the characteristic impedance of any transmission line that it is connected between the transmission line and the second device.
  • 21. The module of claim 17 wherein the second device is connected to one of the branches of the symmetrical tree through an initial transmission line, the initial transmission line having approximately half the characteristic impedance of the transmission lines in the branch to which it is connected.
  • 22. The module of claim 17 wherein both of the transmission lines in each branch have substantially the same length.
  • 23. A module, comprising: a plurality of first devices;a second device; anda symmetrical tree coupled to the second device, the symmetrical tree comprising a plurality of branches each of which comprises a pair of transmission lines coupled to each other and to another transmission line at one end and to either a transmission line of another branch or one of the first devices at another end, the transmission lines being arranged in a plurality of hierarchies with both of transmission lines in the same hierarchy being configured so that a time period during which a signal may propagate through each of the transmission lines is substantially the same for both transmission lines.
  • 24. the module of claim 23 wherein the transmission lines are configured so that respective propagation times during which a signal may propagate from the second device to each of the first devices is substantially the same.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 11/973,684, filed Oct. 9, 2007, which is a continuation of U.S. patent application Ser. No. 11/238,900, filed Sep. 28, 2005, U.S. Pat. No. 7,282,947, which is a divisional of U.S. patent application Ser. No. 10/932,477, filed Sep. 1, 2004, U.S. Pat. No. 7,242,213, which is a continuation of U.S. patent application Ser. No. 10/460,588, filed Jun. 11, 2003, U.S. Pat. No. 7,245,145. These applications are incorporated by reference herein.

US Referenced Citations (347)
Number Name Date Kind
3777154 Lindsey Dec 1973 A
4045781 Levy et al. Aug 1977 A
4240143 Besemer et al. Dec 1980 A
4245306 Besemer et al. Jan 1981 A
4253144 Bellamy et al. Feb 1981 A
4253146 Bellamy et al. Feb 1981 A
4443845 Hamilton et al. Apr 1984 A
4608702 Hirzel et al. Aug 1986 A
4707823 Holdren et al. Nov 1987 A
4724520 Athanas et al. Feb 1988 A
4809232 Baumbaugh et al. Feb 1989 A
4813772 Kowel et al. Mar 1989 A
4823403 Twietmeyer Apr 1989 A
4825208 Mueller et al. Apr 1989 A
4891808 Williams Jan 1990 A
4930128 Suzuki et al. May 1990 A
4953930 Ramsey et al. Sep 1990 A
5241506 Motegi et al. Aug 1993 A
5243703 Farmwald et al. Sep 1993 A
5251303 Fogg, Jr. et al. Oct 1993 A
5269022 Shinjo et al. Dec 1993 A
5307381 Ahuja Apr 1994 A
5317752 Jewett et al. May 1994 A
5319755 Farmwald et al. Jun 1994 A
5327553 Jewett et al. Jul 1994 A
5355391 Horowitz et al. Oct 1994 A
5379382 Work et al. Jan 1995 A
5414819 Redmond et al. May 1995 A
5423009 Zhu Jun 1995 A
5432823 Gasbarro et al. Jul 1995 A
5432907 Picazo, Jr. et al. Jul 1995 A
5442770 Barratt Aug 1995 A
5461627 Rypinski Oct 1995 A
5465229 Bechtolsheim et al. Nov 1995 A
5479370 Furuyama et al. Dec 1995 A
5493437 Lebby et al. Feb 1996 A
5497476 Oldfield et al. Mar 1996 A
5502621 Schumacher et al. Mar 1996 A
5532856 Li et al. Jul 1996 A
5544319 Acton et al. Aug 1996 A
5544345 Carpenter et al. Aug 1996 A
5566325 Bruce, II et al. Oct 1996 A
5568574 Tanguay, Jr. et al. Oct 1996 A
5577220 Combs et al. Nov 1996 A
5581767 Katsuki et al. Dec 1996 A
5606717 Farmwald et al. Feb 1997 A
5608264 Gaul Mar 1997 A
5623534 Desai et al. Apr 1997 A
5638334 Farmwald et al. Jun 1997 A
5638534 Mote, Jr. Jun 1997 A
5659798 Blumrich et al. Aug 1997 A
5706224 Srinivasan et al. Jan 1998 A
5710733 Chengson et al. Jan 1998 A
5715456 Bennett et al. Feb 1998 A
5729709 Harness Mar 1998 A
5748616 Riley May 1998 A
5787475 Pawlowski Jul 1998 A
5796413 Shipp et al. Aug 1998 A
5808897 Miller, Jr. et al. Sep 1998 A
5818844 Singh et al. Oct 1998 A
5818984 Ahmad et al. Oct 1998 A
5819304 Nilsen et al. Oct 1998 A
5822255 Uchida Oct 1998 A
5831467 Leung et al. Nov 1998 A
5832250 Whittaker Nov 1998 A
5872944 Goldrian et al. Feb 1999 A
5875352 Gentry et al. Feb 1999 A
5875454 Craft et al. Feb 1999 A
5887159 Burrows Mar 1999 A
5928343 Farmwald et al. Jul 1999 A
5966724 Ryan Oct 1999 A
5973935 Schoenfeld et al. Oct 1999 A
5973951 Bechtolsheim et al. Oct 1999 A
5978567 Rebane et al. Nov 1999 A
5987196 Noble Nov 1999 A
6023726 Saksena Feb 2000 A
6026226 Heile et al. Feb 2000 A
6029250 Keeth Feb 2000 A
6031241 Silfvast et al. Feb 2000 A
6033951 Chao Mar 2000 A
6061263 Boaz et al. May 2000 A
6061296 Ternullo, Jr. et al. May 2000 A
6067262 Irrinki et al. May 2000 A
6073190 Rooney Jun 2000 A
6076139 Welker et al. Jun 2000 A
6078451 Ioki Jun 2000 A
6079008 Clery, III Jun 2000 A
6088774 Gillingham Jul 2000 A
6092158 Harriman et al. Jul 2000 A
6098158 Lay et al. Aug 2000 A
6101151 Watanabe et al. Aug 2000 A
6105075 Ghaffari Aug 2000 A
6105088 Pascale et al. Aug 2000 A
6111757 Dell et al. Aug 2000 A
6125431 Kobayashi Sep 2000 A
6128703 Bourekas et al. Oct 2000 A
6131149 Lu et al. Oct 2000 A
6134624 Burns et al. Oct 2000 A
6137709 Boaz et al. Oct 2000 A
6144327 Distinti et al. Nov 2000 A
6144587 Yoshida Nov 2000 A
6167465 Parvin et al. Dec 2000 A
6167486 Lee et al. Dec 2000 A
6175571 Haddock et al. Jan 2001 B1
6185352 Hurley Feb 2001 B1
6185676 Poplingher et al. Feb 2001 B1
6186400 Dvorkis et al. Feb 2001 B1
6191663 Hannah Feb 2001 B1
6201724 Ishizaki et al. Mar 2001 B1
6208180 Fisch et al. Mar 2001 B1
6219725 Diehl et al. Apr 2001 B1
6223301 Santeler et al. Apr 2001 B1
6226729 Stevens et al. May 2001 B1
6229712 Munoz-Bustamante et al. May 2001 B1
6229727 Doyle May 2001 B1
6233376 Updegrove May 2001 B1
6243769 Rooney Jun 2001 B1
6243831 Mustafa et al. Jun 2001 B1
6246618 Yamamoto et al. Jun 2001 B1
6247107 Christie Jun 2001 B1
6249802 Richardson et al. Jun 2001 B1
6256253 Oberlaender et al. Jul 2001 B1
6256692 Yoda et al. Jul 2001 B1
6266730 Perino et al. Jul 2001 B1
6272609 Jeddeloh Aug 2001 B1
6285349 Smith Sep 2001 B1
6286083 Chin et al. Sep 2001 B1
6294937 Crafts et al. Sep 2001 B1
6301637 Krull et al. Oct 2001 B1
6327642 Lee et al. Dec 2001 B1
6330205 Shimizu et al. Dec 2001 B2
6343171 Yoshimura et al. Jan 2002 B1
6344664 Trezza et al. Feb 2002 B1
6347055 Motomura Feb 2002 B1
6349363 Cai et al. Feb 2002 B2
6356573 Jonsson et al. Mar 2002 B1
6366375 Sakai et al. Apr 2002 B1
6366529 Williams et al. Apr 2002 B1
6367074 Bates et al. Apr 2002 B1
6370068 Rhee Apr 2002 B2
6370611 Callison et al. Apr 2002 B1
6373777 Suzuki Apr 2002 B1
6381190 Shinkai Apr 2002 B1
6389514 Rokicki May 2002 B1
6392653 Malandain et al. May 2002 B1
6401213 Jeddeloh Jun 2002 B1
6405273 Fleck et al. Jun 2002 B1
6405280 Ryan Jun 2002 B1
6421744 Morrison et al. Jul 2002 B1
6430696 Keeth Aug 2002 B1
6433785 Garcia et al. Aug 2002 B1
6434639 Haghighi Aug 2002 B1
6434654 Story et al. Aug 2002 B1
6434696 Kang Aug 2002 B1
6434736 Schaecher et al. Aug 2002 B1
6438622 Haghighi et al. Aug 2002 B1
6438668 Esfahani et al. Aug 2002 B1
6449308 Knight, Jr. et al. Sep 2002 B1
6453377 Farnworth et al. Sep 2002 B1
6453393 Holman et al. Sep 2002 B1
6457116 Mirsky et al. Sep 2002 B1
6460114 Jeddeloh Oct 2002 B1
6462978 Shibata et al. Oct 2002 B2
6463059 Movshovich et al. Oct 2002 B1
6470422 Cai et al. Oct 2002 B2
6473828 Matsui Oct 2002 B1
6477592 Chen et al. Nov 2002 B1
6477614 Leddige et al. Nov 2002 B1
6477621 Lee et al. Nov 2002 B1
6479322 Kawata et al. Nov 2002 B2
6490188 Nuxoll et al. Dec 2002 B2
6493784 Kamimura et al. Dec 2002 B1
6493803 Pham et al. Dec 2002 B1
6496193 Surti et al. Dec 2002 B1
6496909 Schimmel Dec 2002 B1
6501471 Venkataraman et al. Dec 2002 B1
6502161 Perego et al. Dec 2002 B1
6505287 Uematsu Jan 2003 B2
6507899 Oberlaender et al. Jan 2003 B1
6523092 Fanning Feb 2003 B1
6523093 Bogin et al. Feb 2003 B1
6526483 Cho et al. Feb 2003 B1
6526498 Mirsky et al. Feb 2003 B1
6539490 Forbes et al. Mar 2003 B1
6552304 Hirose et al. Apr 2003 B1
6552564 Forbes et al. Apr 2003 B1
6553479 Mirsky et al. Apr 2003 B2
6564329 Cheung et al. May 2003 B1
6567963 Trezza May 2003 B1
6570429 Hellriegel May 2003 B1
6584543 Williams et al. Jun 2003 B2
6587912 Leddige et al. Jul 2003 B2
6590816 Perner Jul 2003 B2
6594713 Fuoco et al. Jul 2003 B1
6594722 Willke, II et al. Jul 2003 B1
6598154 Vaid et al. Jul 2003 B1
6599031 Li Jul 2003 B2
6615325 Mailloux et al. Sep 2003 B2
6622227 Zumkehr et al. Sep 2003 B2
6623177 Chilton Sep 2003 B1
6628294 Sadowsky et al. Sep 2003 B1
6629220 Dyer Sep 2003 B1
6631440 Jenne et al. Oct 2003 B2
6636110 Ooishi et al. Oct 2003 B1
6636957 Stevens et al. Oct 2003 B2
6646929 Moss et al. Nov 2003 B1
6647470 Janzen Nov 2003 B1
6651139 Ozeki et al. Nov 2003 B1
6658509 Bonella et al. Dec 2003 B1
6661940 Kim Dec 2003 B2
6661943 Li Dec 2003 B2
6662304 Keeth et al. Dec 2003 B2
6665202 Lindahl et al. Dec 2003 B2
6667895 Jang et al. Dec 2003 B2
6681292 Creta et al. Jan 2004 B2
6681301 Mehta et al. Jan 2004 B1
6697926 Johnson et al. Feb 2004 B2
6707726 Nishio et al. Mar 2004 B2
6711652 Arimilli et al. Mar 2004 B2
6715018 Farnworth et al. Mar 2004 B2
6718440 Maiyuran et al. Apr 2004 B2
6721187 Hall et al. Apr 2004 B2
6721195 Brunelle et al. Apr 2004 B2
6724685 Braun et al. Apr 2004 B2
6728800 Lee et al. Apr 2004 B1
6735679 Herbst et al. May 2004 B1
6735682 Segelken et al. May 2004 B2
6745275 Chang Jun 2004 B2
6751113 Bhakta et al. Jun 2004 B2
6751703 Chilton Jun 2004 B2
6751722 Mirsky et al. Jun 2004 B2
6752539 Colgan et al. Jun 2004 B2
6754117 Jeddeloh Jun 2004 B2
6754812 Abdallah et al. Jun 2004 B1
6756661 Tsuneda et al. Jun 2004 B2
6760833 Dowling Jul 2004 B1
6771538 Shukuri et al. Aug 2004 B2
6772261 D'Antonio et al. Aug 2004 B1
6775747 Venkatraman Aug 2004 B2
6785780 Klein et al. Aug 2004 B1
6789173 Tanaka et al. Sep 2004 B1
6792059 Yuan et al. Sep 2004 B2
6792496 Aboulenein et al. Sep 2004 B2
6793408 Levy et al. Sep 2004 B2
6793411 Seifert Sep 2004 B2
6795899 Dodd et al. Sep 2004 B2
6799246 Wise et al. Sep 2004 B1
6799268 Boggs et al. Sep 2004 B1
6804760 Wiliams Oct 2004 B2
6804764 LaBerge et al. Oct 2004 B2
6807630 Lay et al. Oct 2004 B2
6811320 Abbott Nov 2004 B1
6816931 Shih Nov 2004 B2
6816947 Huffman Nov 2004 B1
6820181 Jeddeloh et al. Nov 2004 B2
6821029 Grung et al. Nov 2004 B1
6823023 Hannah Nov 2004 B1
6829398 Ouchi Dec 2004 B2
6845409 Talagala et al. Jan 2005 B1
6889304 Perego et al. May 2005 B2
6910109 Holman et al. Jun 2005 B2
6910812 Pommer et al. Jun 2005 B2
6949406 Bosnyak et al. Sep 2005 B2
6950956 Zerbe et al. Sep 2005 B2
6956996 Gordon et al. Oct 2005 B2
6961259 Lee et al. Nov 2005 B2
6961834 Weber Nov 2005 B2
6980748 Leas Dec 2005 B2
6982892 Lee et al. Jan 2006 B2
7000062 Perego et al. Feb 2006 B2
7016213 Reeves et al. Mar 2006 B2
7016606 Cai et al. Mar 2006 B2
7024547 Kartoz Apr 2006 B2
7035212 Mittal et al. Apr 2006 B1
7062595 Lindsay et al. Jun 2006 B2
7102907 Lee et al. Sep 2006 B2
7106611 Lee et al. Sep 2006 B2
7106973 Kube et al. Sep 2006 B2
7120723 Jeddeloh Oct 2006 B2
7120743 Meyer et al. Oct 2006 B2
7136953 Bisson et al. Nov 2006 B1
7171508 Choi Jan 2007 B2
7181584 LaBerge Feb 2007 B2
7200024 Taylor Apr 2007 B2
7222213 James May 2007 B2
7234070 James Jun 2007 B2
7242213 Pax et al. Jul 2007 B2
7245145 Pax et al. Jul 2007 B2
7254331 Murphy Aug 2007 B2
7282947 Pax et al. Oct 2007 B2
7557601 Pax et al. Jul 2009 B2
20010023474 Kyozuka et al. Sep 2001 A1
20010034839 Karjoth et al. Oct 2001 A1
20010039612 Lee Nov 2001 A1
20020038412 Nizar et al. Mar 2002 A1
20020042863 Jeddeloh Apr 2002 A1
20020112119 Halbert et al. Aug 2002 A1
20020116588 Beckert et al. Aug 2002 A1
20020144064 Fanning Oct 2002 A1
20020178319 Sanchez-Olea Nov 2002 A1
20030005223 Coulson et al. Jan 2003 A1
20030043158 Wasserman et al. Mar 2003 A1
20030043426 Baker et al. Mar 2003 A1
20030093630 Richard et al. May 2003 A1
20030149809 Jensen et al. Aug 2003 A1
20030163649 Kapur et al. Aug 2003 A1
20030177320 Sah et al. Sep 2003 A1
20030193927 Hronik Oct 2003 A1
20030217223 Nino, Jr. et al. Nov 2003 A1
20030227798 Pax Dec 2003 A1
20030229734 Chang et al. Dec 2003 A1
20030229762 Maiyuran et al. Dec 2003 A1
20030229770 Jeddeloh Dec 2003 A1
20040022094 Radhakrishnan et al. Feb 2004 A1
20040044833 Ryan Mar 2004 A1
20040064602 George Apr 2004 A1
20040123088 Poisner et al. Jun 2004 A1
20040126115 Levy et al. Jul 2004 A1
20040128421 Forbes Jul 2004 A1
20040144994 Lee et al. Jul 2004 A1
20040148482 Grundy et al. Jul 2004 A1
20040230718 Polzin et al. Nov 2004 A1
20040236885 Fredriksson et al. Nov 2004 A1
20040268009 Shin et al. Dec 2004 A1
20050044327 Howard et al. Feb 2005 A1
20050071542 Weber et al. Mar 2005 A1
20050105350 Zimmerman May 2005 A1
20050146946 Taylor Jul 2005 A1
20050162882 Reeves et al. Jul 2005 A1
20050210216 Jobs et al. Sep 2005 A1
20050228939 Janzen Oct 2005 A1
20060023528 Pax et al. Feb 2006 A1
20060047891 James et al. Mar 2006 A1
20060179203 Jeddeloh Aug 2006 A1
20060179208 Jeddeloh Aug 2006 A1
20060195647 Jeddeloh Aug 2006 A1
20060200598 Janzen Sep 2006 A1
20060204247 Murphy Sep 2006 A1
20060206667 Ryan Sep 2006 A1
20060206742 James Sep 2006 A1
20060218331 James Sep 2006 A1
20060271720 James et al. Nov 2006 A1
20070025133 Taylor Feb 2007 A1
20070035980 Taylor Feb 2007 A1
20070143553 LaBerge Jun 2007 A1
20070168595 Jeddeloh Jul 2007 A1
20080162861 Jobs et al. Jul 2008 A1
Foreign Referenced Citations (5)
Number Date Country
0849685 Jun 1998 EP
2288066 Oct 1995 GB
2001265539 Sep 2001 JP
WO 9319422 Sep 1993 WO
WO 0227499 Apr 2000 WO
Related Publications (1)
Number Date Country
20090243649 A1 Oct 2009 US
Divisions (1)
Number Date Country
Parent 10932477 Sep 2004 US
Child 11238900 US
Continuations (3)
Number Date Country
Parent 11973684 Oct 2007 US
Child 12480589 US
Parent 11238900 Sep 2005 US
Child 11973684 US
Parent 10460588 Jun 2003 US
Child 10932477 US