Refresh modes for performing various refresh operation types

Information

  • Patent Grant
  • 11749331
  • Patent Number
    11,749,331
  • Date Filed
    Tuesday, May 10, 2022
    2 years ago
  • Date Issued
    Tuesday, September 5, 2023
    9 months ago
Abstract
Apparatuses, systems, and methods for refresh modes. A memory may need to perform targeted refresh operations to refresh the ‘victim’ word lines which are near to frequently accessed ‘aggressor’ word lines. To refresh the victims at a high enough rate, it may be desirable to refresh multiple victims as part of the same refresh operation. However, certain word lines (e.g., word lines in a same section or adjacent sections of the memory) cannot be refreshed together. The memory may have a section comparator, which may check stored aggressor addresses and may provide a signal if there are not two stored addresses which can be refreshed together. Based, in part, on the signal, the memory may activate one of several different refresh modes, which may control the types of refresh operation performed responsive to a refresh signal.
Description
BACKGROUND

This disclosure relates generally to semiconductor devices, such as semiconductor memory devices. The semiconductor memory device may include a number of memory cells which are used to store information. The stored information may be encoded as binary data, and each memory cell may store a single bit of the information. The information in the memory cells may decay over time. To prevent the loss of information, the memory may periodically refresh the information in the memory cells.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of a semiconductor device according an embodiment of the disclosure.



FIG. 2 is a block diagram of a memory array according to some embodiments of the present disclosure.



FIG. 3 is a block diagram of a refresh control circuit according to some embodiments of the present disclosure.



FIG. 4 is a block diagram of a bank portion of a refresh control circuit according to some embodiments of the present disclosure.



FIG. 5 is a state diagram of refresh modes of a memory according to some embodiments of the present disclosure.



FIG. 6 is a timing diagram of different refresh modes according to some embodiments of the present disclosure.



FIG. 7 is a state diagram of a memory with a refresh management mode according to some embodiments of the present disclosure.



FIG. 8 is a timing diagram of different refresh modes according to some embodiments of the present disclosure.



FIG. 9 is a flow chart of a method according to some embodiments of the present disclosure.





DETAILED DESCRIPTION

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 memory device may include a memory array which has a number of memory cells, each located at the intersection of a word line (row) and digit line (column). Information may be stored in the memory cells (e.g., as a charge on a capacitive element). The information may decay over time. The memory may refresh the memory cells to restore the value of the information stored therein. For example, the memory may enter a self-refresh mode where the memory is refreshed on a row-by-row basis. For example, a first group of rows may be refreshed, then a next group of rows, etc. Refreshing one or more rows from such a sequence may be referred to as an auto-refresh operation. The rate at which the rows are refreshed may be based on a rate of information decay, and the memory may work its way through the sequence of auto-refresh operations such that information is not lost.


Certain conditions may increase the rate at which information decays in the memory. For example, if a particular row is accessed repeatedly, the memory cells in nearby rows may decay at an increased rate. Accordingly, it may be important to identify the repeatedly accessed ‘aggressor’ rows so that their nearby ‘victim’ rows can be refreshed as part of a targeted refresh. During a self-refresh mode, the memory may perform a mix of auto-refresh and targeted refresh operations, to ensure that victim rows are refreshed in a timely manner, since the information therein might otherwise decay before they were refreshed as part of an auto-refresh operation. However, this may lead to trade-offs, since the targeted refresh operations may consume timeslots which would have otherwise been used for auto-refresh operations.


To save on time, the memory may refresh multiple rows at the same time. However, certain addresses cannot be refreshed as part of the same refresh operation. While the addresses used as part of the auto-refresh operations may be predictable and may be chosen such that multiple addresses can be simultaneously refreshed, the addresses involved in targeted refreshes are not generally predictable, and may include addresses which cannot be refreshed together. For example, the memory may identify victim rows which cannot be simultaneously refreshed (e.g., because they are in a same section of the memory). It may be important to dynamically reallocate the types of refreshes the memory performs to account for different conditions of the memory.


The present disclosure is directed to apparatuses, systems, and methods for refresh modes. A memory may have different refresh modes. Responsive to a refresh signal, the memory may perform different numbers and types of refresh operations based on the active refresh mode. For example, a first mode may include targeted refresh operations where more than one victim address is refreshed at once, while a second mode may include targeted refresh operations where only one victim address is refreshed at a time. The memory may monitor various indicators of the memory to determine which refresh mode to activate. For example a refresh control circuit may track if identified aggressor rows are in a same section of memory or not. If they are not, then the first refresh mode can be used. If they are, and cannot be refreshed simultaneously, then the second refresh mode may be used.


In some embodiments, the memory may include additional refresh modes, which may help to ensure that both auto and targeted refresh operations are being performed at a high enough rate to prevent information decay. For example, the memory may include a counter which is changed based on the active refresh mode. Based, in part, on the counter additional refresh modes may be activated, where, for example, only auto-refresh operations are performed.



FIG. 1 is a block diagram of a semiconductor device according an embodiment of the disclosure. The semiconductor device 100 may be a semiconductor memory device, such as a DRAM device integrated on a single semiconductor chip.


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 FIG. 1, the memory array 118 is shown as including eight memory banks BANK0-BANK7. More or fewer banks may be included in the memory array 118 of other embodiments. Each memory bank includes a plurality of word lines WL, a plurality of bit lines BL, and a plurality of memory cells MC arranged at intersections of the plurality of word lines WL and the plurality of bit line BL. The selection of the word line WL is performed by a row decoder 108 and the selection of the bit lines BL is performed by a column decoder 110. In the embodiment of FIG. 1, the row decoder 108 includes a respective row decoder for each memory bank and the column decoder 110 includes a respective column decoder for each memory bank. The bit lines BL are coupled to a respective sense amplifier (SAMP). Read data from the bit line BL is amplified by the sense amplifier SAMP, and transferred to read/write amplifiers 120 over complementary local data lines (LIOT/B), transfer gate (TG), and complementary main data lines (MIOT/B). Conversely, write data is transferred to the sense amplifier SAMP over the complementary main data lines MIOT/B, the transfer gate TG, and the complementary local data lines LIOT/B, and written in the memory cell MC coupled to the bit line BL.


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 106 and to an internal clock generator 114. The internal clock generator 114 provides various internal clocks LCLK based on the ICLK clock. The LCLK clocks may be used for timing operation of various internal circuits. The internal data clocks LCLK are provided to the input/output circuit 122 to time operation of circuits included in the input/output circuit 122, for example, to data receivers to time the receipt of write data.


The 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 power supply terminals are also supplied with power supply potentials VDDQ and VSSQ. The power supply potentials VDDQ and VSSQ are supplied to the input/output circuit 122. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals may be the same potentials as the power supply potentials VDD and VSS supplied to the power supply terminals in an embodiment of the disclosure. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals may be different potentials from the power supply potentials VDD and VSS supplied to the power supply terminals in another embodiment of the disclosure. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals are used for the input/output circuit 122 so that power supply noise generated by the input/output circuit 122 does not propagate to the other circuit blocks.


The 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, as well as other commands and operations. The access commands may be associated with one or more row address XADD, column address YADD, and bank address BADD to indicate the memory cell(s) to be accessed.


The commands may be provided as internal command signals to a command decoder 106 via the command/address input circuit 102. The command decoder 106 includes circuits to decode the internal command signals to generate various internal signals and commands for performing operations. For example, the command decoder 106 may provide a row command signal to select a word line and a column command signal to select a bit line.


The device 100 may receive an access command which is a read command. When a read command is received, and a bank address, a row address and a column address are timely supplied with the read command, read data is read from memory cells in the memory array 118 corresponding to the row address and column address. The read command is received by the command decoder 106, which provides internal commands so that read data from the memory array 118 is provided to the RW amplifiers 120, which then provide the data along a global data bus to the IO circuit 122. The read data is output to outside the device 100 from the data terminals DQ via the input/output circuit 122.


The device 100 may receive an access command which is a write command. When the write command is received, and a bank address, a row address and a column address are timely supplied with the write command, and write data is supplied through the DQ terminals to the RW amplifiers 120. The write data is written to a memory cells in the memory array 118 corresponding to the bank address, 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 device 100 may also receive commands causing it to carry out one or more refresh operations as part of a self-refresh mode. In some embodiments, the self-refresh mode command may be externally issued to the memory device 100. In some embodiments, the self-refresh mode 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 a pulse signal which is activated when the command decoder 106 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 self-refresh mode. 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 control circuit 116.


Responsive to each pulse of the refresh signal AREF, a number of word lines of the memory array 118 may be refreshed. The refresh control circuit 116 may generate a number of internal ‘pumps’ associated with each pulse of the refresh signal AREF. Each pump may be accompanied by one or more refresh addresses RXADD, which may indicate which word line(s) should be refreshed as part of that pump. For example, the refresh control circuit 116 may receive the refresh signal AREF and may issue two pumps. The first pump may be associated with a first refresh address RXADD1, and the second pump may be associated with refresh addresses RXADD2 and RXADD3. In some embodiments, each refresh address may be used to indicate more than one word line. Continuing the previous example, the first refresh address RXADD1 may cause 4 word lines to be refreshed, while the second and third refresh addresses RXADD2 and RXADD3 may each cause one word line to be refreshed. The different pumps (and refresh addresses) may be associated with auto-refresh or targeted refresh operations.


The auto-refresh operations may involve refreshing word lines in a sequence (e.g., WL0, WL1, WL2, . . . WLn, WL0). The refresh addresses issued as part of an auto-refresh operation may be referred to as auto-refresh addresses. Targeted refresh operations may involve selecting specific word lines to refresh. For example, the refresh control circuit 116 may track accesses to the memory array 118 in order to identify aggressor rows (and/or potential aggressor rows) and may calculate the address(es) of the victims of those aggressors to be refreshed as part of a targeted refresh operation. For the sake of brevity, the term aggressor address will be used to refer to addresses identified by the memory as aggressors, regardless of whether they are actual or potential aggressors.


