This disclosure relates generally to semiconductor devices, and more specifically to semiconductor memory devices. In particular, the disclosure relates to volatile memory, such as dynamic random access memory (DRAM). Information may be stored on individual memory cells of the memory as a physical signal (e.g., a charge on a capacitive element). When accessed, the memory cell may be coupled to a digit line (or bit line), and a voltage on the digit line may change based on the information stored in the coupled memory cell.
In volatile memory devices, the information may decay over time. To prevent information from being refreshed, the information may be periodically refreshed (e.g., by restoring the charge on a memory cell to an initial level). However, refresh operations may require time which could have otherwise been used for access operations in the memory.
The following description of certain embodiments is merely exemplary in nature and is in no way intended to limit the scope of the disclosure or its applications or uses. In the following detailed description of embodiments of the present systems and methods, reference is made to the accompanying drawings which form a part hereof, and which are shown by way of illustration specific embodiments in which the described systems and methods may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice presently disclosed systems and methods, and it is to be understood that other embodiments may be utilized and that structural and logical changes may be made without departing from the spirit and scope of the disclosure. Moreover, for the purpose of clarity, detailed descriptions of certain features will not be discussed when they would be apparent to those with skill in the art so as not to obscure the description of embodiments of the disclosure. The following detailed description is therefore not to be taken in a limiting sense, and the scope of the disclosure is defined only by the appended claims.
Memory arrays may generally include a number of memory cells arranged at the intersection of word lines (rows) and bit lines/digit lines (columns). To prevent information from being lost, the memory may refresh memory cells on a row-by-row basis (or in sets of rows). Over the course a refresh cycle, the memory may refresh the memory cells as part of sequential refresh operations. The memory may have a refresh period, tREFI, which determines the maximum timing between refresh operations in order to ensure that all memory cells are refreshed over the course of a refresh cycle. For example, tREFI may be based on the expected time at which any individual memory cell needs to be refreshed divided by a total number of refresh operations in a refresh cycle (e.g., a number of rows or a number of rows refreshed per refresh operation). The refresh period tREFI may be relatively short (e.g., <10 μsec). The memory may refresh a first word line (or a first set of word lines) as part of a first sequential refresh operation, then refresh a second word line (or set of word lines) as part of a second sequential refresh operation and so forth until all word lines have been refreshed, then may restart from the beginning of the sequence.
Certain access patterns to the memory may change a rate at which information decays in the memory cells. For example, a row hammer may be repeated access to an ‘aggressor’ row of the memory, which may increase a rate of information decay in memory cells along nearby ‘victim’ word lines. Since the information in the victim word lines may decay faster than the assumptions used to calculate tREFI, it may be important to identify aggressors, and perform targeted refresh operations on the victims of those identified aggressors. In conventional memories, refresh operations may be called for every tREFI. Targeted refresh operations may ‘steal’ a timeslot which is otherwise set aside for a sequential refresh operation. However, this may inefficient, as targeted refresh operations need only be performed when an aggressor has been detected. Accordingly, conventional memories may include relatively logic which manages when to perform targeted refresh operations, what to do if a targeted refresh operation is called for but not aggressor is detected, how to adjust a rate of targeted to sequential refresh operations etc.
The present disclosure is drawn to apparatuses, systems, and methods for access based targeted refresh operations. A memory includes a memory bank which is divided into two or more sub-banks. Each sub-bank is associated with a refresh control circuit which includes an aggressor detector. When an aggressor address is detected in the associated sub-bank, the next time a word line is accessed in a different sub-bank, a targeted refresh operation is performed on the victims of the detected aggressor. In this manner, targeted refresh operations may occur ‘as needed’ in the sub-banks with timing based on accesses in the other sub-banks. This may simplify the logic for determining when to perform targeted refresh operations.
In some embodiments, the use of access operations in other sub-banks to control the timing of targeted refresh operations may be advantageous. Some memories may track accesses to each row of the memory to determine which rows are aggressors. For example, each row may have memory cells set aside which store an access count associated with that row. Based on the access count (e.g., a comparison to a threshold), the row may be determined to be an aggressor. When a targeted refresh operation is performed on the victims of that row, the count value should be reset, which requires accessing the aggressor row (to read, modify and write the count value). However, this requires time to access the aggressor row. After targeted refresh operations have refreshed the victims of the aggressor, the aggressor row may be accessed and it's count value reset responsive to a word line being accessed in a different sub-bank. This may allow the count value along the aggressor to be reset without interrupting normal access operations.
The semiconductor device 100 includes a memory array 118. The memory array 118 is shown as including a plurality of memory banks. In the embodiment of
Each memory sub-bank includes a plurality of word lines WL, a plurality of bit lines BLT, and a plurality of memory cells MC arranged at intersections of the plurality of word lines WL and the plurality of bit lines BL. The selection of the word line WL is performed by a row decoder 108 and the selection of the bit lines BL is performed by a column decoder 110. In the embodiment of
The bit lines BL are coupled to a respective sense amplifier (SAMP). Read data from the bit line BL is amplified by the sense amplifier SAMP, and transferred to read/write amplifiers 120 over local data lines (LIO), transfer gate (TG), and global data lines (GIO). Conversely, write data outputted from the read/write amplifiers 120 is transferred to the sense amplifier SAMP over the complementary main data lines GIO, the transfer gate TG, and the complementary local data lines LIO, and written in the memory cell MC coupled to the bit line BL.
The semiconductor device 100 may employ a plurality of external terminals, such as solder pads, that include command and address (C/A) terminals coupled to a command and address bus to receive commands and addresses, clock terminals to receive clocks CK and/CK, data terminals DQ coupled to a data bus to provide data, and power supply terminals to receive power supply potentials VDD, VSS, VDDQ, and VSSQ.
The clock terminals are supplied with external clocks CK and/CK that are provided to an input circuit 112. The external clocks may be complementary. The input circuit 112 generates an internal clock ICLK based on the CK and/CK clocks. The ICLK clock is provided to the command decoder 106 and to an internal clock generator 114. The internal clock generator 114 provides various internal clocks LCLK based on the ICLK clock. The LCLK clocks may be used for timing operation of various internal circuits. The internal data clocks LCLK are provided to the input/output circuit 122 to time operation of circuits included in the input/output circuit 122, for example, to data receivers to time the receipt of write data. The input/output circuit 122 may include a number of interface connections, each of which may be couplable to one of the DQ pads (e.g., the solder pads which may act as external connections to the device 100).
The C/A terminals may be supplied with memory addresses. The memory addresses supplied to the C/A terminals are transferred, via a command/address input circuit 102, to an address decoder 104. The address decoder 104 receives the address and supplies a decoded row address XADD to the row decoder 108 and supplies a decoded column address YADD to the column decoder 110. The column decoder 110 may provide a column select signal CS, which may activate a selected one of the sense amplifiers SAMP. The address decoder 104 may also supply a decoded bank address BADD, which may indicate the bank of the memory array 118 containing the decoded row address XADD and column address YADD. The row address XADD may indicate the sub-bank within the bank indicated by BADD.
The C/A terminals may be supplied with commands. Examples of commands include timing commands for controlling the timing of various operations, access commands for accessing the memory, such as read commands for performing read operations and write commands for performing write operations, as well as other commands and operations. The access commands may be associated with one or more row address XADD, column address YADD, and bank address BADD to indicate the memory cell(s) to be accessed.
The commands may be provided as internal command signals to a command decoder 106 via the command/address input circuit 102. The command decoder 106 includes circuits to decode the internal command signals to generate various internal signals and commands for performing operations. For example, the command decoder 106 may provide a row command signal to select a word line and a column command signal to select a bit line.
The device 100 may receive an access command which is a read command. When a read command is received, and a bank address, a row address and a column address are timely supplied with the read command, read data is read from memory cells in the memory array 118 corresponding to the row address and column address. The read command is received by the command decoder 106, which provides internal commands so that read data from the memory array 118 is provided to the read/write amplifiers 120. The read data is provided along the data bus and output to outside from the data terminals DQ via the input/output circuit 122.
The device 100 may receive an access command which is a write command. When the write command is received, and a bank address, a row address and a column address are timely supplied with the write command, write data supplied to the data terminals DQ is provided along the data bus and written to a memory cells in the memory array 118 corresponding to the row address and column address. The write command is received by the command decoder 106, which provides internal commands so that the write data is received by data receivers in the input/output circuit 122. Write clocks may also be provided to the external clock terminals for timing the receipt of the write data by the data receivers of the input/output circuit 122. The write data is supplied via the input/output circuit 122 to the read/write amplifiers 120, and by the read/write amplifiers 120 to the memory array 118 to be written into the memory cell MC.
The device 100 includes refresh control circuits 116, each associated with a bank or sub-bank of the memory array 118. Each refresh control circuit 116 may determine when to perform a refresh operation on the associated sub-bank. The refresh control circuit 116 provides a refresh address RXADD (along with one or more refresh signals, not shown in
The refresh control circuit 116 may perform multiple types of refresh operation, which may determine how the address RXADD is generated, as well as other details such as how many word lines are associated with the address RXADD. For example, the refresh control circuit 116 may perform sequential refresh operations, where the refresh address RXADD is generated based on a sequence of refresh operations. For example, after a first sequential refresh operation with an address RXADD, the next sequential refresh operation may generate an address RXADD+1. Sequential refresh addresses may be associated with multiple word lines, for example by truncating the address RXADD compared to a full row address XADD, and refreshing all word lines which share the truncated portion in common. Over the course of a refresh cycle, the sequential refresh operations may refresh all word lines in the sub array (e.g., by sequentially generating addresses associated with all word lines) and then the sequence may recycle.
The refresh control circuit 116 may perform sequential refresh operations with timing based on a refresh interval tREFI. The refresh interval tREFI may be based on expected timing for refreshing any given word line (e.g., based on an expected rate of information decay) as well as the number of refresh operations required to complete a refresh cycle (e.g., the number of sequential refresh operations per refresh cycle). Each tREFI, the refresh control circuit 116 may perform a sequential refresh operation. For example, a refresh signal REF may be generated each time tREFI elapses and responsive to the refresh signal REF, one or more sequential refresh operations may be performed.
As well as sequential refresh operations, the refresh control circuit 116 may perform targeted refresh operations, where the refresh address RXADD is based on a detected aggressor word line. Certain access patterns to a row may cause an increased rate of data decay in the memory cells of other nearby rows. For example, multiple accesses to a single row, a ‘row hammer’, may increase the rate of decay in memory cells along the nearby word lines. Since these memory cells may decay faster than the timing expected by tREFI, it is useful to identify these aggressor rows so that their victims can be refreshed.
The refresh control circuit may include logic which detects aggressors and then generates a refresh address RXADD based on the detected aggressor as part of a targeted refresh operation. For example, if the aggressor is AggXADD, then the refresh control circuit may refresh adjacent and/or nearby word lines such as one or more of AggXADD+1, AggXADD-1, AggXADD+2, AggXADD-2, etc. Various criterion may be used to detect aggressors. For example, the memory may count a number of accesses to different word lines (e.g., based on the row addresses XADD which are provided along a row address bus from the address decoder 104) and designate a row address as an aggressor when that count crosses a threshold. In some embodiments, the count of accesses to a given row may be stored along memory cells of that row. Accordingly, when a word line is accessed, the count may be read from the memory cells of that row, modified (e.g., incremented), compared to a threshold, and the changed count (e.g., either incremented or reset if the count was above the threshold) may be written back.
While the present disclosure may generally refer to detecting aggressor addresses and their victims, it should be understood that these term are used to mean rows which are used to calculate targeted refresh addresses. For example, it is not necessary that the aggressor address undergo an attack, such as a row hammer, or that there is actual increased data decay in the victims. In some embodiments, the memory may use sampling, which may introduce an aspect of randomness into the selection of aggressor addresses.
The refresh control circuit 116 may perform targeted refresh operations on a sub-bank with timing based, in part, on accesses to other sub-banks of the same bank. For example, if there are two sub-banks per bank, after an aggressor is detected in a second sub-bank when a word line is accessed in the first sub-bank, the refresh control circuit 116 may refresh one or more victims in the second sub-bank based on the detected aggressor. In this manner, targeted refresh commands may be performed in an ‘on-demand’ fashion, with timing based on accesses to different sub-banks
The refresh control circuit 116 may also receive refresh management RFM commands which may cause the refresh control circuit 116 to perform a targeted refresh operation. The RFM command may be issued by a controller external to the device 100.
The power supply terminals are supplied with power supply potentials VDD and VSS. The power supply potentials VDD and VSS are supplied to an internal voltage generator circuit 124. The internal voltage generator circuit 124 generates various internal potentials VARY, and the like based on the power supply potentials VDD and VSS supplied to the power supply terminals.
The power supply terminals are also supplied with power supply potentials VDDQ and VSSQ. The power supply potentials VDDQ and VSSQ are supplied to the input/output circuit 122. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals may be the same potentials as the power supply potentials VDD and VSS supplied to the power supply terminals in an embodiment of the disclosure. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals may be different potentials from the power supply potentials VDD and VSS supplied to the power supply terminals in another embodiment of the disclosure. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals are used for the input/output circuit 122 so that power supply noise generated by the input/output circuit 122 does not propagate to the other circuit blocks.
The refresh control circuit 210 includes an aggressor detector circuit 212 which activates a flag when an aggressor address RHR-RA has been detected in the associated sub-bank 206. Responsive to an activation command ACT, a logic circuit 218 may provide a targeted refresh signal RHR if the flag is active. If the flag is active, a comparator 214 may determine if the accessed row address Act-RA matches the aggressor RHR-RA, and if it does not, then sub-bank logic 216 may determine if the address Act-RA and RHR-RA are in a same sub-bank (e.g., is Act-RA in sub-bank B 206). If they are not, the sub-bank logic 216 provides a complimentary match signal matchF at an active level. If both the RHR command and matchF are active, then a logic circuit 220 may provide the RHR command to the sub-bank 206. A refresh address generator 222 provides one or more refresh addresses RXADD responsive to either a refresh command REF or the RHR command. If the RHR command is active, then the refresh address generator 222 may generate refresh address(es) based on RHR-RA. Responsive to the RHR command from logic circuit 220, a row decoder (not shown) may refresh one or more word lines associated with RXADD in the sub-bank 206.
The aggressor detector circuit 212 may detect aggressor addresses in the sub-bank 206 based on one or more criteria. For example, the aggressor detector circuit 212 may count accesses to different addresses and if an access count crosses a threshold may determine that address to be an aggressor. In some embodiments, the aggressor detector 212 may receive the accessed address Act-RA and use that to detect an aggressor. In some embodiments, the access counts may be stored in the memory array (e.g., along memory cells of the row associated with that memory count), and the aggressor detector may receive those counts when the row is accessed. Various other techniques to determine aggressor addresses may be used in other example embodiments. When the aggressor detector circuit 212 detects an aggressor it may activate a flag and provide the aggressor address as RHR-RA.
During an example access operation, a command decoder (e.g., 106 of
A comparator circuit 214 may receive the flag and the RHR-RA from the aggressor detector 212 as well as an accessed address Act-RA. If the flag is active (e.g., if there is a detected aggressor) then the comparator 214 may compare the address RHR-RA and Act-RA to determine if they are the same. If they are not the same, then a sub-bank logic circuit 216 may determine if the address Act-RA is in the sub-bank associated with the refresh control circuit 210. For example, the logic 216 may check a portion of the row address Act-RA which specifies a sub-bank to determine if the address Act-RA is associated with sub-bank B 206. IF the address is not associated with sub-bank B, then the logic 216 provides a signal matchF at an active level (e.g., at a high logical level).
A logic circuit 218 receives the activation command ACT (e.g., from a command decoder) and the flag signal from the aggressor detector 212. If the flag signal is active (e.g., if an aggressor has been detected) then the logic circuit may provide an RHR command. For example, the logic 218 may be an AND gate with inputs coupled to flag and to ACT. A second logic circuit 220 may provide the RHR command to the sub-bank (or to a row decoder associated with the sub-bank) when both the signal matchF and the RHR command are active. For example, the second logic circuit 220 may also be an AND gate with input terminals coupled to RHR from the first logic circuit 218 and to matchF from the sub-bank logic 216. If both are active, then the RHR command is provided to the sub-bank 206.
The refresh logic 210 includes a refresh address generator 222. The refresh address generator 222 includes a CBR counter circuit 224 which generates sequential refresh addresses as the refresh address RXADD when a refresh signal REF is active and a targeted refresh address generator 226 which generates a targeted refresh address as the refresh address RXADD when a targeted refresh signal RHR is active. Responsive to a refresh signal REF, the CBR counter circuit 224 may provide a refresh address RXADD as part of a sequential refresh operation. For example, the CBR counter circuit 224 may updates an address and provides it as the refresh address RXADD as part of a sequential refresh operation. For example, a previous sequential refresh address may be incremented by the CBR counter circuit 224 to generate a new sequential refresh address. In some embodiments, the refresh address generator 222 may provide multiple addresses and perform multiple sequential refresh operations responsive to the signal REF. In some embodiments, the refresh control circuit 210 may perform different numbers of sequential refresh operations responsive to activations of REF. For example, the refresh control circuit 210 may alternate between two sequential refresh operations and one sequential refresh operation.
The targeted refresh address generator 226 may provide a targeted refresh address RXADD based on the aggressor address RHR-RA when the signal RHR is provided. For example, the address RXADD may represent a word line which near to a word line associated with RHR-RA. For example the address RXADD may be one of the word lines adjacent to RHR-RA (e.g., RHR-RA+1 and RHR-RA-1). Other relationships may also be used. In some embodiments, the refresh address generator 222 may provide multiple refresh addresses RXADD responsive to the signal RHR (e.g., both RHR-RA+1 and RHR-RA-1).
Responsive to the signal RHR, a word line associated with RXADD is refreshed in the sub-bank 206. For example, a word line 208 may be refreshed. In this manner, a targeted refresh operation may be performed on the word line 208 in the second sub-bank 206 while the word line 204 in the first sub-bank 202 is being accessed. After refreshing the victim(s) of the identified aggressor RHR-RA, the aggressor detector 212 may reset the flag to an inactive (or unset) state.
The timing diagram shows several refresh intervals, beginning at times t0, t1, t2, and t3, each of which is marked by the activation of tREFI timer signal. The different refresh intervals may be separated by a time tREFI, which may be a setting of the memory. In some embodiments, the refresh intervals may be marked by a refresh signal REF (not shown in
During the first refresh interval beginning at t0, a refresh signal causes two sequential refresh operations to be performed in both sub-banks. Before the time to, an aggressor address has been detected in sub-bank B, but not in sub-bank A. After t0, a first access is performed in sub-bank B. Since there is no detected aggressor in sub-bank A (e.g., the flag for sub-bank A is inactive/unset), no targeted refresh is performed in sub-bank A responsive to the access in sub-bank B. However, when a row is accessed in sub-bank A, a targeted refresh operation may be performed in sub-bank B. During subsequent accesses to sub-bank B, a second aggressor may be detected. Accordingly, during a later access to sub-bank A, a second targeted refresh may be performed in sub-bank A.
During a second refresh interval beginning at t1, only a single sequential refresh operation may be performed. At the time t1, aggressors have been located in both of the sub-banks. Accordingly, after a first access in the first sub-bank, a targeted refresh is performed in sub-bank B. After a first access in the sub-bank B, a targeted refresh is performed in the sub-bank A. Since no further aggressors are detected in the period between t1 and t2, no further targeted refresh operations are performed.
During a third refresh interval beginning at t2, two sequential refresh operations are performed. After that, an access is performed in the sub-bank A, which is determined to be an aggressor. Accordingly, a next time sub-bank B is accessed, a targeted refresh operation is performed in sub-bank A. Similarly at the refresh period beginning with t3, targeted refresh operations are performed in both sub-banks responsive to access operations in the opposite sub-bank.
The refresh logic 400 shows a sub-bank 402 which includes a number of word lines and bit lines. Memory cells (not shown) are located at the intersection of the word and bit lines. Certain memory cells along each row are set aside to store a count value associated with that row. In the example embodiment of
When a word line is accessed (e.g., responsive to the access address ACT-RA and an activation signal ACT), the count value CNT associated with that row may be read out by a counter read/write (R/W) circuit 412. A counter control circuit 414 (which may be part of an aggressor detector circuit such as 212 of
The changed count value CNT+1 is provided to a logic gate 410, which provides it as a new count value CNT′ to the counter R/W circuit 412 when a reset signal RSTF is at a high logical level. Responsive to receiving an updated count value, the counter R/W circuit 412 writes the updated value CNT′ back to the memory cells of the sub-bank 402.
An aggressor register 404 (e.g., part of a refresh address generator 222 of
A comparator 406 may receive an activation address ACT-RA as part of a subsequent access operation. The comparator 406 compares the address ACT-RA and the stored aggressor address XADD in the aggressor register 404 and determines if they are in the same sub-bank. If they are not (e.g., if ACT-RA is associated with sub-bank 403), then the comparator 406 provides a reset signal RST at an active level. An inverter 408 provides the signal RSTF at a low logical level when the signal RST is at an active level. When the signal RSTF is at a low logical level, the logic gate 410 provides a value of CNT′ which is a reset value. For example, the logic gate 410 may be AND logic, and when the signal RSTF is at a low logical level, the bits of the value CNT′ may be at a low logical level (e.g., the binary number may be 0). Accordingly, when the aggressor register 404 stores an aggressor address XADD in a sub-bank 402, and a subsequent access address is provided associated with a second sub-bank 403, then a reset count value CNT′ is written to the memory cells which store the count along a word line associated with RST-RA (e.g., the aggressor word line). In some embodiments, the comparator 406 may be the same comparison logic used to determine if the aggressor and accessed address are in the same sub-bank (e.g., the comparator 406 may represent the comparator 214 and sub-bank logic 216 of
At an initial time t0, a refresh period begins with two sequential refresh operations. Afterwards, an access is performed in sub-bank B, and the access address is identified as an aggressor. When a word line in sub-bank A is performed, a targeted refresh is performed on a victim associated with the aggressor. For the sake of simplicity, in the example of
At a first time t1, an aggressor is detected in both sub-banks. During a first access to sub-bank A, a targeted refresh is performed in sub-bank B. Next during an access to sub-bank B a targeted refresh is performed in sub-bank A. Next, sub-bank A is accessed and the aggressor in sub-bank B is reset followed by an access to sub-bank B which allows a reset operation to be performed on the aggressor in sub-bank A.
The method 600 includes block 610, which describes detecting an aggressor address in a first sub-bank of a memory bank. For example, the method 600 may include detecting the aggressor address with an aggressor detector 212 based on accesses to the aggressor address. For example, the method 600 may include counting accesses to accessed addresses and designating an address as the aggressor address when its count meets or exceeds a threshold. In some embodiments, the method 600 may include reading a count value from memory cells of a word line associated with the aggressor address and determining that it's the aggressor based on the count value.
The method 600 includes box 620, which describes accessing a word line in a second sub-bank of the memory bank. For example, an access address ACT-RA may be associated with a word line in the second sub-bank.
The method 600 includes box 630, which describes performing a targeted refresh operation on the first sub-bank based on the detected aggressor address responsive to accessing the word line in the second sub-bank. For example, the method 600 may include generating a refresh address based on the aggressor address and refreshing a word line associated with the refresh address as part of a targeted refresh operation. The method 600 may include performing the targeted refresh operation on the first sub-bank responsive to a next access operation in the second sub-bank after detecting the aggressor address in the first sub-bank. The method 600 may also include performing sequential refresh operations based on a refresh signal which periodically provided.
Of course, it is to be appreciated that any one of the examples, embodiments or processes described herein may be combined with one or more other examples, embodiments and/or processes or be separated and/or performed amongst separate devices or device portions in accordance with the present systems, devices and methods.
Finally, the above-discussion is intended to be merely illustrative of the present system and should not be construed as limiting the appended claims to any particular embodiment or group of embodiments. Thus, while the present system has been described in particular detail with reference to exemplary embodiments, it should also be appreciated that numerous modifications and alternative embodiments may be devised by those having ordinary skill in the art without departing from the broader and intended spirit and scope of the present system as set forth in the claims that follow. Accordingly, the specification and drawings are to be regarded in an illustrative manner and are not intended to limit the scope of the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5225839 | Okurowski et al. | Jul 1993 | A |
5299159 | Balistreri et al. | Mar 1994 | A |
5654929 | Mote, Jr. | Aug 1997 | A |
5699297 | Yamazaki et al. | Dec 1997 | A |
5867442 | Kim et al. | Feb 1999 | A |
5933377 | Hidaka | Aug 1999 | A |
5943283 | Wong et al. | Aug 1999 | A |
5956288 | Bermingham et al. | Sep 1999 | A |
5959923 | Matteson et al. | Sep 1999 | A |
5970507 | Kato et al. | Oct 1999 | A |
5999471 | Choi | Dec 1999 | A |
5999473 | Harrington et al. | Dec 1999 | A |
6002629 | Kim et al. | Dec 1999 | A |
6011734 | Pappert | Jan 2000 | A |
6061290 | Shirley | May 2000 | A |
6064621 | Tanizaki et al. | May 2000 | A |
6212118 | Fujita | Apr 2001 | B1 |
6306721 | Teo et al. | Oct 2001 | B1 |
6310806 | Higashi et al. | Oct 2001 | B1 |
6310814 | Hampel et al. | Oct 2001 | B1 |
6363024 | Fibranz | Mar 2002 | B1 |
6392952 | Chen et al. | May 2002 | B1 |
6424582 | Ooishi | Jul 2002 | B1 |
6434064 | Nagai | Aug 2002 | B2 |
6452868 | Fister | Sep 2002 | B1 |
6490216 | Chen et al. | Dec 2002 | B1 |
6515928 | Sato et al. | Feb 2003 | B2 |
6535950 | Funyu et al. | Mar 2003 | B1 |
6535980 | Kumar et al. | Mar 2003 | B1 |
6563757 | Agata | May 2003 | B2 |
6567340 | Nataraj et al. | May 2003 | B1 |
6950364 | Kim | Sep 2005 | B2 |
7002868 | Takahashi | Feb 2006 | B2 |
7057960 | Fiscus et al. | Jun 2006 | B1 |
7082070 | Hong | Jul 2006 | B2 |
7187607 | Koshikawa et al. | Mar 2007 | B2 |
7203113 | Takahashi et al. | Apr 2007 | B2 |
7203115 | Eto et al. | Apr 2007 | B2 |
7209402 | Shinozaki et al. | Apr 2007 | B2 |
7215588 | Lee | May 2007 | B2 |
7444577 | Best et al. | Oct 2008 | B2 |
7551502 | Dono et al. | Jun 2009 | B2 |
7565479 | Best et al. | Jul 2009 | B2 |
7692993 | Iida et al. | Apr 2010 | B2 |
7830742 | Han | Nov 2010 | B2 |
8174921 | Kim et al. | May 2012 | B2 |
8400805 | Yoko | Mar 2013 | B2 |
8526260 | Pyeon | Sep 2013 | B2 |
8572423 | Isachar et al. | Oct 2013 | B1 |
8625360 | Iwamoto et al. | Jan 2014 | B2 |
8681578 | Narui | Mar 2014 | B2 |
8756368 | Best et al. | Jun 2014 | B2 |
8811100 | Ku | Aug 2014 | B2 |
8862973 | Zimmerman et al. | Oct 2014 | B2 |
8938573 | Greenfield et al. | Jan 2015 | B2 |
9032141 | Bains et al. | May 2015 | B2 |
9047978 | Bell et al. | Jun 2015 | B2 |
9076499 | Schoenborn et al. | Jul 2015 | B2 |
9076548 | Park et al. | Jul 2015 | B1 |
9087602 | Youn et al. | Jul 2015 | B2 |
9117544 | Bains et al. | Aug 2015 | B2 |
9123447 | Lee et al. | Sep 2015 | B2 |
9153294 | Kang | Oct 2015 | B2 |
9190137 | Kim et al. | Nov 2015 | B2 |
9190139 | Jung et al. | Nov 2015 | B2 |
9236110 | Bains et al. | Jan 2016 | B2 |
9251885 | Greenfield et al. | Feb 2016 | B2 |
9286964 | Halbert et al. | Mar 2016 | B2 |
9299400 | Bains et al. | Mar 2016 | B2 |
9311984 | Hong et al. | Apr 2016 | B1 |
9311985 | Lee et al. | Apr 2016 | B2 |
9324398 | Jones et al. | Apr 2016 | B2 |
9384821 | Bains et al. | Jul 2016 | B2 |
9390782 | Best et al. | Jul 2016 | B2 |
9396786 | Yoon et al. | Jul 2016 | B2 |
9406358 | Lee | Aug 2016 | B1 |
9412432 | Narui et al. | Aug 2016 | B2 |
9418723 | Chishti et al. | Aug 2016 | B2 |
9424907 | Fujishiro | Aug 2016 | B2 |
9484079 | Lee | Nov 2016 | B2 |
9514850 | Kim | Dec 2016 | B2 |
9570143 | Lim et al. | Feb 2017 | B2 |
9570201 | Morgan et al. | Feb 2017 | B2 |
9646672 | Kim et al. | May 2017 | B1 |
9653139 | Park | May 2017 | B1 |
9672889 | Lee et al. | Jun 2017 | B2 |
9685240 | Park | Jun 2017 | B1 |
9691466 | Kim | Jun 2017 | B1 |
9697913 | Mariani et al. | Jul 2017 | B1 |
9734887 | Tavva | Aug 2017 | B1 |
9741409 | Jones et al. | Aug 2017 | B2 |
9741421 | Hedden | Aug 2017 | B1 |
9741447 | Akamatsu | Aug 2017 | B2 |
9747971 | Bains et al. | Aug 2017 | B2 |
9761297 | Tomishima | Sep 2017 | B1 |
9786351 | Lee et al. | Oct 2017 | B2 |
9799391 | Wei | Oct 2017 | B1 |
9805782 | Liou | Oct 2017 | B1 |
9805783 | Ito et al. | Oct 2017 | B2 |
9812185 | Fisch et al. | Nov 2017 | B2 |
9818469 | Kim et al. | Nov 2017 | B1 |
9831003 | Sohn et al. | Nov 2017 | B2 |
9865326 | Bains et al. | Jan 2018 | B2 |
9865328 | Desimone et al. | Jan 2018 | B1 |
9892779 | Kang et al. | Feb 2018 | B2 |
9922694 | Akamatsu | Mar 2018 | B2 |
9934143 | Bains et al. | Apr 2018 | B2 |
9953696 | Kim | Apr 2018 | B2 |
9972377 | Oh et al. | May 2018 | B2 |
9978430 | Seo et al. | May 2018 | B2 |
10020045 | Riho | Jul 2018 | B2 |
10020046 | Uemura | Jul 2018 | B1 |
10032501 | Ito et al. | Jul 2018 | B2 |
10049716 | Proebsting | Aug 2018 | B2 |
10083737 | Bains et al. | Sep 2018 | B2 |
10090038 | Shin | Oct 2018 | B2 |
10134461 | Bell et al. | Nov 2018 | B2 |
10141042 | Richter | Nov 2018 | B1 |
10147472 | Jones et al. | Dec 2018 | B2 |
10153031 | Akamatsu | Dec 2018 | B2 |
10170174 | Ito et al. | Jan 2019 | B1 |
10192608 | Morgan | Jan 2019 | B2 |
10210925 | Bains et al. | Feb 2019 | B2 |
10297305 | Moon et al. | May 2019 | B1 |
10297307 | Raad et al. | May 2019 | B1 |
10339994 | Ito et al. | Jul 2019 | B2 |
10381327 | Ramachandra et al. | Aug 2019 | B2 |
10446256 | Ong et al. | Oct 2019 | B2 |
10468076 | He et al. | Nov 2019 | B1 |
10490250 | Ito et al. | Nov 2019 | B1 |
10490251 | Wolff | Nov 2019 | B2 |
10504577 | Alzheimer | Dec 2019 | B1 |
10510396 | Notani et al. | Dec 2019 | B1 |
10572377 | Zhang et al. | Feb 2020 | B1 |
10573370 | Ito et al. | Feb 2020 | B2 |
10607679 | Nakaoka | Mar 2020 | B2 |
10685696 | Brown et al. | Jun 2020 | B2 |
10699796 | Benedict et al. | Jun 2020 | B2 |
10790005 | He et al. | Sep 2020 | B1 |
10825505 | Rehmeyer | Nov 2020 | B2 |
10832792 | Penney et al. | Nov 2020 | B1 |
10930335 | Bell et al. | Feb 2021 | B2 |
10943636 | Wu et al. | Mar 2021 | B1 |
10950289 | Ito et al. | Mar 2021 | B2 |
10957377 | Noguchi | Mar 2021 | B2 |
10964378 | Ayyapureddi et al. | Mar 2021 | B2 |
10978132 | Rehmeyer et al. | Apr 2021 | B2 |
11017833 | Wu et al. | May 2021 | B2 |
11069393 | Cowles et al. | Jul 2021 | B2 |
11081160 | Ito et al. | Aug 2021 | B2 |
11222683 | Rehmeyer | Jan 2022 | B2 |
11222686 | Noguchi | Jan 2022 | B1 |
11227649 | Meier et al. | Jan 2022 | B2 |
11264079 | Roberts | Mar 2022 | B1 |
11302374 | Jenkinson et al. | Apr 2022 | B2 |
11302377 | Li et al. | Apr 2022 | B2 |
11309010 | Ayyapureddi | Apr 2022 | B2 |
11309012 | Meier et al. | Apr 2022 | B2 |
11315619 | Wolff | Apr 2022 | B2 |
11315620 | Ishikawa et al. | Apr 2022 | B2 |
11320377 | Chen et al. | May 2022 | B2 |
11348631 | Wu et al. | May 2022 | B2 |
11380382 | Zhang et al. | Jul 2022 | B2 |
11386946 | Ayyapureddi | Jul 2022 | B2 |
11417383 | Jenkinson et al. | Aug 2022 | B2 |
11532346 | Brown et al. | Dec 2022 | B2 |
11557331 | Mitsubori et al. | Jan 2023 | B2 |
11610622 | Rehmeyer et al. | Mar 2023 | B2 |
11615831 | Yamamoto | Mar 2023 | B2 |
11626152 | Wu et al. | Apr 2023 | B2 |
11688452 | Nale et al. | Jun 2023 | B2 |
11715512 | Li et al. | Aug 2023 | B2 |
11749331 | Wu et al. | Sep 2023 | B2 |
11798610 | Cowles et al. | Oct 2023 | B2 |
11810612 | Roberts | Nov 2023 | B2 |
11935576 | Ishikawa et al. | Mar 2024 | B2 |
11955158 | Brown et al. | Apr 2024 | B2 |
20010008498 | Ooishi | Jul 2001 | A1 |
20020026613 | Niiro | Feb 2002 | A1 |
20020181301 | Takahashi et al. | Dec 2002 | A1 |
20020191467 | Matsumoto et al. | Dec 2002 | A1 |
20030026161 | Yamaguchi et al. | Feb 2003 | A1 |
20030063512 | Takahashi et al. | Apr 2003 | A1 |
20030067825 | Shimano et al. | Apr 2003 | A1 |
20030081483 | De et al. | May 2003 | A1 |
20030123301 | Jang et al. | Jul 2003 | A1 |
20030161208 | Nakashima et al. | Aug 2003 | A1 |
20030193829 | Morgan et al. | Oct 2003 | A1 |
20030231540 | Lazar et al. | Dec 2003 | A1 |
20040004856 | Sakimura et al. | Jan 2004 | A1 |
20040008544 | Shinozaki et al. | Jan 2004 | A1 |
20040022093 | Lee | Feb 2004 | A1 |
20040024955 | Patel | Feb 2004 | A1 |
20040114446 | Takahashi et al. | Jun 2004 | A1 |
20040130959 | Kawaguchi | Jul 2004 | A1 |
20040184323 | Mori et al. | Sep 2004 | A1 |
20040218431 | Chung et al. | Nov 2004 | A1 |
20050002268 | Otsuka et al. | Jan 2005 | A1 |
20050041502 | Perner | Feb 2005 | A1 |
20050105362 | Choi et al. | May 2005 | A1 |
20050108460 | David | May 2005 | A1 |
20050213408 | Shieh | Sep 2005 | A1 |
20050243627 | Lee et al. | Nov 2005 | A1 |
20050249009 | Shieh | Nov 2005 | A1 |
20050265104 | Remaklus et al. | Dec 2005 | A1 |
20060018174 | Park et al. | Jan 2006 | A1 |
20060083099 | Bae et al. | Apr 2006 | A1 |
20060087903 | Riho et al. | Apr 2006 | A1 |
20060104139 | Hur et al. | May 2006 | A1 |
20060176744 | Stave | Aug 2006 | A1 |
20060198220 | Yoon et al. | Sep 2006 | A1 |
20060215474 | Hokenmaier | Sep 2006 | A1 |
20060233012 | Sekiguchi et al. | Oct 2006 | A1 |
20060262616 | Chen | Nov 2006 | A1 |
20060262617 | Lee | Nov 2006 | A1 |
20060268643 | Schreck et al. | Nov 2006 | A1 |
20070002651 | Lee | Jan 2007 | A1 |
20070008799 | Dono et al. | Jan 2007 | A1 |
20070014175 | Min et al. | Jan 2007 | A1 |
20070028068 | Golding et al. | Feb 2007 | A1 |
20070030746 | Best et al. | Feb 2007 | A1 |
20070033338 | Tsern | Feb 2007 | A1 |
20070033339 | Best et al. | Feb 2007 | A1 |
20070106838 | Choi | May 2007 | A1 |
20070147154 | Lee | Jun 2007 | A1 |
20070165042 | Yagi | Jul 2007 | A1 |
20070171750 | Oh | Jul 2007 | A1 |
20070237016 | Miyamoto et al. | Oct 2007 | A1 |
20070263442 | Cornwell et al. | Nov 2007 | A1 |
20070297252 | Singh | Dec 2007 | A1 |
20080028137 | Schakel et al. | Jan 2008 | A1 |
20080028260 | Oyagi et al. | Jan 2008 | A1 |
20080031068 | Yoo et al. | Feb 2008 | A1 |
20080126893 | Harrand et al. | May 2008 | A1 |
20080130394 | Dono et al. | Jun 2008 | A1 |
20080181048 | Han | Jul 2008 | A1 |
20080212386 | Riho | Sep 2008 | A1 |
20080224742 | Pomichter | Sep 2008 | A1 |
20080253212 | Iida et al. | Oct 2008 | A1 |
20080253213 | Sato et al. | Oct 2008 | A1 |
20080266990 | Loeffler | Oct 2008 | A1 |
20080270683 | Barth et al. | Oct 2008 | A1 |
20080306723 | De et al. | Dec 2008 | A1 |
20080316845 | Wang et al. | Dec 2008 | A1 |
20090021999 | Tanimura et al. | Jan 2009 | A1 |
20090052264 | Hong et al. | Feb 2009 | A1 |
20090059641 | Jeddeloh | Mar 2009 | A1 |
20090073760 | Betser et al. | Mar 2009 | A1 |
20090147606 | Daniel | Jun 2009 | A1 |
20090161468 | Fujioka | Jun 2009 | A1 |
20090168571 | Pyo et al. | Jul 2009 | A1 |
20090185440 | Lee | Jul 2009 | A1 |
20090201752 | Riho et al. | Aug 2009 | A1 |
20090228739 | Cohen et al. | Sep 2009 | A1 |
20090251971 | Futatsuyama | Oct 2009 | A1 |
20090296510 | Lee et al. | Dec 2009 | A1 |
20100005217 | Jeddeloh | Jan 2010 | A1 |
20100005376 | Laberge et al. | Jan 2010 | A1 |
20100061153 | Yen et al. | Mar 2010 | A1 |
20100074042 | Fukuda et al. | Mar 2010 | A1 |
20100097870 | Kim et al. | Apr 2010 | A1 |
20100110809 | Kobayashi et al. | May 2010 | A1 |
20100110810 | Kobayashi | May 2010 | A1 |
20100124138 | Lee et al. | May 2010 | A1 |
20100128547 | Kagami | May 2010 | A1 |
20100131812 | Mohammad | May 2010 | A1 |
20100141309 | Lee | Jun 2010 | A1 |
20100157693 | Iwai et al. | Jun 2010 | A1 |
20100182862 | Teramoto | Jul 2010 | A1 |
20100182863 | Fukiage | Jul 2010 | A1 |
20100329069 | Ito et al. | Dec 2010 | A1 |
20110026290 | Noda et al. | Feb 2011 | A1 |
20110055495 | Remaklus, Jr. et al. | Mar 2011 | A1 |
20110069572 | Lee et al. | Mar 2011 | A1 |
20110122987 | Neyer | May 2011 | A1 |
20110134715 | Norman | Jun 2011 | A1 |
20110216614 | Hosoe | Sep 2011 | A1 |
20110225355 | Kajigaya | Sep 2011 | A1 |
20110299352 | Fujishiro et al. | Dec 2011 | A1 |
20110310648 | Iwamoto et al. | Dec 2011 | A1 |
20120014199 | Narui | Jan 2012 | A1 |
20120059984 | Kang et al. | Mar 2012 | A1 |
20120151131 | Kilmer et al. | Jun 2012 | A1 |
20120155173 | Lee et al. | Jun 2012 | A1 |
20120155206 | Kodama et al. | Jun 2012 | A1 |
20120213021 | Riho et al. | Aug 2012 | A1 |
20120254472 | Ware et al. | Oct 2012 | A1 |
20120287727 | Wang | Nov 2012 | A1 |
20120307582 | Marumoto et al. | Dec 2012 | A1 |
20120327734 | Sato | Dec 2012 | A1 |
20130003467 | Klein | Jan 2013 | A1 |
20130003477 | Park et al. | Jan 2013 | A1 |
20130028034 | Fujisawa | Jan 2013 | A1 |
20130051157 | Park | Feb 2013 | A1 |
20130051171 | Porter et al. | Feb 2013 | A1 |
20130077423 | Lee | Mar 2013 | A1 |
20130173971 | Zimmerman | Jul 2013 | A1 |
20130254475 | Perego et al. | Sep 2013 | A1 |
20130279284 | Jeong | Oct 2013 | A1 |
20130304982 | Jung et al. | Nov 2013 | A1 |
20140006700 | Schaefer et al. | Jan 2014 | A1 |
20140006703 | Bains et al. | Jan 2014 | A1 |
20140006704 | Greenfield et al. | Jan 2014 | A1 |
20140013169 | Kobla et al. | Jan 2014 | A1 |
20140013185 | Kobla et al. | Jan 2014 | A1 |
20140016422 | Kim et al. | Jan 2014 | A1 |
20140022858 | Chen et al. | Jan 2014 | A1 |
20140043888 | Chen et al. | Feb 2014 | A1 |
20140050004 | Mochida | Feb 2014 | A1 |
20140078841 | Chopra | Mar 2014 | A1 |
20140078842 | Oh et al. | Mar 2014 | A1 |
20140089576 | Bains et al. | Mar 2014 | A1 |
20140089758 | Kwok et al. | Mar 2014 | A1 |
20140095780 | Bains et al. | Apr 2014 | A1 |
20140095786 | Moon et al. | Apr 2014 | A1 |
20140119091 | You et al. | May 2014 | A1 |
20140143473 | Kim et al. | May 2014 | A1 |
20140156923 | Bains et al. | Jun 2014 | A1 |
20140169114 | Oh | Jun 2014 | A1 |
20140177370 | Halbert et al. | Jun 2014 | A1 |
20140181453 | Jayasena et al. | Jun 2014 | A1 |
20140185403 | Lai | Jul 2014 | A1 |
20140189228 | Greenfield et al. | Jul 2014 | A1 |
20140219042 | Yu et al. | Aug 2014 | A1 |
20140219043 | Jones et al. | Aug 2014 | A1 |
20140237307 | Kobla et al. | Aug 2014 | A1 |
20140241099 | Seo et al. | Aug 2014 | A1 |
20140254298 | Dally | Sep 2014 | A1 |
20140281206 | Crawford et al. | Sep 2014 | A1 |
20140281207 | Mandava et al. | Sep 2014 | A1 |
20140293725 | Best et al. | Oct 2014 | A1 |
20140321226 | Pyeon | Oct 2014 | A1 |
20150016203 | Sriramagiri et al. | Jan 2015 | A1 |
20150036445 | Yoshida et al. | Feb 2015 | A1 |
20150049566 | Lee et al. | Feb 2015 | A1 |
20150049567 | Chi | Feb 2015 | A1 |
20150055420 | Bell et al. | Feb 2015 | A1 |
20150078112 | Huang | Mar 2015 | A1 |
20150085564 | Yoon et al. | Mar 2015 | A1 |
20150089326 | Joo et al. | Mar 2015 | A1 |
20150092508 | Bains | Apr 2015 | A1 |
20150109871 | Bains et al. | Apr 2015 | A1 |
20150120999 | Kim et al. | Apr 2015 | A1 |
20150134897 | Sriramagiri et al. | May 2015 | A1 |
20150155025 | Lee et al. | Jun 2015 | A1 |
20150162064 | Oh et al. | Jun 2015 | A1 |
20150162067 | Kim et al. | Jun 2015 | A1 |
20150170728 | Jung et al. | Jun 2015 | A1 |
20150199126 | Jayasena et al. | Jul 2015 | A1 |
20150206572 | Lim et al. | Jul 2015 | A1 |
20150213872 | Mazumder et al. | Jul 2015 | A1 |
20150243339 | Bell et al. | Aug 2015 | A1 |
20150255140 | Song | Sep 2015 | A1 |
20150279441 | Greenberg et al. | Oct 2015 | A1 |
20150279442 | Hwang | Oct 2015 | A1 |
20150294711 | Gaither et al. | Oct 2015 | A1 |
20150340077 | Akamatsu | Nov 2015 | A1 |
20150356048 | King | Dec 2015 | A1 |
20150380073 | Joo et al. | Dec 2015 | A1 |
20160019940 | Jang et al. | Jan 2016 | A1 |
20160027498 | Ware et al. | Jan 2016 | A1 |
20160027531 | Jones et al. | Jan 2016 | A1 |
20160027532 | Kim | Jan 2016 | A1 |
20160042782 | Narui et al. | Feb 2016 | A1 |
20160070483 | Yoon et al. | Mar 2016 | A1 |
20160078846 | Liu et al. | Mar 2016 | A1 |
20160078911 | Fujiwara et al. | Mar 2016 | A1 |
20160086649 | Hong et al. | Mar 2016 | A1 |
20160093402 | Kitagawa et al. | Mar 2016 | A1 |
20160125931 | Doo et al. | May 2016 | A1 |
20160133314 | Hwang et al. | May 2016 | A1 |
20160155491 | Roberts et al. | Jun 2016 | A1 |
20160180917 | Chishti et al. | Jun 2016 | A1 |
20160180921 | Jeong | Jun 2016 | A1 |
20160196863 | Shin et al. | Jul 2016 | A1 |
20160202926 | Benedict | Jul 2016 | A1 |
20160224262 | Mandava et al. | Aug 2016 | A1 |
20160225433 | Bains et al. | Aug 2016 | A1 |
20160336060 | Shin | Nov 2016 | A1 |
20160343423 | Shido | Nov 2016 | A1 |
20170011792 | Oh et al. | Jan 2017 | A1 |
20170052722 | Ware et al. | Feb 2017 | A1 |
20170062038 | Doo et al. | Mar 2017 | A1 |
20170076779 | Bains et al. | Mar 2017 | A1 |
20170092350 | Halbert et al. | Mar 2017 | A1 |
20170110177 | Lee et al. | Apr 2017 | A1 |
20170111792 | Correia Fernandes et al. | Apr 2017 | A1 |
20170117030 | Fisch et al. | Apr 2017 | A1 |
20170133085 | Kim et al. | May 2017 | A1 |
20170133108 | Lee et al. | May 2017 | A1 |
20170140807 | Sun et al. | May 2017 | A1 |
20170140810 | Choi et al. | May 2017 | A1 |
20170140811 | Joo | May 2017 | A1 |
20170146598 | Kim et al. | May 2017 | A1 |
20170148504 | Saifuddin et al. | May 2017 | A1 |
20170177246 | Miller et al. | Jun 2017 | A1 |
20170186481 | Oh et al. | Jun 2017 | A1 |
20170213586 | Kang et al. | Jul 2017 | A1 |
20170221546 | Loh et al. | Aug 2017 | A1 |
20170263305 | Cho | Sep 2017 | A1 |
20170269861 | Lu et al. | Sep 2017 | A1 |
20170287547 | Ito et al. | Oct 2017 | A1 |
20170323675 | Jones et al. | Nov 2017 | A1 |
20170345482 | Balakrishnan | Nov 2017 | A1 |
20170352404 | Lee et al. | Dec 2017 | A1 |
20180005690 | Morgan et al. | Jan 2018 | A1 |
20180025770 | Ito et al. | Jan 2018 | A1 |
20180025772 | Lee et al. | Jan 2018 | A1 |
20180025773 | Bains et al. | Jan 2018 | A1 |
20180033479 | Lea et al. | Feb 2018 | A1 |
20180047110 | Blackman et al. | Feb 2018 | A1 |
20180061476 | Kim | Mar 2018 | A1 |
20180061483 | Morgan | Mar 2018 | A1 |
20180061485 | Joo | Mar 2018 | A1 |
20180075927 | Jeong et al. | Mar 2018 | A1 |
20180082736 | Jung | Mar 2018 | A1 |
20180082737 | Lee | Mar 2018 | A1 |
20180096719 | Tomishima et al. | Apr 2018 | A1 |
20180102776 | Chandrasekar et al. | Apr 2018 | A1 |
20180107417 | Shechter et al. | Apr 2018 | A1 |
20180108401 | Choi et al. | Apr 2018 | A1 |
20180114561 | Fisch et al. | Apr 2018 | A1 |
20180114565 | Lee | Apr 2018 | A1 |
20180122454 | Lee et al. | May 2018 | A1 |
20180130506 | Kang et al. | May 2018 | A1 |
20180137005 | Wu et al. | May 2018 | A1 |
20180158504 | Akamatsu | Jun 2018 | A1 |
20180158507 | Bang | Jun 2018 | A1 |
20180182445 | Lee et al. | Jun 2018 | A1 |
20180190340 | Kim et al. | Jul 2018 | A1 |
20180218767 | Wolff | Aug 2018 | A1 |
20180226119 | Kim et al. | Aug 2018 | A1 |
20180233197 | Laurent | Aug 2018 | A1 |
20180240511 | Yoshida et al. | Aug 2018 | A1 |
20180247876 | Kim et al. | Aug 2018 | A1 |
20180254078 | We et al. | Sep 2018 | A1 |
20180261268 | Hyun et al. | Sep 2018 | A1 |
20180276150 | Eckert et al. | Sep 2018 | A1 |
20180285007 | Franklin et al. | Oct 2018 | A1 |
20180294028 | Lee et al. | Oct 2018 | A1 |
20180308539 | Ito et al. | Oct 2018 | A1 |
20180341553 | Koudele et al. | Nov 2018 | A1 |
20190013059 | Akamatsu | Jan 2019 | A1 |
20190043558 | Suh et al. | Feb 2019 | A1 |
20190051344 | Bell et al. | Feb 2019 | A1 |
20190065087 | Li et al. | Feb 2019 | A1 |
20190066759 | Nale | Feb 2019 | A1 |
20190066766 | Lee | Feb 2019 | A1 |
20190088315 | Saenz et al. | Mar 2019 | A1 |
20190088316 | Inuzuka et al. | Mar 2019 | A1 |
20190103147 | Jones et al. | Apr 2019 | A1 |
20190115069 | Lai | Apr 2019 | A1 |
20190122723 | Ito et al. | Apr 2019 | A1 |
20190129651 | Wuu et al. | May 2019 | A1 |
20190130960 | Kim | May 2019 | A1 |
20190130961 | Bell et al. | May 2019 | A1 |
20190147964 | Yun et al. | May 2019 | A1 |
20190161341 | Howe | May 2019 | A1 |
20190190341 | Beisele et al. | Jun 2019 | A1 |
20190196730 | Imran | Jun 2019 | A1 |
20190198078 | Hoang et al. | Jun 2019 | A1 |
20190198099 | Mirichigni et al. | Jun 2019 | A1 |
20190205253 | Roberts | Jul 2019 | A1 |
20190228810 | Jones et al. | Jul 2019 | A1 |
20190228815 | Morohashi et al. | Jul 2019 | A1 |
20190237132 | Morohashi | Aug 2019 | A1 |
20190252020 | Rios et al. | Aug 2019 | A1 |
20190267077 | Ito et al. | Aug 2019 | A1 |
20190279706 | Kim | Sep 2019 | A1 |
20190294348 | Ware et al. | Sep 2019 | A1 |
20190333573 | Shin et al. | Oct 2019 | A1 |
20190347019 | Shin et al. | Nov 2019 | A1 |
20190348100 | Smith et al. | Nov 2019 | A1 |
20190348102 | Smith et al. | Nov 2019 | A1 |
20190348103 | Jeong et al. | Nov 2019 | A1 |
20190362774 | Kuramori et al. | Nov 2019 | A1 |
20190385661 | Koo et al. | Dec 2019 | A1 |
20190385667 | Morohashi et al. | Dec 2019 | A1 |
20190385668 | Fujioka et al. | Dec 2019 | A1 |
20190385670 | Notani et al. | Dec 2019 | A1 |
20190386557 | Wang et al. | Dec 2019 | A1 |
20190391760 | Miura et al. | Dec 2019 | A1 |
20190392886 | Cox et al. | Dec 2019 | A1 |
20200005857 | Ito et al. | Jan 2020 | A1 |
20200051616 | Cho | Feb 2020 | A1 |
20200075086 | Hou et al. | Mar 2020 | A1 |
20200082873 | Wolff | Mar 2020 | A1 |
20200126611 | Riho et al. | Apr 2020 | A1 |
20200135263 | Brown et al. | Apr 2020 | A1 |
20200143871 | Kim et al. | May 2020 | A1 |
20200176050 | Ito et al. | Jun 2020 | A1 |
20200185026 | Yun et al. | Jun 2020 | A1 |
20200194050 | Akamatsu | Jun 2020 | A1 |
20200194056 | Sakurai et al. | Jun 2020 | A1 |
20200202921 | Morohashi et al. | Jun 2020 | A1 |
20200210278 | Rooney et al. | Jul 2020 | A1 |
20200211632 | Noguchi | Jul 2020 | A1 |
20200211633 | Okuma | Jul 2020 | A1 |
20200211634 | Ishikawa et al. | Jul 2020 | A1 |
20200219555 | Rehmeyer | Jul 2020 | A1 |
20200219556 | Ishikawa et al. | Jul 2020 | A1 |
20200265888 | Ito et al. | Aug 2020 | A1 |
20200273517 | Yamamoto | Aug 2020 | A1 |
20200273518 | Raad et al. | Aug 2020 | A1 |
20200279599 | Ware et al. | Sep 2020 | A1 |
20200294569 | Wu et al. | Sep 2020 | A1 |
20200294576 | Brown et al. | Sep 2020 | A1 |
20200321049 | Meier et al. | Oct 2020 | A1 |
20200381040 | Penney et al. | Dec 2020 | A1 |
20200388324 | Rehmeyer et al. | Dec 2020 | A1 |
20200388325 | Cowles et al. | Dec 2020 | A1 |
20200395063 | Rehmeyer | Dec 2020 | A1 |
20210057021 | Wu et al. | Feb 2021 | A1 |
20210057022 | Jenkinson et al. | Feb 2021 | A1 |
20210109577 | Mandava | Apr 2021 | A1 |
20210118491 | Li et al. | Apr 2021 | A1 |
20210166752 | Noguchi | Jun 2021 | A1 |
20210183433 | Jenkinson et al. | Jun 2021 | A1 |
20210183435 | Meier et al. | Jun 2021 | A1 |
20210225431 | Rehmeyer et al. | Jul 2021 | A1 |
20210304813 | Cowles et al. | Sep 2021 | A1 |
20210335411 | Wu et al. | Oct 2021 | A1 |
20210350844 | Morohashi et al. | Nov 2021 | A1 |
20210406170 | Jung et al. | Dec 2021 | A1 |
20220059153 | Zhang et al. | Feb 2022 | A1 |
20220059158 | Wu et al. | Feb 2022 | A1 |
20220091784 | Brandl | Mar 2022 | A1 |
20220093165 | Mitsubori et al. | Mar 2022 | A1 |
20220165328 | Ishikawa et al. | May 2022 | A1 |
20220189537 | Kim | Jun 2022 | A1 |
20220189539 | Li et al. | Jun 2022 | A1 |
20220199144 | Roberts | Jun 2022 | A1 |
20220270670 | Wu et al. | Aug 2022 | A1 |
20230105151 | Brown et al. | Apr 2023 | A1 |
20230352076 | He et al. | Nov 2023 | A1 |
20240062798 | Cowles et al. | Feb 2024 | A1 |
20240071460 | Noguchi | Feb 2024 | A1 |
Number | Date | Country |
---|---|---|
825677 | Aug 1975 | BE |
1841551 | Oct 2006 | CN |
1879173 | Dec 2006 | CN |
101026003 | Aug 2007 | CN |
101038785 | Sep 2007 | CN |
101047025 | Oct 2007 | CN |
101067972 | Nov 2007 | CN |
101211653 | Jul 2008 | CN |
101243450 | Aug 2008 | CN |
102301423 | Dec 2011 | CN |
102663155 | Sep 2012 | CN |
102931187 | Feb 2013 | CN |
104350546 | Feb 2015 | CN |
104733035 | Jun 2015 | CN |
104737234 | Jun 2015 | CN |
104781885 | Jul 2015 | CN |
104981874 | Oct 2015 | CN |
105378847 | Mar 2016 | CN |
105529047 | Apr 2016 | CN |
106710621 | May 2017 | CN |
107025927 | Aug 2017 | CN |
107871516 | Apr 2018 | CN |
107919150 | Apr 2018 | CN |
108154895 | Jun 2018 | CN |
108242248 | Jul 2018 | CN |
109949844 | Jun 2019 | CN |
110520929 | Nov 2019 | CN |
114121076 | Mar 2022 | CN |
S6282887 | Apr 1987 | JP |
2005-216429 | Aug 2005 | JP |
2011-258259 | Dec 2011 | JP |
4911510 | Jan 2012 | JP |
2013-004158 | Jan 2013 | JP |
6281030 | Jan 2018 | JP |
20030063947 | Jul 2003 | KR |
20070109104 | Nov 2007 | KR |
20160134411 | Nov 2016 | KR |
20170053373 | May 2017 | KR |
20170093053 | Aug 2017 | KR |
20180011642 | Feb 2018 | KR |
20180101647 | Sep 2018 | KR |
20190046572 | May 2019 | KR |
201801079 | Jan 2018 | TW |
2014120477 | Aug 2014 | WO |
2015030991 | Mar 2015 | WO |
2017171927 | Oct 2017 | WO |
2019222960 | Nov 2019 | WO |
2020010010 | Jan 2020 | WO |
2020117686 | Jun 2020 | WO |
2020247163 | Dec 2020 | WO |
2020247639 | Dec 2020 | WO |
Entry |
---|
Kyungbae Park et al. “Experiments an Droot Cause Analysis for Active-Precharge Hammering Fault in DDR3 SDRAM Under 3XNM Technology”; Microelectronics Reliability:An Internet.Journaland World Abstracting Service; vol. 57, Dec. 23, 2015;pp. 39-46. |
Kyungbae Park et al.“Experiments and root cause analysis for acitve-precharge hammering fault in Ddr# Sdram under 3Xnm technology”, Microelectronics Reliability 57 : Sep. 14, 2015, pp. 39-46. |
U.S. Appl. No. 17/731,529, titled “Apparatuses and Methods for Access Based Refresh Operations”; filed Apr. 28, 2022; pp. all pages of the application as filed. |
International Application No. PCT/US20/23689, titled “Semiconductor Device Having Cam That Stores Address Signals”, dated Mar. 19, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/797,658, titles “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 21, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/818,981 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Mar. 13, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/824,460, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 19, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/025,844, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, filed Jul. 2, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/783,063, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, dated Feb. 5, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/805,197, titled “Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device”, dated Feb. 28, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/232,837, titled “Apparatuses and Methods for Distributed Targeted Refresh Operations”, filed Dec. 26, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/818,989, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 13, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/268,818, titled “Apparatuses and Methods for Managing Row Access Counts”, filed Feb. 6, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/286,187 titled “Apparatuses and Methods for Memory Mat Refresh Sequencing” filed on Feb. 26, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/084,119, titled “Apparatuses and Methods for Pure-Time, Self Adopt Sampling for Row Hammer Refresh Sampling”, filed Sep. 11, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/886,284 titled “Apparatuses and Methods for Access Based Refresh Timing” filed May 28, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/886,284, titled “Apparatuses and Methods for Access Based Refresh Timing”, dated May 28, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/358,587, titled “Semiconductor Device Having Cam That Stores Address Signals”, dated Mar. 19, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/375,716 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed on Apr. 4, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/411,573 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed May 14, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/428,625 titled “Apparatuses and Methods for Tracking Victim Rows” filed May 31, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/432,604 titled “Apparatuses and Methods for Staggered Timing of Skipped Refresh Operations” filed Jun. 5, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 17/008,396 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Aug. 31, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/513,400 titled “Apparatuses and Methods for Tracking Row Accesses” filed Jul. 16, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/548,027 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Aug. 22, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/549,942 titled “Apparatuses and Methods for Lossy Row Access Counting” filed Aug. 23, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/546,152 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Aug. 20, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/549,411 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Aug. 23, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/655,110 titled “Apparatuses and Methods for Dynamic Targeted Refresh Steals” filed Oct. 16, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 17/186,913 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Feb. 26, 2021, pp. al pages of application as filed. |
U.S. Appl. No. 17/187,002 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Feb. 26, 2021, pp. al pages of application as filed. |
U.S. Appl. No. 17/347,957 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 15, 2021, pp. al pages of application as filed. |
International Application No. PCT/US19/40169 titled “Apparatus and Methods for Triggering Row Hammer Address Sampling” filed Jul. 1, 2019, pp. al pages of application as filed. |
International Application No. PCT/US19/64028, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Dec. 2, 2019, pp. al pages of application as filed. |
International Application No. PCT/US20/26689, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations”, dated Apr. 3, 2020, pp. al pages of application as filed. |
PCT Application No. PCT/US20/32931, titled “Apparatuses and Methods for Controlling Steal Rates”, dated May 14, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/788,657, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Feb. 12, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 17/324,621 titled “Apparatuses and Methods for Pure-Time, Self-Adopt Sampling for Row Hammer Refresh Sampling” filed May 19, 2021, pp. al pages of application as filed. |
U.S. Appl. No. 15/881,256 entitled ‘Apparatuses and Methods for Detecting a Row Hammer Attack With a Bandpass Filter’ filed on Jan. 26, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 17/662,733, titled “Apparatuses, Systems, and Methods for Identifying Victim Rows in a Memorydevice Which Cannot Be Simultaneously Refreshed” filed May 10, 2022, pp. al pages of application as filed. |
U.S. Appl. No. 16/425,525 titled “Apparatuses and Methods for Tracking All Row Accesses” filed May 29, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/427,105 titled “Apparatuses and Methods for Priority Targeted Refresh Operations” filed May 30, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/427,140 titled “Apparatuses and Methods for Tracking Row Access Counts Between Multiple Register Stacks” filed May 30, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/437,811 titled “Apparatuses, Systems, and Methods for Determining Extremum Numerical Values” filed Jun. 11, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/537,981 titled “Apparatuses and Methods for Controlling Targeted Refresh Rates” filed Aug. 12, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/994,338 titled “Apparatuses, Systems, and Methods for Memory Directed Access Pause” filed Aug. 14, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/997,766 titled “Refresh Logic Circuit Layouts Thereof” filed Aug. 19, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 16/997,659 titled “Apparatuses, Systems, and Methods for Refresh Modes” filed Aug. 19, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 17/095,978 titled “Apparatuses and Methods for Controlling Refresh Timing” filed Nov. 12, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 17/127,654 titled “Apparatuses and Methods for Row Hammer Based Cache Lockdown” filed Dec. 18, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 17/175,485 titled “Apparatuses and Methods for Distributed Targeted Refresh Operations” filed Feb. 12, 2021, pp. al pages of application as filed. |
U.S. Appl. No. 15/789,897, entitled “Apparatus and Methods for Refreshing Memory”, filed Oct. 20, 2017, pp. al pages of application as filed. |
U.S. Appl. No. 15/796,340, entitled: “Apparatus and Methods for Refreshing Memory” filed on Oct. 27, 2017, pp. al pages of application as filed. |
U.S. Appl. No. 16/012,679, titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences”, filed Jun. 19, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/020,863, titled “Semiconductor Device”, filed Jun. 27, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/112,471 titled “Apparatuses and Methods for Controlling Refresh Operations” filed Aug. 24, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/160,801, titled “Apparatuses and Methods for Selective Row Refreshes” filed on Oct. 15, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/176,932, titled “Apparatuses and Methods for Access Based Refresh Timing”, filed Oct. 31, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/208,217, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Dec. 3, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/230,300, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Dec. 21, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/231,327 titled “Apparatuses and Methods for Selective Row Refreshes”, filed on Dec. 21, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/237,291, titled “Apparatus and Methods for Refreshing Memory”, filed Dec. 31, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/290,730, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 1, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/374,623, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Apr. 3, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/411,698 title “Semiconductor Device” filed May 14, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/427,330 titled “Apparatuses and Methods for Storing Victim Row Data” filed May 30, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/431,641 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 4, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 16/682,606, titled “Apparatuses and Methods for Distributing Row Hammer Refresh Events Across a Memory Device ”, filed Nov. 13, 2019, pp. al pages of application as filed. |
U.S. Appl. No. 17/654,035, titled “Apparatuses and Methods for Dynamic Targeted Refresh Steals”, filed Mar. 8, 2022; pp. all pages of application as filed. |
U.S. Appl. No. 15/876,566 entitled ‘Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device’ filed on Jan. 22, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 15/656,084, titled “Apparatuses and Methods for Targeted Refreshing of Memory” filed Jul. 21, 20217, pp. al pages of application as filed. |
U.S. Appl. No. 17/226,975, titled “Apparatuses and Methods for Staggered Timing of Skipped Refresh Operations” filed Apr. 9, 2021, pp. al pages of application as filed. |
U.S. Appl. No. 16/459,520 titled “Apparatuses and Methods for Monitoring Word Line Accesses”, filed Jul. 1, 2019, pp. al pages of application as filed. |
PCT Application No. PCT/US18/55821 “Apparatus and Methods for Refreshing Memory” filed Oct. 15, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 15/715,846, entitled “Semiconductor Device”, filed Sep. 26, 2017, pp. al pages of application as filed. |
U.S. Appl. No. 15/888,993, entitled “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 5, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 16/190,627 titled “Apparatuses and Methods for Targeted Refreshing of Memory” filed Nov. 14, 2018, pp. al pages of application as filed. |
U.S. Appl. No. 17/030,018, titled “Apparatuses and Methods for Controlling Refresh Operations”, filed Sep. 23, 2020, pp. al pages of application as filed. |
U.S. Appl. No. 15/281,818, entitled: “Semiconductor Device” filed on Sep. 30, 2016, pp. al pages of application as filed. |
Kim, et al., “Flipping Bits in Memory Without Accessing Them: An Experimental Study of DRAM Disturbance Errors”, IEEE, Jun. 2014, 12 pgs. |
U.S. Appl. No. 18/064,773, filed Dec. 12, 2022, titled, “Apparatuses and Methods for Access Based Refresh Timing,” pp. all pages of application as filed. |
Anonymous: “Frequency—Wikipedia”, Dec. 17, 2018, retrieved from URL: https://en.wikipedia.org/w/index.php?title=Frequency&oldid=874192848; pp. all. |
U.S. Appl. No. 18/746,551 titled “Apparatuses and Methods for Direct Refresh Management Attack Identification” filed Jun. 18, 2024, pp. all pages of the application as filed. |
U.S. Appl. No. 18/747,740, titled “Apparatuses and Methods Refresh Rate Register Adjustment Based On Refresh Queue” filed Jun. 19, 2024, pp. all pages of application as filed. |
U.S. Appl. No. 18/774,730 titled “Apparatuses and Methods for Controller Signaling of Refresh Operations” filed Jul. 16, 2024, pp. all pages of the application as filed. |
Number | Date | Country | |
---|---|---|---|
20230352076 A1 | Nov 2023 | US |