This invention relates to memory devices, and, more particularly, in one or more embodiments to repairing defective memory cells in memory devices by replacing defective memory cells with redundant memory cells.
As memory devices of all types have evolved, continuous strides have been made in improving their performance in a variety of respects. For example, the storage capacity of memory devices has continued to increase at geometric proportions. This increased capacity, coupled with the geometrically higher operating speeds of electronic systems containing memory devices, has made high memory device bandwidth ever more critical. One application in which memory devices, such as dynamic random access memory (“DRAM”) devices, require a higher bandwidth is their use as system memory in computer systems. As the operating speed of processors has increased, processors are able to read and write data at correspondingly higher speeds. Yet conventional DRAM devices often do not have the bandwidth to read and write data at these higher speeds, thereby slowing the performance of conventional computer systems. This problem is exacerbated by the trend toward multi-core processors and multiple processor computer systems. It is currently estimated that computer systems operating as high-end servers are idle as many as 3 out of every 4 clock cycles because of the limited data bandwidth of system memory devices. In fact, the limited bandwidth of DRAM devices operating as system memory can reduce the performance of computer systems to as low as 10% of the performance of which they would otherwise be capable.
Various attempts have been made to increase the data bandwidth of memory devices. For example, wider internal data buses have been used to transfer data to and from arrays with a higher bandwidth. However, doing so usually requires that write data be serialized and read data deserialized at the memory device interface. Another approach has been to simply scale up the size of memory devices or conversely shrink their feature sizes, but, for a variety of reasons, scaling has been incapable of keeping up with the geometric increase in the demand for higher data bandwidths. Proposals have also been made to stack several integrated circuit memory devices in the same package, but doing so threatens to create a large number of other problems that must be overcome.
One potential problem with increasing memory capacity to achieve a higher memory bandwidth is the higher likelihood that at least some of the memory cells will be defective. As is well-known in the art, memory devices typically have at least some memory cells that are defective, either at manufacture or after use. These defective memory devices are conventionally repaired by substituting redundant memory cells for the defective memory cells. Such repairs are normally accomplished by substituting a redundant row of memory cells for a row containing one or more defective memory cells or associated circuitry, or by substituting a redundant column of memory cells for a column containing one or more defective memory cells or associated circuitry. Yet vastly increasing memory capacity can make it more difficult to repair memory devices by substituting redundant memory cells for defective memory cells.
Therefore, a need exists for a method and apparatus to minimize problems and limitations caused by greatly increasing the data bandwidth of memory devices, such as the need to repair memory devices containing defective memory cells.
A computer system including a high-capacity, high bandwidth memory device 10 according to an embodiment of the invention is shown in
The DRAM dice 20, 22, 24, 26 are connected to each other and to the logic die 30 by a relatively wide bus 34. The bus 34 may be implemented with through silicon vias (“TSVs”), which comprise a large number of conductors extending at least partially through the DRAM dice 20, 22, 24, 26 at the same locations on the DRAM dice and connect to respective conductors formed on the dice 20, 22, 24, 26. In one embodiment, each of the DRAM dice 20, 22, 24, 26 are divided into 16 autonomous partitions, each of which may contain 2 or 4 independent memory banks. In such case, the partitions of each dice 20, 22, 24, 26 that are stacked on top of each other may be independently accessed for read and write operations. Each set of 16 stacked partitions may be referred to as a “vault.” Thus, the memory device 10 may contain 16 vaults.
As shown in
As explained in greater detail below, one of the functions performed by the logic die 30 is to serialize the read data bits coupled from the DRAM dice 20, 22, 24, 26 into a serial stream of 16 serial data bits coupled through each of 16 parallel bits of one of the upstream lanes 42a-d of the bus 14. Similarly, the logic die 30 may perform the functions of deserializing 16 serial data bits coupled through one of the 16-bit downstream lanes 40a-d of the bus 14 to obtain 256 parallel data bits. The logic die 30 then couples these 256 bits through one of the 32-bit sub-buses 38a-p in a serial stream of 8 bits. However, other embodiments may use different numbers of lanes 40, 42 having different widths or different numbers of sub-buses 38a-p having different widths, and they may couple data bits having different structures. As will be appreciated by one skilled in the art, the stacking of multiple DRAM dice results in a memory device having a very large capacity. Further, the use of a very wide bus connecting the DRAM dice allows data to be coupled to and from the DRAM dice with a very high bandwidth.
A logic die 30 according to an embodiment of the invention is shown in
Each of the link interfaces 50a-d applies its 256 parallel bits to a respective downstream target 60a-d, which decodes the command and address portions of the received packet and buffers write data in the event a memory request is for a write operation. The downstream targets 60a-d output their respective commands, addresses and possibly write data to a switch 62. The switch 62 contains 16 multiplexers 64 each of which direct the command, addresses and any write data from any of the downstream targets 60a-d to its respective vault of the DRAM dice 20, 22, 24, 26. Thus, each of the downstream targets 60a-d can access any of the 16 vaults in the DRAM dice 20, 22, 24, 26. The multiplexers 64 use the address in the received memory requests to determine if its respective vault is the target of a memory request. Each of the multiplexers 64 apply the memory request to a respective one of 16 vault controllers 70a-p.
Each vault controller 70a-p includes a respective memory controller 80, each of which includes a write buffer 82, a read buffer 84 and a command pipeline 86. The commands and addresses in memory requests received from the switch 62 are loaded into the command pipeline 86, which subsequently outputs the received commands and corresponding addresses. Any write data in the memory requests are stored in the write buffer 82. The read buffer 84 is used to store read data from the respective vault, as will be explained in greater detail below. Both the write data from the write buffer 82 and the commands and addresses from the command pipeline 86 are applied to a memory interface 88. The memory interface 88 includes an ECC and defective memory cell repair system 100. As explained in greater detail below, the ECC and repair system 100 uses ECC techniques to check and correct the data read from the DRAM dice 20, 22, 24, 26, and to assist a controller, such as an embedded processor or hardware state machine 148, the processor 12 or other memory access device to substitute redundant rows and columns for rows and columns, respectively, containing one or more defective memory cells. However, in other embodiments, a processor (not shown) embedded in the logic die 30 may be used to substitute redundant rows and columns for rows and columns, respectively, containing one or more defective memory cells. The memory interface 88 couples commands and addresses from the command pipeline 86 to the DRAM dice 20, 22, 24, 26 through a command/address bus 92, and it coupled 32-bits of write data from the write buffer 82 and 4 bits of ECC from the ECC and repair system 100 to the DRAM dice 20, 22, 24, 26 through a 36-bit data bus 94.
Although data are loaded into the write buffer 82 as 256 parallel bits, they are output from the buffer 82 in two sets, each set being 128 parallel bits. These 128 bits are then further serialized by the ECC and repair system 100 to 4 sets of 32-bit data, which are coupled through the data bus 94. In the embodiment shown in
In the event a memory request is for a read operation, the command and address for the request are coupled to the DRAM dice 20, 22, 24, 26 in the same manner as a write request, as explained above. In response to a read request, 32 bits of read data and 4 ECC bits are output from the DRAM dice 20, 22, 24, 26 through the 36-bit data bus 94. The ECC bits are passed to the ECC and repair system 100, which uses the ECC bits to check and correct the read data before passing the read data on to the read buffer 84. The ECC and repair system 100 also deserializes the 32 bits of read data into two sets of 128-bit read data. After 2 sets of 128-bit read data have been stored in the read buffer 84, the read buffer transmits 256 bits to the switch 62. The switch includes 4 output multiplexers 104 coupled to respective upstream masters 110a-d. Each multiplexer 104 can couple 256 bits of parallel data from any one of the vault controllers 70a-p to its respective upstream master 110a-d. The upstream masters 110a-d format the 256 bits of read data into packet data and couple the packet to respective upstream link interfaces 114a-d. Each of the link interfaces 114a-d include a respective serializer 120 that converts the incoming 256 bits to a serial stream of 16 bits on each bit of a respective one of the 16-bit upstream links 42a-d.
As also shown in
An embodiment of the ECC and defective memory cell repair system 100 is shown in
The write buffer 82 applies received write data to a merge circuit 160. The function of the merge circuit is to combine write data output from the write buffer 82 with adjacent bits read from one of the DRAM dice 20, 22, 24, 26 in the event of a write of less than 128 bits of data. More specifically, the ECCs are generated on the basis of 128 bits of data. If only 32 bits of data are written to an address, then the neighbor 96 bits are read. The merger circuit 160 combines these adjacent 96 bits with the 32 bits being written, and applies the resulting 128 bits to an ECC Generator 164, which generates a 16-bit ECC code. The 16 bits of the ECC code are divided into 4 groups by a serializer 168 and applied to the DRAM dice 20, 22, 24, 26 through 4 of the 36 bits of the data bus 92 (
The read data and corresponding ECC bits from the DRAM dice 20, 22, 24, 26 are applied to a deserializer 170, which combines 4 successive 36-bit groups (32 bits of read data plus 4 bits of ECC) coupled through the data bus 92 into 128 bits of read data and 16 bits of ECC. These 144 bits are applied to an ECC checker and corrector 174 or some other type of error comparator. The ECC checker and corrector 174 generates a 16-bit ECC from the 128 data bits, and compares the generated 16 bits to the 16-bit ECC received from the deserializer 170. In the event of a match, the read data are considered valid and is output from the ECC checker and corrector 174 and stored in the read buffer 84. If the generated 16 bits do not match the 16-bit ECC received from the deserializer 170, the read data are considered to be in error. In such case, the ECC checker and corrector 174 corrects the read data if the data can be corrected (i.e., in the case of a 16-bit ECC, if only one bit is in error) and passes the corrected read data to the read buffer 84. The ECC checker and corrector 174 also outputs a “Flag ECC Error” signal to a reissue state machine 180, which causes the corrected read data to be re-written to the DRAM dice 20, 22, 24, 26 and then re-read. If the re-read data is now correct, then no repair is considered needed. If the re-read data is still incorrect, then the error is considered a “hard error,” and is repaired by substituting a redundant row or column. In such case, the reissue state machine issues a “Hard Error” flag to the embedded processor or hardware state machine 148 or the processor 12 (
The reissue state machine 180 first causes the corrected read data to be re-written by switching the multiplexer 150 so a read command and the address of the corrected read data output from the reissue state machine 180 are applied to the command pipeline 154. When the read command is subsequently executed, the ECC checker and corrector 174 applies the corrected read data and the address to the ECC generator 164 through the merger circuit 160. The ECC generator 164 generates a 16-bit ECC for the corrected read data, and applies both the read data and the ECC to the serializer 168. The serializer 168 then outputs the corrected read data and ECC bits to the DRAM dice 20, 22, 24, 26. After the corrected read data have been written to the DRAM dice 20, 22, 24, 26, the ECC checker and corrector issues a read command to the same address, and causes the multiplexer 150 to couple the read command and address to the command pipeline 154. The read data and ECC received responsive to the read command is processed as described above to determine if the previous error was a “hard error” or a “soft error.”
As mentioned above, the embedded processor or hardware state machine 148 or processor 12 is programmed to substitute a redundant row or column for a row or column, respectively, containing a memory cell that results in a “hard error.” An embodiment of a process performed by the embedded processor or hardware state machine 148 or processor 12 or other memory access device (such as a memory controller or processor embedded in logic die 30) is shown in
If a determination is made at step 216 that the re-read data are not in error, the embedded processor or hardware state machine 148 or processor 12 causes a memory timing stress test to be executed at step 220. This stress test may, for example, cause the memory cells to be refreshed at a reduced rate. After the data have been read at the address, a check is again made at step 224 to determine if the read data are in error. If so, the process branches through 226 back to step 200, as explained above. If, on the other hand, a determination is made at step 224 that the read data are not in error, the current address is added to a scrubbing list 230 maintained by the embedded processor or hardware state machine 148 or processor 12 at step 234. The scrubbing list 230 is a list of memory addresses from which errors have been reported. For this reason, the embedded processor or hardware state machine 148 or processor 12 may perform its own ECC check of the data stored in that location. The embedded processor or hardware state machine 148 or processor 12 then writes a pattern of test data to the DRAM dice 20, 22, 24, 26 at step 236 according to a target address stress routine 238. After the DRAM dice 20, 22, 24, 26 have been checked according to the stress routine 238, the process again checks at step 240 to determine if the read data are in error. If so, the process branches through step 244 back to step 200. Otherwise, the process ends at 248.
Returning to step 206, if it is determined that the error count does exceed the particular number, the corresponding address is removed from an error buffer at step 250 since the address will no longer be used for memory accesses. The bank is then set to “busy” at step 254 while a new row or column is substituted for the row or column, respectively, for the address corresponding to the defective memory cell. The contents of the idled block is then read at step 258, and an address of the redundant row or column is then activated by adding the substituted address to an address compare list at step 260. The address compare list is a list maintained by the embedded processor or hardware state machine 148 or processor 12 of the addresses that have been repaired by substituting a redundant address. The embedded processor or hardware state machine 148 or processor 12 compares the address for each memory access to the compare list to determine if the access should be redirected to a substituted address. At step 264, data read from the block at step 258 is written to the redundant block of memory cells that will subsequently be used. The bank that was set to “busy” at step 254 is then cleared at step 266, and the process exits via 268.
The errors detected by the ECC and defective memory cell repair system 100 can arise for either of two reasons. First, the errors may result from faults in each individual DRAM dice 20, 22, 24, 26. These errors are corrected and repaired as explained with reference to
An embodiment of a process performed by the embedded processor or hardware state machine 148 (
If a determination is made at 310 that the temporal threshold or spatial threshold is exceeded, the process branches to 320 where address and data information are fetched from the TSV error count buffer. The process then examines the stored data at step 324 to look for whether addresses from which data was read in error have common address bits. The process also examines the stored data at step 324 to look for erroneous read data having common data bits in error. If neither of these situations are found to exist at step 324, the error causing the process to be entered at 300 is considered to be an error in an individual one of the DRAM device dice 20, 22, 24, 26 rather than a TSV error. If so, the process again terminates at 314, in which case the process for detecting and correcting errors in the DRAM device dice 20, 22, 24, 26 shown in
If errors from common addresses or read data having common data bits in error are detected at 324, then the error causing the process to be entered at 300 is considered to be a TSV error. In such case, the process branches to 330 where a test is conducted to determine how sensitive the failing address or data is to variations in the timing of a clock that is used to capture the address or write data in the DRAM dice 20, 22, 24, 26 or capture the read data in the logic die 30. This test is performed by incrementally altering the timing of clock signals that are sent to the DRAM dice 20, 22, 24, 26 for each of several purposes. For example, the logic die 30 may send an address capture clock or strobe signal to the DRAM dice 20, 22, 24, 26 that the DRAM dice use to capture an address. Similarly, the logic die 30 may send a data capture clock or strobe signal to the DRAM dice 20, 22, 24, 26 that the DRAM dice use to capture write data. The logic die 30 may also send a data clock or strobe signal to the DRAM dice 20, 22, 24, 26 that determines when the DRAM dice will send read data to the logic die 30. In any case, the test may be conducted on each item of address or data as a whole or it may be conducted bit-by-bit on an address or data. If the error can be corrected by altering the timing of one of these clock or strobe signals, the error is considered to be cured, and the process exits through 314.
If the error cannot be corrected by altering the timing of one of these clock or strobe signals, the process branches to 334 where the logic die 30 causes memory requests from the processor 12 or other memory access device to be suspended. This is done because the memory device is considered unusable until the timing test conduced at 330 can be repeated since the memory requests sent by the processor 12 or other memory access device are not being satisfied. A variety of means can be used to signal the processor 12 or other memory access device to suspend sending memory requests. For example, the logic die 30 could formulate a “stop” packet back to the processor 12 or other memory access device.
After additional memory requests have been suspended, the process checks at 336 to see if the error still exits and, if so, whether the error for which the process was entered at 300 was the result of a repeated test. If so, the process branches to 340 in which the embedded processor or hardware state machine 148 records one of the TSVs as being permanently faulty. The embedded processor or hardware state machine 148, processor 12, or other memory access device then remaps addresses to the faulty address to a different address, or discontinues using the faulty data bit for write and read data. If however, the error is found at 336 to no longer exist, the process branches to 344 where the identity of the previously failed TSV is recorded to see if the fault is repeated, and the process then branches back to 330 where the TSV would presumably still pass the test and therefore terminate though 340.
The dynamic repair of defective memory cells as disclosed herein has several advantages. It makes memory devices more reliable, accessible and serviceable by decreasing the time between failures of memory devices. By fixing hard errors as they are detected, memory devices should rarely fail since soft errors can be corrected by scrubbing. This is especially beneficial for memory devices used in mission critical enterprise-type servers. Further, a determination can be made as to whether the error exists in one of the DRAM device dice 20, 22, 24, 26 or in a through silicon via connecting the DRAM device dice 20, 22, 24, 26 to each other and to the logic die 30.
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, although the embodiments of the invention are explained in the context of stacked DRAM die, it will be understood that the stacked die may be other types of memory device die, such as flash memory device die. Accordingly, the invention is not limited except as by the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5179303 | Searles et al. | Jan 1993 | A |
5263032 | Porter et al. | Nov 1993 | A |
5748914 | Barth et al. | May 1998 | A |
5774475 | Qureshi | Jun 1998 | A |
5960008 | Osawa et al. | Sep 1999 | A |
5982684 | Schwartzlow et al. | Nov 1999 | A |
6052329 | Nishino et al. | Apr 2000 | A |
6122688 | Barth et al. | Sep 2000 | A |
6177807 | Bertin et al. | Jan 2001 | B1 |
6181616 | Byrd | Jan 2001 | B1 |
6247138 | Tamura et al. | Jun 2001 | B1 |
6285211 | Sample et al. | Sep 2001 | B1 |
6363017 | Polney | Mar 2002 | B2 |
6401213 | Jeddeloh | Jun 2002 | B1 |
6519194 | Tsujino et al. | Feb 2003 | B2 |
6574626 | Regelman et al. | Jun 2003 | B1 |
6650157 | Amick et al. | Nov 2003 | B2 |
6658523 | Janzen et al. | Dec 2003 | B2 |
6839260 | Ishii | Jan 2005 | B2 |
6882304 | Winter et al. | Apr 2005 | B2 |
6889334 | Magro et al. | May 2005 | B1 |
6907555 | Normura et al. | Jun 2005 | B1 |
7058865 | Mori et al. | Jun 2006 | B2 |
7107424 | Avakian et al. | Sep 2006 | B1 |
7135905 | Teo et al. | Nov 2006 | B2 |
7149134 | Streif et al. | Dec 2006 | B2 |
7168005 | Adams et al. | Jan 2007 | B2 |
7184916 | Resnick et al. | Feb 2007 | B2 |
7197101 | Glenn et al. | Mar 2007 | B2 |
7203259 | Glenn et al. | Apr 2007 | B2 |
7389375 | Gower et al. | Jun 2008 | B2 |
7489743 | Koh et al. | Feb 2009 | B2 |
7567476 | Ishikawa | Jul 2009 | B2 |
7697369 | Koshizuka | Apr 2010 | B2 |
7710144 | Dreps et al. | May 2010 | B2 |
7764564 | Saito et al. | Jul 2010 | B2 |
7855931 | LaBerge et al. | Dec 2010 | B2 |
7979757 | Jeddeloh | Jul 2011 | B2 |
8010866 | LaBerge | Aug 2011 | B2 |
8127204 | Hargan | Feb 2012 | B2 |
8289760 | Jeddeloh | Oct 2012 | B2 |
8356138 | Kulkarni et al. | Jan 2013 | B1 |
8400808 | King | Mar 2013 | B2 |
20020004893 | Chang | Jan 2002 | A1 |
20020054516 | Taruishi et al. | May 2002 | A1 |
20020097613 | Raynham | Jul 2002 | A1 |
20020125933 | Tamura et al. | Sep 2002 | A1 |
20020130687 | Duesman | Sep 2002 | A1 |
20020133666 | Janzen et al. | Sep 2002 | A1 |
20020138688 | Hsu et al. | Sep 2002 | A1 |
20030041299 | Kanazawa et al. | Feb 2003 | A1 |
20030132790 | Amick et al. | Jul 2003 | A1 |
20040073767 | Johnson et al. | Apr 2004 | A1 |
20040098545 | Pline et al. | May 2004 | A1 |
20040160833 | Suzuki | Aug 2004 | A1 |
20040168101 | Kubo | Aug 2004 | A1 |
20040199840 | Takeoka et al. | Oct 2004 | A1 |
20040206982 | Lee et al. | Oct 2004 | A1 |
20040237023 | Takahashi et al. | Nov 2004 | A1 |
20040246026 | Wang et al. | Dec 2004 | A1 |
20050005230 | Koga et al. | Jan 2005 | A1 |
20050071707 | Hampel | Mar 2005 | A1 |
20050091471 | Conner et al. | Apr 2005 | A1 |
20050144546 | Igeta et al. | Jun 2005 | A1 |
20050157560 | Hosono et al. | Jul 2005 | A1 |
20050278490 | Murayama | Dec 2005 | A1 |
20060036827 | Dell et al. | Feb 2006 | A1 |
20060059406 | Micheloni et al. | Mar 2006 | A1 |
20060123320 | Vogt | Jun 2006 | A1 |
20060126369 | Raghuram | Jun 2006 | A1 |
20060233012 | Sekiguchi et al. | Oct 2006 | A1 |
20060245291 | Sakaitani | Nov 2006 | A1 |
20060253723 | Wu et al. | Nov 2006 | A1 |
20060262587 | Matsui et al. | Nov 2006 | A1 |
20060273455 | Williams et al. | Dec 2006 | A1 |
20070058410 | Rajan | Mar 2007 | A1 |
20070070669 | Tsern | Mar 2007 | A1 |
20070074093 | Lasser | Mar 2007 | A1 |
20070136645 | Hsueh et al. | Jun 2007 | A1 |
20070271424 | Lee et al. | Nov 2007 | A1 |
20080147897 | Talbot | Jun 2008 | A1 |
20080150088 | Reed et al. | Jun 2008 | A1 |
20080250292 | Djordjevic | Oct 2008 | A1 |
20090006775 | Bartley et al. | Jan 2009 | A1 |
20090016130 | Menke et al. | Jan 2009 | A1 |
20090021992 | Oh | Jan 2009 | A1 |
20090196093 | Happ et al. | Aug 2009 | A1 |
20090251189 | Hsieh | Oct 2009 | A1 |
20090300314 | LaBerge et al. | Dec 2009 | A1 |
20090300444 | Jeddleoh | Dec 2009 | A1 |
20100005217 | Jeddeloh | Jan 2010 | A1 |
20100005376 | Laberge et al. | Jan 2010 | A1 |
20100014364 | LaBerge et al. | Jan 2010 | A1 |
20100031129 | Hargan | Feb 2010 | A1 |
20100042889 | Hargan | Feb 2010 | A1 |
20100070696 | Blankenship | Mar 2010 | A1 |
20100079180 | Kim et al. | Apr 2010 | A1 |
20100091537 | Best et al. | Apr 2010 | A1 |
20100110748 | Best | May 2010 | A1 |
20110075497 | LaBerge et al. | Mar 2011 | A1 |
20110296227 | LaBerge et al. | Dec 2011 | A1 |
20120144276 | Hargan | Jun 2012 | A1 |
20120155142 | King | Jun 2012 | A1 |
20130208549 | King | Aug 2013 | A1 |
20130318298 | LaBerge et al. | Nov 2013 | A1 |
Number | Date | Country |
---|---|---|
05-265872 | Oct 1993 | JP |
H07-74620 | Mar 1995 | JP |
11-102599 | Apr 1999 | JP |
2004-327474 | Nov 2004 | JP |
2007-140948 | Jun 2007 | JP |
2007-226876 | Sep 2007 | JP |
2007-328636 | Dec 2007 | JP |
2008-112503 | May 2008 | JP |
2008-140220 | Jun 2008 | JP |
2010-514080 | Apr 2010 | JP |
WO-2007038225 | Apr 2007 | WO |
WO-2007095080 | Aug 2007 | WO |
WO-2008054696 | May 2008 | WO |
WO 2008076790 | Jun 2008 | WO |
WO-2009148863 | Dec 2009 | WO |
2010002561 | Jan 2010 | WO |
WO-2010011503 | Jan 2010 | WO |
WO 2012060097 | May 2012 | WO |
WO-2012082338 | Jun 2012 | WO |
Entry |
---|
Related U.S. Appl. No. 12/970,086, filed Dec. 16, 2010, entitled “Phase Interpolators and Push-Pull Buffers”. |
International Search Report and Written Opinion in International Application No. PCT/US2009/046956 mailed Jan. 22, 2010. |
Notice of Preliminary Rejection dated Jun. 21, 2012 for KR Appl. No. 10-2011-7002786. |
Int. Search Report and Written Opinion for Appl. No. PCT/US2011/062009 on Jul. 31, 2012. |
Office Action dated received for Oct. 30, 2012 for Appln No. 10-2012-7021899. |
Search Report dated Mar. 11, 2013 for TW Patent Application No. 098114848. |
Office Action dated Mar. 11, 2013 for TW Patent Application No. 098114848. |
Office action received for Japanese Appln. No. 2011-516422 dated Jan. 22, 2013. |
First office action for CN appl No. 20098012573.7 issued Jan. 25, 2013. |
Office Action for TW Appl No. 098121258, issued Dec. 2, 2013. |
Number | Date | Country | |
---|---|---|---|
20100005376 A1 | Jan 2010 | US |