The present invention relates generally to electronic systems for data storage and retrieval. More particularly, the invention is directed toward improved methods and structures for memory devices.
In any engineered design there are compromises between cost and performance. The present invention introduces novel methods and structures for reducing the cost of memory devices while minimally compromising their performance. The description of the invention requires a significant amount of background including: application requirements, memory device physical construction, and memory device logical operation.
Memory device application requirements can be most easily understood with respect to memory device operation.
For purposes of illustrating the invention a conventional DRAM core will be described.
A conventional DRAM core 202 mainly comprises storage banks 211 and 221, row decoder and control circuitry 210, and column data path circuit comprising column amplifiers 260 and column decoder and control circuitry 230. Each of the storage banks comprises storage arrays 213 and 223 and sense amplifiers 212 and 222.
There may be many banks, rather than just the two illustrated. Physically the row and column decoders may be replicated in order to form the logical decoder shown in
The operation of a conventional DRAM core is divided between row and column operations. Row operations control the storage array word lines 241 and the sense amplifiers via line 242. These operations control the movement of data from the selected row of the selected storage array to the selected sense amplifier via the bit lines 251 and 252. Column operations control the movement of data from the selected sense amplifiers to and from the external data connections 204d and 204e.
Device selection is generally accomplished by one of the following choices:
The operations and device selection arguments are presented to the core via the PRECH and SENSE timing signals while the remaining arguments are presented as signals which have setup and hold relationships to the timing signals. Specifically, as shown in
More recent conventional DRAM cores allow a certain amount of concurrent operation between the functional blocks of the core. For example, it is possible to independently operate the precharge and sense operations or to operate the column path simultaneously with row operations. To take advantage of this concurrency each of the following groups may operate somewhat independently:
There are some restrictions on this independence. For example, as shown in
The present invention, while not limited by such values, has been optimized to typical values as shown in Table 1.
The series of memory operations needed to satisfy any application request can be covered by the nominal and transitional operation sequences described in Table 2 and Table 3. These sequences are characterized by the initial and final bank states as shown in
The sequence of memory operations is relatively limited. In particular, there is a universal sequence:
In this sequence, close is an alternative timing of precharge but is otherwise functionally identical. This universal sequence allows any sequence of operations needed by an application to be performed in one pass through it without repeating any step in that sequence. A control mechanism that implements the universal sequence can be said to be conflict free. A conflict free control mechanism permits a new application reference to be started for every minimum data transfer. That is, the control mechanism itself will never introduce a resource restriction that stalls the memory requestor. There may be other reasons to stall the memory requestor, for example references to different rows of the same bank may introduce bank contention, but lack of control resources will not be a reason for stalling the memory requester
Memory applications may be categorized as follows:
Applications may also be categorized by their reference stream characteristics. According to the application partition mentioned above reference streams can be characterized in the following fashion:
As stated above, unified applications combine the characteristics of main memory and graphics memory traffic. As electronic systems achieve higher and higher levels of integration the ability to handle these combined reference streams becomes more and more important.
Although the present invention can be understood in light of the previous application classification, it will be appreciated by those skilled in the art that the invention is not limited to the mentioned applications and combinations but has far wider application. In addition to the specific performance and functionality characteristics mentioned above it is generally important to maximize the effective bandwidth of the memory system and minimize the service time. Maximizing effective bandwidth requires achieving a proper balance between control and data transport bandwidth. The control bandwidth is generally dominated by the addressing information delivered to the memory device. The service time is the amount of time required to satisfy a request once it is presented to the memory system. Latency is the service time of a request when the memory system is otherwise devoid of traffic. Resource conflicts, either for the interconnect between the requester and the memory devices, or for resources internal to the memory devices such as the banks, generally determine the difference between latency and service time. It is desirable to minimize average service time, especially for processor traffic.
The previous section introduced the performance aspects of the cost-performance tradeoff that is the subject of the present invention. In this section the cost aspects are discussed. These aspects generally result from the physical construction of a memory device, including the packaging of the device.
There are many negative aspects to the increase in the length of the package wiring 1640, including the facts that: the overall size of the package increases, which costs more to produce and requires more area and volume when the package is installed in the next level of the packaging hierarchy, such as on a printed circuit board. Also, the stub created by the longer package wiring can affect the speed of the interconnect. In addition, mismatch in package wiring lengths due to the fan-in angle can affect the speed of the interconnect due to mismatched parasitics.
The total number of signal pins has effects throughout the packaging hierarchy. For example, the memory device package requires more material, the next level of interconnect, such as a printed circuit board, requires more area, if connectors are used they will be more expensive, and the package and die area of the master device will grow.
In addition to all these cost concerns based on area and volume of the physical construction another cost concern is power. Each signal pin, especially high speed signal pins, requires additional power to run the transmitters and receivers in both the memory devices as well as the master device. Added power translates to added cost since the power is supplied and then dissipated with heat sinks.
The memory device illustrated in
In
In addition to illustrating a specific type of prior art memory device,
The technique of specifying the burst size in a register makes it difficult to mix transfer sizes unless the burst size is always programmed to be the minimum, which then increases control overhead. The increase in control overhead may be so substantial as to render the minimum burst size impractical in many system designs.
Regardless of the transfer burst size, the technique of a single unified control bus, using various combinations of the command pins 1810, address pins 1820, and mask pins 1830 places limitations on the ability to schedule the primitive operations. A controller which has references in progress that are simultaneously ready to use the control resources must sequentialize them, leading to otherwise unnecessary delay.
Read operations do not require masking information. This leaves the mask pins 1830 available for other functions. Alternately, the mask pins during read operations may specify which bytes should actually be driven across the pins as illustrated by box 1873.
Another technique is an alternative method of specifying that a precharge should occur by linking it to a read or write operation. When this is done the address components of the precharge operation need not be respecified; instead, a single bit can be used to specify that the precharge should occur. One prior art method of coding this bit is to share an address bit not otherwise needed during a read or write operation. This is illustrated by the “A-Prech” boxes, 1861 and 1862.
Another technique makes the delay from write control information to data transfer different from the delay of read control information to data transfer. When writes and reads are mixed, this leads to difficulties in fully utilizing the data pins.
Thus, current memory devices have inadequate control bandwidth for many application reference sequences. Current memory devices are unable to handle minimum size transfers. Further, current memory devices utilize the available control bandwidth in ways that do not support efficient applications. Current memory devices do not schedule the use of the data pins in an efficient manner. In addition, current memory devices inefficiently assign a bonding pad for every pin of the device.
Like reference numerals refer to corresponding parts throughout the drawings.
There are many alternatives for how to code the precharge information on the mask pins. In one embodiment in which there are two mask pins and the memory device has two banks, one pin indicates whether an operation should occur and the other pin indicates which bank to precharge. In an alternative embodiment, in which the minimum data transfer requires more than one cycle, more banks are addressed by using the same pins for more than one cycle to extend the size of the bank address field.
Using the mask pins to specify a precharge operation and the associated bank address requires another way of specifying the device argument. In one embodiment the device is specified in some other operation. For example, the precharge specified by the mask pins shares device selection with a chip select pin that also conditions the main command pins. In another embodiment, additional control bandwidth is added to the device. For example, an additional chip select pin is added for sole use by the recoded mask pin precharge. In yet another example of using additional control bandwidth in which the minimum data transfer requires more than one cycle, the device address is coded on the additional bits, the device address being compared to an internal device address register.
In
This change in resource ordering gives rise to resource conflict problems that produce data bubbles when mixing reads and writes. The resource ordering of writes generally leads to the resource timing shown in
The read resource timing of
Note that the data bubble appears regardless of whether the write 2642 and the read 2643 are directed to the same or different memory devices on the channel. Further note that the delay from the control resource to the column i/o resource is identical for reads and writes. In view of this, it is impossible for the data resource timing to be identical for reads and writes.
Matching the timing of the write-use of the data resource to the read-use of the data resource avoids the problem stated above. Since the use of the data pins in a system environment has an intrinsic turnaround time for the external interconnect, the optimal delay for a write does not quite match the delay for a read. Instead, it should be the minimum read delay minus the minimum turnaround time. Since the turnaround delay grows as the read delay grows, there is no need to change the write control to data delay as a function of the memory device position on the channel.
Since write latency is not an important metric for application performance, as long as the write occurs before the expiration of tRAS,MIN (so that it does not extend the time the row occupies the sense amplifiers, which reduces application performance), this configuration does not cause any loss in application performance, as long as the writes and reads are directed to separate column data paths.
Delayed writes help optimize data bandwidth efficiency over a set of bidirectional data pins. One method adds delay between the control and write data packets so that the delay between them is the same or similar as that for read operations. Keeping this Apattern≅the same or similar for reads and writes improves pipeline efficiency over a set of bidirectional data pins, but at the expense of added complexity in the interface.
The benefit of the present invention according to a specific embodiment is shown in Table 4 and
The operation of this embodiment can be most easily understood through various timing diagrams as shown in
The nominal timings for the examples are shown in Table 7.
A description of each of the timing diagrams follows.
The previous figures show how various application references can be decomposed into the memory operations.
The previous figures demonstrate the conditions in which the universal sequence can be scheduled. The ability to schedule the universal sequence guarantees that there will not be any control conflicts which reduce available data transfer bandwidth. However, none of the nominal reference sequences actually requires two precharges to be scheduled. So there is generally adequate control bandwidth for various mixes of miss and empty traffic as shown in
According to an embodiment of the present invention the memory device of
As is shown in Table 10, the memory device is selected by the SDEV field and the SOP field determines the Auxiliary Operation to be performed by the Register Operation Unit 5309 in
According to an embodiment of the present invention the memory device of
In an alternate embodiment, each memory device receives a different CMD signal, one for each device, rather than using the data input field via path 5307 to identify the device for a ExitToNormal or ExitToDrowsy operation.
The foregoing description, for purposes of explanation, used specific nomenclature to provide a thorough understanding of the invention. However, it will be apparent to one skilled in the art that the specific details are not required in order to practice the invention. In other instances, well known circuits and devices are shown in block diagram form in order to avoid unnecessary distraction from the underlying invention. Thus, the foregoing descriptions of specific embodiments of the present invention are presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed, obviously many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the invention and its practical applications, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalents.
This application is a continuation of U.S. patent application Ser. No. 11/953,803, filed Dec. 10, 2007 now U.S. Pat. No. 7,496,709, which is a continuation of U.S. patent application Ser. No. 11/692,159, filed Mar. 27, 2007, now U.S. Pat. No. 7,330,952, which is a continuation of U.S. patent application Ser. No. 11/059,216, filed Feb. 15, 2005, now U.S. Pat. No. 7,197,611, which is a continuation of U.S. patent application Ser. No. 10/128,167, filed Apr. 22, 2002, now U.S. Pat. No. 6,868,474, which is a divisional of U.S. patent application Ser. No. 09/169,206, filed Oct. 9, 1998, now U.S. Pat. No. 6,401,167, which claims priority to U.S. Provisional Patent Application No. 60/061,770, filed Oct. 10, 1997, all of which are herein incorporated by referenced in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
3950735 | Patel | Apr 1976 | A |
4183095 | Ward | Jan 1980 | A |
4315308 | Jackson | Feb 1982 | A |
4330852 | Redwine et al. | May 1982 | A |
4337523 | Hotta et al. | Jun 1982 | A |
4445204 | Nishiguchi | Apr 1984 | A |
4499536 | Gemma et al. | Feb 1985 | A |
4528661 | Bahr et al. | Jul 1985 | A |
4637018 | Flora et al. | Jan 1987 | A |
4646270 | Voss | Feb 1987 | A |
4712190 | Guglielmi et al. | Dec 1987 | A |
4719568 | Carrubba et al. | Jan 1988 | A |
4719602 | Hag et al. | Jan 1988 | A |
4755937 | Glier | Jul 1988 | A |
4763249 | Bomba et al. | Aug 1988 | A |
4792926 | Roberts | Dec 1988 | A |
4792929 | Olson et al. | Dec 1988 | A |
4799199 | Scales, III et al. | Jan 1989 | A |
4800530 | Itoh et al. | Jan 1989 | A |
4821226 | Christopher et al. | Apr 1989 | A |
4825411 | Hamano | Apr 1989 | A |
4845644 | Anthias et al. | Jul 1989 | A |
4845677 | Chappell et al. | Jul 1989 | A |
4849937 | Yoshimoto | Jul 1989 | A |
4866675 | Kawashima | Sep 1989 | A |
4875192 | Matsumoto | Oct 1989 | A |
4882712 | Ohno et al. | Nov 1989 | A |
4891791 | Iijima | Jan 1990 | A |
4916670 | Suzuki et al. | Apr 1990 | A |
4920483 | Pogue et al. | Apr 1990 | A |
4928265 | Higuchi et al. | May 1990 | A |
4937734 | Bechtiksheim | Jun 1990 | A |
4945516 | Kashiyama | Jul 1990 | A |
4953128 | Kawai | Aug 1990 | A |
5001672 | Ebbers et al. | Mar 1991 | A |
5022004 | Kurtze et al. | Jun 1991 | A |
5077693 | Hardee et al. | Dec 1991 | A |
5083296 | Hara et al. | Jan 1992 | A |
5111386 | Fujishima et al. | May 1992 | A |
5124589 | Shiomi et al. | Jun 1992 | A |
5140688 | White et al. | Aug 1992 | A |
5150467 | Hayes et al. | Sep 1992 | A |
5159676 | Wicklund et al. | Oct 1992 | A |
5179687 | Hidaka et al. | Jan 1993 | A |
5260905 | Mori | Nov 1993 | A |
5272664 | Alexander et al. | Dec 1993 | A |
5276858 | Oak et al. | Jan 1994 | A |
5301278 | Bowater et al. | Apr 1994 | A |
5305278 | Inoue | Apr 1994 | A |
5311483 | Takasugi | May 1994 | A |
5319755 | Farmwald et al. | Jun 1994 | A |
5323358 | Toda et al. | Jun 1994 | A |
5327390 | Takasugi | Jul 1994 | A |
5337285 | Ware et al. | Aug 1994 | A |
5339276 | Takasugi | Aug 1994 | A |
5341341 | Fukuzo | Aug 1994 | A |
5345573 | Bowden, III et al. | Sep 1994 | A |
5365489 | Jeong | Nov 1994 | A |
5375089 | Lo | Dec 1994 | A |
5381376 | Kim et al. | Jan 1995 | A |
5381538 | Amini et al. | Jan 1995 | A |
5384745 | Konishi et al. | Jan 1995 | A |
5386385 | Stephens, Jr. | Jan 1995 | A |
5388222 | Chisvin et al. | Feb 1995 | A |
5388250 | Lewis et al. | Feb 1995 | A |
5390149 | Vogley et al. | Feb 1995 | A |
5392239 | Margulis et al. | Feb 1995 | A |
5404338 | Murai et al. | Apr 1995 | A |
5404463 | McGarvey | Apr 1995 | A |
5430676 | Ware et al. | Jul 1995 | A |
5432468 | Moriyama et al. | Jul 1995 | A |
5438535 | Lattibeaudiere | Aug 1995 | A |
5444667 | Obara | Aug 1995 | A |
5452401 | Lin | Sep 1995 | A |
5455803 | Kodama | Oct 1995 | A |
5471607 | Garde | Nov 1995 | A |
5483640 | Isfeld et al. | Jan 1996 | A |
5504874 | Galles et al. | Apr 1996 | A |
5508960 | Pinkham | Apr 1996 | A |
5511024 | Ware et al. | Apr 1996 | A |
5533054 | DeAndrea et al. | Jul 1996 | A |
5533204 | Tipley | Jul 1996 | A |
5542067 | Chappell et al. | Jul 1996 | A |
5548786 | Amini et al. | Aug 1996 | A |
5553248 | Melo et al. | Sep 1996 | A |
5560000 | Vogley | Sep 1996 | A |
5568445 | Park et al. | Oct 1996 | A |
5577236 | Johnson et al. | Nov 1996 | A |
5581746 | Watanabe | Dec 1996 | A |
5588130 | Fujishima et al. | Dec 1996 | A |
5594704 | Konishi et al. | Jan 1997 | A |
5598376 | Merritt et al. | Jan 1997 | A |
5611058 | Moore et al. | Mar 1997 | A |
5613075 | Wade et al. | Mar 1997 | A |
5615358 | Vogley | Mar 1997 | A |
5623607 | Kodama et al. | Apr 1997 | A |
5636173 | Schaefer | Jun 1997 | A |
5638531 | Crump et al. | Jun 1997 | A |
5646904 | Ohno et al. | Jul 1997 | A |
5649161 | Andrade et al. | Jul 1997 | A |
5655113 | Leung | Aug 1997 | A |
5659515 | Matsuo et al. | Aug 1997 | A |
5673226 | Yumitori et al. | Sep 1997 | A |
5680361 | Ware et al. | Oct 1997 | A |
5708622 | Ohtani et al. | Jan 1998 | A |
5715407 | Barth et al. | Feb 1998 | A |
5737587 | Leung et al. | Apr 1998 | A |
5740398 | Quattromani et al. | Apr 1998 | A |
5748914 | Barth et al. | May 1998 | A |
5758132 | Strålin | May 1998 | A |
5764963 | Ware et al. | Jun 1998 | A |
5765020 | Barth et al. | Jun 1998 | A |
5774409 | Yamazaki et al. | Jun 1998 | A |
5777942 | Dosaka et al. | Jul 1998 | A |
5778419 | Hansen et al. | Jul 1998 | A |
5781918 | Lieberman et al. | Jul 1998 | A |
5793227 | Goldrian | Aug 1998 | A |
5796995 | Nasserbakht et al. | Aug 1998 | A |
5802356 | Gaskins et al. | Sep 1998 | A |
5802555 | Shigeeda | Sep 1998 | A |
5805873 | Roy | Sep 1998 | A |
5815693 | McDermott et al. | Sep 1998 | A |
5819076 | Jeddeloh et al. | Oct 1998 | A |
5828606 | Mick | Oct 1998 | A |
5844855 | Ware et al. | Dec 1998 | A |
5857095 | Jeddeloh et al. | Jan 1999 | A |
5870350 | Bertin et al. | Feb 1999 | A |
5872996 | Barth et al. | Feb 1999 | A |
5884100 | Normoyle et al. | Mar 1999 | A |
5886948 | Ryan | Mar 1999 | A |
5896545 | Barth et al. | Apr 1999 | A |
5917760 | Miller | Jun 1999 | A |
5918058 | Bud | Jun 1999 | A |
5940340 | Ware et al. | Aug 1999 | A |
5948081 | Foster | Sep 1999 | A |
5953263 | Farmwald et al. | Sep 1999 | A |
5956284 | Ware et al. | Sep 1999 | A |
5966343 | Thurston | Oct 1999 | A |
5970019 | Suzuki et al. | Oct 1999 | A |
5978296 | Zibert | Nov 1999 | A |
5987620 | Tran | Nov 1999 | A |
6006290 | Suh | Dec 1999 | A |
6021264 | Morita | Feb 2000 | A |
6034916 | Lee | Mar 2000 | A |
6035369 | Ware et al. | Mar 2000 | A |
6041419 | Huang et al. | Mar 2000 | A |
6044429 | Ryan et al. | Mar 2000 | A |
6065092 | Roy | May 2000 | A |
6075730 | Barth et al. | Jun 2000 | A |
6088774 | Gillingham | Jul 2000 | A |
6105144 | Wu | Aug 2000 | A |
6111445 | Zerbe et al. | Aug 2000 | A |
6115318 | Keeth | Sep 2000 | A |
6125078 | Ooishi et al. | Sep 2000 | A |
6131149 | Lu et al. | Oct 2000 | A |
6134638 | Olarig et al. | Oct 2000 | A |
6151239 | Batra | Nov 2000 | A |
6151648 | Haq | Nov 2000 | A |
6182207 | Poivre et al. | Jan 2001 | B1 |
6185151 | Cho | Feb 2001 | B1 |
6209071 | Barth et al. | Mar 2001 | B1 |
6226723 | Gustovson et al. | May 2001 | B1 |
6226757 | Ware et al. | May 2001 | B1 |
6256716 | Pham | Jul 2001 | B1 |
6260097 | Farmwald et al. | Jul 2001 | B1 |
6263448 | Tsern et al. | Jul 2001 | B1 |
6266285 | Farmwald et al. | Jul 2001 | B1 |
6266737 | Ware et al. | Jul 2001 | B1 |
6279077 | Nasserbakht et al. | Aug 2001 | B1 |
6292903 | Coteus et al. | Sep 2001 | B1 |
6301627 | Neal et al. | Oct 2001 | B1 |
6304937 | Farmwald et al. | Oct 2001 | B1 |
6314051 | Farmwald et al. | Nov 2001 | B1 |
6321316 | Manning | Nov 2001 | B1 |
6343352 | Davis et al. | Jan 2002 | B1 |
6359815 | Sato et al. | Mar 2002 | B1 |
6401167 | Barth et al. | Jun 2002 | B1 |
6404178 | Kato | Jun 2002 | B2 |
6404258 | Ooishi | Jun 2002 | B2 |
6437619 | Okuda et al. | Aug 2002 | B2 |
6442644 | Gustavson et al. | Aug 2002 | B1 |
6456544 | Zumkehr | Sep 2002 | B1 |
6462998 | Proebsting | Oct 2002 | B1 |
6463066 | Moriwaki et al. | Oct 2002 | B2 |
6470405 | Barth et al. | Oct 2002 | B2 |
6493789 | Ware et al. | Dec 2002 | B2 |
6496897 | Ware et al. | Dec 2002 | B2 |
6510503 | Gillingham et al. | Jan 2003 | B2 |
6526462 | Elabd | Feb 2003 | B1 |
6560652 | Larson et al. | May 2003 | B1 |
6570873 | Isoyama et al. | May 2003 | B1 |
6584037 | Farmwald et al. | Jun 2003 | B2 |
6591353 | Barth et al. | Jul 2003 | B1 |
6629222 | Jeddeloh | Sep 2003 | B1 |
6640292 | Barth et al. | Oct 2003 | B1 |
6658578 | Laurenti et al. | Dec 2003 | B1 |
6677791 | Okuda et al. | Jan 2004 | B2 |
6681288 | Griffin et al. | Jan 2004 | B2 |
6701446 | Tsern et al. | Mar 2004 | B2 |
6748507 | Kawasaki et al. | Jun 2004 | B2 |
6757779 | Wong et al. | Jun 2004 | B1 |
6868474 | Barth et al. | Mar 2005 | B2 |
6889300 | Davis et al. | May 2005 | B2 |
6892273 | James et al. | May 2005 | B1 |
6928571 | Bonella et al. | Aug 2005 | B1 |
6931467 | Barth et al. | Aug 2005 | B2 |
6934201 | Ware et al. | Aug 2005 | B2 |
7047375 | Davis et al. | May 2006 | B2 |
7177998 | Ware et al. | Feb 2007 | B2 |
7197611 | Barth et al. | Mar 2007 | B2 |
7210016 | Ware et al. | Apr 2007 | B2 |
7287103 | Ganfield et al. | Oct 2007 | B2 |
7287109 | Barth et al. | Oct 2007 | B2 |
7287119 | Barth et al. | Oct 2007 | B2 |
7330952 | Barth et al. | Feb 2008 | B2 |
7330953 | Barth et al. | Feb 2008 | B2 |
7360050 | Barth et al. | Apr 2008 | B2 |
7496709 | Barth et al. | Feb 2009 | B2 |
20070147143 | Barth et al. | Jun 2007 | A1 |
20070198868 | Barth et al. | Aug 2007 | A1 |
20090129178 | Barth et al. | May 2009 | A1 |
Number | Date | Country |
---|---|---|
0339224 | Nov 1989 | EP |
487819 | Jun 1992 | EP |
0535670 | Apr 1993 | EP |
0561370 | Sep 1993 | EP |
0 605 887 | Jul 1994 | EP |
0638858 | Feb 1995 | EP |
0 709 786 | May 1996 | EP |
0778575 | Jun 1997 | EP |
2695227 | Mar 1994 | FR |
SHO 58-192154 | Nov 1983 | JP |
57-210495 | Dec 1983 | JP |
SHO 61-107453 | May 1986 | JP |
SHO 61-160556 | Oct 1986 | JP |
SHO 62-016289 | Jan 1987 | JP |
SHO 63-034795 | Feb 1988 | JP |
SHO 63-091766 | Apr 1988 | JP |
SHO 63-217452 | Sep 1988 | JP |
SHO 63-239676 | Oct 1988 | JP |
1-236494 | Sep 1989 | JP |
SHO 01-236494 | Sep 1989 | JP |
WO 9630838 | Oct 1996 | WO |
WO 9946687 | Sep 1999 | WO |
WO 9946687 | Sep 1999 | WO |
Number | Date | Country | |
---|---|---|---|
20090129178 A1 | May 2009 | US |
Number | Date | Country | |
---|---|---|---|
60061770 | Oct 1997 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09169206 | Oct 1998 | US |
Child | 10128167 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11953803 | Dec 2007 | US |
Child | 12349485 | US | |
Parent | 11692159 | Mar 2007 | US |
Child | 11953803 | US | |
Parent | 11059216 | Feb 2005 | US |
Child | 11692159 | US | |
Parent | 10128167 | Apr 2002 | US |
Child | 11059216 | US |