The refresh control circuit 116 may perform a mix of auto-refresh operations and targeted refresh operations. The type of refresh operation performed may be based on how the refresh address RXADD is generated. Thus a first pump may be an auto-refresh operation, a second pump may be a targeted refresh operation, etc. The refresh control circuit 116 may decide how many pumps to generate and how to allocate the pumps between different refresh operations. The refresh control circuit 116 may activate one or more different refresh modes, which may govern the number and type of refresh operation performed responsive to an activation of the refresh signal AREF. Different types of refresh mode that may be activated are discussed in more detail herein. The refresh control circuit 116 may include logic (e.g., a state machine) which determines which refresh mode is active. After performing refresh operations responsive to an activation of the refresh signal AREF, the refresh control circuit 116 may use one or more criteria to determine if a same or a different refresh mode should be activated.


While some refresh modes are active, the refresh control circuit 116 may issue two refresh addresses as part of each pump when performing a targeted refresh operation. However, there may be circumstances where this is not possible, because the two refresh addresses are associated with word lines which cannot both be refreshed at the same time. For example, the two addresses may represent word lines in the same (or adjacent sections as each other). The refresh control circuit 116 may store aggressor word lines in an aggressor detector circuit. The refresh control circuit 116 may check to see if there are at least two stored aggressors which can be refreshed at the same time (e.g., because they are in different non-adjacent sections). If so, a first refresh mode may be activated where victims based on those addresses are both refreshed as part of the same refresh pump. If not, a second refresh mode may be activated where victims based on those addresses are refreshed sequentially.



FIG. 2 is a block diagram of a memory array according to some embodiments of the present disclosure. The memory array 200 may, in some embodiments, be included in the memory array 118 of FIG. 1. The memory array 200 is a simplified view of a memory array to help illustrate the problem of refreshing multiple word lines in the same (or adjacent) sections as part of the same refresh operation.


The memory array 200 includes three sections, section 0210, section 1220, and section 2230. Each section includes a number of memory cells at the intersection of digit lines 203 and word lines such as word lines 212, 222, 224, and 232. For the sake of clarity, only a limited number of sections, digit lines, and word lines are shown. Other example embodiments may have more (or fewer) sections, digit lines, and word lines.


The digit lines may be coupled to a set of sense amplifiers, which may be shared between different adjacent sections. For example, sense amplifiers 204 are shared by both section 0210 and section 1220, while sense amplifiers 206 are shared by both section 1220 and section 2230. During a refresh operation, a word line indicated by the refresh address RXADD may be activated. The digit lines 203 may read the information from the activated word line out to the sense amplifiers. The sense amplifiers may use the non-activated digit lines 203 in the adjacent section as a reference voltage. The sense amplifiers may determine the value read out along the active digit line based on a comparison of the voltage read out with the reference voltage, and may then restore the initial value of the memory cell back along the digit line to the memory cell at the intersection with the active word line.


It may not be possible to simultaneously refresh two word lines which are in the same section, such as the word lines 222 and 224. The digit lines which intersect the word line 222 may also intersect the word line 224. Accordingly, the sense amplifiers 204 and 206 can't read and write data to both word lines 222 and 224 at the same time.


It may also not be possible to simultaneously refresh two word lines which are in different but adjacent sections, since the shared sense amplifiers can't be used to read data from digit lines in both of the coupled sections at the same time. For example, if the refresh address indicates the word line 222, then information may be read out along digit lines 203 to the sense amplifiers 204 and to the sense amplifiers 206. The sense amplifiers 204 may use the digit lines 203 in the section 210 as a reference, while the sense amplifiers 206 may use the digit lines 203 in the section 230 as a reference. Accordingly, while only a word line 222 in the section 220 is active, the digit lines of the adjacent sections 210 and 230 are in use to provide reference voltages to the sense amplifiers 204 and 206. Thus, while the word line 222 is being refreshed it may not be possible to refresh word lines 212 or 232 at the same time. Note that it would be possible to refresh word lines 212 and 232 at the same time since they are in non-adjacent sections 210 and 230 respectively, and no sense amplifiers are shared.


Referring back to FIG. 1, the refresh control circuit 116 may include a section comparator, which checks to see if the stored addresses which have been identified as aggressors are in the same section or not (since their victims to be refreshed will also be in the same section as the aggressors). The section comparator may also check to see if they are in adjacent sections or not. The value of the row address may be used to check for section similarity/adjacency. For example a portion of the row address (e.g., a subset of the bits of the row address) may indicate which section the word line associated with that row address is in. If there are multiple aggressor addresses stored in the aggressor detector which are associated with word lines in different (non-adjacent) sections, then the refresh control circuit 116 may provide multiple refresh addresses as part of a targeted refresh operation. If all of the aggressors are in the same (or mutually adjacent) sections, then the refresh control circuit 116 may provide one refresh address as part of each targeted refresh operation. For example, the addresses in the aggressor detector may all be associated with word lines in sections adjacent to at least one other address in the aggressor detector, however as long as there is at least a pair that is non-adjacent to each other, the victims of that pair may be refreshed together. For example, if the memory stores addresses for word lines 212, 222, 224, and 232, even though all those addresses are associated with word lines in at least one other adjacent section, word lines 212 and 232 may be refreshed at the same time.



FIG. 3 is a block diagram of a refresh control circuit according to some embodiments of the present disclosure. The refresh control circuit 300 may, in some embodiments, be included in the refresh control circuit 116 of FIG. 1.


The refresh control circuit 300 may have a first portion 310 which is shared between the banks, and individual bank logic 320, each of which may be associated with one of the banks of the memory array (e.g., 118 of FIG. 1). In the example of FIG. 3, there may be 32 banks (e.g., Bank0 to Bank31), however more or fewer banks may be used in other example embodiments. The bank logic 320 will be described in more detail in FIG. 4.


The refresh control circuit 300 may receive an activation (e.g., a pulse) of the refresh signal AREF. Based on a currently active refresh mode, the central portion 310 of the refresh control circuit 300 provides a number of pump signals to the bank logic portions 320, which in turn provide refresh addresses to their respective banks' row decoders. For example, the central portion 310 may provide a signal Rfsh which indicates that an auto-refresh operation should be performed and a signal RHR which indicates that a targeted refresh operation should be performed. In some embodiments, the bank portions 320 may receive the signals Rfsh and RHR in common. Accordingly, each of the banks may perform the same number of pumps and the same types of refresh operation in common based on which refresh mode is activated by the central portion 310.


The central portion 310 includes a dynamic steal rate control circuit 312 which determines which refresh mode is currently active. For example, the dynamic steal rate control circuit 312 may act as a state machine, and may enable one of several different refresh modes. In the example of FIG. 3, the refresh control circuit 300 has four different modes (e.g., Mode0 to Mode3). The details of different refresh modes will be discussed in more detail in FIGS. 5-6. Which refresh mode is active may, in part, determine the number and type of the pump signals Rfsh and RHR which are provided to the bank portions 320.


The dynamic steal rate control circuit 312 provides enable signals to indicate which refresh mode the device is currently in. For example, the dynamic steal rate control circuit 312 may have an enable signal for each of the modes Mode0En, Mode1En, Mode2En, and Mode3En. These may be binary signals which are in a high level when that mode is enabled (while the other enable signals may be at a low level). Other schemes may be used in other example embodiments for the enable signals. For example a single multi-bit enable signal may be used, which has different states for different modes (e.g., a two bit signal with four states, one for each mode).


The dynamic steal rate control circuit 312 may use various methods to determine which refresh mode to enable. For example, the dynamic steal rate control circuit 312 may include a steal rate control counter 314. The steal rate control counter 314 may manage a steal rate control count (SRCC) value which is used to track a deficit of auto-refresh operations. For example, if the memory enters a refresh mode where auto-refresh refresh operations are primarily performed, then the steal rate control counter 314 may increase the SRCC value. When the memory enters a refresh mode where targeted refresh operations are primarily performed, the steal rate control counter 314 may decrease the SRCC value. The SRCC value being at a minimum (and/or below a threshold) may trigger the activation of a refresh mode where more auto-refresh operations are performed. More details of the management of the steal rate control counter 314 is discussed in FIG. 5. The steal rate control counter 314 may store the SRCC value as a binary number. The number of bits used to store the SRCC may be based, in part, on the calculations used to determine which refresh modes should be used with what frequency. In some embodiments, the SRCC may be a 4 bit number. Other lengths of the SRCC may be used in other embodiments. The length of the SRCC value may be based, in part, on the desired rates of auto-refresh and targeted refresh operations.


The dynamic steal rate control circuit 312 may also receive a same section signal SameSecRequestBnk from the bank portions 320 of the refresh control circuit 300. The signal SameSecRequestBnk may indicate if any (and which) of the bank portions 320 are holding detected aggressor addresses which are all in the same section (or all in sections which are mutually adjacent to each other). For example, the signal SameSecRequestBnk may be a multi-bit signal with a single bit representing each bank. The bit for a given bank may be active if that bank portion 320 is holding aggressors which are in the same (or mutually adjacent) sections. In some embodiments, the dynamic steal rate control 312 may determine which refresh mode to use based on the SRCC value and whether or not any of the bits of the signal SameSecRequestBnk are at a high logical level.


The central portion 310 of the refresh control circuit 300 may also include a refresh timing control circuit 316. The refresh timing control circuit 316 may manage and provide various internal signals based on the refresh mode indicated by the refresh mode signals Mode0En to Mode3En. For example the refresh timing control circuit 316 may receive the refresh signal AREF and may generate a number of timing signals, which may in turn control the activation of one or more pump signals. For example, the refresh timing control circuit 316 may provide an auto-refresh signal Rfsh and a targeted refresh signal RHR. The auto-refresh signal Rfsh and targeted refresh signal RHR may be provided in common to the bank logic portions 320. When the signal Rfsh is active (e.g., at a high logical level), it may indicate that an auto-refresh operation should be performed. When the signal RHR is at an active level (e.g., at a high logical level) it may indicate that a targeted refresh operation should be performed. By managing the timing of when the signals Rfsh and RHR are active, the refresh timing circuit 316 can control how many refresh operations are performed responsive to each AREF signal, and which types of operations are performed. The bank portions 320 may then issue refresh addresses to their respective row decoders to perform the actual refresh operations.


