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 device as a physical signal (e.g., a charge on a capacitive element). The memory device may include a volatile memory, and the physical signal may decay over time (which may degrade or destroy the information stored in the memory cells). It may be necessary to periodically refresh the information in the memory cells by, for example, rewriting the information to restore the physical signal to an initial value. This periodic refreshing of the memory cells may be referred to as auto-refresh operations.
As memory components have decreased in size, the density of memory cells has greatly increased. Repeated access to a particular memory cell or group of memory cells (often referred to as a ‘row hammer’) may cause an increased rate of data degradation in nearby memory cells, for example, those located at word lines adjacent to the accessed word line. Memory cells affected by the row hammer effect may be identified and refreshed as part of a targeted refresh operation performed by the memory device, also referred to as a row hammer refresh (RHR) operation. These targeted refresh operations may take the place of (e.g., steal) time slots which would otherwise be used for an auto-refresh operation.
To perform RHR operations, addresses of word lines may be stored in an address storing circuit and one of the addresses is provided from the address storing circuit at a time of the row hammer refresh operation to generate one or more refresh addresses. However, if the address is not provided from the address storing circuit in time, the RHR operation may not be performed properly and/or the RHR operation may be delayed (e.g., delayed until the next steal time slot).
Various embodiments of the present disclosure will be explained below in detail with reference to the accompanying drawings. The following detailed description refers to the accompanying drawings that show, by way of illustration, specific aspects and embodiments of the disclosure. The detailed description includes sufficient detail to enable those skilled in the art to practice the embodiments of the disclosure. Other embodiments may be utilized, and structural, logical and electrical changes may be made without departing from the scope of the present disclosure. The various embodiments disclosed herein are not necessary mutually exclusive, as some disclosed embodiments can be combined with one or more other disclosed embodiments to form new embodiments.
Information in a volatile memory device may be stored in memory cells (e.g., as a charge on a capacitive element), but may decay over time. In order to prevent information from being lost or corrupted due to this decay, the memory may carry out a refresh process, such as refresh operations as part of a refresh mode. The memory cells may be organized into rows (word lines) and columns (bit lines), and the memory cells may be refreshed on a row-by-row basis. During a refresh operation, information may be rewritten to the word line to restore its initial state. Auto-refresh operations may be performed on the word lines of the memory in a sequence such that over time each of the word lines of the memory are refreshed at a rate faster than the expected rate of data degradation.
Repeated access to a particular word line of memory (e.g., an aggressor row) may cause an increased rate of decay in word lines (e.g., victim rows) which are close to the aggressor row. These repeated accesses may be part of a deliberate attack against the memory and/or may be due to ‘natural’ access patterns of the memory. The increased rate of decay in the victim rows may require that they be refreshed as part of a targeted refresh operation, also referred to as a row hammer refresh (RHR) operation. The memory device may periodically perform targeted refresh operations as part of the refresh mode. For example, when the memory device is in a refresh mode it may perform a set of refresh operations including a number of auto-refresh operations, and a number of RHR operations and then repeat this cycle. In some embodiments, the RHR operations may ‘steal’ timeslots which would otherwise be used for auto-refresh operations. A memory device may generally cycle between performing access operations for a period of time, entering a refresh mode for a period of time, performing access operations and so forth.
In some applications, some or all of the addresses of word lines accessed may be monitored. For example, the addresses of accessed word lines may be stored in an address storing circuit. The number of times the word lines are accessed may also be monitored. For example, each address stored in the address storing circuit may be associated with a counter that keeps track of the number of times the word line associated with the address is accessed. When an RHR operation is performed, one or more addresses of word lines at which accesses are concentrated (e.g., the word lines accessed the most, an aggressor row) may be provided from the address storing circuit to generate one or more refresh addresses (e.g., the addresses associated with victim word lines to be refreshed during the RHR operation).
In order to provide the address of a word line at which accesses are concentrated, the address associated with a counter having the highest count value is determined. Typically, the determination is triggered by the initiation of the RHR operation (e.g., activation of RHR signal). However, the determination of the counter with the highest count value may take some period of time. If the determination is initiated too late and/or takes too long to complete, an address may not be provided from the address storing circuit in time for refresh addresses to be generated for refreshing the associated word lines by the RHR operation. If the address is not provided from the address storing circuit in time, the RHR operation may not be performed properly and/or the RHR operation on the word lines may be delayed (e.g., delayed until the next steal time slot).
According to embodiments of the present disclosure, determination of a counter circuit of an address storing circuit with a highest count value may be initiated by a signal (or a transition of the signal) preceding a RHR operation. For example, a command may be used to initiate the determination prior to the RHR operation. This may permit additional time prior to the RHR operation for the determination of the counter with the highest count value, providing an address associated with the counter, and generating one or more refresh addresses from the address. The additional time may reduce or eliminate the risk that refresh addresses will not be available for the RHR operation. In some embodiments of the disclosure, a precharge command preceding a RHR operation may initiate determination of a counter circuit of an address storing circuit with a highest count value.
As used herein, an activation of a signal may refer to any portion of a signal's waveform that a circuit responds to. For example, if a circuit responds to a rising edge, then a signal switching from a low level to a high level may be an activation. One example type of activation is a pulse, where a signal switches from a low level to a high level for a period of time, and then back to the low level. This may trigger circuits which respond to rising edges, falling edges, and/or signals being at a high logical level.
Multiple external terminals included in the semiconductor device 10 include command address terminals 21, clock terminals 22, data terminals 23, and power-supply terminals 24 and 25. The data terminals 23 are connected to an I/O circuit 16.
A command address signal CA is supplied to the command address terminals 21. One of the command address signals CA supplied to the command address terminals 21, which relates to an address, is transferred to an address decoder 32 via a command address input circuit 31. Another one that relates to a command is transferred to a command control circuit 33 via the command address input circuit 31. The address decoder 32 decodes an address signal and generates a row address XADD and a column address YADD. The row address XADD is supplied to the row address control circuit 12, and the column address YADD is supplied to the column decoder 13. Further, a command address signal CA that functions as a clock enable signal CKE is supplied to an internal clock generator 35.
Complementary external clock signals CK_t and CK_c are supplied to the clock terminals 22. The complementary external clock signals CK_t and CK_c are input to a clock input circuit 34. The clock input circuit 34 generates an internal clock signal ICLK based on the complementary external clock signals CK_t and CK_c. The internal clock signal ICLK is supplied to at least the command control circuit 33 and the internal clock generator 35. The internal clock generator 35 is activated by the clock enable signal CKE, for example, and generates an internal clock signal LCLK based on the internal clock signal ICLK. The internal clock signal LCLK is supplied to the I/O circuit 16. The internal clock signal LCLK is used as a timing signal that defines a timing at which read data DQ is output from the data terminal 23 at the time of a read operation. In a write operation, write data is input to the data terminal 23 from outside. In the write operation, a data mask signal DM may be input to the data terminal 23 from outside.
Power-supply potentials VDD and VSS are supplied to the power-supply terminals 24. These power-supply potentials VDD and VSS are supplied to a voltage generator 36. The voltage generator 36 generates various internal potentials VPP, VOD, VARY, and VPERI, for example, based on the power-supply potentials VDD and VSS. The internal potential VPP is used mainly in the row address control circuit 12. The internal potentials VOD and VARY are used mainly in the sense amplifier 14 included in the memory cell array 11. The internal potential VPERI is used in many other circuit blocks.
Power-supply potentials VDDQ and VSSQ are supplied to the I/O circuit 16 from the power-supply terminals 25. Although the power-supply potentials VDDQ and VSSQ may be the same potentials as the power-supply potentials VDD and VSS supplied to the power supply terminals 24, respectively, the dedicated power-supply potentials VDDQ and VSSQ are assigned to the I/O circuit 16 in order to prevent propagation of power-supply noise generated in the I/O circuit 16 to another circuit block.
The command control circuit 33 may provide one or more internal signals, responsive, at least in part, to external commands received via the command address input circuit 31. For example, the command control circuit 33 may provide an activation/precharge signal ACT/PRE, a refresh signal AREF, and/or a column selection signal CYE. When a read command is issued from outside, following the activation command, the command control circuit 33 activates a column selection signal CYE. The column selection signal CYE is supplied to the column decoder 13. In response to this signal, read data is read out from the memory cell array 11. The read data read from the memory cell array 11 is transferred to the I/O circuit 16 via a read-write amplifier 17 and an FIFO circuit 18, and is output to outside via the data terminals 23.
The command control circuit 33 activates an activation signal ACT when an activation command is issued, and activates a refresh signal AREF when a refresh command is issued. The activation signal ACT and the refresh signal AREF are both supplied to the row address control circuit 12. The row address control circuit 12 includes a refresh control circuit 40. The refresh control circuit 40 controls a refresh operation for the memory cell array 11 based on the row address XADD, the activation signal ACT, and the refresh signal AREF.
In some embodiments, the refresh signal AREF may be a pulse signal which is activated when the command control circuit 33 receives a signal which indicates entry to the self-refresh mode. The refresh signal AREF may be activated once immediately after command input, and thereafter may be cyclically activated at desired internal timing. The refresh signal AREF may be used to control the timing of refresh operations during the refresh mode. A self-refresh exit command may cause the automatic activation of the refresh signal AREF to stop and may cause the device 10 to return to an idle state and/or resume other operations.
The refresh signal AREF is supplied to the refresh control circuit 40. The refresh control circuit 40 supplies a refresh row address and the row address control circuit 12 may refresh one or more word lines WL indicated by the refresh row address. In some embodiments, the refresh address may represent a single word line. In some embodiments, the refresh address may represent multiple word lines, which may be refreshed sequentially or simultaneously by the row address control circuit 12. In some embodiments, the number of word lines represented by the refresh address may vary from one refresh address to another. The refresh control circuit 40 may control a timing of the refresh operation, and may generate and provide the refresh address. The refresh control circuit 40 may be controlled to change details of the refreshing address RXADD (e.g., how the refresh address is calculated, the timing of the refresh addresses, the number of word lines represented by the address), or may operate based on internal logic.
The refresh control circuit 40 may selectively output a targeted refresh (e.g., RHR) address, which may specifies one or more victim address based on an aggressor row address, or an automatic refresh address (e.g., from a sequence of auto-refresh addresses) as the refresh address. Based on the type of refresh address, the row address control circuit 12 may perform a targeted refresh or auto-refresh operation. The automatic refresh addresses may be from a sequence of addresses which are provided based on activations of the refresh signal AREF. The refresh control circuit 40 may cycle through the sequence of auto-refresh addresses at a rate determined by AREF. In some embodiments, the auto-refresh operations may generally occur with a timing such that the sequence of auto-refresh addresses is cycled such that no information is expected to degrade in the time between auto-refresh operations for a given word line. In other words, auto-refresh operations may be performed such that each word line is refreshed at a rate faster than the expected rate of information decay.
The refresh control circuit 40 may also determine targeted refresh addresses which are addresses that require refreshing (e.g., victim addresses corresponding to victim rows) based on the access pattern of nearby addresses (e.g., aggressor addresses corresponding to aggressor rows) in the memory cell array 11. The refresh control circuit 40 may use one or more signals of the device 10 to calculate the targeted refresh address. For example, the refresh address may be a calculated based on the row addresses XADD provided by the address decoder 32.
In some embodiments, the refresh control circuit 40 may sample the current value of the row address XADD provided by the address decoder 32, and determine a targeted refresh address based on one or more of the sampled addresses. The sampled addresses may be stored in an address storing circuit of the refresh control circuit 40. When a row address XADD is sampled, it may be compared to the stored addresses in the address storing circuit. In some embodiments, an aggressor address may be determined based on the sampled and/or stored addresses. For example, the comparison between the sampled address and the stored addresses may be used to update a count value (e.g., an access count) in a counter circuit associated with the stored addresses. The aggressor address may be calculated based on the count values stored in the counter circuits. The refresh addresses may then be generated based on the aggressor addresses.
While in general the present disclosure refers to determining aggressor and victim word lines and addresses, it should be understood that as used herein, an aggressor word line does not necessarily need to cause data degradation in neighboring word lines, and a victim word line does not necessarily need to be subject to such degradation. The refresh control circuit 40 may use some criteria to judge whether an address is an aggressor address, which may capture potential aggressor addresses rather than definitively determining which addresses are causing data degradation in nearby victims. For example, the refresh control circuit 40 may determine potential aggressor addresses based on a pattern of accesses to the addresses and this criteria may include some addresses which are not aggressors, and miss some addresses which are. Similarly, victim addresses may be determined based on which word lines are expected to be affected by aggressors, rather than a definitive determination of which word lines are undergoing an increased rate of data decay.
The refresh address may be provided with a timing based on a timing of the refresh signal AREF. During the periodic refresh operations of a refresh mode, the refresh control circuit 40 may have time slots corresponding to the timing of AREF, and may provide one or more refresh addresses during each time slot. In some embodiments, the targeted refresh/RHR address may be issued in (e.g., “steal”) a time slot which would otherwise have been assigned to an auto-refresh address. In some embodiments, certain time slots may be reserved for targeted refresh addresses, and the refresh control circuit 40 may determine whether to provide a targeted refresh address, not provide an address during that time slot, or provide an auto-refresh address instead during the time slot.
In some embodiments, some or all of the calculations and/or other operations for determining the aggressor address for generating the refresh addresses may be performed each time a row address is sampled by the refresh control circuit 40. In some embodiments some or all of the calculations and/or other operation for determining the aggressor address may be performed each time a targeted/RHR address is to be issued for a RHR operation. In some embodiments, determining the aggressor address may be performed responsive, at least in part, to one or more signals, such as the ACT/PRE and/or AREF signals provided by the command control circuit 33. In some embodiments, determining a counter circuit having a highest count value may be initiated, at least in part, by a precharge signal PRE preceding a RHR operation.
As shown in
The sampling circuit 43 samples the row address XADD at a timing when a sampling signal SMP generated by the ARM sample generator 42 is activated, and supplies the sampled row address XADD to the row hammer address storing circuit 44. The ARM sample generator 42 may activate the sampling signal SMP at a timing when the activation signal ACT is activated for a predetermined number of times. In some embodiments, the ARM sample generator 42 may further generate an operation timing control signal ArmSample, which may also be referred to as a sampling signal. The ArmSample signal may control when one or more operations are performed by the row hammer address storing circuit 44. In some embodiments, the ArmSample signal may be a pulse signal. In some embodiments, the ArmSample signal may be activated multiple times during an activation period (e.g., a period during which the activation signal ACT is active or a period between an activation command and a precharge command). For example, multiple pulses of the ArmSample signal may be provided to the row hammer address storing circuit 44 during the activation period. In some embodiments, the active ArmSample signal may be provided when the activation signal is active and the sampling signal SMP is also activated.
The row hammer address storing circuit 44 stores multiple row addresses. One or more of the row addresses stored in the row hammer address storing circuit 44 are supplied to the address convertor 45 via an address bus as the row address VADD. The address VADD provided from the row hammer address storing circuit 44 may correspond to a word line WL at which accesses are concentrated, for example, a row address associated with a highest count value of the multiple of row addresses stored in the row hammer address storing circuit 44. As will be described in more detail with reference to
The Min/Max Sel signal may be provided by a min/max control logic circuit 38. The min/max control logic circuit 38 may receive the activation/precharge ACT/PRE signal and the refresh signal AREF. As will be described in more detail with reference to
The address convertor 45 converts the row addresses VADD to generate row hammer refresh addresses (collectively referred to as RHR ADD). The RHR ADD may include, for example, +1ADD, −1ADD, +2ADD, and −2ADD. The row hammer refresh addresses +1ADD and −1ADD are addresses of word lines WL adjacent (e.g., on both sides) to the word line WL having the row address VADD assigned thereto. The row hammer refresh addresses +2ADD and −2ADD are addresses of word lines WL two lines away from the word line WL having the row address VADD assigned thereto. For example, when word lines WL1 to WL5 are arranged in the order as shown in
The refresh control circuit 40 further includes a counter circuit 47, a comparing circuit 48, and a refresh state circuit 49. The counter circuit 47 increments or decrements a count value CV in response to the internal refresh signal IREF. The comparing circuit 48 receives the count value CV and activates a refresh state signal RHR State each time the count value CV reaches a predetermined value. The predetermined value can be changed with a mode signal MODE. Therefore, it suffices to set the predetermined value to a small value with the mode signal MODE when the frequency of the targeted refresh/RHR operations is to be increased, and set the predetermined value to a large value with the mode signal MODE when the frequency of the row hammer refresh operations is to be decreased. The refresh counter 41 may temporarily stop an update operation of the counter refresh address NRADD when the refresh state signal RHR State is activated.
The refresh state signal RHR State is supplied to the refresh state circuit 49. The refresh state circuit 49 generates refresh selection signals NR, RHR1, and RHR2 on the basis of the internal refresh signal IREF and the refresh state signal RHR State.
The refresh state circuit 49 activates the refresh selection signal NR when the refresh state signal RHR State is in an inactive state. The refresh selection signal NR is a signal activated when a refresh operation is to be performed for the counter refresh address NRADD. In a case where the refresh selection signal NR is activated, the refresh address selector 46 selects the counter refresh address NRADD output from the refresh counter 41 and outputs the counter refresh address NRADD as a refresh address REFADD. When the refresh state signal RHR State is in an active state, the refresh state circuit 49 activates the refresh selection signal RHR1 or RHR2. The refresh selection signal RHR1 is a signal activated when the row hammer refresh operation is to be performed on the word lines adjacent the word line at which accesses are concentrated (e.g., performed on word lines WL2 and WL4 for concentrated accesses to word line WL3). In a case where the refresh selection signal RHR1 is activated, the refresh address selector 46 selects the row hammer refresh addresses +1 ADD and −1ADD output from the address convertor 45 and outputs the row hammer refresh addresses +1ADD and −1ADD as the refresh addresses REFADD. The refresh selection signal RHR1 is supplied also to the row hammer address storing circuit 44. The refresh selection signal RHR2 is a signal activated when the row hammer refresh operation is to be performed on the word lines two word lines away from the word line at which accesses are concentrated (e.g., performed on word lines WL1 and WL5 for concentrated accesses to word line WL3). In a case where the refresh selection signal RHR2 is activated, the refresh address selector 46 selects the row hammer refresh addresses +2ADD and −2ADD output from the address convertor 45 and outputs the row hammer refresh addresses +2ADD and −2ADD as the refresh addresses REFADD.
Although shown as part of the refresh control circuit 40, in some embodiments, the min/max control logic circuit 38, the counter circuit 47, and/or comparing circuit 48 may be included in another component of the device 10, for example, command control circuit 33.
As shown in
The address comparing circuit 70 compares the input row address XADD with each of the row addresses XADD stored in the address registers 50 to 57. When the input row address XADD matches with any of the row addresses XADD stored in the address registers 50 to 57, the address comparing circuit 70 activates a corresponding one of hit signals HIT0 to HIT7. When any of the hit signals HIT0 to HIT7 is activated, the storage control circuit 80 increments the count value of a corresponding one of the counter circuits 60 to 67. Therefore, the count values of the counter circuits 60 to 67 indicate the numbers of times when the row addresses XADD stored in the address registers 50 to 57 are sampled by the sampling circuit 43, respectively.
The count comparing circuit 90 compares the count values stored in the counter circuits 60 to 67 and determines which of the counter circuits 60 to 67 includes a highest count value and/or determines which of the counter circuits 60 to 67 includes a lowest count value. In some embodiments, the comparing circuit 90 may include one or more comparator circuits (not shown) which may perform one or more operations to compare the count values stored in two or more of the counter circuits 60 to 67 to determine which of the counter circuits 60 to 67 includes the highest and/or lowest count value. Which of the counter circuits 60 to 67 includes the highest and/or lowest count value may be provided to the storage control circuit 80. The storage control circuit 80 includes a minimum pointer 81 that indicates one of the counter circuits 60 to 67 having the lowest count value determined by the count comparing circuit 90, and a maximum pointer 82 that indicates one of the counter circuits 60 to 67 having the highest count value determined by the count comparing circuit 90.
The count comparing circuit 90 may receive minimum/maximum calculation selection signal Min/Max Sel and operation timing control/sampling signal ArmSample. The Min/Max Sel signal may be provided by min/max control logic circuit 38 and the ArmSample signal may be provided by Arm sample generator 42 in some embodiments. The Min/Max Sel signal may determine whether the count comparing circuit 90 determines which of the counter circuits 60 to 67 includes the highest count value or which of the counter circuits 60 to 67 includes the lowest count value. The ArmSample signal may determine, at least in part, when the count comparing circuit 90 makes the lowest count value determination (e.g., determines when the count comparing circuit 90 initiates one or more operations to make the determination). In some embodiments, the count comparing circuit 90 may determine which counter circuit 60 to 67 includes the lowest count value responsive to an active ArmSample signal. In some embodiments, the count comparing circuit 90 may determine which counter circuit 60 to 67 includes the lowest count value responsive, at least in part, to the Min/Max Sel signal transitioning from a state indicating the highest count value should be determined (e.g., a high state) to a state indicating the lowest count value should be determined (e.g., a low state). In some embodiments, the count comparing circuit 90 may determine which counter circuit 60 to 67 includes the highest count value responsive, at least in part, to the Min/Max Sel signal transitioning from a state indicating the lowest count value should be determined (e.g., a low state) to a state indicating the highest count value should be determined (e.g., a high state). In other words, either or both of the ArmSample signal and the Min/Max Sel signal may cause the count comparing circuit 90 to initiate one or more operations to determine the counter circuit associated with the highest and/or lowest count value.
Returning to the address comparing circuit 70, when none of the hit signals HIT0 to HIT7 is activated, that is, when the input row address XADD does not match with any of the row addresses XADD respectively stored in the address registers 50 to 57, the storage control circuit 80 resets one of the counter circuits 60 to 67 indicated by the minimum pointer 81 to an initial value and supplies a point number MIN to the address registers 50 to 57. Accordingly, the input row address XADD is overwritten in one of the address registers 50 to 57 indicated by the point value MIN. In this way, when the input row address XADD does not match with any of the row addresses XADD respectively stored in the address registers 50 to 57, the value of one of the address registers 50 to 57 storing the row address XADD that is least frequently accessed is overwritten.
One of the row addresses XADD stored in the address registers 50 to 57 is output as the row address VADD in response to the refresh selection signal RHR1. When the refresh selection signal RHR1 is activated, a point value MAX indicated by the maximum pointer 82 is selected. One of the address registers 50 to 57 is selected by the point value MAX and the row address XADD stored in the selected one of the address registers 50 to 57 is output as the row address VADD. The value of one of the counter circuits 60 to 67 corresponding to the point value MAX is reset to an initial value.
In some embodiments, in addition to controlling the timing of operations performed by the count comparing circuit 90, the ArmSample signal may control timing of operations performed by the address comparing circuit 70 and/or storage control circuit 80. In some embodiments, the address comparing circuit 70 may compare the input row address XADD and provide a hit signal (if a match) responsive, at least in part, to activation of the ArmSample signal. In some embodiments, the storage control circuit 80 may increment and/or reset a counter circuit 60 to 67 responsive, at least in part, to an activation of the ArmSample. In some embodiments, the timing of the operations of the address comparing circuit 70 and/or storage control circuit 80 may be further controlled by additional signals not shown.
The first line of timing diagram 500 illustrates the state of a refresh signal AREF. In some embodiments, the AREF signal may be provided by a command control circuit, such as command control circuit 33. The second line of timing diagram 500 indicates a state of an activation/precharge signal ACT/PRE. The ACT/PRE signal may be provided by the command control circuit in some embodiments. The third line of timing diagram 500 illustrates the state of a refresh state signal RHR State. In some embodiments, the RHR State signal may be provided by a comparing circuit, such as comparing circuit 48. The fourth line of timing diagram 500 illustrates a state of an operation timing control/sampling signal ArmSample. In some embodiments, the ArmSample signal may be provided by an arm sample generator, such as arm sample generator 42.
The fifth line of timing diagram 500 illustrates a state of a minimum/maximum calculation selection signal Min/Max Sel. In some embodiments, the Min/Max Sel signal may be provided by a min/max control logic circuit, such as min/max control logic circuit 38. In some embodiments, the Min/Max Sel signal may have a default and/or resting state. By default state, it is meant a state at which the Min/Max Sel signal is provided unless the ACT/PRE is active and the AREF signal is inactive. The default state may be a state that indicates that a counter circuit (e.g., counter circuits 60-67) with a highest count value should be determined by a count comparing circuit (e.g., count comparing circuit 90). In the example shown in
The sixth line of timing diagram 500 indicates a timing of operations of a count comparing circuit, such as count comparing circuit 90. Operations may include, but are not limited to, comparing count values from two or more counter circuits. The operations may be initiated at or around a left edge of a first “X” and a result of the operations may be available at or around an a right edge of a final “X.” The seventh line of timing diagram 500 indicates a state of an address bus providing a row address VADD. The address bus may provide the row address VADD from a row hammer address storing circuit, such as address storing circuit 44, to an address convertor, such as address convertor 45 in some embodiments. The final line of timing diagram 500 indicates a state of an address bus providing one or more row hammer refresh addresses RHR ADD. The RHR address RHR ADD may be provided from the address convertor to a refresh address selector, such as refresh address selector 46 in some embodiments.
A refresh command 505 may be received by a device, such as device 10. Responsive, at least in part, to the refresh command 505, the AREF signal may transition to an active state (a high state in the example shown in
The next refresh operation may be determined to be a targeted refresh/RHR operation. Accordingly, the RHR State signal may transition to an active state at or around time T2. An activation command 510 may be received by the device. Responsive to the activation command 510, the ACT/PRE signal may transition to the active state at or around time T3. Responsive to the active ACT/PRE signal and inactive AREF signal, the Min/Max Sel signal may transition from a default state (e.g., high state) that indicates the counter circuit with a highest count value should be determined to another state (e.g., low) that indicates the counter circuit with a lowest count value should be determined at or around time T4.
Responsive to the transition of the Min/Max Sel signal, the count comparing circuit may perform one or more operations to determine a counter circuit including the lowest count value beginning at or around time T4 as indicated by the “X's” in the Comparing line. The result of the count comparing circuit's operations may be used to update a pointer in a control circuit, such as MIN pointer 81 in storage control circuit 80.
At or around time T5, the sampling signal ArmSample may provide an active pulse (a high pulse in the example shown in
Responsive to the active pulse of the ArmSample at or around T5 and the continued low state of the Min/Max Sel signal, the count comparing circuit may again perform operations to determine a counter circuit including the lowest count value as indicated by the “X's” in the Comparing line. The result of the count comparing circuit's operations may be used to update a pointer in a control circuit, such as MIN pointer 81 in storage control circuit 80. If the sampled row address matched an address stored in an address register and a corresponding counter circuit was incremented, a different address register may be associated with the lowest count value. If the sampled row address was written to an address register, the same address register may be associated with a lowest count value because the corresponding counter circuit was reset.
At or around time T6, the ArmSample signal may provide a second active pulse. Again, the ArmSample pulse may be associated with and/or trigger an address comparing circuit, such as address comparing circuit 70, to perform operations to determine whether a sampled row address matches an address stored in an address register. Because the second ArmSample signal occurs during execution of a same activation command 510 as the first pulse, the sampled row address will be the same as the sampled row address previously compared. Accordingly, the sampled row address will match a row address in an address register and a corresponding count value will be incremented.
Responsive to the active pulse of the ArmSample at or around T6 and the continued low state of the Min/Max Sel signal, the count comparing circuit may again perform operations to determine a counter circuit including the lowest count value as indicated by the “X's” in the Comparing line. The result of the count comparing circuit's operations may be used to update a pointer in a control circuit, such as MIN pointer 81 in storage control circuit 80. The counter circuit including the lowest count value may or may not have changed between the two determinations of the lowest count value performed by the count comparing circuit.
A precharge command 515 may be received by the device. Responsive to the precharge command, the ACT/PRE signal may transition to an inactive state at or around time T7. Responsive, at least in part, to the ACT/PRE signal transitioning to the inactive state, the Min/Max Sel signal may transition from the low state to the default state at or around time T8. As previously discussed, with the Min/Max Sel signal in the default state the count comparing circuit determines a counter circuit with a highest count value.
Responsive to the transition in the Min/Max Sel signal, the count comparing circuit may perform one or more operations to determine a counter circuit including the highest count value beginning at or around time T8 as indicated by the “X's” in the Comparing line. The result of the count comparing circuit's operations may be used to update a pointer in a control circuit, such as MAX pointer 82 in storage control circuit 80. The updated pointer may be used to provide a row address VADD on an address bus at or around time T9. The address VADD may be a row address associated with the highest count value. The address VADD may be used by an address convertor to generate RHR addresses RHR ADD. The RHR addresses may be provided on an address bus at or around time T10.
A refresh command 520 may be received by the device. Responsive to the refresh command 520, the refresh signal AREF and the ACT/PRE signals may transition to active states, and the RHR addresses RHR ADD remain available on the address bus. Because RHR State is active, a RHR operation may be performed. Thus, the RHR addresses RHR ADD may be used as refresh addresses during the refresh operation performed responsive to the refresh command 520.
By triggering the RHR address calculation operations earlier, the RHR addresses RHR ADD may be available sooner than if the calculation operation for the RHR address was performed responsive to receipt of the refresh command 520. This may reduce the risk that the RHR addresses RHR ADD are not available to be used as refresh addresses during a RHR operation. This may reduce the need to delay the RHR operation and/or store the RHR addresses RHR for a subsequent RHR operation. In some embodiments of the disclosure, the RHR address calculation operation is triggered by causing the count comparing circuit to determine a counter circuit including the highest count value based on the precharge command 515. For example, the Min/Max Sel signal may transition from the low state to the high state at the receipt of the precharge command 515, and the count comparing circuit may determine a counter circuit including the highest count value responsive to the transition of the Min/Max Sel signal.
At block 602, “receiving a precharge command” may be performed. In some embodiments, an inactive activation signal may be provided responsive, at least in part, to the precharge command. In some embodiments, the signal may be provided to a min/max control logic circuit, such as min/max control logic circuit 38.
Responsive, at least in part, to the precharge command, at block 604, “determining with a count comparing circuit, a counter circuit of a plurality of counter circuits storing a highest count value” may be performed. In some embodiments, the determining may be performed by count comparing circuit 90. In some embodiments, the counter circuits may include counter circuits 60-67.
In some embodiments, the method 600 may further include providing a row address from an address register associated with the counter circuit of the plurality of counter circuits storing the highest count value. In some embodiments, the address registers may include row address registers 50-57. In some embodiments, method 600 may further include generating at least one refresh address based, at least in part, on the row address. In some embodiments, the refresh address may be generated by an address convertor, such as address convertor 45. In some embodiments, method 600 may further include refreshing at least one word line corresponding to the at least one refresh address. In some embodiments, the refreshing may be responsive, at least in part, to a refresh command and the active refresh state signal. In some embodiments, the active refresh state signal may cause a targeted refresh/RHR operation to be performed responsive to the refresh command.
In some embodiments, method 600 may further include receiving an active activation signal at the min/max control logic circuit. In some embodiments, the active activation signal is provided responsive, at least in part, to an activation command. Responsive, at least in part, to the inactive refresh signal and the active activation signal, method 600 may further include transitioning the selection signal from one state to another state by the min/max control logic circuit. In some embodiments, responsive, at least in part, to the transitioning of the selection signal from the one state to the other state, method 600 may further include determining with the count comparing circuit, a counter circuit of the plurality of counter circuits storing a lowest count value.
In some embodiments, method 600 may further include receiving an active timing control signal. In some embodiments, the timing control signal may be a sampling signal provided by an arm sample generator, such as arm sample generator 42. In some embodiments, responsive, at least in part, to the active timing control signal, method 600 may further include determining with the count comparing circuit, the counter circuit of the plurality of counter circuits storing the lowest count value. In some embodiments, responsive, at least in part, to the active timing control signal, method 600 may further include comparing, with an address comparing circuit, such as address comparing circuit 70, a sampled row address to a plurality of row addresses stored in a corresponding one of a plurality of address registers, such as address registers 50-57. In some embodiments, method 600 may include storing in an address register of the plurality of address registers associated with the counter circuit of the plurality of counter circuits storing the lowest count value when the sampled row address does not match the plurality of row addresses. When the sampled row address matches a row address of the plurality of row addresses, method 600 may include incrementing a counter circuit of the plurality of counter circuits associated with an address register of the plurality of address registers storing the row address of the plurality of row addresses. In some embodiments, the active timing control signal may be provided a plurality of times during a time period between the activation command and the precharge command and the count comparing circuit determines the counter circuit of the plurality of counter circuits storing the lowest count value each time the active timing control signal is provided.
At block 702, “receiving a signal” may be performed. The signal may be received by a device, such as device 10. In some embodiments, the signal may be received by a command control circuit, such as command control circuit 33. In some embodiments, the signal may be a command, such as a precharge command. At block 704, “receiving an active refresh state signal” may be performed. In some embodiments, the refresh state signal may be provided by the command control circuit. In some embodiments, the refresh state signal may be provided by a component of a refresh control circuit. In some embodiments, the active refresh state signal may be associated with a row hammer refresh operation. In some embodiments, the refresh state signal may be received by a min/max control logic circuit, such as min/max control logic circuit 38.
Responsive, at least in part, to the signal, at block 706 “determining a counter circuit of a plurality of counter circuits storing a highest count value” may be performed. In some embodiments, the determining may be performed by a row hammer address storing circuit, such as row hammer address storing circuit 44. More specifically, in some embodiments, the determining may be performed by a count comparing circuit, such as count comparing circuit 90. In some embodiments, the determining may be performed responsive to a transition of a selection signal provided by the min/max control logic circuit. In some embodiments, the transition of the selection signal is made responsive to the signal, which as noted, may be a precharge command in some embodiments. In some embodiments, the counter circuits may include counter circuits 60-67. At block 708, “providing, on an address bus, a row address from an address register associated with the counter circuit” may be performed. In some embodiments, the address register may include one of address registers 50-57. In some embodiments, the address bus may be the address bus labeled VADD in
In some embodiments, method 700 may further include generating a refresh address based on the row address. In some embodiments, the generating may be performed by an address convertor, such as address convertor 45. Method 700 may further include providing the refresh address on a second address bus. In some embodiments, the second address bus may include one or more address busses labeled RHR ADD.
In some embodiments, method 700 may further include receiving a refresh command. In some embodiments, the refresh command may be received by the command control circuit. Responsive, at least in part, to the refresh command, in some embodiments, method 700 may include refreshing a word line corresponding to the refresh address. In some embodiments, the word line may be refreshed, at least in part, by a row address control circuit, such as row address control circuit 12.
The apparatuses, methods, and systems disclosed herein may permit determination of a counter of an address storing circuit with a highest count value may be initiated by a signal received preceding a RHR operation. In some examples, the signal may be a command, such as a precharge command. This may permit additional time prior to the RHR operation for the determination of the counter with the highest count value, providing an address associated with the counter, and generating one or more refresh addresses from the address. The additional time may reduce or eliminate the risk that refresh addresses will not be available for the RHR operation.
Although this invention has been disclosed in the context of certain preferred embodiments and examples, it will be understood by those skilled in the art that the inventions extend beyond the specifically disclosed embodiments to other alternative embodiments and/or uses of the inventions and obvious modifications and equivalents thereof. In addition, other modifications which are within the scope of this invention will be readily apparent to those of skill in the art based on this disclosure. It is also contemplated that various combination or sub-combination of the specific features and aspects of the embodiments may be made and still fall within the scope of the inventions. It should be understood that various features and aspects of the disclosed embodiments can be combined with or substituted for one another in order to form varying modes of the disclosed invention. Thus, it is intended that the scope of at least some of the present invention herein disclosed should not be limited by the particular disclosed embodiments described above.
Number | Name | Date | Kind |
---|---|---|---|
1158364 | Bibb | Oct 1915 | A |
5291198 | Dingwall et al. | Mar 1994 | A |
5299159 | Balistreri et al. | Mar 1994 | A |
5422850 | Sukegawa et al. | Jun 1995 | A |
5638317 | Tran | Jun 1997 | A |
5699297 | Yamazaki et al. | Dec 1997 | A |
5768196 | Bloker et al. | Jun 1998 | A |
5933377 | Hidaka | Aug 1999 | A |
5943283 | Wong et al. | Aug 1999 | A |
5970507 | Kato et al. | Oct 1999 | A |
5999471 | Choi | Dec 1999 | A |
6002629 | Kim et al. | Dec 1999 | A |
6011734 | Pappert | Jan 2000 | A |
6061290 | Shirley | May 2000 | A |
6212118 | Fujita | Apr 2001 | B1 |
6310806 | Higashi et al. | Oct 2001 | B1 |
6317381 | Gans et al. | Nov 2001 | B1 |
6373738 | Towler et al. | Apr 2002 | B1 |
6392952 | Chen et al. | May 2002 | B1 |
6424582 | Ooishi | Jul 2002 | B1 |
6434064 | Nagai | Aug 2002 | B2 |
6452868 | Fister | Sep 2002 | B1 |
6480931 | Buti et al. | Nov 2002 | B1 |
6515928 | Sato et al. | Feb 2003 | B2 |
6567340 | Nataraj et al. | May 2003 | B1 |
6950364 | Kim | Sep 2005 | B2 |
7027343 | Sinha et al. | Apr 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 | Done et al. | Jun 2009 | B2 |
7565479 | Best et al. | Jul 2009 | B2 |
7830742 | Han | Nov 2010 | B2 |
8174921 | Kim et al. | May 2012 | B2 |
8400805 | Yoko | Mar 2013 | B2 |
8451677 | Okahiro et al. | May 2013 | B2 |
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 |
9058900 | Kang | Jun 2015 | B2 |
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 |
9251885 | Greenfield et al. | Feb 2016 | B2 |
9286964 | Halbert et al. | Mar 2016 | B2 |
9299457 | Chun et al. | Mar 2016 | B2 |
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 |
9412432 | Narui 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 |
9646672 | Kim et al. | 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 | Tawa | Aug 2017 | B1 |
9741409 | Jones et al. | Aug 2017 | B2 |
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 |
9818469 | Kim et al. | Nov 2017 | B1 |
9865326 | Bains et al. | Jan 2018 | B2 |
9865328 | Desimone et al. | Jan 2018 | B1 |
9922694 | Akamatsu | Mar 2018 | B2 |
9934143 | Bains et al. | Apr 2018 | B2 |
9953696 | Kim | Apr 2018 | B2 |
10032501 | Ito et al. | Jul 2018 | B2 |
10083737 | Bains et al. | Sep 2018 | B2 |
10090038 | Shin | Oct 2018 | B2 |
10134461 | Bell et al. | Nov 2018 | B2 |
10147472 | Jones et al. | Dec 2018 | B2 |
10153031 | Akamatsu | Dec 2018 | B2 |
10170174 | Ito et al. | Jan 2019 | B1 |
10176860 | Mylavarapu | Jan 2019 | B1 |
10210925 | Bains et al. | Feb 2019 | B2 |
10297305 | Moon et al. | May 2019 | B1 |
10339994 | Ito et al. | Jul 2019 | B2 |
10381327 | Ramachandra et al. | Aug 2019 | B2 |
10387276 | Ryu et al. | Aug 2019 | B2 |
10446216 | Oh | Oct 2019 | B2 |
10490251 | Wolff | Nov 2019 | B2 |
10600462 | Augustine et al. | Mar 2020 | B2 |
10600491 | Chou et al. | Mar 2020 | B2 |
10607686 | Akamatsu | Mar 2020 | B2 |
10629286 | Lee et al. | Apr 2020 | B2 |
10679710 | Hirashima et al. | Jun 2020 | B2 |
10705900 | Jin | Jul 2020 | B2 |
10770127 | Shore et al. | Sep 2020 | B2 |
10811066 | Jones et al. | Oct 2020 | B2 |
10832792 | Penney et al. | Nov 2020 | B1 |
10861519 | Jones et al. | Dec 2020 | B2 |
10867660 | Akamatsu | Dec 2020 | B2 |
10930335 | Bell et al. | Feb 2021 | B2 |
10943636 | Wu et al. | Mar 2021 | B1 |
10950289 | Ito et al. | Mar 2021 | B2 |
10964378 | Ayyapureddi et al. | Mar 2021 | B2 |
11043254 | Enomoto et al. | Jun 2021 | B2 |
20010008498 | Ooishi | Jul 2001 | A1 |
20020007476 | Kishino | Jan 2002 | A1 |
20020078311 | Matsuzaki et al. | Jun 2002 | A1 |
20020080677 | Watanabe et al. | Jun 2002 | A1 |
20020181301 | Takahashi et al. | Dec 2002 | A1 |
20030063512 | Takahashi et al. | Apr 2003 | A1 |
20030067825 | Shimano et al. | Apr 2003 | A1 |
20030090400 | Barker | May 2003 | A1 |
20030123301 | Jang et al. | Jul 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 |
20040052142 | Ikehashi et al. | Mar 2004 | A1 |
20040114446 | Takahashi et al. | Jun 2004 | A1 |
20040130959 | Kawaguchi | Jul 2004 | A1 |
20040174757 | Garverick et al. | Sep 2004 | A1 |
20040184323 | Mori et al. | Sep 2004 | A1 |
20040218431 | Chung et al. | Nov 2004 | A1 |
20050041502 | Perner | Feb 2005 | A1 |
20050105315 | Shin et al. | May 2005 | A1 |
20050243629 | Lee | Nov 2005 | A1 |
20050265104 | Remaklus et al. | Dec 2005 | A1 |
20060083099 | Bae et al. | Apr 2006 | A1 |
20060087903 | Riho et al. | Apr 2006 | A1 |
20060176744 | Stave | Aug 2006 | A1 |
20060262616 | Chen | Nov 2006 | A1 |
20070008799 | Done et al. | Jan 2007 | A1 |
20070014174 | Ohsawa | Jan 2007 | A1 |
20070028068 | Golding et al. | Feb 2007 | A1 |
20070030746 | Best et al. | Feb 2007 | A1 |
20070033339 | Best et al. | Feb 2007 | A1 |
20070133330 | Ohsawa | Jun 2007 | A1 |
20070230264 | Eto | Oct 2007 | A1 |
20070237016 | Miyamoto et al. | Oct 2007 | A1 |
20070297252 | Singh | Dec 2007 | 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 |
20080224742 | Pomichter | Sep 2008 | A1 |
20080253212 | Iida et al. | Oct 2008 | A1 |
20080266990 | Loeffler | Oct 2008 | A1 |
20080288720 | Atwal et al. | Nov 2008 | A1 |
20080316845 | Wang et al. | Dec 2008 | A1 |
20090021999 | Tanimura et al. | Jan 2009 | A1 |
20090059641 | Jeddeloh | Mar 2009 | A1 |
20090077571 | Gara et al. | Mar 2009 | A1 |
20090161457 | Wakimoto | Jun 2009 | A1 |
20090168571 | Pyo et al. | Jul 2009 | A1 |
20090185440 | Lee | Jul 2009 | A1 |
20090201752 | Riho et al. | Aug 2009 | A1 |
20090213675 | Shino | Aug 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 |
20100054011 | Kim | Mar 2010 | A1 |
20100074042 | Fukuda et al. | Mar 2010 | A1 |
20100080074 | Ohmaru et al. | Apr 2010 | A1 |
20100110809 | Kobayashi et al. | May 2010 | A1 |
20100110810 | Kobayashi | May 2010 | A1 |
20100131812 | Mohammad | May 2010 | A1 |
20100157693 | Iwai et al. | Jun 2010 | A1 |
20100182863 | Fukiage | Jul 2010 | A1 |
20100329069 | Ito et al. | Dec 2010 | A1 |
20110026290 | Noda et al. | Feb 2011 | A1 |
20110051530 | Kushida | Mar 2011 | A1 |
20110055495 | Remaklus, Jr. et al. | Mar 2011 | A1 |
20110069572 | Lee et al. | Mar 2011 | A1 |
20110122987 | Neyer | May 2011 | A1 |
20110216614 | Hosoe | Sep 2011 | A1 |
20110225355 | Kajigaya | Sep 2011 | A1 |
20110286271 | Chen | Nov 2011 | A1 |
20110310648 | Iwamoto et al. | Dec 2011 | A1 |
20110317462 | Gyllenhammer et al. | Dec 2011 | A1 |
20120014199 | Narui | Jan 2012 | A1 |
20120059984 | Kang et al. | Mar 2012 | A1 |
20120151131 | Kilmer et al. | Jun 2012 | A1 |
20120213021 | Riho et al. | Aug 2012 | A1 |
20120254472 | Ware et al. | Oct 2012 | A1 |
20130003467 | Klein | Jan 2013 | A1 |
20130003477 | Park et al. | Jan 2013 | A1 |
20130057173 | Yao | Mar 2013 | A1 |
20130107623 | Kavalipurapu et al. | May 2013 | A1 |
20130173971 | Zimmerman | Jul 2013 | A1 |
20130254475 | Perego et al. | Sep 2013 | A1 |
20130304982 | Jung et al. | Nov 2013 | 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 |
20140050004 | Mochida | Feb 2014 | A1 |
20140078841 | Chopra | Mar 2014 | A1 |
20140078842 | Oh et al. | Mar 2014 | A1 |
20140078845 | Song | Mar 2014 | A1 |
20140089576 | Bains 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 |
20140136763 | Li et al. | May 2014 | A1 |
20140143473 | Kim et al. | May 2014 | A1 |
20140177370 | Halbert et al. | Jun 2014 | A1 |
20140189228 | Greenfield et al. | Jul 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 |
20140269021 | Yang et al. | Sep 2014 | A1 |
20140281206 | Crawford et al. | Sep 2014 | A1 |
20140281207 | Mandava et al. | Sep 2014 | A1 |
20140292375 | Angelini et al. | Oct 2014 | A1 |
20140293725 | Best et al. | Oct 2014 | A1 |
20140355332 | Youn et al. | Dec 2014 | A1 |
20150049567 | Chi | Feb 2015 | A1 |
20150055420 | Bell et al. | Feb 2015 | A1 |
20150078112 | Huang | Mar 2015 | A1 |
20150089326 | Joo et al. | Mar 2015 | A1 |
20150155027 | Abe 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 |
20150213877 | Darel | Jul 2015 | A1 |
20150228341 | Watanabe et al. | Aug 2015 | A1 |
20150243339 | Bell et al. | Aug 2015 | A1 |
20150255140 | Song | Sep 2015 | A1 |
20150262652 | Igarashi | 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 |
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 |
20160078845 | Lin et al. | Mar 2016 | A1 |
20160078911 | Fujiwara et al. | Mar 2016 | A1 |
20160078918 | Hyun et al. | Mar 2016 | A1 |
20160086649 | Hong et al. | Mar 2016 | A1 |
20160086651 | Kim | Mar 2016 | A1 |
20160093402 | Kitagawa et al. | Mar 2016 | A1 |
20160099043 | Tu | Apr 2016 | A1 |
20160125931 | Doo et al. | May 2016 | A1 |
20160133314 | Hwang et al. | May 2016 | A1 |
20160140243 | Adams et al. | May 2016 | A1 |
20160163372 | Lee et al. | Jun 2016 | A1 |
20160172056 | Huh | 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 |
20160211008 | Benedict et al. | Jul 2016 | A1 |
20160225433 | Bains et al. | Aug 2016 | A1 |
20160225461 | Tuers et al. | Aug 2016 | A1 |
20160336060 | Shin | Nov 2016 | A1 |
20160343423 | Shido | Nov 2016 | A1 |
20170011792 | Oh | Jan 2017 | A1 |
20170076779 | Bains et al. | Mar 2017 | A1 |
20170092350 | Halbert et al. | Mar 2017 | A1 |
20170117030 | Fisch et al. | Apr 2017 | A1 |
20170133085 | Kim et al. | May 2017 | A1 |
20170139641 | Cha et al. | May 2017 | A1 |
20170140807 | Sun et al. | May 2017 | A1 |
20170140811 | Joo | 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 |
20170287547 | Ito et al. | Oct 2017 | A1 |
20170323675 | Jones et al. | Nov 2017 | A1 |
20170352399 | Yokoyama et al. | Dec 2017 | A1 |
20170371742 | Shim et al. | Dec 2017 | A1 |
20170372767 | Kang 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 |
20180060194 | Ryu et al. | Mar 2018 | A1 |
20180061483 | Morgan | Mar 2018 | A1 |
20180082737 | Lee | Mar 2018 | A1 |
20180084314 | Koyama | Mar 2018 | A1 |
20180090199 | Kim et al. | Mar 2018 | A1 |
20180096719 | Tomishima et al. | Apr 2018 | A1 |
20180102776 | Chandrasekar et al. | Apr 2018 | A1 |
20180107417 | Shechter et al. | Apr 2018 | A1 |
20180114561 | Fisch et al. | Apr 2018 | A1 |
20180114565 | Lee | Apr 2018 | A1 |
20180158504 | Akamatsu | Jun 2018 | A1 |
20180182445 | Lee et al. | Jun 2018 | A1 |
20180203621 | Ahn et al. | Jul 2018 | A1 |
20180218767 | Wolff | Aug 2018 | A1 |
20180261268 | Hyun et al. | Sep 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 |
20190066759 | Nale | Feb 2019 | A1 |
20190066762 | Koya | Feb 2019 | A1 |
20190088315 | Saenz et al. | Mar 2019 | A1 |
20190088316 | Inuzuka et al. | Mar 2019 | A1 |
20190096492 | Cai et al. | Mar 2019 | A1 |
20190103147 | Jones et al. | Apr 2019 | A1 |
20190130961 | Bell et al. | May 2019 | A1 |
20190139599 | Ito et al. | May 2019 | A1 |
20190147941 | Qin et al. | May 2019 | A1 |
20190147964 | Yun et al. | May 2019 | A1 |
20190161341 | Howe | May 2019 | A1 |
20190196730 | Imran | Jun 2019 | A1 |
20190198078 | Hoang et al. | Jun 2019 | A1 |
20190198090 | Lee | Jun 2019 | A1 |
20190198099 | Mirichigni et al. | Jun 2019 | A1 |
20190205253 | Roberts | Jul 2019 | A1 |
20190207736 | Ben-tovim et al. | Jul 2019 | A1 |
20190228810 | Jones et al. | Jul 2019 | A1 |
20190228813 | Nale et al. | Jul 2019 | A1 |
20190228815 | Morohashi et al. | Jul 2019 | A1 |
20190237132 | Morohashi | Aug 2019 | A1 |
20190243708 | Cha et al. | Aug 2019 | A1 |
20190252020 | Rios et al. | Aug 2019 | A1 |
20190267077 | Ito et al. | Aug 2019 | A1 |
20190279706 | Kim | Sep 2019 | A1 |
20190333573 | Shin et al. | Oct 2019 | A1 |
20190348100 | Smith et al. | Nov 2019 | A1 |
20190348103 | Jeong et al. | Nov 2019 | A1 |
20190348107 | Shin et al. | Nov 2019 | A1 |
20190349545 | Koh et al. | Nov 2019 | A1 |
20190362774 | Kuramori et al. | Nov 2019 | A1 |
20190371391 | Cha et al. | Dec 2019 | A1 |
20190385661 | Koo et al. | Dec 2019 | A1 |
20190385667 | Morohashi et al. | Dec 2019 | A1 |
20190386557 | Wang et al. | Dec 2019 | A1 |
20200005857 | Ito et al. | Jan 2020 | A1 |
20200075106 | Tokutomi et al. | Mar 2020 | A1 |
20200082873 | Wolff | Mar 2020 | A1 |
20200090760 | Purahmad et al. | Mar 2020 | A1 |
20200135263 | Brown et al. | Apr 2020 | A1 |
20200194050 | Akamatsu | Jun 2020 | A1 |
20200194056 | Sakurai et al. | Jun 2020 | A1 |
20200201380 | Murali et al. | Jun 2020 | A1 |
20200202921 | Morohashi et al. | Jun 2020 | A1 |
20200211626 | Hiscock et al. | Jul 2020 | A1 |
20200211633 | Okuma | Jul 2020 | A1 |
20200211636 | Hiscock et al. | Jul 2020 | A1 |
20200251158 | Shore et al. | Aug 2020 | A1 |
20200294576 | Brown et al. | Sep 2020 | A1 |
20200302994 | Enomoto et al. | Sep 2020 | A1 |
20200321049 | Meier et al. | Oct 2020 | A1 |
20200349995 | Shore et al. | Nov 2020 | A1 |
20200365208 | Schreck et al. | Nov 2020 | A1 |
20200381040 | Penney et al. | Dec 2020 | A1 |
20200395072 | Penney et al. | Dec 2020 | A1 |
20210005229 | Hiscock et al. | Jan 2021 | A1 |
20210005240 | Brown et al. | Jan 2021 | A1 |
20210020223 | Ayyapureddi et al. | Jan 2021 | A1 |
20210020262 | Penney et al. | Jan 2021 | A1 |
20210026732 | Park et al. | Jan 2021 | A1 |
20210057012 | Ayyapureddi et al. | Feb 2021 | A1 |
20210057013 | Jenkinson et al. | Feb 2021 | A1 |
20210057021 | Wu et al. | Feb 2021 | A1 |
20210065755 | Kim et al. | Mar 2021 | A1 |
20210065764 | Cheng et al. | Mar 2021 | A1 |
20210142852 | Schreck et al. | May 2021 | A1 |
20210158851 | Ayyapureddi et al. | May 2021 | A1 |
20210158860 | Wu et al. | May 2021 | A1 |
20210158861 | Jeong et al. | May 2021 | A1 |
20210201984 | Khasawneh et al. | Jul 2021 | A1 |
20210225432 | Enomoto et al. | Jul 2021 | A1 |
20210241810 | Hollis et al. | Aug 2021 | A1 |
20210265504 | Ishizu et al. | Aug 2021 | A1 |
Number | Date | Country |
---|---|---|
1195173 | Oct 1998 | CN |
101038785 | Sep 2007 | CN |
101067972 | Nov 2007 | CN |
101331554 | Dec 2008 | CN |
101458658 | Jun 2009 | CN |
101622607 | Jan 2010 | CN |
102113058 | Jun 2011 | CN |
102483952 | May 2012 | CN |
104350546 | Feb 2015 | CN |
106710621 | May 2017 | CN |
107871516 | Apr 2018 | CN |
H0773682 | Mar 1995 | JP |
2005-216429 | Aug 2005 | JP |
2011-258259 | Dec 2011 | JP |
4911510 | Jan 2012 | JP |
2013-004158 | Jan 2013 | JP |
1020180064940 | Jun 2018 | KR |
1020180085184 | Jul 2018 | KR |
2014120477 | Aug 2014 | WO |
2015030991 | Mar 2015 | WO |
2017171927 | Oct 2017 | WO |
2019222960 | Nov 2019 | WO |
2020010010 | Jan 2020 | WO |
2020191222 | Sep 2020 | WO |
2021003085 | Jan 2021 | WO |
Entry |
---|
U.S. Appl. No. 17/446,710 titled “Apparatuses, Systems, and Methods for Determining Extremum NumericalValues” filed Sep. 1, 2021, pp. all. |
U.S. Appl. No. 17/470,883 titled “Apparatuses and Methods for Tracking Victim Rows” filed Sep. 9, 2021, pp. all. |
Application No. PCT/US20/23689, titled “Semiconductor Device Having Cam That Stores Address Signals”, dated Mar. 19, 2020, pp. all. |
U.S. Appl. No. 15/884,192 entitled ‘Semiconductor Device Performing Row Hammer Refresh Operation’, filed Jan. 30, 2018, pp. all. |
U.S. Appl. No. 16/797,658, titles “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 21, 2020, pp. all. |
U.S. Appl. No. 16/818,981 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Mar. 13, 2020, pp. all. |
U.S. Appl. No. 16/824,460, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 19, 2020, pp. all. |
U.S. Appl. No. 16/025,844, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, filed Jul. 2, 2018, pp. all. |
U.S. Appl. No. 16/783,063, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, dated Feb. 5, 2020, pp. all. |
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. all. |
U.S. Appl. No. 16/232,837, titled “Apparatuses and Methods for Distributed Targeted Refresh Operations”, filed Dec. 26, 2018, pp. all. |
U.S. Appl. No. 16/818,989, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 13, 2020, pp. all. |
U.S. Appl. No. 16/268,818, titled “Apparatuses and Methods for Managing Row Access Counts”, filed Feb. 6, 2019, pp. all. |
U.S. Appl. No. 16/286,187 titled “Apparatuses and Methods for Memory Mat Refresh Sequencing” filed on Feb. 26, 2019; pp. all. |
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. all. |
U.S. Appl. No. 16/886,284 titled “Apparatuses and Methods for Access Based Refresh Timing” filed May 28, 2020, pp. all. |
U.S. Appl. No. 16/886,284, titled “Apparatuses and Methods for Access Based Refresh Timing”, dated May 28, 2020, pp. all. |
U.S. Appl. No. 16/358,587, titled “Semiconductor Device Having Cam That Stores Address Signals”, dated Mar. 19, 2019, pp. all. |
U.S. Appl. No. 16/375,716 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed on Apr. 4, 2019; pp. all. |
U.S. Appl. No. 16/936,297 titled “Apparatuses and Methods for Managing Row Access Counts” filed Jul. 22, 2020, pp. all. |
U.S. Appl. No. 16/411,573 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed May 14, 2019, pp. all. |
U.S. Appl. No. 16/428,625 titled “Apparatuses and Methods for Tracking Victim Rows” filed May 31, 2019, pp. all. |
U.S. Appl. No. 16/513,400 titled “Apparatuses and Methods for Tracking Row Accesses” filed Jul. 16, 2019, pp. all. |
U.S. Appl. No. 17/060,403 titled “Apparatuses and Methods for Adjusting Victim Data” filed Oct. 1, 2020, pp. all. |
U.S. Appl. No. 16/548,027 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Aug. 22, 2019, pp. all. |
U.S. Appl. No. 16/549,942 titled “Apparatuses and Methods for Lossy Row Access Counting” filed Aug. 23, 2019, pp. all. |
U.S. Appl. No. 16/546,152 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Aug. 20, 2019, pp. all. |
U.S. Appl. No. 16/549,411 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Aug. 23, 2019, pp. all. |
U.S. Appl. No. 16/655,110 titled “Apparatuses and Methods for Dynamic Targeted Refresh Steals” filed Oct. 16, 2019, pp. all. |
U.S. Appl. No. 17/154,945 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed Jan. 21, 2021, pp. all. |
U.S. Appl. No. 17/170,616 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Feb. 8, 2021, pp. all. |
U.S. Appl. No. 17/168,036 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Feb. 4, 2021, pp. all. |
U.S. Appl. No. 17/301,533 titled “Semiconductor Device Having Cam That Stores Address Signals” filed Apr. 6, 2021, pp. all. |
International Application No. PCT/US19/40169 titled “Apparatus and Methods for Triggering Row Hammer Address Sampling” filed Jul. 1, 2019, pp. all. |
International Application No. PCT/US19/64028, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Dec. 2, 2019, pp. all. |
International Application No. PCT/US20/26689, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations”, dated Apr. 3, 2020, pp. all. |
International Application No. PCT/US20/40077, titled “Apparatuses and Methods for Monitoring Word Line Accesses”, dated Jun. 29, 2020, pp. all. |
U.S. Appl. No. 16/788,657, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Feb. 12, 2020, pp. all. |
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. all. |
U.S. Appl. No. 16/425,525 titled “Apparatuses and Methods for Tracking All Row Accesses” filed May 29, 2019, pp. all. |
U.S. Appl. No. 16/427,105 titled “Apparatuses and Methods for Priority Targeted Refresh Operations” filed May 30, 2019, pp. all. |
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. all. |
U.S. Appl. No. 16/437,811 titled “Apparatuses, Systems, and Methods for Determining Extremum Numerical Values” filed Jun. 11, 2019, pp. all. |
U.S. Appl. No. 16/537,981 titled “Apparatuses and Methods for Controlling Targeted Refresh Rates” filed Aug. 12, 2019, pp. all. |
U.S. Appl. No. 17/153,555 titled “Apparatuses and Methods for Dynamically Allocated Aggressor Detection” filed Jan. 20, 2021, pp. all. |
U.S. Appl. No. 17/201,941 titled “Apparatuses and Methods for Sketch Circuits for Refresh Binning” filed Mar. 15, 2021, pp. all. |
U.S. Appl. No. 17/375,817 titled “Apparatuses and Methods for Monitoring Word Line Accesses” filed Jul. 14, 2021, pp. all. |
U.S. Appl. No. 17/443,056 titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences” filed Jul. 20, 2021, pp. all. |
U.S. Appl. No. 17/444,925 titled “Apparatuses and Methods for Countering Memory Attacks” filed Aug. 12, 2021, pp. all. |
U.S. Appl. No. 15/789,897, entitled “Apparatus and Methods for Refreshing Memory”, filed Oct. 20, 2017; pp. all. |
U.S. Appl. No. 15/796,340, entitled: “Apparatus and Methods for Refreshing Memory” filed on Oct. 27, 2017; pp. all. |
U.S. Appl. No. 16/012,679, titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences”, filed Jun. 19, 2018; pp. all. |
U.S. Appl. No. 16/020,863, titled “Semiconductor Device”, filed Jun. 27, 2018; pp. all. |
U.S. Appl. No. 16/112,471 titled “Apparatuses and Methods for Controlling Refresh Operations” filed Aug. 24, 2018; pp. all. |
U.S. Appl. No. 16/160,801, titled “Apparatuses and Methods for Selective Row Refreshes” filed on Oct. 15, 2018, pp. all. |
U.S. Appl. No. 16/176,932, titled “Apparatuses and Methods for Access Based Refresh Timing”, filed Oct. 31, 2018; pp. all. |
U.S. Appl. No. 16/208,217, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Dec. 3, 2018, pp. all. |
U.S. Appl. No. 16/230,300, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Dec. 21, 2018; pp. all. |
U.S. Appl. No. 16/231,327 titled “Apparatuses and Methods for Selective Row Refreshes”, filed on Dec. 21, 2018; pp. all. |
U.S. Appl. No. 16/237,291, titled “Apparatus and Methods for Refreshing Memory”, filed Dec. 31, 2018, pp. all. |
U.S. Appl. No. 16/290,730, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 1, 2019; pp. all. |
U.S. Appl. No. 16/374,623, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Apr. 3, 2019; pp. all. |
U.S. Appl. No. 16/411,698 title “Semiconductor Device” filed May 14, 2019; pp. all. |
U.S. Appl. No. 16/427,330 titled “Apparatuses and Methods for Storing Victim Row Data” filed May 30, 2019; pp. all. |
U.S. Appl. No. 16/431,641 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 4, 2019; pp. all. |
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. all. |
U.S. Appl. No. 17/102,266, titled “Apparatuses and Methods for Tracking Word Line Accesses”, dated Nov. 23, 2020; pp. all. |
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. all. |
International Application No. PCT/US20/32684, titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell”, dated May 13, 2020; pp. all. |
U.S. Appl. No. 15/656,084, titled “Apparatuses and Methods for Targeted Refreshing of Memory”, filed Jul. 21, 2017; pp. all. |
U.S. Appl. No. 16/459,520 titled “Apparatuses and Methods for Monitoring Word Line Accesses”, filed Jul. 1, 2019, pp. all. |
PCT Application No. PCT/US18/55821 “Apparatus and Methods for Refreshing Memory” filed Oct. 15, 2018., pp. all. |
U.S. Appl. No. 15/715,846, entitled “Semiconductor Device”, filed Sep. 26, 2017, pp. all. |
U.S. Appl. No. 15/888,993, entitled “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 5, 2018, pp. all. |
U.S. Appl. No. 16/190,627 titled “Apparatuses and Methods for Targeted Refreshing of Memory” filed Nov. 14, 2018, pp. all. |
U.S. Appl. No. 16/459,507 titled “Apparatuses and Methods for Adjusting Victim Data”, filed Jul. 1, 2019, pp. all. |
U.S. Appl. No. 15/281,818, entitled: “Semiconductor Device” filed Sep. 30, 2016; pp. all. |
Kim, et al., “Flipping Bits in MemoryWithout Accessing Them: An Experimental Study of DRAM Disturbance Errors”, IEEE, Jun. 2014, 12 pgs. |
Stout, Thomas et al., “Voltage Source Based Voltage-to-Time Converter”, IEEE, downloaded Jul. 2020, p. All. |