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 in memory cells of the DRAM as a changed physical property of the memory cell. For example the memory cell may be a capacitive element, and the information may be stored as the charge of the capacitive element. The DRAM may include volatile memory cells, which are memory cells where the physical property may change over time (e.g., the charge on a capacitor may decay over time) which may, in turn, degrade the data stored in the memory cell over time. Thus, it may be necessary to periodically refresh the memory cells to maintain information fidelity in the memory (e.g., by restoring the memory cell to an initial charge level).
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. It may be desirable to identify and refresh memory cells affected by the row hammer. These targeted refreshes may need to be interspersed amongst the regular periodic refreshes which are carried out on rows which are not experiencing a row hammer effect.
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.
A semiconductor memory device may store information in a plurality of memory cells, each of which is disposed at the intersection of a particular row (word line) and column (bit line). The memory cells may store information in a manner which is volatile, such that the state of the memory cell (and thus the information stored therein) changes or decays over time. Accordingly, memory devices may conduct refresh operations in which the state of the memory cell is restored to an initial value (e.g., an initial level of charge) corresponding to the information stored in that memory cell. For example, the information may be read from a given memory cell and then written back to the same memory cell. The refresh operation may refresh an entire row of memory cells at a time. These refreshes may be part of an auto-refresh operation and may happen as a result of user commands and/or may happen periodically. During an auto-refresh the memory device may work its way through a sequence of rows of memory cells of the semiconductor device
In addition to the auto-refresh operation, it may be necessary to refresh certain targeted rows of memory cells. These rows may undergo degradation more quickly than other rows of the semiconductor device. Accordingly they may need to be refreshed more often than they would be by an auto-refresh operation. These targeted refresh rows (or targeted refresh addresses) may need to be identified and then targeted refreshes may need to be carried out while other refresh operations are occurring. The targeted refresh rows may be subject to the row hammer effect, in which repeated access to a given row (the aggressor row) causes degradation of one or more rows proximate to the aggressor row (the victim rows). The victim row(s) may be identified and provided as the targeted refresh rows. The rate at which the victim rows experience degradation may be related to the number (and/or rate) of accesses to the aggressor row. Accordingly, the rate at which targeted refresh operations need to be carried out may be dependent on the number and/or rate of accesses.
The present disclosure is aimed at apparatuses and methods for scheduling targeted refreshes. The memory device may carry out refresh operations on a sequence of row addresses, which may be timed based on an auto-refresh signal. The memory device may include a counter which checks to see if the number (and/or rate) of accesses to a particular memory location or memory locations of the memory device exceeds a threshold. If it does, the memory device may schedule a targeted row refresh, which may ‘steal’ one of the timing slots that would have been used for an auto-refresh address. If the accesses to a particular memory locations are not above the threshold, then the targeted refresh may be skipped, and the auto-refresh addresses may continue. The memory device may periodically check the counter to determine if a targeted refresh address will be provided or not. In this manner, the targeted refreshes may be scheduled based on an access count of the memory device.
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
The semiconductor device 100 may employ a plurality of external terminals that include command and address (C/A) terminals coupled to a command and address bus to receive commands and addresses, and a CS signal, clock terminals to receive clocks CK and /CK, data terminals DQ 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 110 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 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 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 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, mode register write and read commands for performing mode register write and read operations, as well as other commands and operations. The access commands by 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 output to outside from the data terminals DQ via the input/output circuit 122. The external terminals DQ include several separate terminals, each providing a bit of data synchronized with a clock edge of a data clock of the device 100. The number of external terminals DQ corresponds a data width, that is, a number of bits of data concurrently provided with a clock edge of the data clocks. In some embodiments of the disclosure, the data width of the semiconductor device 100 is 8 bits. In other embodiments of the disclosure, the data width of the semiconductor device 100 is 16 bits, with the 16 bits separated into a lower byte of data (including 8 bits) and a upper byte of data (including 8 bits).
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 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. As previously described, the external terminals DQ include several separate terminals. With reference to a write operation, each external terminal DQ receives a bit of data, and the number of external terminals DQ corresponds to a data width of bits of data that are concurrently received synchronized to one or more clock signals. Some embodiments of the disclosure include a data width of 8 bits. In other embodiments of the disclosure, the data width is 16 bits, with the 16 bits separated into a lower byte of 8 bits of data and a upper byte of 8 bits of data.
The device 100 may also receive commands causing it to carry out an auto-refresh operation. The refresh signal AREF may be a pulse signal which is activated when the command decoder 106 receives a signal which indicates an auto-refresh command. In some embodiments, the auto-refresh command may be externally issued to the memory device 100. In some embodiments, the auto-refresh command may be periodically generated by a component of the device. In some embodiments, when an external signal indicates a self-refresh entry command, the refresh signal AREF may also be activated. The refresh signal AREF may be activated once immediately after command input, and thereafter may be cyclically activated at desired internal timing. Thus, refresh operations may continue automatically. A self-refresh exit command may cause the automatic activation of the refresh signal AREF to stop and return to an IDLE state.
The refresh signal AREF is supplied to the refresh address control circuit 116. The refresh address control circuit 116 supplies a refresh row address RXADD to the row decoder 108, which may refresh the predetermined word line WL contained in the memory cell array 118. The refresh address control circuit 116 may control a timing of a refresh operation, and may generate and provide the refresh address RXADD. The refresh address control circuit 116 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), or may operate based on internal logic.
The refresh address control circuit 116 may selectively output a targeted refresh address or an automatic refresh address (auto-refresh address) as the refreshing address RXADD. The automatic refresh addresses may be a sequence of addresses which are provided based on activations of the auto-refresh signal AREF. The refresh address control circuit 116 may cycle through the sequence of auto-refresh addresses at a rate determined by AREF. The refresh address control circuit 116 may also determine targeted refresh addresses which are addresses that require refreshing based on the access pattern of nearby addresses in the memory array 118. The refresh address control circuit 116 may selectively use one or more signals of the device 100 to calculate the targeted refresh address RXADD. For example, the refresh address RXADD may be a calculated based on the row addresses XADD provided by the address decoder.
The refresh address control circuit 116 may determine whether to issue an auto-refresh address or a targeted refresh address as the refresh address RXADD based on monitoring access commands which are issued to the memory array 118. The refresh address RXADD may be provided with a timing based on a timing of the refresh signal AREF. The refresh address control circuit 116 may have time slots corresponding to the timing of AREF, and may provide one or more refresh addresses RXADD during each time slot. In some embodiments, the targeted refresh 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 address control circuit 116 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.
The refresh address control circuit 116 may determine whether the provided refresh address RXADD is a targeted refresh address or an auto-refresh address based on monitoring the access commands to the memory array 118. In particular, the refresh address control circuit 116 may monitor the access commands which are issued to each bank of the memory array 116. The refresh address control circuit 116 is shown as coupled to the bank address BADD, however any signal (or other method) may be used to monitor the accesses to a particular bank (e.g., the refresh address control circuit 116 may monitor how often a particular bank is activated). The refresh address control circuit 116 may count a number (and/or rate) of activations to a given bank, and may compare that value to a threshold. The threshold may be a programmable value of device 100 (e.g., based on a fuse setting of the refresh address control circuit 116 and/or a value stored in a mode register of the device 100). When the number (and/or rate) of accesses to a given bank exceed the threshold, it may indicate that the bank is more likely to contain an address which is an aggressor address (e.g., due to the row hammer effect), and the refresh address control circuit 116 may provide a targeted refresh address. The refresh address control circuit 116 may provide the targeted refresh address right away, or may queue up the targeted refresh address to be provided at a later time (e.g., in the next time slot available for a targeted refresh).
The targeted refresh address may be based on characteristics over time of the row addresses XADD received from the address decoder 104. The refresh address control circuit 116 may sample the current row address XADD to determine its characteristics over time. The sampling may occur intermittently, with each sample acquired based on a random or pseudo-random timing. The refresh address control circuit 116 may use different methods to calculate a targeted refresh address based on the sampled row address XADD. For example, the refresh address control circuit 116 may determine if a given row is an aggressor address, and then calculate and provide addresses corresponding to victim addresses of the aggressor address as the targeted refresh address. In some embodiments, more than one victim address may correspond to a given aggressor address. In this case the refresh address control circuit may queue up multiple targeted refresh addresses, and provide them sequentially when it determines that a targeted refresh address should be provided.
The auto-refresh address may be provided by the refresh address control circuit 116 in order to periodically refresh the word lines of the memory array 118. The refresh address control circuit 116 may produce auto-refresh addresses in a sequence such that each time an auto-refresh address is provided as the refresh address RXADD, it is a next address in the sequence of auto-refresh addresses.
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 VPP, VOD, VARY, VPERI, and the like based on the power supply potentials VDD and VSS supplied to the power supply terminals. The internal potential VPP is mainly used in the row decoder 108, the internal potentials VOD and VARY are mainly used in the sense amplifiers SAMP included in the memory array 118, and the internal potential VPERI is used in many peripheral circuit blocks.
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.
As shown in
The refresh address control circuit 300 includes a targeted refresh address generator 340, which receives the row address XADD and provides the targeted refresh address StealAdd. The circuit 300 also includes an auto-refresh address generator 342 and a cycle generator 344. An example implementation of the cycle generator 344 is shown in more detail in
Although certain signals (XADD, AREF, BADD) are shown coupled to the components of the refresh address control circuit 300, it is to be understood that more or fewer, or different, signals may be used in other examples. For example, the cycle generator 344 may use signals other than (or in addition to) the bank address BADD to determine access to a given bank.
The targeted refresh address generator 340 identifies one or more target addresses StealAdd which require a targeted refresh. The targeted refresh address generator 340 may determine the row addresses for a targeted refresh in any number of ways. In an example embodiment, the targeted refresh address generator 340 may monitor the provided row addresses XADD to determine if one or more addresses is being hammered (e.g., accessed a certain number of times, faster than a given rate, etc.). The targeted refresh address generator 340 may then identify the addresses which are the victim rows on either side of the aggressor row (e.g., the rows which are physically adjacent to the hammered row). In this example embodiment, the targeted refresh address generator 340 may provide a first targeted refresh address StealAdd+1 and a second targeted refresh address StealAdd-1 corresponding to the addresses of the victim rows which are adjacent to the identified aggressor row. Other types of aggressor rows and other relationships between the victim rows and the aggressor rows may be used in other examples.
In some embodiments of the disclosure, the targeted refresh address generator 340 may determine a hammered aggressor row based on the number and/or frequency of accesses to a particular row. In some embodiments of the disclosure, the targeted refresh address generator 340 may sample incoming row addresses XADD at random (or semi-random) intervals, and the sampled row addresses may be compared to the previously sampled row addresses to determine if a given row address is being frequently accessed. Other methods of identifying hammered aggressor rows may be used in other example embodiments.
The targeted refresh address generator 340 provides one or more targeted refresh addresses StealAdd based on the row addresses XADD. In some embodiments the targeted refresh address generator 340 may provide a single targeted refresh address StealAdd. In some embodiments, the targeted refresh address generator 340 may provide a sequence of multiple targeted refresh addresses StealAdd over time. For example, as discussed above, the targeted refresh address generator 340 may provide a first and second targeted refresh address which correspond to the rows which are physically adjacent to a hammered row. As described in
The auto-refresh address generator 342 may provide a sequence of auto-refresh addresses responsive to an auto-refresh signal (e.g., AREF). The auto-refresh generator may sequentially move through a number of addresses in a memory bank. Each activation of the auto-refresh signal AREF may cause the auto-refresh address generator 342 to provide a next address in the sequence of addresses as the auto-refresh address CBRAdd. In some embodiments, the auto-refresh address generator 342 may provide multiple auto-refresh addresses CBRAdd with each activation of the auto-refresh signal AREF.
The auto-refresh generator 342 may be coupled to the targeted refresh signal RHR, which may indicate that a targeted refresh address StealAdd is going to be used as the refresh address RXADD. In some embodiments, the auto-refresh generator 342 may pause providing auto-refresh addresses CBRAdd while the targeted refresh signal RHR is active. Accordingly, when the targeted refresh signal RHR is no longer active, the auto-refresh address generator 342 may resume providing auto-refresh addresses at the same point in the sequence it was at before it received an active RHR signal.
The cycle generator 344 may determine the timing of whether the refresh address RXADD is an auto-refresh address or a targeted refresh address StealAdd based on the accesses (e.g., read and write commands) issued to a memory array (e.g., memory array 118 of
As shown in more detail in
In an example embodiment, the cycle generator 344 may be associated with a particular bank of the memory (e.g., Bank0, Bank1, . . . , Bankn). In some embodiments, the cycle generator 344 may be a component of the bank. Thus, for example, there may be multiple cycle generators 344 each associated with a respective bank of the memory array. Each cycle generator 344 may have a counter circuit 347 and a comparator circuit 349 which may monitor the accesses to the respective bank to which that the cycle generator 344 is associated.
The counter 347 may increment each time an access command is issued to that bank (e.g., as indicated by a bank address BADD). In some embodiments, the counters 347 may increment based on a specific combination of signals indicating one or more types of access commands. For example, the counter 347 for a given bank may increment when a bank address BADD and activate signal ACT are provided together, but may not increment when a bank address BADD and read/write signal R/W are provided together. When the counter 347 is equal to or greater than a threshold number of accesses, the cycle generator 344 may produce the signal RHR to indicate that the targeted refresh address StealAdd currently identified by the targeted refresh address generator 340 should be supplied as the refresh address RXADD. The counter 347 may be reset when a targeted refresh address is provided to a given bank.
In another example embodiment, rather than being associated with a particular bank, the counter circuit may include a plurality of counters, each associated with one of the banks. The comparator 349 may access particular counters in order to provide the signal RHR to a given one of the banks.
In some embodiments (for example, when rate is to be determined), the cycle generator 344 may include an oscillator 348, which may provide a timing signal to the counter 347. The oscillator may be synchronized to one or more signals of the device, such as the auto-refresh signal AREF. In some embodiments, the auto-refresh signal AREF may be used as the timing signal, and the oscillator 348 may not be needed to provide timing. The oscillator 348 may allow the value of the counter circuit 347 to reflect a rate rather than a raw number of accesses. The value of the counter circuit 347 may be compared to a threshold value which reflects a threshold rate.
In an example embodiment where rate is determined by the counter circuit 347, the oscillator 348 may act to produce a clock signal and provide it to the counter circuit 347. The counter circuit 347 may be periodically reset after a certain number of clock signals (e.g., after a certain amount of time). Accordingly, if the counter passes a threshold before being reset, it may indicate that the accesses are received at (or above) a certain threshold rate. In some embodiments, the clock signal may be synchronized to the auto-refresh signal AREF, or may be the auto-refresh signal AREF.
In another example embodiment where rate is determined by the counter circuit 347, the counter circuit 347 may decrement over time. The counter circuit 347 may increment when an access command is issued to that bank. The oscillator 348 may produce a clock signal. The counter circuit 347 may decrement responsive to the clock signal. The counter circuit 347 may thus only increase in value when access commands are received at a rate faster than the clock signal (e.g, when it is incrementing at a rate faster than it is decrementing). The value of the counter reaching a threshold value may be used to indicate that a rate of access commands is greater than a threshold rate determined by the clock signal.
The first line of the timing diagram 400 depicts an auto-refresh signal AREF. The auto-refresh signal may be provided by a device which is external to the memory device (e.g., a memory controller). The auto-refresh signal AREF may periodically transition from a low logical level (e.g., a low voltage) to a high logical level (e.g., a high voltage) and then back to a low logical level. Each transition to a high logical level (a rising edge) may be counted as an activation of the auto-refresh signal AREF.
The second line of the timing diagram 400 shows a bank activation counter. The counter may have a value which increments each time an access command is issued to a given bank. The value of the bank activation counter may be periodically reset to 0 (e.g., after a targeted refresh is carried out). There may be a plurality of such counters, for example, each of the counters associated with a different bank of the memory device. For the sake of brevity, only a single bank activation counter is shown in the example timing diagram 400.
The third line of the timing diagram 400 shows the refresh addresses issued to a given memory bank. Similar to the bank activation counter, there may be a plurality of lines of refresh addresses each issued to a different one of the banks, however for clarity only a single line of refresh addresses is shown. The refresh addresses are represented here as pulsed signals rising from a low logic level to a high voltage level and then returning to a low voltage level. This may represent a time slot, or a period of time over which a given refresh address is provided. The actual addresses may be provided as electrical signals which convey the actual address, and which may have waveforms which are more complicated than the pulses depicted in the timing diagram 400. For example, the actual addresses may be provided as multi-bit signals, which may be transmitted in series on a single data line, and/or in parallel on multiple data lines. Each pulse is labeled with the address which is provided during that period. CBRAdd is used to represent an auto-refresh address. Each of the CBRAdd addresses shown in the timing diagram 400 may represent different wordlines of the memory which are being refreshed, even though for the sake of brevity they all share a common label. The targeted refresh addresses are represented as StealAdd−1 and StealAdd+1, which represents the addresses adjacent to an identified aggressor row. Similar to the auto-refresh addresses CBRAdd, even though they share a label, each pair of targeted refresh addresses StealAdd−1 and StealAdd+1 may correspond to different aggressor rows of the memory.
In the particular embodiment represented in the timing diagram 400, each auto-refresh signal AREF may cause the refresh address control circuit to provide up to four refresh addresses. The refresh address control circuit may be configured in the example device such that one quarter of the provided refresh addresses are targeted refresh addresses (e.g., the device has a steal rate of ¼). For example, over two AREF activations, the refresh address control circuit may provide eight total refresh addresses. Six of these will be auto-refresh addresses CBRAdd, while two may be targeted refresh addresses StealAdd+1/−1.
At a first time t0, a targeted refresh operation occurs. At t0 AREF activates and rises from a low logic level to a high logic level. This causes the refresh address control circuit to provide four refresh addresses, two of which are targeted refresh addresses StealAdd-1 and StealAdd+1 and two of which are auto-refresh addresses CBRAdd. Since a targeted refresh operation was carried out, the bank activation counter is also reset to 0 (assume that the value was above the threshold prior to t0). After t0, the bank activation counter begins incrementing each time there is an access command issued to the corresponding bank. The counter may be responsive to any number of commands indicating access, such as an activation signal directed to a particular bank, a read/write command issued to a bank, a bank address, etc.
At t1, there is another activation of the AREF signal. The refresh address control circuit provides four auto-refresh addresses CBRAdd in four corresponding auto-refresh address time slots. Since there are no time slots allocated for targeted refresh addresses (since those only happen with every other AREF activation in this example embodiment), the value of the bank activation counter is not used to determine if targeted refresh addresses are provided. In some embodiments, the value of the counter may be compared to a threshold with the activation at t1, however the result may not be used. In some embodiments, the value of the counter may only be compared to the threshold when there is a possibility of a targeted refresh (e.g., at times t0, t2, etc. in the present example).
At t2, there is another activation of the AREF signal. This time the refresh address control circuit is configured to provide two auto-refresh addresses and two targeted refresh addresses due to the ¼ steal rate of the example device (for the two AREF signals at t1 and t2, there are eight total refresh addresses, two of which are allocated for targeted refresh addresses). The refresh address control circuit may provide the addresses in four time slots (set periods of time during which a refresh address can be provided). Two of the time slots may be auto-refresh address time slots and two may be targeted refresh address time slots. The refresh address control circuit may compare the value of the counter to a threshold value to determine if targeted refresh addresses are provided during the target refresh address time slots. In the example embodiment of the timing diagram 400, the threshold has been set to 200 activations. At t2, the bank activation counter has recorded 55 accesses, which is below the threshold value. Thus, at t2, the activation of AREF causes the refresh address control circuit to issue two auto-refresh addresses (one in each of the two auto-refresh time slots), but not any targeted refresh addresses as indicated by the dotted lines during the targeted refresh address time slots. In some embodiments, the refresh address control circuit may skip the targeted refresh addresses and may issue only the two auto-refresh addresses (e.g., the target refresh address time slots may pass with no refresh address provided in that time slot). In some embodiments, the refresh address control circuit may add in two additional auto-refresh addresses such that the same total number of refresh addresses are issued each time the auto-refresh signal activates (e.g., auto-refresh addresses may be provided during the target refresh address time slots).
At t3, there is another activation of AREF. Similar to the time t1, no targeted refresh addresses are issued or are scheduled to be issued at this activation. Accordingly, four auto-refresh addresses are issued in response to the AREF activation at t3.
At time t4, there is another activation of AREF. At this time, there are target refresh address time slots, so the value of the counter is compared to the threshold. At t4, the value of the bank activation counter is 211, which is above the threshold (e.g., 200) in this example embodiment. Thus, the refresh address control circuit provides two auto-refresh addresses CBRAdd during the auto-refresh address time slots, and two targeted refresh addresses StealAdd+1/−1 during the target refresh address time slots. Since targeted refresh addresses were provided, the counter will be reset back to 0.
Although a specific pattern of providing auto-refresh and targeted refresh addresses is discussed, it should be understood that any pattern of auto-refresh and targeted refresh addresses may be used. For example, the auto-refresh time slots may happen before the targeted refresh address time slots, or they may alternate. In another example, the device may be configured such that at each activation of the auto-refresh signal only a single refresh address is provided, which is an auto-refresh address unless the bank activation counter is above the threshold, in which case a targeted refresh address is provided instead. Thus, there may not be target refresh address time slots, and instead the refresh address control circuit may provide the targeted refresh addresses in time slots that would otherwise have been used for auto-refresh addresses.
The cycle generator 500 may receive the bank activation commands ActivateCmd and provide the targeted refresh signal RHR. The targeted refresh signal RHR may be used as the signal RHR of
The cycle generator 500 includes a NAND logic gate 550 which receives ActivateCmd and RHRF, which may be the logical inverse of RHR. The output of the NAND gate 550 is provided to an inverter 552, which provides an output to the CLK terminal of a first flip-flop circuit 554. Each of the flip-flop circuits 554a-h is coupled in series such that the output terminal Q of a given flip-flop circuit (e.g., 554b) is coupled to the clock terminal of a next flip-flop circuit (e.g., 554c) in the series. The output terminal Q of each flip-flop circuit 554 is also coupled through a corresponding inverter 556 to the input terminal D. Each of the flip-flop circuits 554 has a reset terminal which is coupled in common to a line which carries a StealFinished signal.
Each flip-flop circuit 554a-h has an output terminal Q which is coupled to one input of an XOR gate 558a. The other terminal of the XOR gate 558a is coupled to a bit of a Threshold signal provided by a threshold generator 560. The threshold generator 560 receives a fuse signal to set a level of the threshold, and then provides the threshold signal Threshold, which comprises a number of different bits each of which have values corresponding to the set threshold. The XOR gates 558a-h provide outputs to NOR gates 562a, b. The XOR gates 558a-d are coupled to NOR gate 562a, and the XOR gates 558e-h are coupled to NOR gate 562b. The outputs of the NOR gates 562a-b are coupled to the inputs of an AND gate 564, which provides the signal RHR as an output. The signal RHR is coupled through an inverter 566 to provide the inverse signal RHRF, which is coupled to the NAND gate 550.
The cycle generator 500 includes a counter circuit 547 which includes the NAND gate 550, inverter 552, flip-flop circuits 554a-h and inverters 556a-h. The counter circuit 547 counts the number of ActivateCmd signals received by changing the states of the flip-flop circuits 554a-h. The cycle generator 500 also includes a comparator circuit 549 which includes the threshold generator 560, the XOR gates 558a-h, NOR gates 562a,b, and AND gate 564. The XOR gates 558a-h of the comparator circuit 549 compare the state of each corresponding flip-flop circuit 554a-h to a corresponding bit of the Threshold signal to determine if the count stored in the flip-flop circuits 554 has exceeded the threshold. If the count has exceeded the threshold, then the signal RHR is provided to signal that a targeted refresh should occur. The signal RHR is also inverted with inverter 566 and used as feedback to pause the operation of the counter circuit once the threshold has been met. Once the targeted refresh occurs, the signal StealFinished is provided to reset the state of the flip-flop circuits 554a-h (thus resetting RHRF to a high logic level), resetting the cycle generator 500.
The NAND gate 550 and the inverter 552 work together to only provide a signal to the first flip-flop circuit 554a of the counter circuit when an ActivateCmd is provided, but the signal RHR is not currently being provided. The NAND gate 550 returns a low logical level only when both inputs (e.g., ActivateCmd and RHRF) are at a high logical level. Taking into account the effects of the inverters 552 and 566, this means that a high logical level is only provided to the CLK terminal of the first flip-flop circuit 554a when ActivateCmd is at a high logical level and RHR is at a low logical level (RHRF at a high logical level). In this manner, the flip-flop circuits 554 may be prevented from responding to further activations of ActivateCmd, and may thus stop counting the accesses, while the signal RHR is active.
The counter circuit may act as a binary counter. Each time the ActivateCmd signal activates (assuming that RHR is in a low logical state), the states of the flip-flop circuits 554a-h may selectively change such that the state of each flip-flop circuit 554a-h represents a bit of a binary number which is the number of activations of the ActivateCmd signal (since the previous reset). As an example, before first activation of ActivateCmd, all the flip-flop circuits 554a-h may be reset (e.g., by an activation of StealFinished) such that they each are at a low logical level. At a first activation of the ActivateCmd, the first flip-flop circuit 554a is triggered to provide its stored value (a low logical level) at the terminal Q, which then feeds back through inverter 556a to the input D, which causes the state of the first flip-flop circuit 554a to change to a high logical level. At a second activation of ActivateCmd, the first flip-flop circuit 554a provides its stored value (a high logical level) to the second flip-flop circuit 554b, which provides a low logical level on its output Q, which due to feedback through inverter 558b causes the second flip-flop circuit to transition to a high logical level. The first flip-flop circuit 554a transitions to a low logical level due to providing a high logical level on the output Q. In this manner the flip-flop circuits 554 count the number of activations of the ActivateCmd in a binary fashion.
The threshold generator 560 provides the ThreshHold signal, which is a binary number representing the threshold, with each digit of the binary number supplied to a different one of the XOR gates 558a-h. In the example cycle generator 500, the ThreshHold signal may be an 8-bit number. Accordingly, there may be 8 shift registers 554a-h and 8 XOR gates 558a-h. The value of the threshold (and thus the number expressed by the ThreshHold signal) may be a programmable value. The threshold generator 560 may receive a Fuse signal which sets the value of the threshold by specifying the state of fuses within the threshold generator 560. In an example embodiment, the threshold generator 560 may have 16 different threshold levels which are set by the status of 4 different fuses. The Fuse signal may be a 4-bit signal which specifies the state of each of the fuses in the threshold generator 560.
The XOR gates 558a-h each compare the value of a digit of the ThreshHold signal to the value stored in a flip-flop circuit 554 corresponding to a digit of the count of ActivateCmd activations. Each XOR gate 558 returns a high logic level when the inputs of the logic gate are different, and a low logic level when they are the same. The comparison of the lowest four digits (e.g., the outputs of XORs 558a-d) of the threshold and count are supplied to NOR gate 562a, while the highest four digits are supplied to NOR gate 562b. The NOR gates supply a high logical level only when all of the inputs to the NOR gate 562 are at a low logical level (e.g., each of the digits of ThreshHold and the count match each other). The output of the two NOR gates 562a,b are provided to the AND gate 564, which provides RHR at a high logical when both inputs are at a high logical level, and provides RHR at a low logical level otherwise.
In this manner, RHR is provided at a high logical level when the value of each of the flip-flop circuits 554a-h matches the value of the corresponding bit of the Threshold signal (e.g., when the count equals the value of the threshold). RHR transitioning to a high logical level may feedback (through inverter 566) to prevent the counter circuit from being responsive to further activations of ActivateCmd. Thus, once the count matches the value of the threshold, RHR may be provided at a high logic level until the signal StealFinished is provided to reset the counter circuit.
The method 600 may generally begin with block 610, which describes monitoring accesses to a memory bank. The memory bank may be part of a memory array (e.g., memory array 118 of
In some embodiments, there may be a plurality of memory banks associated with the memory array, and the accesses may be monitored on a bank-by-bank basis. In some embodiments, the access commands to a given memory bank may be counted in a counter circuit. In some embodiments, where the rate of access command to the memory bank is monitored, a counter may be incremented each time an access command is received, and decremented at a frequency. If the value of the counter exceeds a threshold, it may indicate that access commands are received at or above a certain rate, and a targeted refresh command may be provided.
Block 610 may generally be followed by 620, which describes providing refresh addresses to the memory bank over time. In some embodiments, monitoring the accesses and providing the refresh addresses (e.g., blocks 610 and 620) may generally happen simultaneously. The refresh addresses may be directed to specific addresses within the memory bank. Responsive to the refresh addresses, corresponding rows in the memory bank may be refreshed.
Block 620 may generally be followed by block 630, which describes providing a targeted refresh address as one of the refresh addresses based on the monitored accesses to the bank. The refresh addresses may generally be either auto-refresh addresses or targeted refresh addresses. The auto-refresh address may be one (or more) of a sequence of addresses of the memory. The targeted refresh addresses may be specific addresses of the memory bank that have been identified as requiring more frequent refresh operations.
In some embodiments, the method 600 may include generating the targeted refresh address. Accesses to addresses of the memory bank may be monitored. It may be determined if a given row of the memory bank is an aggressor row. The aggressor row may be determined based on a certain pattern (e.g., frequency, number, etc.) of accesses to the aggressor row. One or more victim rows may be determined based on the aggressor row. The victim rows may undergo increased data degradation due to their relationship with the aggressor row. In some embodiments, the aggressor row may be a row hammer row, and the victim rows may be physically adjacent to the aggressor row. The address of the victim row(s) may be provided as the targeted refresh address.
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.
This application is a divisional of U.S. patent application Ser. No. 16/886,284, filed May 28, 2020, which is a divisional of U.S. patent application Ser. No. 16/176,932, filed Oct. 31, 2018, issued as U.S. Pat. No. 10,685,696 on Jun. 16, 2020. These applications and patent are incorporated by reference herein in their entirety and for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
5225839 | Okurowski et al. | Jul 1993 | A |
5654929 | Mote | Aug 1997 | A |
5867442 | Kim et al. | Feb 1999 | A |
5956288 | Bermingham et al. | Sep 1999 | A |
5959923 | Matteson et al. | Sep 1999 | A |
5999471 | Choi | Dec 1999 | A |
5999473 | Harrington et al. | Dec 1999 | A |
6002629 | Kim et al. | Dec 1999 | A |
6064621 | Tanizaki et al. | May 2000 | A |
6306721 | Teo et al. | Oct 2001 | B1 |
6310814 | Hampel et al. | Oct 2001 | B1 |
6363024 | Fibranz | Mar 2002 | B1 |
6392952 | Chen et al. | May 2002 | B1 |
6490216 | Chen et al. | Dec 2002 | B1 |
6535950 | Funyu et al. | Mar 2003 | B1 |
6535980 | Kumar et al. | Mar 2003 | B1 |
6563757 | Agata | May 2003 | B2 |
7002868 | Takahashi | Feb 2006 | B2 |
7082070 | Hong | Jul 2006 | B2 |
7203113 | Takahashi et al. | Apr 2007 | B2 |
7565479 | Best et al. | Jul 2009 | B2 |
7692993 | Iida et al. | Apr 2010 | B2 |
8174921 | Kim et al. | May 2012 | B2 |
8400805 | Yoko | Mar 2013 | B2 |
8526260 | Yeon | Sep 2013 | B2 |
8572423 | Isachar et al. | Oct 2013 | B1 |
8756368 | Best et al. | Jun 2014 | B2 |
9076499 | Schoenborn et al. | Jul 2015 | B2 |
9076548 | Park et al. | Jul 2015 | B1 |
9190137 | Kim et al. | Nov 2015 | B2 |
9236110 | Bains et al. | Jan 2016 | B2 |
9251885 | Greenfield et al. | Feb 2016 | B2 |
9299400 | Bains et al. | Mar 2016 | B2 |
9311984 | Hong et al. | Apr 2016 | B1 |
9390782 | Best et al. | Jul 2016 | B2 |
9396786 | Yoon et al. | Jul 2016 | B2 |
9406358 | Lee | Aug 2016 | B1 |
9418723 | Chishti et al. | Aug 2016 | B2 |
9570201 | Morgan et al. | Feb 2017 | B2 |
9653139 | Park | May 2017 | B1 |
9685240 | Park | Jun 2017 | B1 |
9691466 | Kim | Jun 2017 | B1 |
9734887 | Tavva | Aug 2017 | B1 |
9761297 | Tomishima | Sep 2017 | B1 |
9812185 | Fisch et al. | Nov 2017 | B2 |
9818469 | Kim et al. | Nov 2017 | B1 |
9831003 | Sohn et al. | Nov 2017 | B2 |
9865328 | Desimone et al. | Jan 2018 | B1 |
9978430 | Seo et al. | May 2018 | B2 |
10020045 | Riho | Jul 2018 | B2 |
10020046 | Uemura | Jul 2018 | B1 |
10049716 | Proebsting | Aug 2018 | B2 |
10090038 | Shin | Oct 2018 | B2 |
10141042 | Richter | Nov 2018 | B1 |
10192608 | Morgan | Jan 2019 | B2 |
10297307 | Raad et al. | May 2019 | B1 |
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 |
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 |
20020026613 | Niiro | Feb 2002 | A1 |
20020191467 | Matsumoto et al. | Dec 2002 | A1 |
20030026161 | Yamaguchi et al. | Feb 2003 | A1 |
20030081483 | De et al. | May 2003 | A1 |
20030161208 | Nakashima et al. | Aug 2003 | A1 |
20030231540 | Lazar et al. | Dec 2003 | A1 |
20040024955 | Patel | Feb 2004 | A1 |
20050002268 | Otsuka et al. | Jan 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 |
20060104139 | Hur et al. | May 2006 | A1 |
20060198220 | Yoon et al. | Sep 2006 | A1 |
20060215474 | Hokenmaier | Sep 2006 | A1 |
20060233012 | Sekiguchi et al. | Oct 2006 | A1 |
20060262617 | Lee | Nov 2006 | A1 |
20060268643 | Schreck et al. | Nov 2006 | A1 |
20070002651 | Lee | Jan 2007 | A1 |
20070014175 | Min et al. | Jan 2007 | A1 |
20070028068 | Golding 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 |
20070263442 | Cornwell et al. | Nov 2007 | A1 |
20080028137 | Schakel et al. | Jan 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 |
20080270683 | Barth et al. | Oct 2008 | A1 |
20080306723 | De 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 |
20090228739 | Cohen et al. | Sep 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 |
20100097870 | Kim et al. | Apr 2010 | A1 |
20100124138 | Lee et al. | May 2010 | A1 |
20100128547 | Kagami | May 2010 | A1 |
20100141309 | Lee | Jun 2010 | A1 |
20100182862 | Teramoto | Jul 2010 | A1 |
20100182863 | Fukiage | Jul 2010 | A1 |
20110055495 | Remaklus et al. | Mar 2011 | A1 |
20110134715 | Norman | Jun 2011 | A1 |
20110225355 | Kajigaya | Sep 2011 | A1 |
20110299352 | Fujishiro et al. | Dec 2011 | A1 |
20120155173 | Lee et al. | Jun 2012 | A1 |
20120155206 | Kodama et al. | Jun 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 |
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 |
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 |
20140089758 | Kwok et al. | Mar 2014 | A1 |
20140095780 | Bains 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 |
20140181453 | Jayasena et al. | Jun 2014 | A1 |
20140185403 | Lai | Jul 2014 | A1 |
20140219042 | Yu et al. | Aug 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 |
20150078112 | Huang | Mar 2015 | A1 |
20150085564 | Yoon 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 |
20150199126 | Jayasena et al. | Jul 2015 | A1 |
20150206572 | Lim et al. | Jul 2015 | A1 |
20150356048 | King | Dec 2015 | A1 |
20150380073 | Joo et al. | Dec 2015 | A1 |
20160027498 | Ware et al. | Jan 2016 | A1 |
20160070483 | Yoon et al. | Mar 2016 | A1 |
20160078846 | Liu et al. | Mar 2016 | A1 |
20160155491 | Roberts et al. | Jun 2016 | A1 |
20160180921 | Jeong | Jun 2016 | A1 |
20160202926 | Benedict | Jul 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 |
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 |
20170221546 | Loh et al. | Aug 2017 | A1 |
20170269861 | Lu et al. | Sep 2017 | A1 |
20170287547 | Ito | Oct 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 |
20180158507 | Bang | 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 |
20180341553 | Koudele et al. | Nov 2018 | A1 |
20190043558 | Suh 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 |
20190115069 | Lai | Apr 2019 | A1 |
20190122723 | Ito et al. | Apr 2019 | A1 |
20190129651 | Wuu et al. | May 2019 | A1 |
20190130960 | Kim | May 2019 | A1 |
20190161341 | Howe | May 2019 | A1 |
20190190341 | Beisele et al. | Jun 2019 | A1 |
20190196730 | Imran | Jun 2019 | A1 |
20190205253 | Roberts | Jul 2019 | A1 |
20190237132 | Morohashi | Aug 2019 | A1 |
20190252020 | Rios 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 |
20190348102 | Smith et al. | Nov 2019 | A1 |
20190362774 | Kuramori et al. | Nov 2019 | A1 |
20190385661 | Koo et al. | Dec 2019 | A1 |
20190385668 | Fujioka et al. | Dec 2019 | A1 |
20190385670 | Notani 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 |
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 |
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 |
20220093165 | Mitsubori et al. | Mar 2022 | A1 |
20220165328 | Ishikawa et al. | May 2022 | A1 |
20220189539 | Li et al. | Jun 2022 | A1 |
20220199144 | Roberts | Jun 2022 | A1 |
20220270670 | Wu et al. | Aug 2022 | A1 |
20230352075 | Suzuki | Nov 2023 | A1 |
20230352076 | He et al. | Nov 2023 | A1 |
Number | Date | Country |
---|---|---|
825677 | Aug 1975 | BE |
1841551 | Oct 2006 | CN |
1879173 | Dec 2006 | CN |
101026003 | Aug 2007 | CN |
101047025 | Oct 2007 | CN |
101211653 | Jul 2008 | CN |
101243450 | Aug 2008 | CN |
102301423 | Dec 2011 | CN |
102663155 | Sep 2012 | CN |
102931187 | Feb 2013 | CN |
104350546 4 | 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 |
4911510 | Jan 2012 | JP |
6281030 | Jan 2018 | JP |
20030063947 | Jul 2003 | KR |
20070109104 | Nov 2007 | KR |
201801079 | Jan 2018 | TW |
2019222960 | Nov 2019 | WO |
2020010010 | Jan 2020 | WO |
2020117686 | Jun 2020 | WO |
2020247163 | Dec 2020 | WO |
2020247639 | Dec 2020 | WO |
Entry |
---|
U.S. Appl. No. 18/356,502, titled “Refresh Modes for Performing Various Refresh Operation Types” filed Jul. 21, 2023, pp. all pages of application as filed. |
Kyungbae Park et al. “Experiments and Root Cause Analysis for Active-Precharge Hammering Fault in DDR3 SDRAM Under 3 X NM Technology”; Microelectronics Reliability: An Internet. Journal and World Abstracting Service; vol. 57, Dec. 23, 2015; pp. 39-46. |
U.S. Appl. No. 16/537,981 titled “Apparatuses and Methods for Controlling Targeted Refresh Rates”, filed Aug. 12, 2019. |
U.S. Appl. No. 16/290,730, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 1, 2019. |
U.S. Appl. No. 16/374,623, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Apr. 3, 2019. |
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. |
U.S. Appl. No. 17/731,645, titled “Apparatuses and Methods for Access Based Targeted Refresh Operations”, filed Apr. 28, 2022; pp. all pages of application as filed. |
U.S. Appl. No. 18/467,097, titled “Apparatuses and Methods for Controlling Steal Rates” filed Sep. 14, 2023. |
U.S. Appl. No. 18/505,199, titled “Apparatuses and Methods for Distributed Targeted Refresh Operations” filed Nov. 9, 2023. |
Number | Date | Country | |
---|---|---|---|
20230105151 A1 | Apr 2023 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16886284 | May 2020 | US |
Child | 18064773 | US | |
Parent | 16176932 | Oct 2018 | US |
Child | 16886284 | US |