The behavior of the refresh timing control circuit 316 may be based on which of the mode enable signals Mode0En to Mode3En is active (e.g., based on which refresh mode is active). For example, if the first refresh mode signal Mode0En is at an active level, then responsive to an activation of the refresh signal AREF, the refresh timing control circuit 316 may provide the signal Rfsh (e.g., to indicate an auto-refresh operation) and then provide the signal RHR twice (e.g., to indicate two targeted refresh operations). In some embodiments, the refresh timing control circuit 316 may also generate and provide the auto-refresh address along with the signal Rfsh, and may determine which and how many word lines are associated with the auto-refresh address based on the active refresh mode enable signals is active. In some embodiments, the auto-refresh addresses may be generated by the bank logic 320, and various additional signals (not shown) may be passed to the bank logic 320 to control which and how many word lines are associated with the auto-refresh address.



FIG. 4 is a block diagram of a bank portion of a refresh control circuit according to some embodiments of the present disclosure. The bank portion 400 may, in some embodiments, be included in the bank portion 320 of FIG. 3. The bank portion 400 may be associated with a single bank of the memory array, and may manage refresh operations by providing refresh addresses to a row decoder 430 (e.g., row decoder 108 of FIG. 1), which may then refresh the row(s) indicated by the refresh address(es) RXADD.


The bank portion 400 may include an auto-refresh address control circuit 420, which may be used to manage the auto-refresh addresses. Responsive to the auto-refresh signal Rfsh at an active level, the auto-refresh control circuit 420 may provide an auto-refresh address RXADD. For example, each auto-refresh address may indicate a certain number of word lines (e.g., 4 word lines) which may be refreshed at the same time. The auto-refresh address RXADD may indicate multiple word lines by truncating part (e.g., some number of bits) of the row address, such that the refresh address indicates multiple word lines. After providing a refresh address RXADD, the auto-refresh address control 420 may update the refresh address in order to move to a next set of wordlines in a sequence of word lines. For example, the auto-refresh address control circuit 420 may increment certain bits of the refresh address RXADD to generate the next refresh address. In some embodiments, the auto-refresh address control 420 may be located in a central portion (e.g., 310 of FIG. 3) of the refresh control circuit.


The bank portion 400 may include various circuits and structures for detecting aggressor addresses and calculating refresh addresses based on the victims of those aggressors. For example, the bank portion 400 may include an aggressor detector circuit. The aggressor detector circuit may store received row addresses XADD, and may identify aggressors based on the stored row addresses. For example, the aggressor detector may include a memory structure, such as a content-addressable memory (CAM) 402. The CAM 402 may have a number of registers, each of which may hold a received memory address, such as row address XADD. The row addresses may be provided along an address bus as part of an access operation to the row associated with that row address XADD. The received row address may be compared to the other addresses already stored in the CAM 402. If there is not a match, the received row address may be stored in the CAM 402 (replacing an old address if needed). If there is a match, then the address may be identified as an aggressor. In some embodiments, each register in the CAM 402 may be associated with a counter, which may increment when there is a match. The value of the counter may be used to identify aggressors.


In some embodiments, the CAM 402 may receive every address XADD along the row address bus. In some embodiments, the CAM 402 may receive a sampling signal, and may only receive the address XADD when the sampling signal is active. The sampling signal may be activated with random, semi-random, and/or pseudo-random timing in some embodiments.


The CAM 402 may be managed by a steal output control circuit 410. The steal output control circuit 410 may determine which of the addresses stored in the CAM 410 should be used to calculate victim addresses. The selected aggressors may generally be referred to as ‘seed’ addresses. The steal output control circuit 410 may include an output priority control circuit 412, which may select which of the addresses stored in the CAM 402 should be used as seeds. For example, the steal output control 412 may select the two oldest addresses in the CAM 402, or the two addresses which have been most recently matched to addresses along the address bus.


The steal output control circuit 410 may also have a section comparator circuit 414. The section comparator 414 may check the addresses in the CAM 402 to determine if the addresses in the CAM 402 are in the same (or adjacent) sections of the memory. If there are at least two addresses which are in different, non-adjacent sections (and there are multiple addresses in the CAM 402), then the section comparator 414 may provide the signal SameSecRequest for that bank at a high logical level. This may, in part, be used as a signal to enter the memory into a refresh mode where only a single address is refreshed as part of a targeted refresh operation. The output priority control 412 may also take the results from the section comparator 414 into account. For example, the output priority control 412 may prioritize finding two addresses which are in different non-adjacent sections if such a pair of addresses is available.


The steal output control circuit 410 may provide a first seed and a second seed address from the CAM 402 to first and second victim calculators 406 and 407 respectively. The victim address calculators 406 and 407 may determine the addresses of victims (or potential victims) of those seed addresses, which may then be refreshed. In some embodiments, the victims may be based on word lines which are physically close to word lines represented by the seed addresses. For example, the victims may be the word lines which are adjacent to the seed address (e.g., R+/−1). The calculated victim addresses may be stored in a first and second latch 408 and 409 respectively. The first latch 408 may hold a first refresh address RXADD1 provided by the first seed address victim calculator 406 and the second latch 409 may hold a second refresh address RXADD2 provided by the second seed address victim calculator 407.


The stored refresh addresses may be provided to a row decoder 430, which may simultaneously refresh the word lines associated with the first refresh address RXADD1 and the second refresh address RXADD2. Two address buses may couple the refresh control circuit to the row decoder 430. The row decoder 430 may have different portions for each section of a given bank. Each section portion of the row decoder 430 may receive the addresses RXADD1 and RXADD2 in common as inputs to a multiplexer. A control signal generated within the row decoder 430 may determine which of the two addresses RXADD1 and RXADD2 is used within that section for refreshing. In some embodiments, each section of the row decoder 430 may have two multiplexers, one for each received address, each of which selects between providing that received address for refreshing or providing no address. A decoder for the refresh addresses RXADD1 and RXADD2 may provide a command signal to each section of the row decoder 430. The two multiplexers in each section may respond to opposite levels of that section's command signal, such that only one may be active (e.g., providing the address) at a time.


The steal output control circuit 410 may provide a second seed skip signal Seed2Skip. When the signal Seed2Skip is at an active level the row decoder may refresh the first refresh address RXADD1 and not the second refresh address RXADD2. The steal output control circuit 410 may provide the signal Seed2Skip at an active level when there is only one detected aggressor which needs to have its victims refreshed (e.g., if there is only one address stored in the CAM 402).


In an example targeted refresh operation the memory may be in a refresh mode where two addresses are simultaneously refreshed as part of a targeted refresh operation (e.g., because the signal SameSecRequestBank is inactive for every bank). The steal output control circuit 410 may retrieve a first seed address Seed1 and a second seed address Seed2 from the CAM 402. The victim calculators 406 and 407 may calculate a first and a second victim address based on the respective first and second seeds. For example, the first refresh address RXADD1 may be the R+1 victim of Seed1, while the second refresh address RXADD2 may be the R+1 victim of Seed2. These two refresh addresses may be refreshed by the row decoder 430. The victim calculators 406 and 407 may then provide respective third and fourth victim addresses based on the respective first and the second seed addresses. For example, the first refresh address RXADD1 may now be the R−1 victim of Seed1 while the second refresh address RXADD2 may now be the R−1 victim of Seed2. The row decoder 430 may refresh these two refresh addresses at the same time. The steal output control circuit 410 may then retrieve new seed addresses from the CAM 402 for further refresh operations.


In an example targeted refresh operation the memory may be in a refresh mode where only one refresh address is refreshed per pump (e.g., because at least one of the signals SameSecRequestBank is active). The steal control circuit 410 may retrieve a first seed address Seed1 from the CAM 402. The first seed address Seed1 may be provided to the first victim address calculator 406, which may calculate a first refresh address RXADD1 (e.g., which may be the R+1 of Seed1), and provide it to the first latch 408. The row decoder 430 may then refresh the first refresh address RXADD1. The first victim address calculator 406 may then calculate a second refresh address based on the first seed address Seed1. For example, the refresh address RXADD1 may be updated to the R−1 address of Seed1. The row decoder 430 may then refresh this address. The steal output control 410 may then retrieve one or more new addresses from the CAM 402 to use as seed addresses for subsequent targeted refresh operations.


In some embodiments, word lines further from the seed word line may also be refreshed. For example, the memory may refresh word lines which are adjacent to the R+/−1 word lines (e.g., the R+/−2 word lines). The R+/−2 word lines may undergo a slower rate of decay than the R+/−1 word lines and may thus need to be refreshed less frequently. In order to mitigate this, the memory may periodically refresh the R+/−2 word lines instead of the R+/−1 word lines. For example, the bank portion 400 may include a R+/−2 steal rate control circuit 404, which may provide a signal RHR2en. When the signal RHR2en is active, instead of calculating the R+1 or R−1 victim addresses, the first and the second victim address calculators 406 and 407 may calculate the R+2 and R−2 victim addresses instead.


The R+/−2 steal rate control circuit 404 may count a number of times that targeted refresh operations are performed (e.g., a number of activations of the signal RHR) and may provide the signal RHR2en at an active level based on that count. For example, the signal RHR2en may be active for one in every eight targeted refresh operations.



FIG. 5 is a state diagram of refresh modes of a memory according to some embodiments of the present disclosure. The state diagram 500 may, in some embodiments, represent different refresh modes that may be used by one or more of the memories (or memory components) of FIGS. 1-4. For example, the state diagram 500 may represent the states of a state machine such as the dynamic steal rate control circuit 312 of FIG. 3.


Mode 510 represents checking the value of a steal rate control counter (SRCC) (e.g., SRCC 314 of FIG. 3) as well as the value of a same section address signal (e.g., SameSecRequestBnk of FIGS. 3-4). Based on these values, the state machine may determine which refresh mode 520-550 to perform when a refresh signal (e.g., AREF) is received. After performing the refreshes associated with the determined refresh mode, the state machine may return to the initial mode 510 to determine which refresh mode to use for the next activation of the refresh signal.


The initial mode 510 may also represent an initial state of the memory system. For example, after a power up or reset operation of the memory (e.g., as indicated by a PwrUpRst signal), the memory may enter initial mode 510 and begin monitoring the SRCC value and the SameSecRequestBnk signal. In some embodiments, the value of the SRCC may be reset to an initial value (e.g., 0) responsive to the PwrUpRst signal.


If the signal SameSecRequestBnk is low for all banks (e.g., all bank refresh portions include at least a pair of refresh addresses which are in different non-adjacent sections) and the SRCC is at a maximum value (or above a threshold value), the memory may enter a first refresh mode 520. The first refresh mode 520 may involve performing an auto-refresh operation followed by at least one targeted refresh operation where multiple targeted refresh addresses are refreshed together. After performing refresh operations, the value of the SRCC may be maintained at its current (e.g., maximum) value, and the memory may return to the initial state 510.


If the signal SameSecRequestBnk is low for all banks (e.g., all bank refresh portions include at least a pair of refresh addresses which are in different non-adjacent sections) and the SRCC is below a maximum value (or below a threshold value), the memory may enter a second refresh mode 530. The second refresh mode 530 may be similar to the first refresh mode 520, except in the second refresh mode 530, more word lines are refreshed as part of the auto-refresh operation. After performing refresh operations responsive to the refresh signal in the second mode, the SRCC value may be incremented.


If the signal SameSecRequestBnk has at least one bit at a high logical level (e.g., at least one bank does not include a pair of identified aggressors in different non-adjacent sections) and the SRCC is at a minimum value (e.g., 0), then the memory may enter a third refresh mode 540. Responsive to the refresh signal AREF in the third refresh mode 540, the memory may perform auto-refresh operations but not targeted refresh operations. After performing the refresh operations, the SRCC value may be increased by a value. For example, in the embodiment of FIG. 5, the SRCC value may be increased by 7. Different values (and different sizes of the maximum value of the SRCC) may be used to adjust average numbers of seed addresses which are refreshed per activation of the refresh signal AREF.


If the signal SameSecRequestBnk has at least one bit at a high logical level (e.g., at least one bank does not include a pair of identified aggressors in different non-adjacent sections) and the SRCC is above a minimum value (e.g., SRCC>0), then the memory may enter a fourth refresh mode 550. Responsive to the refresh signal AREF in the fourth refresh mode 550, the memory may perform targeted refresh operations but not auto-refresh operations. In the fourth refresh mode 550 (unlike the first mode 520 and second mode 530) each targeted refresh operation may include refreshing a single refresh address.



FIG. 6 is a timing diagram of different refresh modes according to some embodiments of the present disclosure. The timing diagrams 620-650 shows different groups of refresh operations which may each be performed responsive to an activation of a refresh signal (e.g., AREF) when the memory is in different refresh modes. In some embodiments, the timing diagrams 620-650 may represent the respective refresh modes 520-550 of FIG. 5. It should be noted that the timing diagrams 620-650 do not necessarily share the same time access and are not necessarily to scale with each other. For example, the refresh operations represented by the timing diagram 640 may take more time to complete than the refresh operations represented by the timing diagram 650.


Timing diagram 620 shows refresh operations in a first refresh mode (e.g., mode 520 of FIG. 5). Responsive to an activation of the refresh signal, there may be 3 refresh pumps. A first pump is used for an auto-refresh operation, and 4 word lines may be refreshed. A second pump is used for targeted refresh operations. During the first pump the R+1 victims may be refreshed for a first seed address Seed1 and a second seed address Seed2. The third pump may be used to refresh the victims of the addresses Seed1 and Seed2. In some embodiments, when an R+/−2 refresh is called for, the second pump may be used to refresh the R+2 victims of the addresses Seed1 and Seed2 and the third pump may be used to refresh the R−2 victims of the addresses Seed1 and Seed2.


Timing diagram 630 shows refresh operations in a second refresh mode (e.g., mode 530 of FIG. 5). The timing diagram 630 may be generally similar to the timing diagram 620, except that in the timing diagram 630, more word lines are refreshed during the first auto-refresh pump. In particular, during the first pump of the timing diagram 630, eight word lines are refreshed as part of an auto-refresh operation.


Timing diagram 640 shows refresh operations in a third refresh mode (e.g., mode 540 of FIG. 5). The timing diagram 640 includes two refresh pumps. During each refresh pump, 16 word lines are refreshed as part of an auto-refresh operation.


Timing diagram 650 shows refresh operations as part of a fourth refresh mode (e.g., mode 550 of FIG. 5). The timing diagram 650 includes four refresh pumps. Each pump is used for a targeted refresh operation which refreshes a single refresh word line. For example, the first pump may be used to refresh R+1 victim of a first seed address Seed1. The second pump may be used to refresh R−1 victim of the first seed address Seed1. The third pump may be used to refresh the R+1 victim of a second seed address Seed2. The fourth pump may be used to refresh the R−1 victim of a second seed address Seed2. In some embodiments, if an R+/−2 refresh is called for than R+2 or R−2 victims may be refreshed instead.



FIG. 7 is a state diagram of a memory with a refresh management mode according to some embodiments of the present disclosure. The state diagram 700 may be generally similar to the state diagram 500 of FIG. 5, except that in the state diagram 700, there are two additional refresh modes to accommodate a refresh management (RFM) mode of the memory. For the sake of brevity modes and operations similar to those previously described with respect to FIG. 5 will not repeated again with respect to FIG. 7.


Some memories may include an RFM mode, in which when the RFM mode is enabled, the controller may monitor access operations to a memory, and may control the ratio of auto refresh operations and targeted refresh operations. When an RFM mode is enabled, the memory may move from the initial state 710 to an RFM enabled mode 760. While the RFM mode remains enabled, the memory may perform refreshes as part of a fifth mode 770 when an REM signal is active and an activation of the refresh signal AREF is received from the controller, and may perform refreshes as part of a sixth mode 780 when the refresh signal AREF is received by the signal RFM is not active. In some embodiments, the controller may count access operations to the memory and may activate the signal RFM when the count crosses a threshold.


The fifth mode 770 may involve performing targeted refresh operations, each of which refreshes a single victim word line. The sixth mode 780 may include auto-refresh and targeted refresh operations.



FIG. 8 is a timing diagram of different refresh modes according to some embodiments of the present disclosure. The timing diagrams 870 and 880 may represent the fifth refresh mode 770 and sixth refresh mode 780 of FIG. 7. The timing diagrams 870 and 880 may generally be similar to the timing diagrams of FIG. 6.


The timing diagram 870 shows a fifth refresh mode which includes 3 refresh pumps. The first pump is used to refresh four word lines as part of an auto-refresh operation. The second pump is used to refresh the R+1 (or R+2) victim of a first seed address Seed1. The third pump is used to refresh the R−1 (or R−2) victim of the first seed address Seed1.


The timing diagram 880 shows a sixth refresh mode which includes 4 refresh pumps. The first two pumps are used to refresh the R+1 and R−1 (or R+2 and R−2) victims of a first seed address Seed1. The third and fourth pumps are used to refresh the R+1 and R−1 (or R+2 and R−2) victims of a second seed address Seed2.


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.



FIG. 9 is a flow chart of a method according to some embodiments of the present disclosure. The method 900 may, in some embodiments, be performed by one or more of the apparatuses or systems of FIGS. 1-4 and may operate it one or more of the manners described in FIGS. 5-8.


The method 900 may generally begin with box 910, which describes storing a plurality of row addresses each associated with a word line of a memory array. The row addresses may be received along a row address bus as part of access operations on the memory. The row addresses may be stored in an aggressor detector (e.g., CAM 402 of FIG. 4). In some embodiments, only a portion of the addresses along the bus may be sampled and stored. In some embodiments, all addresses along the bus may be stored.


Box 910 may generally be followed by box 920, which describes activating a control signal if there are not at least two of the stored plurality of row addresses which represent word lines which can be refreshed simultaneously. For example, a section comparator may check the stored addresses to determine if there are at least two of the stored addresses which are in different non-adjacent sections. In some embodiments, the section comparator may check the addresses in the aggressor detector responsive to a refresh signal (e.g., AREF).


Box 920 may be generally followed by box 930, which describes generating a first refresh address based on a first one of the stored plurality of row addresses. The first refresh address may be an address associated with a word line which is adjacent to the word line represented by the first one of the stored plurality of row addresses. In some embodiments, the first refresh address may be generated responsive to the refresh signal AREF. In some embodiments, the first refresh address may be generated responsive to a targeted refresh signal (e.g., RHR).


Box 930 may generally be followed by box 940, which describes generating a second refresh address based on a second one of the stored plurality of row addresses. The process of generating the second refresh address may generally be similar to generating the first refresh address as described in box 930. In some embodiments, the operations described in boxes 930 and 940 may be performed simultaneously.


Box 940 may generally be followed by box 950, which describes refreshing a first word line associated with the first refresh address and a second word line associated with the second refresh address simultaneously as part of a targeted refresh operation if the control signal is inactive, and refreshing the first word line as and the second word line sequentially as part of respective first and second targeted refresh operations if the control signal is active.


Whether the two refresh addresses are refreshed together or not may be based by which refresh mode of the memory is active. For example the method 900 may include activating a refresh mode of the memory based on the control signal.


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.

Claims
  • 1. An apparatus comprising: a central portion of a refresh control circuit configured to provide pump signals responsive to receiving a refresh signal, wherein a number and type of the pump signals are based on a current refresh mode, wherein the central portion is configured to adjust a count value based on the pump signals; anda plurality of bank specific portions of the refresh control circuit configured to receive the pump signals in common, wherein each of the plurality of bank specific portions are configured to perform refresh operations on an associated one of a plurality of memory banks, wherein a number and type of the refresh operations is based on the number and the type of the pump signal, wherein each of the plurality of bank specific portions is configured to store one or more address and provides a respective one of a plurality of control signals based on the stored one or more addresses,wherein the central portion is configured to select the current refresh mode based on the count value and the plurality of control signals, andwherein each of the plurality of bank specific portions is configured to provide the respective one of the plurality of control signals at an active level if there are not two of the stored one or more addresses which can be simultaneously refreshed in the bank specific portion.
  • 2. The apparatus of claim 1, wherein each of the associated one of the plurality of memory banks includes a plurality of sections, and wherein each of the plurality of bank specific portions includes a section comparator configured to provide the respective one of the plurality of control signals at the active level if there are not at least two of the stored one or more addresses which are in different non-adjacent ones of the plurality of sections.
  • 3. The apparatus of claim 1, wherein the central portion is further configured to select a current refresh mode based on a refresh management signal.
  • 4. An apparatus comprising: a central portion of a refresh control circuit configured to provide pump signals responsive to receiving a refresh signal, wherein a number and type of the pump signals are based on a current refresh mode, wherein the central portion is configured to adjust a count value based on the pump signals; anda plurality of bank specific portions of the refresh control circuit configured to receive the pump signals in common, wherein each of the plurality of bank specific portions are configured to perform refresh operations on an associated one of a plurality of memory banks, wherein a number and type of the refresh operations is based on the number and the type of the pump signal, wherein each of the plurality of bank specific portions is configured to store one or more address and provides a respective one of a plurality of control signals based on the stored one or more addresses,wherein the central portion is configured to select the current refresh mode based on the count value and the plurality of control signals, andwherein the central portion is configured to select a first refresh mode as the current refresh mode if at least one of the plurality of control signals is at an active level, wherein as part of refresh operations while the first refresh mode is active, a first refresh address based on one of the stored one or more addresses and a second refresh address based on a different one of the stored one or more addresses are refreshed sequentially.
  • 5. The apparatus of claim 4, wherein the central portion is configured to select a second refresh mode as the current refresh mode if none of the plurality of control signals is at the active level, wherein as part of refresh operations while the second refresh mode is active, the first refresh address based on the one of the stored one or more addresses and the second refresh address based on the different one of the stored one or more addresses are refreshed at the same time.
  • 6. An apparatus comprising: a central portion of a refresh control circuit configured to provide pump signals responsive to receiving a refresh signal, wherein a number and type of the pump signals are based on a current refresh mode, wherein the central portion is configured to adjust a count value based on the pump signals; anda plurality of bank specific portions of the refresh control circuit configured to receive the pump signals in common, wherein each of the plurality of bank specific portions are configured to perform refresh operations on an associated one of a plurality of memory banks, wherein a number and type of the refresh operations is based on the number and the type of the pump signal, wherein each of the plurality of bank specific portions is configured to store one or more address and provides a respective one of a plurality of control signals based on the stored one or more addresses,wherein the central portion is configured to select the current refresh mode based on the count value and the plurality of control signals, andwherein the central portion is further configured to select a refresh mode as the current refresh mode based, in part, on the count value at a minimum value, and select a different refresh mode as the current refresh mode if the count value is at a maximum value.
  • 7. An apparatus comprising: a central portion of a refresh control circuit configured to determine a refresh mode based, in part, on a plurality of control signals, wherein the central portion is configured to determine a number and type of refresh operations based on the refresh mode; anda plurality of bank specific portions of the refresh control circuit each configured to perform refresh operations based on the number and the type determined by the central portion, store at least one address and provide a respective one of the plurality of control signals based on the stored at least one address, and wherein each of the bank specific portions is configured to provide the respective one of the plurality of control signals based in part, on a comparison between the stored at least one addresses.
  • 8. The apparatus of claim 7, wherein the central portion is configured to adjust a count value passed on the number and type of refresh operations, and wherein the determination of the refresh mode is based, in part, on the count value.
  • 9. The apparatus of claim 7, wherein each of the bank specific portions is configured to provide the respective one of the plurality of control signals at an active level if there are not two of the stored at least one addresses which can be simultaneously refreshed.
  • 10. The apparatus of claim 7, wherein the central portion provides at least one pump signal responsive to a refresh signal, wherein each of the at least one pump signals indicates a first type or a second type of refresh operation.
  • 11. An apparatus comprising: a central portion of a refresh control circuit configured to determine a refresh mode based, in part, on a plurality of control signals, wherein the central portion is configured to determine a number and type of refresh operations based on the refresh mode; anda plurality of bank specific portions of the refresh control circuit each configured to perform refresh operations based on the number and the type determined by the central portion, store at least one address and provide a respective one of the plurality of control signals based on the stored at least one address,wherein the central portion provides at least one pump signal responsive to a refresh signal, wherein each of the at least one pump signals indicates a first type or a second type of refresh operation, andwherein responsive to the second type of refresh operation each of the second type causes each bank specific portion to provide a refresh address based on the stored at least one address.
  • 12. An apparatus comprising: a central portion of a refresh control circuit configured to determine a refresh mode based, in part, on a plurality of control signals, wherein the central portion is configured to determine a number and type of refresh operations based on the refresh mode; and a plurality of bank specific portions of the refresh control circuit each configured to perform refresh operations based on the number and the type determined by the central portion, store at least one address and provide a respective one of the plurality of control signals based on the stored at least one address, wherein the central portion is configured to select the mode based in part, on a comparison of the count value to a minimum value and a maximum value.
  • 13. A method comprising: storing at least one row address in each of a plurality of bank specific portions of a refresh control circuit;providing a respective one of a plurality of control signals from each of the plurality of bank specific portions, wherein the plurality of control signals are based on the stored at least one row address;generating a plurality of pump signals responsive to receiving a refresh signal at a central portion of a refresh control circuit, wherein a number and type of the plurality of pump signals are based on a current refresh mode;changing a count value based on the plurality of pump signals;determining the current refresh mode based on the count value and the plurality of control signals; anddetermining a state of the respective one of the plurality of control signals based on if there are not two of the stored one or more addresses which can be simultaneously refreshed stored in the associated one of the plurality of bank specific portions.
  • 14. The method of claim 13, further comprising performing refresh operations with each of the plurality of bank specific portions of the refresh control circuit on an associated one of a plurality of memory banks responsive to the plurality of pump signals.
  • 15. The method of claim 13, further comprising determining the state of the respective one of the plurality of control signals based on a location of the two of the stored one or more addresses within a memory bank.
  • 16. The method of claim 13, further comprising comparing the count value to a maximum value and a minimum value, and determining the current refresh mode based, in part, on the comparison.
  • 17. A method comprising: storing at least one row address in each of a plurality of bank specific portions of a refresh control circuit;providing a respective one of a plurality of control signals from each of the plurality of bank specific portions, wherein the plurality of control signals are based on the stored at least one row address;generating a plurality of pump signals responsive to receiving a refresh signal at a central portion of a refresh control circuit, wherein a number and type of the plurality of pump signals are based on a current refresh mode;changing a count value based on the plurality of pump signals;determining the current refresh mode based on the count value and the plurality of control signals; andentering a first refresh mode based on at least one of the plurality of control signals being active, wherein as part of the first refresh mode, a first refresh address and a second refresh address are refreshed sequentially; andentering a second refresh mode based on none of the plurality of control signals being active, wherein as part of the second refresh mode, wherein as part of the first refresh mode the first refresh address and the second refresh address are refreshed at the same time.
CROSS REFERENCE TO RELATED APPLICATION(S)

This application is a continuation of U.S. patent application Ser. No. 16/997,659 filed Aug. 19, 2020 and issued as U.S. Pat. No. 11,348,631 on May 31, 2022. The aforementioned application, and issued patent, is incorporated herein by reference, in its entirety, for any purpose.

US Referenced Citations (501)
Number Name Date Kind
5299159 Balistreri et al. Mar 1994 A
5654929 Mote, Jr. Aug 1997 A
5699297 Yamazaki et al. Dec 1997 A
5867442 Kim et al. Feb 1999 A
5933377 Hidaka Aug 1999 A
5943283 Wong et al. Aug 1999 A
5956288 Bermingham et al. Sep 1999 A
5959923 Matteson et al. Sep 1999 A
5970507 Kato et al. Oct 1999 A
5999471 Choi Dec 1999 A
6002629 Kim et al. Dec 1999 A
6011734 Pappert Jan 2000 A
6061290 Shirley May 2000 A
6064621 Tanizaki et al. May 2000 A
6212118 Fujita Apr 2001 B1
6306721 Teo et al. Oct 2001 B1
6310806 Higashi et al. Oct 2001 B1
6310814 Hampel et al. Oct 2001 B1
6363024 Fibranz Mar 2002 B1
6392952 Chen et al. May 2002 B1
6424582 Ooishi Jul 2002 B1
6434064 Nagai Aug 2002 B2
6452868 Fister Sep 2002 B1
6515928 Sato et al. Feb 2003 B2
6535950 Funyu et al. Mar 2003 B1
6535980 Kumar et al. Mar 2003 B1
6567340 Nataraj et al. May 2003 B1
6950364 Kim Sep 2005 B2
7002868 Takahashi Feb 2006 B2
7057960 Fiscus et al. Jun 2006 B1
7082070 Hong Jul 2006 B2
7187607 Koshikawa et al. Mar 2007 B2
7203113 Takahashi et al. Apr 2007 B2
7203115 Eto et al. Apr 2007 B2
7209402 Shinozaki et al. Apr 2007 B2
7215588 Lee May 2007 B2
7444577 Best et al. Oct 2008 B2
7551502 Dono et al. Jun 2009 B2
7565479 Best et al. Jul 2009 B2
7692993 Iida et al. Apr 2010 B2
7830742 Han Nov 2010 B2
8174921 Kim et al. May 2012 B2
8400805 Yoko Mar 2013 B2
8526260 Pyeon Sep 2013 B2
8572423 Isachar et al. Oct 2013 B1
8625360 Iwamoto et al. Jan 2014 B2
8681578 Narui Mar 2014 B2
8756368 Best et al. Jun 2014 B2
8811100 Ku Aug 2014 B2
8862973 Zimmerman et al. Oct 2014 B2
8938573 Greenfield et al. Jan 2015 B2
9032141 Bains et al. May 2015 B2
9047978 Bell et al. Jun 2015 B2
9076499 Schoenborn et al. Jul 2015 B2
9087602 Youn et al. Jul 2015 B2
9117544 Bains et al. Aug 2015 B2
9123447 Lee et al. Sep 2015 B2
9153294 Kang Oct 2015 B2
9190137 Kim et al. Nov 2015 B2
9190139 Jung et al. Nov 2015 B2
9236110 Bains et al. Jan 2016 B2
9251885 Greenfield et al. Feb 2016 B2
9286964 Halbert et al. Mar 2016 B2
9299400 Bains et al. Mar 2016 B2
9311984 Hong et al. Apr 2016 B1
9311985 Lee et al. Apr 2016 B2
9324398 Jones et al. Apr 2016 B2
9384821 Bains et al. Jul 2016 B2
9390782 Best et al. Jul 2016 B2
9396786 Yoon et al. Jul 2016 B2
9406358 Lee Aug 2016 B1
9412432 Narui et al. Aug 2016 B2
9418723 Chishti et al. Aug 2016 B2
9424907 Fujishiro Aug 2016 B2
9484079 Lee Nov 2016 B2
9514850 Kim Dec 2016 B2
9570143 Lim et al. Feb 2017 B2
9570201 Morgan et al. Feb 2017 B2
9646672 Kim et al. May 2017 B1
9653139 Park May 2017 B1
9672889 Lee et al. Jun 2017 B2
9685240 Park Jun 2017 B1
9691466 Kim Jun 2017 B1
9697913 Mariani et al. Jul 2017 B1
9734887 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
9812185 Fisch et al. Nov 2017 B2
9818469 Kim et al. Nov 2017 B1
9831003 Sohn et al. Nov 2017 B2
9865326 Bains et al. Jan 2018 B2
9865328 Desimone et al. Jan 2018 B1
9922694 Akamatsu Mar 2018 B2
9934143 Bains et al. Apr 2018 B2
9953696 Kim Apr 2018 B2
9978430 Seo et al. May 2018 B2
10020045 Riho Jul 2018 B2
10020046 Uemura Jul 2018 B1
10032501 Ito et al. Jul 2018 B2
10049716 Proebsting Aug 2018 B2
10083737 Bains et al. Sep 2018 B2
10090038 Shin Oct 2018 B2
10134461 Bell et al. Nov 2018 B2
10141042 Richter Nov 2018 B1
10147472 Jones et al. Dec 2018 B2
10153031 Akamatsu Dec 2018 B2
10170174 Ito et al. Jan 2019 B1
10192608 Morgan Jan 2019 B2
10210925 Bains et al. Feb 2019 B2
10297305 Moon et al. May 2019 B1
10297307 Raad et al. May 2019 B1
10339994 Ito et al. Jul 2019 B2
10381327 Ramachandra et al. Aug 2019 B2
10446256 Ong et al. Oct 2019 B2
10468076 He et al. Nov 2019 B1
10490250 Ito et al. Nov 2019 B1
10490251 Wolff Nov 2019 B2
10504577 Alzheimer Dec 2019 B1
10510396 Notani et al. Dec 2019 B1
10572377 Zhang et al. Feb 2020 B1
10573370 Ito et al. Feb 2020 B2
10607679 Nakaoka Mar 2020 B2
10685696 Brown et al. Jun 2020 B2
10699796 Benedict et al. Jun 2020 B2
10790005 He et al. Sep 2020 B1
10825505 Rehmeyer Nov 2020 B2
10832792 Penney et al. Nov 2020 B1
10930335 Bell et al. Feb 2021 B2
10943636 Wu et al. Mar 2021 B1
10950289 Ito et al. Mar 2021 B2
10957377 Noguchi Mar 2021 B2
10964378 Ayyapureddi et al. Mar 2021 B2
10978132 Rehmeyer et al. Apr 2021 B2
11017833 Wu et al. May 2021 B2
11069393 Cowles et al. Jul 2021 B2
11081160 Ito et al. Aug 2021 B2
11222683 Rehmeyer Jan 2022 B2
11222686 Noguchi Jan 2022 B1
11227649 Meier et al. Jan 2022 B2
11264079 Roberts Mar 2022 B1
11302374 Jenkinson et al. Apr 2022 B2
11302377 Li et al. Apr 2022 B2
11309010 Ayyapureddi Apr 2022 B2
11309012 Meier et al. Apr 2022 B2
11315619 Wolff Apr 2022 B2
11315620 Ishikawa et al. Apr 2022 B2
11320377 Chen et al. May 2022 B2
11348631 Wu et al. May 2022 B2
11380382 Zhang et al. Jul 2022 B2
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
20010008498 Ooishi Jul 2001 A1
20020026613 Niiro Feb 2002 A1
20020181301 Takahashi et al. Dec 2002 A1
20020191467 Matsumoto et al. Dec 2002 A1
20030026161 Yamaguchi et al. Feb 2003 A1
20030063512 Takahashi et al. Apr 2003 A1
20030067825 Shimano et al. Apr 2003 A1
20030081483 De Paor et al. May 2003 A1
20030123301 Jang et al. Jul 2003 A1
20030161208 Nakashima et al. Aug 2003 A1
20030193829 Morgan et al. Oct 2003 A1
20030231540 Lazar et al. Dec 2003 A1
20040004856 Sakimura et al. Jan 2004 A1
20040008544 Shinozaki et al. Jan 2004 A1
20040022093 Lee Feb 2004 A1
20040024955 Patel Feb 2004 A1
20040114446 Takahashi et al. Jun 2004 A1
20040130959 Kawaguchi Jul 2004 A1
20040184323 Mori et al. Sep 2004 A1
20040218431 Chung et al. Nov 2004 A1
20050002268 Otsuka et al. Jan 2005 A1
20050041502 Perner Feb 2005 A1
20050105362 Choi et al. May 2005 A1
20050108460 David May 2005 A1
20050213408 Shieh Sep 2005 A1
20050243627 Lee et al. Nov 2005 A1
20050265104 Remaklus et al. Dec 2005 A1
20060018174 Park et al. Jan 2006 A1
20060083099 Bae et al. Apr 2006 A1
20060087903 Riho et al. Apr 2006 A1
20060104139 Hur et al. May 2006 A1
20060176744 Stave Aug 2006 A1
20060198220 Yoon et al. Sep 2006 A1
20060215474 Hokenmaier Sep 2006 A1
20060233012 Sekiguchi et al. Oct 2006 A1
20060262616 Chen Nov 2006 A1
20060262617 Lee Nov 2006 A1
20060268643 Schreck et al. Nov 2006 A1
20070002651 Lee Jan 2007 A1
20070008799 Dono et al. Jan 2007 A1
20070014175 Min et al. Jan 2007 A1
20070028068 Golding et al. Feb 2007 A1
20070030746 Best et al. Feb 2007 A1
20070033339 Best et al. Feb 2007 A1
20070106838 Choi May 2007 A1
20070147154 Lee Jun 2007 A1
20070165042 Yagi Jul 2007 A1
20070237016 Miyamoto et al. Oct 2007 A1
20070263442 Cornwell et al. Nov 2007 A1
20070297252 Singh Dec 2007 A1
20080028137 Schakel et al. Jan 2008 A1
20080028260 Oyagi et al. Jan 2008 A1
20080031068 Yoo et al. Feb 2008 A1
20080126893 Harrand et al. May 2008 A1
20080130394 Dono et al. Jun 2008 A1
20080181048 Han Jul 2008 A1
20080212386 Riho Sep 2008 A1
20080224742 Pomichter Sep 2008 A1
20080253212 Iida et al. Oct 2008 A1
20080253213 Sato et al. Oct 2008 A1
20080266990 Loeffler Oct 2008 A1
20080270683 Barth et al. Oct 2008 A1
20080306723 De Ambroggi et al. Dec 2008 A1
20080316845 Wang et al. Dec 2008 A1
20090021999 Tanimura et al. Jan 2009 A1
20090052264 Hong et al. Feb 2009 A1
20090059641 Jeddeloh Mar 2009 A1
20090073760 Betser et al. Mar 2009 A1
20090161468 Fujioka Jun 2009 A1
20090168571 Pyo et al. Jul 2009 A1
20090185440 Lee Jul 2009 A1
20090201752 Riho et al. Aug 2009 A1
20090228739 Cohen et al. Sep 2009 A1
20090251971 Futatsuyama Oct 2009 A1
20090296510 Lee et al. Dec 2009 A1
20100005217 Jeddeloh Jan 2010 A1
20100005376 Laberge et al. Jan 2010 A1
20100061153 Yen et al. Mar 2010 A1
20100074042 Fukuda et al. Mar 2010 A1
20100097870 Kim et al. Apr 2010 A1
20100110809 Kobayashi et al. May 2010 A1
20100110810 Kobayashi May 2010 A1
20100124138 Lee et al. May 2010 A1
20100128547 Kagami May 2010 A1
20100131812 Mohammad May 2010 A1
20100141309 Lee Jun 2010 A1
20100157693 Iwai et al. Jun 2010 A1
20100182862 Teramoto Jul 2010 A1
20100182863 Fukiage Jul 2010 A1
20100329069 Ito et al. Dec 2010 A1
20110026290 Noda et al. Feb 2011 A1
20110055495 Remaklus, Jr. et al. Mar 2011 A1
20110069572 Lee et al. Mar 2011 A1
20110122987 Neyer May 2011 A1
20110134715 Norman Jun 2011 A1
20110216614 Hosoe Sep 2011 A1
20110225355 Kajigaya Sep 2011 A1
20110299352 Fujishiro et al. Dec 2011 A1
20110310648 Iwamoto et al. Dec 2011 A1
20120014199 Narui Jan 2012 A1
20120059984 Kang et al. Mar 2012 A1
20120151131 Kilmer et al. Jun 2012 A1
20120155173 Lee et al. Jun 2012 A1
20120155206 Kodama et al. Jun 2012 A1
20120213021 Riho et al. Aug 2012 A1
20120254472 Ware et al. Oct 2012 A1
20120287727 Wang Nov 2012 A1
20120307582 Marumoto et al. Dec 2012 A1
20120327734 Sato Dec 2012 A1
20130003467 Klein Jan 2013 A1
20130003477 Park et al. Jan 2013 A1
20130028034 Fujisawa Jan 2013 A1
20130051157 Park Feb 2013 A1
20130051171 Porter et al. Feb 2013 A1
20130077423 Lee Mar 2013 A1
20130173971 Zimmerman Jul 2013 A1
20130254475 Perego et al. Sep 2013 A1
20130279284 Jeong Oct 2013 A1
20130304982 Jung Nov 2013 A1
20140006700 Schaefer et al. Jan 2014 A1
20140006703 Bains et al. Jan 2014 A1
20140006704 Greenfield et al. Jan 2014 A1
20140013169 Kobla et al. Jan 2014 A1
20140013185 Kobla et al. Jan 2014 A1
20140016422 Kim et al. Jan 2014 A1
20140022858 Chen et al. Jan 2014 A1
20140043888 Chen et al. Feb 2014 A1
20140050004 Mochida Feb 2014 A1
20140078841 Chopra Mar 2014 A1
20140078842 Oh et al. Mar 2014 A1
20140089576 Bains et al. Mar 2014 A1
20140089758 Kwok et al. Mar 2014 A1
20140095780 Bains et al. Apr 2014 A1
20140095786 Moon et al. Apr 2014 A1
20140119091 You et al. May 2014 A1
20140143473 Kim et al. May 2014 A1
20140169114 Oh Jun 2014 A1
20140177370 Halbert et al. Jun 2014 A1
20140181453 Jayasena et al. Jun 2014 A1
20140185403 Lai Jul 2014 A1
20140189228 Greenfield et al. Jul 2014 A1
20140219042 Yu et al. Aug 2014 A1
20140219043 Jones et al. Aug 2014 A1
20140237307 Kobla et al. Aug 2014 A1
20140241099 Seo et al. Aug 2014 A1
20140254298 Dally Sep 2014 A1
20140281206 Crawford et al. Sep 2014 A1
20140281207 Mandava et al. Sep 2014 A1
20140293725 Best et al. Oct 2014 A1
20140321226 Pyeon Oct 2014 A1
20150016203 Sriramagiri et al. Jan 2015 A1
20150036445 Yoshida et al. Feb 2015 A1
20150049566 Lee et al. Feb 2015 A1
20150049567 Chi Feb 2015 A1
20150055420 Bell et al. Feb 2015 A1
20150078112 Huang Mar 2015 A1
20150085564 Yoon et al. Mar 2015 A1
20150089326 Joo et al. Mar 2015 A1
20150092508 Bains Apr 2015 A1
20150109871 Bains et al. Apr 2015 A1
20150120999 Kim et al. Apr 2015 A1
20150134897 Sriramagiri et al. May 2015 A1
20150155025 Lee et al. Jun 2015 A1
20150162064 Oh et al. Jun 2015 A1
20150162067 Kim et al. Jun 2015 A1
20150170728 Jung et al. Jun 2015 A1
20150199126 Jayasena et al. Jul 2015 A1
20150206572 Lim et al. Jul 2015 A1
20150213872 Mazumder et al. Jul 2015 A1
20150243339 Bell et al. Aug 2015 A1
20150255140 Song Sep 2015 A1
20150279442 Hwang Oct 2015 A1
20150294711 Gaither et al. Oct 2015 A1
20150340077 Akamatsu Nov 2015 A1
20150356048 King Dec 2015 A1
20150380073 Joo et al. Dec 2015 A1
20160019940 Jang et al. Jan 2016 A1
20160027498 Ware et al. Jan 2016 A1
20160027531 Jones et al. Jan 2016 A1
20160027532 Kim Jan 2016 A1
20160042782 Narui et al. Feb 2016 A1
20160070483 Yoon et al. Mar 2016 A1
20160078846 Liu et al. Mar 2016 A1
20160078911 Fujiwara et al. Mar 2016 A1
20160086649 Hong et al. Mar 2016 A1
20160093402 Kitagawa et al. Mar 2016 A1
20160125931 Doo et al. May 2016 A1
20160133314 Hwang et al. May 2016 A1
20160155491 Roberts et al. Jun 2016 A1
20160180917 Chishti et al. Jun 2016 A1
20160180921 Jeong Jun 2016 A1
20160196863 Shin et al. Jul 2016 A1
20160202926 Benedict Jul 2016 A1
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
20170076779 Bains et al. Mar 2017 A1
20170092350 Halbert et al. Mar 2017 A1
20170111792 Correia Fernandes et al. Apr 2017 A1
20170117030 Fisch Apr 2017 A1
20170133085 Kim et al. May 2017 A1
20170133108 Lee et al. May 2017 A1
20170140807 Sun et al. May 2017 A1
20170140810 Choi et al. May 2017 A1
20170140811 Joo May 2017 A1
20170146598 Kim et al. May 2017 A1
20170148504 Saifuddin et al. May 2017 A1
20170177246 Miller et al. Jun 2017 A1
20170186481 Oh et al. Jun 2017 A1
20170213586 Kang et al. Jul 2017 A1
20170221546 Loh et al. Aug 2017 A1
20170263305 Cho Sep 2017 A1
20170269861 Lu et al. Sep 2017 A1
20170287547 Ito et al. Oct 2017 A1
20170323675 Jones et al. Nov 2017 A1
20170345482 Balakrishnan Nov 2017 A1
20170352404 Lee et al. Dec 2017 A1
20180005690 Morgan et al. Jan 2018 A1
20180025770 Ito et al. Jan 2018 A1
20180025772 Lee et al. Jan 2018 A1
20180025773 Bains et al. Jan 2018 A1
20180033479 Lea et al. Feb 2018 A1
20180047110 Blackman et al. Feb 2018 A1
20180061476 Kim Mar 2018 A1
20180061483 Morgan Mar 2018 A1
20180061485 Joo Mar 2018 A1
20180075927 Jeong et al. Mar 2018 A1
20180082737 Lee Mar 2018 A1
20180096719 Tomishima et al. Apr 2018 A1
20180102776 Chandrasekar et al. Apr 2018 A1
20180107417 Shechter et al. Apr 2018 A1
20180108401 Choi et al. Apr 2018 A1
20180114561 Fisch et al. Apr 2018 A1
20180114565 Lee Apr 2018 A1
20180122454 Lee et al. May 2018 A1
20180130506 Kang et al. May 2018 A1
20180137005 Wu et al. May 2018 A1
20180158504 Akamatsu Jun 2018 A1
20180158507 Bang Jun 2018 A1
20180182445 Lee et al. Jun 2018 A1
20180190340 Kim et al. Jul 2018 A1
20180218767 Wolff Aug 2018 A1
20180226119 Kim et al. Aug 2018 A1
20180233197 Laurent Aug 2018 A1
20180240511 Yoshida et al. Aug 2018 A1
20180247876 Kim et al. Aug 2018 A1
20180254078 We et al. Sep 2018 A1
20180261268 Hyun et al. Sep 2018 A1
20180276150 Eckert et al. Sep 2018 A1
20180285007 Franklin et al. Oct 2018 A1
20180294028 Lee et al. Oct 2018 A1
20180308539 Ito et al. Oct 2018 A1
20180341553 Koudele et al. Nov 2018 A1
20190013059 Akamatsu Jan 2019 A1
20190043558 Suh et al. Feb 2019 A1
20190051344 Bell et al. Feb 2019 A1
20190065087 Li et al. Feb 2019 A1
20190066759 Nale Feb 2019 A1
20190066766 Lee Feb 2019 A1
20190088315 Saenz et al. Mar 2019 A1
20190088316 Inuzuka et al. Mar 2019 A1
20190103147 Jones et al. Apr 2019 A1
20190115069 Lai Apr 2019 A1
20190122723 Ito et al. Apr 2019 A1
20190129651 Wuu et al. May 2019 A1
20190130960 Kim May 2019 A1
20190130961 Bell et al. May 2019 A1
20190147964 Yun et al. May 2019 A1
20190161341 Howe May 2019 A1
20190190341 Beisele et al. Jun 2019 A1
20190196730 Imran Jun 2019 A1
20190198078 Hoang et al. Jun 2019 A1
20190198099 Mirichigni et al. Jun 2019 A1
20190205253 Roberts Jul 2019 A1
20190228810 Jones et al. Jul 2019 A1
20190228815 Morohashi et al. Jul 2019 A1
20190252020 Rios et al. Aug 2019 A1
20190267077 Ito et al. Aug 2019 A1
20190279706 Kim Sep 2019 A1
20190294348 Ware et al. Sep 2019 A1
20190333573 Shin et al. Oct 2019 A1
20190347019 Shin et al. Nov 2019 A1
20190348100 Smith et al. Nov 2019 A1
20190348102 Smith et al. Nov 2019 A1
20190348103 Jeong et al. Nov 2019 A1
20190362774 Kuramori et al. Nov 2019 A1
20190385661 Koo et al. Dec 2019 A1
20190385667 Morohashi et al. Dec 2019 A1
20190385668 Fujioka et al. Dec 2019 A1
20190385670 Notani et al. Dec 2019 A1
20190386557 Wang et al. Dec 2019 A1
20190391760 Miura et al. Dec 2019 A1
20190392886 Cox et al. Dec 2019 A1
20200005857 Ito et al. Jan 2020 A1
20200051616 Cho Feb 2020 A1
20200075086 Hou et al. Mar 2020 A1
20200082873 Wolff Mar 2020 A1
20200126611 Riho et al. Apr 2020 A1
20200135263 Brown et al. Apr 2020 A1
20200143871 Kim et al. May 2020 A1
20200176050 Ito et al. Jun 2020 A1
20200185026 Yun et al. Jun 2020 A1
20200194050 Akamatsu Jun 2020 A1
20200194056 Sakurai et al. Jun 2020 A1
20200202921 Morohashi et al. Jun 2020 A1
20200210278 Rooney et al. Jul 2020 A1
20200211632 Noguchi Jul 2020 A1
20200211633 Okuma Jul 2020 A1
20200211634 Ishikawa et al. Jul 2020 A1
20200219555 Rehmeyer Jul 2020 A1
20200219556 Ishikawa et al. Jul 2020 A1
20200265888 Ito et al. Aug 2020 A1
20200273517 Yamamoto Aug 2020 A1
20200273518 Raad et al. Aug 2020 A1
20200279599 Ware et al. Sep 2020 A1
20200294569 Wu et al. Sep 2020 A1
20200294576 Brown et al. Sep 2020 A1
20200321049 Meier Oct 2020 A1
20200381040 Penney Dec 2020 A1
20200388324 Rehmeyer 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 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
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
Foreign Referenced Citations (26)
Number Date Country
1841551 Oct 2006 CN
101026003 Aug 2007 CN
101038785 Sep 2007 CN
101067972 Nov 2007 CN
104350546 Feb 2015 CN
104733035 Jun 2015 CN
104981874 Oct 2015 CN
105529047 Apr 2016 CN
106710621 May 2017 CN
107025927 Aug 2017 CN
107871516 Apr 2018 CN
108154895 Jun 2018 CN
2005-216429 Aug 2005 JP
2011-258259 Dec 2011 JP
4911510 Jan 2012 JP
2013-004158 Jan 2013 JP
6281030 Jan 2018 JP
201801079 Jan 2018 TW
2014120477 Aug 2014 WO
2015030991 Mar 2015 WO
2017171927 Oct 2017 WO
2019222960 Nov 2019 WO
2020010010 Jan 2020 WO
2020117686 Jun 2020 WO
2020247163 Dec 2020 WO
2020247639 Dec 2020 WO
Non-Patent Literature Citations (80)
Entry
U.S. Appl. No. 18/064,773, filed Dec. 12, 2022, titled, “Apparatuses and Methods for Access Based Refresh Timing,” pp. all pages of application as filed.
International Application No. PCT/US20/23689, titled “Semiconductor Device Having Cam That Stores Address Signals”, dated Mar. 19, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/797,658, titles “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 21, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/818,981 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Mar. 13, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/824,460, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 19, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/025,844, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, filed Jul. 2, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/783,063, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, dated Feb. 5, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/805,197, titled “Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device”, dated Feb. 28, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/232,837, titled “Apparatuses and Methods for Distributed Targeted Refresh Operations”, filed Dec. 26, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/818,989, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 13, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/268,818, titled “Apparatuses and Methods for Managing Row Access Counts”, filed Feb. 6, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/286,187 titled “Apparatuses and Methods for Memory Mat Refresh Sequencing” filed Feb. 26, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/084,119, titled “Apparatuses and Methods for Pure-Time, Self Adopt Sampling for Row Hammer Refresh Sampling”, filed Sep. 11, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/886,284 titled “Apparatuses and Methods for Access Based Refresh Timing” filed May 28, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/886,284, titled “Apparatuses and Methods for Access Based Refresh Timing”, dated May 28, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/358,587, titled “Semiconductor Device Having Cam That Stores Address Signals”, dated Mar. 19, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/375,716 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Apr. 4, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/411,573 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed May 14, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/428,625 titled “Apparatuses and Methods for Tracking Victim Rows” filed May 31, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/432,604 titled “Apparatuses and Methods for Staggered Timing of Skipped Refresh Operations” filed Jun. 5, 2019, pp. all pages of application as filed.
U.S. Appl. No. 17/008,396 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Aug. 31, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/513,400 titled “Apparatuses and Methods for Tracking Row Accesses” filed Jul. 16, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/548,027 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Aug. 22, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/549,942 titled “Apparatuses and Methods for Lossy Row Access Counting” filed Aug. 23, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/546,152 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Aug. 20, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/549,411 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Aug. 23, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/655,110 titled “Apparatuses and Methods for Dynamic Targeted Refresh Steals” filed Oct. 16, 2019, pp. all pages of application as filed.
U.S. Appl. No. 17/186,913 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Feb. 26, 2021, pp. all pages of application as filed.
U.S. Appl. No. 17/187,002 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Feb. 26, 2021, pp. all pages of application as filed.
U.S. Appl. No. 17/347,957 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 15, 2021, pp. all pages of application as filed.
International Application No. PCT/US19/40169 titled “Apparatus and Methods for Triggering Row Hammer Address Sampling” filed Jul. 1, 2019, pp. all pages of application as filed.
International Application No. PCT/US19/64028, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Dec. 2, 2019, pp. all pages of application as filed.
International Application No. PCT/US20/26689, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations”, dated Apr. 3, 2020, pp. all pages of application as filed.
International Application No. PCT/US20/32931, titled “Apparatuses and Methods for Controlling Steal Rates”, dated May 14, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/788,657, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Feb. 12, 2020, pp. all pages of application as filed.
U.S. Appl. No. 15/324,621 titled “Apparatuses and Methods for Pure-Time, Self-Adopt Sampling for Row Hammer Refresh Sampling” filed May 19, 2021, pp. all pages of application as filed.
U.S. Appl. No. 15/881,256 entitled ‘Apparatuses and Methods for Detecting a Row Hammer Attack With a Bandpass Filter’ filed Jan. 26, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/425,525 titled “Apparatuses and Methods for Tracking All Row Accesses” filed May 29, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/427,105 titled “Apparatuses and Methods for Priority Targeted Refresh Operations” filed May 30, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/427,140 titled “Apparatuses and Methods for Tracking Row Access Counts Between Multiple Register Stacks” filed May 30, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/437,811 titled “Apparatuses, Systems, and Methods for Determining Extremum Numerical Values” filed Jun. 11, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/537,981 titled “Apparatuses and Methods for Controlling Targeted Refresh Rates” filed Aug. 12, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/994,338 titled “Apparatuses, Systems, and Methods for Memory Directed Access Pause” filed Aug. 14, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/997,766 titled “Refresh Logic Circuit Layouts Thereof” filed Aug. 19, 2020, pp. all pages of application as filed.
U.S. Appl. No. 16/997,659 titled “Apparatuses, Systems, and Methods for Refresh Modes” filed Aug. 19, 2020, pp. all pages of application as filed.
U.S. Appl. No. 17/095,978 titled “Apparatuses and Methods for Controlling Refresh Timing” filed Nov. 12, 2020, pp. all pages of application as filed.
U.S. Appl. No. 17/127,654 titled “Apparatuses and Methods for Row Hammer Based Cache Lockdown” filed Dec. 18, 2020, pp. all pages of application as filed.
U.S. Appl. No. 17/175,485 titled “Apparatuses and Methods for Distributed Targeted Refresh Operations” filed Feb. 12, 2021, pp. all pages of application as filed.
U.S. Appl. No. 15/789,897, entitled “Apparatus and Methods for Refreshing Memory”, filed Oct. 20, 2017, pp. all pages of application as filed.
U.S. Appl. No. 15/796,340, entitled: “Apparatus and Methods for Refreshing Memory” filed Oct. 27, 2017, pp. all pages of application as filed.
U.S. Appl. No. 16/012,679, titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences”, filed Jun. 19, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/020,863, titled “Semiconductor Device”, filed Jun. 27, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/112,471 titled “Apparatuses and Methods for Controlling Refresh Operations” filed Aug. 24, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/160,801, titled “Apparatuses and Methods for Selective Row Refreshes” filed Oct. 15, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/176,932, titled “Apparatuses and Methods for Access Based Refresh Timing”, filed Oct. 31, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/208,217, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Dec. 3, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/230,300, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Dec. 21, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/231,327 titled “Apparatuses and Methods for Selective Row Refreshes”, filed Dec. 21, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/237,291, titled “Apparatus and Methods for Refreshing Memory”, filed Dec. 31, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/290,730, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 1, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/374,623, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Apr. 3, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/411,698 title “Semiconductor Device” filed May 14, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/427,330 titled “Apparatuses and Methods for Storing Victim Row Data” filed May 30, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/431,641 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 4, 2019, pp. all pages of application as filed.
U.S. Appl. No. 16/682,606, titled “Apparatuses and Methods for Distributing Row Hammer Refresh Events Across a Memory Device”, filed Nov. 13 2019, pp. all pages of application as filed.
U.S. Appl. No. 17/654,035, titled “Apparatuses and Methods for Dynamic Targeted Refresh Steals”, filed Mar. 8, 2022; pp. all pages of application as filed.
U.S. Appl. No. 15/876,566 entitled ‘Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device’ filed on Jan. 22, 2018, pp. all pages of application as filed.
U.S. Appl. No. 17/226,975, titled “Apparatuses and Methods for Targeted Refreshing of Memory”, filed Jul. 21, 2017, pp. all pages of application as filed.
U.S. Appl. No. 17/226,975, titled “Apparatuses and Methods for Staggered Timing of Skipped Refresh Operations” filed Apr. 9, 2021, pp. all pages of application as filed.
U.S. Appl. No. 16/459,520 titled “Apparatuses and Methods for Monitoring Word Line Accesses”, filed Jul. 1, 2019, pp. all pages of application as filed.
International Application No. PCT/US18/55821 “Apparatus and Methods for Refreshing Memory” filed Oct. 15, 2018, pp. all pages of application as filed.
U.S. Appl. No. 15/715,846, entitled “Semiconductor Device”, filed Sep. 26, 2017, pp. all pages of application as filed.
U.S. Appl. No. 15/888,993, entitled “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 5, 2018, pp. all pages of application as filed.
U.S. Appl. No. 16/190,627 titled “Apparatuses and Methods for Targeted Refreshing of Memory” filed Nov. 14, 2018, pp. all pages of application as filed.
U.S. Appl. No. 17/030,018, titled “Apparatuses and Methods for Controlling Refresh Operations”, filed Sep. 23, 2020, pp. all pages of application as filed.
U.S. Appl. No. 15/281,818, entitled: “Semiconductor Device” filed Sep. 30, 2016, pp. all pages of application as filed.
Kim, et al., “Flipping Bits in MemoryWithout Accessing Them: An Experimental Study of DRAM Disturbance Errors”, IEEE, Jun. 2014, 12 pgs.
U.S. Appl. No. 17/731,529, titled “Apparatuses and Methods for Access Based Refresh Dperations”; 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.
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.
Related Publications (1)
Number Date Country
20220270670 A1 Aug 2022 US
Continuations (1)
Number Date Country
Parent 16997659 Aug 2020 US
Child 17662733 US