This disclosure relates generally to semiconductor devices, and more specifically to semiconductor memory devices. In particular, the disclosure relates to volatile memory, such as dynamic random access memory (DRAM). Information may be stored in the memory as charge accumulated in capacitors acting as memory cells, which will decay overtime unless periodically refreshed.
As memory components have decreased in size, the density of memory cells has greatly increased. Repealed access to a particular memory cell, or group of memory cells (often referred to as a “row hammer”) may cause an increased rate of data degradation in nearby memory cells. It may be desirable to identify and refresh memory cells affected by the row hammer.
The following description of certain embodiments is merely exemplary in nature and is in no way intended to limit the invention 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.
The present disclosure is related to apparatuses and methods for refreshing different memory cells (or different groups of memory cells) affected by a row hammer. The memory cell which is being hammered may be referred to as an aggressor row (or aggressor address). The memory cell(s) which are being affected by the aggressor row may be referred to as victim rows (or victim addresses). Methods to mitigate row hammer effects may refresh victim rows which are adjacent to the aggressor row. However, victim rows may also exist which are not adjacent to the aggressor row.
The present disclosure provides for separately refreshing different victim rows (or groups of victim rows) each of which may have a different relationship to the aggressor address. The relationship that victim rows have to the aggressor row may be based on a physical relationship (e.g., distance or location) of the refreshed groups with respect to the aggressor row.
Different victim rows may experience the row hammer effect to different degrees. For example, one victim row may degrade faster than a different victim row. The degrees to which different victim rows are affected by the row hammer effect may be based on their relationship to the hammer row. For example, an adjacent victim row may undergo more rapid data degradation than a more distant victim row. For this reason, it may be desirable to refresh different victim rows at different rates.
The semiconductor device 10 may include a synchronous DRAM (SDRAM), for example, a Double Data Rate 4 (DDR4) type integrated on a single semiconductor chip. The semiconductor device 10 may include a memory cell array 11 that is provided with a plurality of word lines WL and a plurality of bit lines BL and has a configuration in which memory cells MC are disposed at the intersections of the plurality of wordlines and the plurality of bit lines. Selection of the word lines WL is carried out by a row decoder 12, and selection of bit lines BL is carried out by a column decoder 13. The memory cell array 11, the row decoder 12, the column decoder 13, and a read/write amplifier 14 are each divided into a number of banks corresponding to a number of banks of the memory cell array 11. As shown, for example, in
Moreover, the semiconductor device 10 is provided with command/address terminals 21, clock terminals 23, data terminals 24, data mask terminals 25, and power supply terminals 26 and 27 as external terminals.
The command/address terminals 21 receive external C/A signals which may be address signals ADD and/or command signals COM input from outside the semiconductor device 10. The C/A signals from command/address terminals 21 are supplied to a command address input circuit 31, which provides address signals ADD, and command signals COM. The address signals ADD are supplied to an address decoder circuit 32 which supplies a row address XADD to the row decoder 12 and supplies a column address YADD to the column decoder 13. The row address XADD is also supplied to a refresh address control circuit 40.
The command signals COM are supplied to a command decoder 34 that generates various internal commands by decoding the command signals COM. Examples of the internal commands include active signals ACT, pre-charge signals Pre, read/write signals R/W, and automatic refresh signals AREF. The active signals ACT, pre-charge signals PRE, and refresh signals AREF are all supplied to the refresh address control circuit 40.
The active signal ACT may be a pulse signal which is activated when the command signal COM indicates row access (active command). When the active signal ACT is activated, the row decoder 12 of a specified bank address is activated. As a result, the word line WL specified by the row address XADD is selected and activated. The pre-charge signal Pre may be a pulse signal which is activated when the command signal COM indicates pre-charge. When the pre-charge signal Pre is activated, the row decoder 12 of the specified bank address and the word line WL specified by the row address XADD controlled thereby are deactivated.
The read/write signal R/W may be a pulse signal which is activated when the command signal COM indicates column access (read command or write command). When the read/write signal R/W is activated, the column decoder 13 is activated. As a result, the bit line BL specified by the column address YADD is selected.
Therefore, if the active command and the read command are input and if the row address XADD and the column address YADD are input in synchronization with them, read data is read from the memory cell MC specified by the row address XADD and the column address YADD. The read data DQ is output from the data terminal 24 to outside via a sense amplifier SAMP, a transfer gate TG, the read/write amplifier 14, and an input/output circuit 15.
On the other hand, a write operation is performed when the active command and the write command are input, and the row address XADD and the column address YADD are input in synchronization with them, and, write data DQ is input to the data terminal 24. The write data DQ is supplied to the memory cell array 11 via the input/output circuit 15, the read/write amplifier 14, the transfer gate TG, and the sense amplifier SAMP and is written to the memory cell MC specified by the row address XADD and the column address YADD.
The refresh signal AREF may be a pulse signal which is activated when the command signal COM indicates an auto-refresh command. Also, when the command signal COM indicates a self-refresh entry command, the refresh signal AREF is activated. The refresh signal AREF may be activated once immediately after command input, and thereafter may be cyclically activated at desired internal timing. Thus refresh operations may continue automatically. A self-refresh exit command may cause the automatic activation of the refresh signal AREF to stop and return to an IDLE state.
The refresh signal AREF is supplied to the refresh address control circuit 40. The refresh address control circuit 40 supplies a refreshing row address RXADD to the row decoder 12, thereby activating the predetermined word line WL contained in the memory cell array 11, thereby refreshing the information of the corresponding memory cell MC. Other than the refresh signal AREF, the active signal ACT, the row address XADD, and the pre-charge signal Pre are supplied to the refresh address control circuit 40. The refresh address control circuit may control a timing of a refresh operation, and may utilize more than one timing and/or more than one method to calculate the refreshing address RXADD. The refresh address control circuit 40 may be controlled to change details of the refreshing address RXADD, or may operate based on internal logic.
The refresh address control circuit 40 may selectively use one or more of the active signal ACT, pre-charge signal Pre, row address XADD, and/or refresh signal AREF to output the refreshing row address RXADD. The refresh address control circuit 40 may calculate and output an automatic refresh address based on an automatic refresh operation indicated by the refresh signal AREF. The automatic refresh address may be output at a frequency based on a frequency of the refresh signal AREF. The refresh address control circuit 40 may selectively output a hammer refresh address, instead of an automatic refresh address, as the refreshing address RXADD. The hammer refresh address may be based on characteristics over time of the row addresses XADD received from the address decoder 32 in response to C/A inputs 21. The refresh address control circuit may sample the current row address XADD to determine its characteristics over time. The sampling may occur intermittently, with each sample acquired based on a random or pseudo-random timing. The refresh address control circuit 40 may use different methods to calculate a hammer refresh address based on the sampled row address XADD.
External clock signals CK and /CK are input to the clock terminals 23. The external clock signals CK and the external clock signals /CK are mutually complementary signals, and both of them are supplied to the clock input circuit 35. The clock input circuit 35 generates internal clock signals ICLK based on the external clock signals CK and /CK. The internal clock signals ICLK are supplied to the command decoder 34, an internal clock generator 36, etc. The internal clock generator 36 generates internal clock signals LCLK, which control the operation timing of the input/output circuit 15.
The data mask terminals 25 are the terminals to which data mask signals DM are input. When the data mask signal DM s activated, overwrite of corresponding data is prohibited.
The power supply terminals 26 are the terminals to which power supply potentials VDD and VSS are supplied. The power supply potentials VDD and VSS supplied to the power supply terminals 26 are supplied to a voltage generator 37. The voltage generator 37 generates various internal potentials VPP, VOD, VARY, VPERI, etc. based on the power supply potentials VDD and VSS. The internal potential VPP is the potential mainly used in the row decoder 12, the internal potentials VOD and VARY are the potentials used in the sense amplifier SAMP in the memory cell array 11, and the internal potential VPERI is the potential used in many other circuit blocks.
The power supply terminals 27 are the terminals to which power supply potentials VDDQ and VSSQ are supplied. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals 27 are supplied to the input-output circuit 15. The power supply potentials VDDQ and VSSQ are the same potentials as the power supply potentials VDD and VSS, respectively, which are supplied to the power supply terminals 26. However, the dedicated power supply potentials VDDQ and VSSQ are used for the input/output circuit 15 so that power supply noise generated by the input/output circuit 15 does not propagate to other circuit blocks.
As shown in
As shown in
The address hammer detector 350 may determine if a given address is considered to be a ‘row hammer address’ (or aggressor address). The address may be an address XADD currently being provided by an address decoder (e.g., address decoder 32 of
The address selector 352 may include a reference address generator 347, a cycle generator 348, an address scrambler 346, a multiplexer 349, and a NOR gate circuit 354. The address selector 352 accepts the output of the address hammer detector 350 and also the refresh signal AREF as inputs. The address selector calculates and selectively outputs a refreshing address RXADD based on these inputs. The address selector 352 may generate automatic refresh addresses Pre_RXADD in response to the refresh signal AREF. The address selector 352 may also selectively calculate hammer refresh addresses HitXADD2 based on an identified hammer address HitXADD1. The address selector 352 may provide hammer refresh addresses HitXADD2 resulting from different calculations. Which calculations are used to generate the hammer refresh address HitXADD2 may be based on, for example, an internal timing cycle. The different calculations may represent different relationships between hammer wordlines corresponding to the hammer address HitXADD1 and to refresh wordlines corresponding to the hammer refresh address HitXADD2. For example, the different relationships may be different physical relationships between wordlines corresponding to the addresses. In one embodiment, the address selector may calculate a first relationship where a refresh wordline corresponding to HitXADD2 is adjacent to an aggressor wordline corresponding to HitXADD1 and a second relationship where the refresh wordlines are non-adjacent (e.g., more distal from) the aggressor wordlines. Additional relationships may be used in other examples.
The address selector 352 provides one or more of these different calculated addresses as the refreshing address RXADD, which is then used to refresh corresponding locations of the memory. The address selector 352 may provide the automatic refresh address Pre_RXADD as the refresh address RXADD at a first rate. The address selector 352 may provide a first calculation of the hammer refresh address HitXADD2 as the refresh address RXADD at a second rate based on a number of times that the automatic refresh address Pre_RXADD was provided. The address selector 352 may provide a second calculation of the hammer refresh address HitXADD2 as the refresh address RXADD at a third rate based on a number of times that the first hammer refresh address HitXADD2 was provided.
The address hammer defector 350 includes a sampling signal generator 341 which generates a first sampling signal S1 (or ‘Armsample’) in response to the active signal ACT, the pre-charge signal Pre, and/or an internal oscillator signal Int_Osc. The active signal ACT and the pre-charge signal Pre may be generated by the command decoder 34 in response to C/A signals and may indicate activation or deactivation of a memory location corresponding to a specific row address XADD. The internal oscillator signal Int_Osc may be a periodic signal output by an internal oscillator circuit (not shown) of the semiconductor device 10 of
Referring back to
The rate of activations of the first sampling signal S1 may be varied based on rates of activations of command signals. The sampling circuit 341 may use the inputs ACT, Pre, and/or Int_Osc as a basis for controlling a rate of sampling signal S1 which captures different types of row hammer patterns. For example, if the inputs ACT and Pre are more frequently activated, that may indicate an increased chance that one or more addresses are being frequently accessed by the system. Thus, the sampling circuit 341 may increase a rate at which the first sampling signal S1 is generated in response to an increase in the rates of the ACT and Pre signals. Int_Osc may be used to detect addresses which have been kept active for a certain amount of time (e.g., in an ‘active standby’ mode). Since the internal oscillator signal Int_Osc is periodic and continuous over lime, first sampling signal S1 may intermittently be generated even when input signals ACT and Pre are less frequently active. Thus, the internal oscillator signal Int_Osc may allow for the first sampling signal S1 to be activated at a certain ‘baseline’ rate.
In one embodiment, the sampling circuit 341 may include a counter circuit and a pseudo-random generator which are clocked by the inputs ACT, PRE, and Int_Osc. An example of a sampling circuit that, in certain embodiments, may be used as the sampling circuit 341 may be found in U.S. Pat. No. 9,805,783, issued Oct. 31, 2017, the entire contents of which are disclosed by reference herein. By producing the first sampling signal S1 at random or pseudo-random timing based on input signals and an internal oscillator, a broad range of row hammer events may be detected without the need to track every current address XADD provided by the row decoder.
The shift register 342 may store a certain number of previously sampled addresses for comparison with a current address. The shift register 342 may latch current row addresses XADD in response to the sampling signal S1. The shift register 342 may be made of a number (n) of storage or latch circuits, such as flip-flop circuits (FF#1 to FF#n). In one example, the flip-flop circuits are arranged in a cascade fashion such that each flip-flop circuit (e.g., an ith circuit FF#i) accepts an output of a previous flip-flop circuit (e.g., FF#i−1) as an input, and outputs to a subsequent flip-flop circuit (e.g., FF#i+1). The first flip-flip circuit is provided the current row address XADD. Each flip-flop circuit also has a clock node connected to the first sampling signal S1 provided by the sampling circuit 341. In this manner, the first sampling signal S1 may cause the shift register 342 to record the n most recent addresses which were being provided by the row decoder at each the n most recent first sampling signal S1 activations.
As an example of the operation of the shift register 342, the first flip-flop circuit FF#1 responds to the first sampling signal S1 being active and latches the current address XADD. A subsequent activation of the first sampling signal S1 may cause the address XADD to be moved from FF#1 to FF#2, while a new address XADD′ is latched in FF#1. As the first sampling signal S1 continues to be activated, the address XADD will eventually be moved into a final flip-flop circuit FF#n. When the first sampling signal S1 is activated again, the address XADD may be discarded from the shift register. Other operations may be used in other examples.
The shift register 342 also includes a number of comparator circuits corresponding to each of the latch circuits. The comparator circuits may determine if a currently provided address XADD matches one or more of the addresses stored in the latch circuits. The comparator circuits are shown in the embodiment of
The signal Match and the first sampling signal S1 are both provided to an AND gate circuit 344. When both Match and the first sampling signal S1 are active, the AND gate circuit outputs an active second sampling signal S2 (a high logic level). Activation of the second sampling signal S2 may cause a latch circuit 345 to store the current row address XADD. The stored address may then be output by the latch circuit 345 as a hammer address HitXADD1.
In this manner, the address hammer detector 350 monitors addresses XADD and outputs them as hammer address HitXADD1 when the current row address matches one of n recently sampled row addresses. The address hammer detector 350 may intermittently store addresses XADD based on a sampling rate which may be based on the rates of inputs ACT, Pre, or Int_Osc and/or may be random or pseudo-random. The address hammer detector 350 may store up to n recent addresses in this manner, compare them to the current address XADD, and store them as hammer address HitXADD1 in latch circuit 345. Because the address hammer detector 350 may records addresses in a random or semi-random manner, not all addresses that fit a set of row hammer criteria will necessarily be detected by the address hammer detector 350. However, the intermittent sampling also means that the higher the access rate of a given row (or the longer that row is activated), the higher the probability that a row hammer will be detected by the address hammer detector 350. Thus, the rate of the first sampling signal S1 may allow for capture of all or a portion of expected row hammer addresses.
The address selector 352 is provided the hammer address HitXADD1 and the automatic refresh signal AREF as inputs. The address selector 352 may calculate and selectively output a refreshing address RXADD in response to these inputs. The refresh address generator 347 generates a refresh address Pre_RXADD based on the refresh signal AREF. The cycle generator 348 periodically outputs a first command signal Rhr or a second command signal RHRplusEn based on the refresh signal AREF. The address scrambler 346 calculates a hammer refresh address HitXADD2 based on the hammer address HitXADD1 provided by the address hammer detector 350 in response to the first and second refresh command signal Rhr, RHRplusEn. As previously described, the hammer refresh address HitXADD2 may be calculated in different ways. The calculation used to provide the hammer refresh address HitXADD2 may be based on the status of the first and second command signals. The address selector 352 outputs a refreshing address RXADD which is the refresh address Pre_RXADD or the hammer refresh address HitXADD2 based on the first and second refresh command signals Rhr, RHRplusEN. The refreshing address RXADD is provided to a row decoder, for example, row decoder 200 of
The address selector 352 includes a refresh address generator 347 which generates an automatic refresh address Pre_RXADD in response to the refresh signal AREF. The automatic refresh address Pre_RXADD may be part of a sequence of addresses to be refreshed as part of an automatic refresh operation. The refresh address generator 347 may update the current automatic refresh address Pre_RXADD to a next address in the sequence in response to the refresh signal AREF. The refresh address generator 347 is also provided the first command signal Rhr from cycle generator 348. When the first command signal is active, the refresh address generator 347 may be controlled to stop updating the automatic refresh address Pre_RXADD even if the automatic refresh signal AREF is active. As described herein, since the command signals indicate that a row hammer refresh operation is to be conducted instead of an automatic refresh operation, this allows the automatic refresh operation to be suspended while the row hammer refresh is carried out, and resumed when the command signals are not active.
The refresh cycle generator 348 determines if an automatic refresh operation or a row hammer refresh operation will occur. The refresh cycle generator 348 may also determine which row hammer refresh operation will occur. The refresh cycle generator 348 is provided the refresh signal AREF and selectively provides the first command signal Rhr and/or the second command signal RHRplusEn in response. As described herein, the first command signal Rhr may indicate a first row hammer refresh operation (e.g., refresh the rows adjacent to a row corresponding to HitXADD1). The second command signal RHRplusEn may indicate a second row hammer refresh operation (e.g., refresh rows non-adjacent to a row corresponding to HitXADD1). The second row hammer refresh operation may only be indicated when both the first and second command signals are active. As described herein, the refresh cycle generator 348 may periodically provide one (or both) of the first and second command signals in response to a rate of the automatic refresh signal AREF. The rates that the first and second command signals are provided may be different from each other.
The address selector 352 may also include an address scrambler 346, which calculates one or more addresses to be refreshed based on row hammer addresses identified by the address hammer detector 350 and which row hammer refresh operation is indicated by the refresh cycle generator 348. The address selector 352 may be provided the hammer address HitXADD1, the first command signal Rhr, and the second command signal RHRplusEn as inputs. The address scrambler may provide a hammer refresh address HitXADD2 in response to these inputs. The hammer refresh address HitXADD2 may be an address for a memory location (e.g., a wordline) that may be affected by repeated activation of the memory location corresponding to the hammer address HitXADD1. In other words, the hammer address HitXADD1 may be an ‘aggressor’ address, and the hammer refresh address HitXADD2 may be a ‘victim’ address. Different calculations may be used for generating different victim addresses as the hammer refresh address HitXADD2.
The address scrambler 346 may calculate the hammer refresh address HitXADD2 based on the hammer address HitXADD1. The address scrambler may employ different calculations based on the state of the first command signal Rhr and the second command signal RHRplusEn. In one example, a first calculation may be used when Rhr alone is active, and a second calculation may be used when both Rhr and RHRplusEn are active. The calculations may provide hammer refresh addresses HitXADD2 corresponding to wordlines which have a known physical relationship (e.g., a spatial relationship) with a wordline corresponding to the hammer address HitXADD1. The calculations may result in a single hammer refresh address HitXADD2 in some embodiments of the disclosure. The calculations may result in a sequence of hammer refresh address HitXADD2 in other embodiments of the disclosure. The calculations triggered by the first command signal Rhr may provide hammer refresh addresses HitXADD2 corresponding to first refresh wordlines of a memory with a first physical relationship to an aggressor wordline corresponding to the hammer address HitXADD1 and the second command signal RHRplusEn may provide hammer refresh addresses HitXADD2 corresponding to second refresh wordlines having a second physical relationship to the aggressor wordline.
In one embodiment, the first calculation triggered by first command signal Rhr causes the address scrambler 346 to output a pair of addresses which are adjacent to the hammer address HitXADD1 (e.g., HitXADD2=HitXADD1+/−1). The second calculation may be triggered by both first command signal Rhr and second command signal RHRplusEn being active, and may cause the address scrambler 346 to output a pair of addresses which are adjacent to the adjacent addresses of the hammer address HitXADD1 (e.g., HitXADD2=HitXADD1+/−2). Other calculations are possible in other example embodiments. For example, the first calculations may be based on a physical relationship with the hammer address HitXADD1, while the second calculation may be based on a physical relationship with the address(es) provided by the first calculation.
The address selector 352 may include a multiplexer 349 which accepts the automatic refresh address Pre_RXADD and the hammer refresh address HitXADD2 provided by the address scrambler 346 and outputs one of them as the refreshing address RXADD. The multiplexer 349 may select between the two refresh addresses based on the first and second command signals Rhr and RHRplusEn. For example, a NOR gate circuit 354 is provided the first and second command signals Rhr and RHRplusEn and an output is provided to the multiplexer 349 to control selection of providing the Pre_RXADD or HitXADD2 addresses as the refreshing address RXADD. The NOR gate circuit 54 outputs a low logic level if either or both of the first and second command signals Rhr, RHRplusEn is active (e.g., at a high level). The multiplexer 349 outputs the hammer refresh address HitXADD2 in response to that low logic level. Thus, the multiplexer 349 outputs the hammer refresh address HitXADD2 if either of the command signals indicating a row refresh is active, and outputs the automatic refresh address Pre_RXADD otherwise.
In this manner, the address selector 352 selectively outputs a refreshing row address RXADD, which may be used by the row decoder (e.g., row decoder 12 of
The refresh cycle generator 400 includes a shift register 482, a combination logic circuit 483, a counter circuit 481, and a second refresh cycle generator 484. The refresh cycle generator provides the first command signal Rhr and the second command signal RHRplusEn to determine which calculations will be used to generate a hammer refresh address HitXADD2 from a hammer address HitXADD1. The refresh cycle generator 400 may provide the first and second command signals at different rates. The refresh cycle generator 400 may provide the first command signal Rhr at a rate based on the rate of the refresh signal AREF. As described herein, the second refresh cycle generator 484 may provide the second command signal RHRplusEn at a second rate based on the rate of the first command signal Rhr.
In the example circuit shown in
The refresh cycle generator 400 may also be provided with a power on signal Ponf. The power on signal Ponf is provided to the shift register 482 and to the counter circuit 481. The power on signal Ponf may be provided by the system (e.g., one or more components of the semiconductor device 10 of
The second refresh cycle generator 500 may generate the second command signal RHRplusEn in response to a number of activations of the first command signal Rhr. The second command signal RHRplusEn in combination with the first command signal Rhr may indicate that a second refresh operation is to take place, different than the refresh operation which is indicated by the first command signal Rhr alone. The first and second command signals may be produced at different rates. The rates at which the first and second command signals are produced may be determined based on the row hammer refresh operation they indicate. As an example, the first command signal Rhr may refresh a row which is adjacent to an identified row hammer and the second command signal RHRplusEn may refresh a row which is non-adjacent to the identified row hammer. In this situation, the adjacent rows may be expected to be more affected by a row hammer effect than the non-adjacent rows, and so Rhr may be produced more frequently than RHRplusEn. Other refresh operations may correspond to other rates of the first and second command signal in other examples.
As shown in the example circuit of
In the example circuit of
The first two lines of
The third line of
The fourth line of
The fifth line of
The sixth line of
The seventh line of
When both the first and second command signals activate, the address C is the row hammer address HitXADD1, and a second refresh operation causes C+/−2 to be provided as the hammer refresh address HitXADD2. An address corresponding to C+2 may be output during the refresh signal AREF pulse labeled “1st RHR”, and an address corresponding to C−2 may be output during the pulse labeled “2nd RHR”. The irregular timing of the first sampling signal S1 means that addresses A and C each have different refresh operations calculated, and address B has none. Various patterns and sequences of address refreshes may be provided based on the operation of the address refresh circuit.
The eighth line of
Block 710 recites “Determining if a current address is an aggressor address, wherein the aggressor address corresponds to an aggressor wordline of a memory”. The current address may be an address which is currently being provided by an address decoder circuit (e.g. address decoder 32 of
Block 720 recites “Generating a first refresh address corresponding to a first refresh wordline of the memory”. The addresses which are provided by the address decoder circuit may correspond to specific locations within a memory cell array (e.g., memory cell array 11 of
Block 730 recites “Generating a second refresh address corresponding to a second refresh wordline of the memory.” The operation of the block 730 may be generally similar to the operation of the block 720 described herein. However, in block 730 second refresh addresses are generated which have a second physical relationship to the aggressor wordline. The second physical relationship may be a different physical relationship to the aggressor wordline than the first aggressor wordline. For example, the first refresh wordlines may be adjacent to the aggressor wordline, while the second refresh wordlines are non-adjacent to the aggressor wordline.
Block 740 recites “Refreshing the first refresh wordlines at a first rate.” The first refresh wordlines may be refreshed at a given rate. The rate at which the first wordlines are refreshed may be based on how much they are expected to be affected by the aggressor address. The first rate may be determined, at least in part, based on an access frequency of the aggressor address. The first rate may be determined, at least in part, based on a rate of a refresh signal. The first rate may be linked to a certain number of activations of the refresh signal.
Block 750 recites “Refreshing the second refresh wordlines at a second rate.” The second wordlines may be refreshed at a given second rate, which may be different from the first rate. The second rate may be based, at least in part, on how much the second wordlines are expected to be affected by the aggressor address. In some examples, where the second refresh wordlines are expected to be less affected than the first refresh wordlines, the second rate may be slower than the first rate. In some examples, the second rate may be a subset of the first rate, such as a fraction of the first rate.
The first and second refresh addresses may each be based off of a same aggressor address. The first and second refresh addresses may each be based off of different aggressor addresses if a new aggressor address is identified between generating the first refresh addresses and generating the second refresh addresses. If no aggressor address is detected, then a normal refresh operation may be carried out at a third rate, which may be faster than either the first or second rates. The normal refresh operation may be interrupted to allow for wordlines corresponding to either the first or second refresh addresses to be refreshed.
Of course, it is to be appreciated that any one of the examples, embodiments or processes described herein may be combined with one or more other examples, embodiments and/or processes or be separated and/or performed amongst separate devices or device portions in accordance with the present systems, devices and methods.
Finally, the above-discussion is intended to be merely illustrative of the present system and should not be construed as limiting the appended claims to any particular embodiment or group of embodiments. Thus, while the present system has been described in particular detail with reference to exemplary embodiments, it should also be appreciated that numerous modifications and alternative embodiments may be devised by those having ordinary skill in the art without departing from the broader and intended spirit and scope of the present system as set forth in the claims that follow. Accordingly, the specification and drawings are to be regarded in an illustrative manner and are not intended to limit the scope of the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5291198 | Dingwall et al. | Mar 1994 | A |
5299159 | Balistreri et al. | Mar 1994 | A |
5422850 | Sukegawa et al. | Jun 1995 | A |
5638317 | Tran | Jun 1997 | A |
5699297 | Yamazaki et al. | Dec 1997 | A |
5768196 | Bloker et al. | Jun 1998 | A |
5933377 | Hidaka | Aug 1999 | A |
5943283 | Wong et al. | Aug 1999 | A |
5970507 | Kato | Oct 1999 | A |
5999471 | Choi | Dec 1999 | A |
6002629 | Kim et al. | Dec 1999 | A |
6011734 | Pappert | Jan 2000 | A |
6061290 | Shirley | May 2000 | A |
6212118 | Fujita | Apr 2001 | B1 |
6310806 | Higashi et al. | Oct 2001 | B1 |
6317381 | Gans et al. | Nov 2001 | B1 |
6373738 | Towler et al. | Apr 2002 | B1 |
6392952 | Chen et al. | May 2002 | B1 |
6424582 | Ooishi | Jul 2002 | B1 |
6434064 | Nagai | Aug 2002 | B2 |
6452868 | Fister | Sep 2002 | B1 |
6480931 | Buti et al. | Nov 2002 | B1 |
6515928 | Sato | Feb 2003 | B2 |
6567340 | Nataraj et al. | May 2003 | B1 |
6950364 | Kim | Sep 2005 | B2 |
7027343 | Sinha et al. | Apr 2006 | B2 |
7057960 | Fiscus et al. | Jun 2006 | B1 |
7082070 | Hong | Jul 2006 | B2 |
7187607 | Koshikawa et al. | Mar 2007 | B2 |
7203113 | Takahashi et al. | Apr 2007 | B2 |
7203115 | Eto et al. | Apr 2007 | B2 |
7209402 | Shinozaki | 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 |
7830742 | Han | Nov 2010 | B2 |
8174921 | Kim et al. | May 2012 | B2 |
8400805 | Yoko | Mar 2013 | B2 |
8451677 | Okahiro et al. | May 2013 | B2 |
8625360 | Iwamoto et al. | Jan 2014 | B2 |
8681578 | Narui | Mar 2014 | B2 |
8756368 | Best et al. | Jun 2014 | B2 |
8811100 | Ku | Aug 2014 | B2 |
8862973 | Zimmerman et al. | Oct 2014 | B2 |
8938573 | Greenfield et al. | Jan 2015 | B2 |
9032141 | Bains et al. | May 2015 | B2 |
9047978 | Bell et al. | Jun 2015 | B2 |
9058900 | Kang | Jun 2015 | B2 |
9087602 | Youn | Jul 2015 | B2 |
9117544 | Bains et al. | Aug 2015 | B2 |
9123447 | Lee et al. | Sep 2015 | B2 |
9153294 | Kang | Oct 2015 | B2 |
9190137 | Kim et al. | Nov 2015 | B2 |
9190139 | Jung et al. | Nov 2015 | B2 |
9251885 | Greenfield et al. | Feb 2016 | B2 |
9286964 | Halbert et al. | Mar 2016 | B2 |
9299457 | Chun et al. | Mar 2016 | B2 |
9311985 | Lee et al. | Apr 2016 | B2 |
9324398 | Jones et al. | Apr 2016 | B2 |
9384821 | Bains et al. | Jul 2016 | B2 |
9390782 | Best et al. | Jul 2016 | B2 |
9412432 | Narui et al. | Aug 2016 | B2 |
9424907 | Fujishiro | Aug 2016 | B2 |
9484079 | Lee | Nov 2016 | B2 |
9514850 | Kim | Dec 2016 | B2 |
9570143 | Lim et al. | Feb 2017 | B2 |
9646672 | Kim et al. | May 2017 | B1 |
9672889 | Lee et al. | Jun 2017 | B2 |
9685240 | Park | Jun 2017 | B1 |
9691466 | Kim | Jun 2017 | B1 |
9697913 | Mariani et al. | Jul 2017 | B1 |
9734887 | Tavva | Aug 2017 | B1 |
9741409 | Jones et al. | Aug 2017 | B2 |
9741447 | Akamatsu | Aug 2017 | B2 |
9747971 | Bains et al. | Aug 2017 | B2 |
9761297 | Torishima | Sep 2017 | B1 |
9786351 | Lee et al. | Oct 2017 | B2 |
9799391 | Wei | Oct 2017 | B1 |
9805782 | Liou | Oct 2017 | B1 |
9805783 | Ito et al. | Oct 2017 | B2 |
9818469 | Kim et al. | Nov 2017 | B1 |
9865326 | Bains et al. | Jan 2018 | B2 |
9865328 | Desimone et al. | Jan 2018 | B1 |
9922694 | Akamatsu | Mar 2018 | B2 |
9934143 | Bains et al. | Apr 2018 | B2 |
9953696 | Kim | Apr 2018 | B2 |
10032501 | Ito et al. | Jul 2018 | B2 |
10083737 | Bains et al. | Sep 2018 | B2 |
10090038 | Shin | Oct 2018 | B2 |
10134461 | Bell et al. | Nov 2018 | B2 |
10147472 | Jones et al. | Dec 2018 | B2 |
10153031 | Akamatsu | Dec 2018 | B2 |
10170174 | Ito et al. | Jan 2019 | B1 |
10176860 | Mylavarapu | Jan 2019 | B1 |
10210925 | Bains et al. | Feb 2019 | B2 |
10297305 | Moon et al. | May 2019 | B1 |
10339994 | Ito et al. | Jul 2019 | B2 |
10381327 | Ramachandra et al. | Aug 2019 | B2 |
10387276 | Ryu et al. | Aug 2019 | B2 |
10446216 | Oh et al. | Oct 2019 | B2 |
10490251 | Wolff | Nov 2019 | B2 |
10600462 | Augustine et al. | Mar 2020 | B2 |
10600491 | Chou et al. | Mar 2020 | B2 |
10629286 | Lee et al. | Apr 2020 | B2 |
10679710 | Hirashima et al. | Jun 2020 | B2 |
10832792 | Penney et al. | Nov 2020 | B1 |
10861519 | Jones et al. | Dec 2020 | B2 |
10867660 | Akamatsu | Dec 2020 | B2 |
10930335 | Bell et al. | Feb 2021 | B2 |
10943636 | Wu et al. | Mar 2021 | B1 |
10950289 | Ito et al. | Mar 2021 | B2 |
10964378 | Ayyapureddi et al. | Mar 2021 | B2 |
20010008498 | Ooishi | Jul 2001 | A1 |
20020078311 | Matsuzaki | Jun 2002 | A1 |
20020080677 | Watanabe | Jun 2002 | A1 |
20020181301 | Takahashi et al. | Dec 2002 | A1 |
20030063512 | Takahashi et al. | Apr 2003 | A1 |
20030067825 | Shimano et al. | Apr 2003 | A1 |
20030090400 | Barker | May 2003 | A1 |
20030123301 | Jang et al. | Jul 2003 | A1 |
20030193829 | Morgan et al. | Oct 2003 | A1 |
20030231540 | Lazar et al. | Dec 2003 | A1 |
20040008544 | Shinozaki et al. | Jan 2004 | A1 |
20040022093 | Lee | Feb 2004 | A1 |
20040052142 | Ikehashi et al. | Mar 2004 | A1 |
20040114446 | Takahashi et al. | Jun 2004 | A1 |
20040130959 | Kawaguchi | Jul 2004 | A1 |
20040174757 | Garverick et al. | Sep 2004 | A1 |
20040184323 | Mori et al. | Sep 2004 | A1 |
20040218431 | Chung et al. | Nov 2004 | A1 |
20050105315 | Shin et al. | May 2005 | A1 |
20050243629 | Lee | Nov 2005 | A1 |
20050265104 | Remaklus et al. | Dec 2005 | A1 |
20060083099 | Bae et al. | Apr 2006 | A1 |
20060087903 | Riho et al. | Apr 2006 | A1 |
20060176744 | Stave | Aug 2006 | A1 |
20060262616 | Chen | Nov 2006 | A1 |
20070008799 | Dono et al. | Jan 2007 | A1 |
20070014174 | Ohsawa | Jan 2007 | A1 |
20070028068 | Golding et al. | Feb 2007 | A1 |
20070030746 | Best et al. | Feb 2007 | A1 |
20070033339 | Best et al. | Feb 2007 | A1 |
20070133330 | Ohsawa | Jun 2007 | A1 |
20070297252 | Singh | Dec 2007 | A1 |
20080028260 | Oyagi et al. | Jan 2008 | A1 |
20080031068 | Yoo et al. | Feb 2008 | A1 |
20080126893 | Harrand et al. | May 2008 | A1 |
20080130394 | Dono et al. | Jun 2008 | A1 |
20080181048 | Han | Jul 2008 | A1 |
20080224742 | Pomichter | Sep 2008 | A1 |
20080253212 | Iida et al. | Oct 2008 | A1 |
20080266990 | Loeffler | Oct 2008 | A1 |
20080288720 | Atwal et al. | Nov 2008 | A1 |
20080316845 | Wang et al. | Dec 2008 | A1 |
20090021999 | Tanimura et al. | Jan 2009 | A1 |
20090059641 | Jeddeloh | Mar 2009 | A1 |
20090077571 | Gara et al. | Mar 2009 | A1 |
20090161457 | Wakimoto | Jun 2009 | A1 |
20090168571 | Pyo et al. | Jul 2009 | A1 |
20090185440 | Lee | Jul 2009 | A1 |
20090201752 | Riho et al. | Aug 2009 | A1 |
20090213675 | Shino | Aug 2009 | A1 |
20090296510 | Lee et al. | Dec 2009 | A1 |
20100005217 | Jeddeloh | Jan 2010 | A1 |
20100005376 | Laberge et al. | Jan 2010 | A1 |
20100054011 | Kim | Mar 2010 | A1 |
20100074042 | Fukuda et al. | Mar 2010 | A1 |
20100080074 | Ohmaru et al. | Apr 2010 | A1 |
20100110809 | Kobayashi et al. | May 2010 | A1 |
20100110810 | Kobayashi | May 2010 | A1 |
20100131812 | Mohammad | May 2010 | A1 |
20100157693 | Iwai et al. | Jun 2010 | A1 |
20100182863 | Fukiage | Jul 2010 | A1 |
20100329069 | Ito et al. | Dec 2010 | A1 |
20110026290 | Noda et al. | Feb 2011 | A1 |
20110051530 | Kushida | Mar 2011 | A1 |
20110055495 | Remaklus, Jr. et al. | Mar 2011 | A1 |
20110069572 | Lee et al. | Mar 2011 | A1 |
20110216614 | Hosoe | Sep 2011 | A1 |
20110225355 | Kazuhiko | Sep 2011 | A1 |
20110286271 | Chen | Nov 2011 | A1 |
20110310648 | Iwamoto et al. | Dec 2011 | A1 |
20110317462 | Gyllenhammer et al. | Dec 2011 | A1 |
20120014199 | Narui | Jan 2012 | A1 |
20120059984 | Kang | Mar 2012 | A1 |
20120151131 | Kilmer et al. | Jun 2012 | A1 |
20120213021 | Riho et al. | Aug 2012 | A1 |
20120254472 | Ware et al. | Oct 2012 | A1 |
20130003467 | Klein | Jan 2013 | A1 |
20130003477 | Park et al. | Jan 2013 | A1 |
20130107623 | Kavalipurapu et al. | May 2013 | A1 |
20130173971 | Zimmerman | Jul 2013 | A1 |
20130254475 | Perego et al. | Sep 2013 | A1 |
20130304982 | Jung, I et al. | Nov 2013 | A1 |
20140006703 | Bains et al. | Jan 2014 | A1 |
20140006704 | Greenfield et al. | Jan 2014 | A1 |
20140013135 | Kobla et al. | Jan 2014 | A1 |
20140013169 | Kobla et al. | Jan 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 |
20140095780 | Bains et al. | Apr 2014 | A1 |
20140095786 | Moon et al. | Apr 2014 | A1 |
20140119091 | You et al. | May 2014 | A1 |
20140136763 | Li et al. | May 2014 | A1 |
20140143473 | Kim et al. | May 2014 | A1 |
20140177370 | Halbert et al. | Jun 2014 | A1 |
20140189228 | Greenfield et al. | Jul 2014 | A1 |
20140219043 | Jones et al. | Aug 2014 | A1 |
20140237307 | Kobla et al. | Aug 2014 | A1 |
20140241099 | Seo et al. | Aug 2014 | A1 |
20140254298 | Dally | Sep 2014 | A1 |
20140269021 | Yang et al. | Sep 2014 | A1 |
20140281206 | Crawford et al. | Sep 2014 | A1 |
20140281207 | Mandava et al. | Sep 2014 | A1 |
20140292375 | Angelini et al. | Oct 2014 | A1 |
20140293725 | Best et al. | Oct 2014 | A1 |
20140355332 | Youn et al. | Dec 2014 | A1 |
20150049567 | Chi | Feb 2015 | A1 |
20150055420 | Bell et al. | Feb 2015 | A1 |
20150078112 | Huang | Mar 2015 | A1 |
20150089326 | Joo et al. | Mar 2015 | A1 |
20150155027 | Abe et al. | Jun 2015 | A1 |
20150162067 | Kim et al. | Jun 2015 | A1 |
20150170728 | Jung et al. | Jun 2015 | A1 |
20150199126 | Jayasena et al. | Jul 2015 | A1 |
20150206572 | Lim et al. | Jul 2015 | A1 |
20150213872 | Mazumder et al. | Jul 2015 | A1 |
20150213877 | Darel | Jul 2015 | A1 |
20150228341 | Watanabe et al. | Aug 2015 | A1 |
20150243339 | Bell et al. | Aug 2015 | A1 |
20150255140 | Song | Sep 2015 | A1 |
20150262652 | Igarashi | Sep 2015 | A1 |
20150279441 | Greenberg et al. | Oct 2015 | A1 |
20150279442 | Hwang | Oct 2015 | A1 |
20150294711 | Gaither et al. | Oct 2015 | A1 |
20150340077 | Akamatsu | Nov 2015 | A1 |
20150356048 | King | Dec 2015 | A1 |
20160019940 | Jang et al. | Jan 2016 | A1 |
20160027498 | Ware et al. | Jan 2016 | A1 |
20160027531 | Jones et al. | Jan 2016 | A1 |
20160027532 | Kim | Jan 2016 | A1 |
20160042782 | Narui et al. | Feb 2016 | A1 |
20160078911 | Fujiwara et al. | Mar 2016 | A1 |
20160086649 | Hong et al. | Mar 2016 | A1 |
20160093402 | Kitagawa et al. | Mar 2016 | A1 |
20160099043 | Tu | Apr 2016 | A1 |
20160125931 | Doo et al. | May 2016 | A1 |
20160133314 | Hwang | May 2016 | A1 |
20160140243 | Adams et al. | May 2016 | A1 |
20160172056 | Huh | Jun 2016 | A1 |
20160180917 | Chishti et al. | Jun 2016 | A1 |
20160180921 | Jeong | Jun 2016 | A1 |
20160196863 | Shin et al. | Jul 2016 | A1 |
20160202926 | Benedict | Jul 2016 | A1 |
20160211008 | Benedict | Jul 2016 | A1 |
20160225433 | Bains et al. | Aug 2016 | A1 |
20160225461 | Tuers et al. | Aug 2016 | A1 |
20160336060 | Shin | Nov 2016 | A1 |
20160343423 | Shido | Nov 2016 | A1 |
20170011792 | Oh et al. | Jan 2017 | A1 |
20170076779 | Bains et al. | Mar 2017 | A1 |
20170092350 | Halbert et al. | Mar 2017 | A1 |
20170117030 | Fisch et al. | Apr 2017 | A1 |
20170133085 | Kim et al. | May 2017 | A1 |
20170140807 | Sun et al. | May 2017 | A1 |
20170140811 | Joo | May 2017 | A1 |
20170148504 | Salfuddin et al. | May 2017 | A1 |
20170177246 | Miller et al. | Jun 2017 | A1 |
20170186481 | Oh et al. | Jun 2017 | A1 |
20170213586 | Kang | Jul 2017 | A1 |
20170221546 | Loh et al. | Aug 2017 | A1 |
20170263305 | Cho | Sep 2017 | A1 |
20170287547 | Ito et al. | Oct 2017 | A1 |
20170323675 | Jones et al. | Nov 2017 | A1 |
20170352399 | Yokoyama et al. | Dec 2017 | A1 |
20170371742 | Shim et al. | Dec 2017 | A1 |
20170372767 | Kang et al. | Dec 2017 | A1 |
20180005690 | Morgan et al. | Jan 2018 | A1 |
20180025770 | Ito et al. | Jan 2018 | A1 |
20180025772 | Lee et al. | Jan 2018 | A1 |
20180060194 | Ryu et al. | Mar 2018 | A1 |
20180061483 | Morgan | Mar 2018 | A1 |
20180082737 | Lee | Mar 2018 | A1 |
20180090199 | Kim et al. | Mar 2018 | A1 |
20180096719 | Tomishin et al. | Apr 2018 | A1 |
20180102776 | Chandrasekar et al. | Apr 2018 | A1 |
20180107417 | Shechter et al. | Apr 2018 | A1 |
20180114561 | Fisch et al. | Apr 2018 | A1 |
20180114565 | Lee | Apr 2018 | A1 |
20180158504 | Akamatsu | Jun 2018 | A1 |
20180182445 | Lee et al. | Jun 2018 | A1 |
20180203621 | Ahn et al. | Jul 2018 | A1 |
20180218767 | Wolff | Aug 2018 | A1 |
20180261268 | Hyun et al. | Sep 2018 | A1 |
20180294028 | Lee et al. | Oct 2018 | A1 |
20180308539 | Ito et al. | Oct 2018 | A1 |
20180341553 | Koudele et al. | Nov 2018 | A1 |
20190013059 | Akamatsu | Jan 2019 | A1 |
20190043558 | Suh et al. | Feb 2019 | A1 |
20190051344 | Bell et al. | Feb 2019 | A1 |
20190066759 | Nale | Feb 2019 | A1 |
20190066762 | Koya | Feb 2019 | A1 |
20190088315 | Saenz et al. | Mar 2019 | A1 |
20190088316 | Inuzuka et al. | Mar 2019 | A1 |
20190096492 | Cai et al. | Mar 2019 | A1 |
20190103147 | Jones et al. | Apr 2019 | A1 |
20190130961 | Bell et al. | May 2019 | A1 |
20190139599 | Ito et al. | May 2019 | A1 |
20190147941 | Qin et al. | May 2019 | A1 |
20190161341 | Howe | May 2019 | A1 |
20190196730 | Imran | Jun 2019 | A1 |
20190198090 | Lee | Jun 2019 | A1 |
20190198099 | Mirichigni et al. | Jun 2019 | A1 |
20190205253 | Roberts | Jul 2019 | A1 |
20190207736 | Ben-tovim et al. | Jul 2019 | A1 |
20190228810 | Jones et al. | Jul 2019 | A1 |
20190228813 | Naie et al. | Jul 2019 | A1 |
20190228815 | Morohashi et al. | Jul 2019 | A1 |
20190237132 | Morohashi | Aug 2019 | A1 |
20190243708 | Cha et al. | Aug 2019 | A1 |
20190252020 | Rios | Aug 2019 | A1 |
20190267077 | Ito et al. | Aug 2019 | A1 |
20190279706 | Kim | Sep 2019 | A1 |
20190333573 | Shin et al. | Oct 2019 | A1 |
20190348100 | Smith et al. | Nov 2019 | A1 |
20190348107 | Shin et al. | Nov 2019 | A1 |
20190349545 | Koh et al. | Nov 2019 | A1 |
20190362774 | Kuramori et al. | Nov 2019 | A1 |
20190371391 | Cha et al. | Dec 2019 | A1 |
20190385661 | Koo et al. | Dec 2019 | A1 |
20200005857 | Ito et al. | Jan 2020 | A1 |
20200075106 | Tokutomi et al. | Mar 2020 | A1 |
20200082873 | Wolff | Mar 2020 | A1 |
20200090760 | Purahmad et al. | Mar 2020 | A1 |
20200194050 | Akamatsu | Jun 2020 | A1 |
20200194056 | Sakurai et al. | Jun 2020 | A1 |
20200201380 | Murali et al. | Jun 2020 | A1 |
20200211626 | Hiscock et al. | Jul 2020 | A1 |
20200211633 | Okuma | Jul 2020 | A1 |
20200211636 | Hiscock et al. | Jul 2020 | A1 |
20200302994 | Enomoto et al. | Sep 2020 | A1 |
20200349995 | Shore et al. | Nov 2020 | A1 |
20200365208 | Schreck et al. | Nov 2020 | A1 |
20200381040 | Penney et al. | Dec 2020 | A1 |
20200395072 | Penney et al. | Dec 2020 | A1 |
20210020262 | Penney et al. | Jan 2021 | A1 |
20210026732 | Park et al. | Jan 2021 | A1 |
20210065755 | Kim et al. | Mar 2021 | A1 |
20210065764 | Cheng et al. | Mar 2021 | A1 |
Number | Date | Country |
---|---|---|
1195173 | Oct 1998 | CN |
101038785 | Sep 2007 | CN |
101067972 | Nov 2007 | CN |
101331554 | Dec 2008 | CN |
101458658 | Jun 2009 | CN |
101622607 | Jan 2010 | CN |
102113058 | Jun 2011 | CN |
102483952 | May 2012 | CN |
104350546 | Feb 2015 | CN |
106710621 | May 2017 | CN |
107871516 | Apr 2018 | CN |
H0773682 | Mar 1995 | JP |
2005-216429 | Aug 2005 | JP |
2011-258259 | Dec 2011 | JP |
2011-258259 | Dec 2011 | JP |
4911510 | Jan 2012 | JP |
2013-004158 | Jan 2013 | JP |
1020180064940 | Jun 2018 | KR |
1020180085184 | Jul 2018 | KR |
2014120477 | Aug 2014 | WO |
2015030991 | Mar 2015 | WO |
2019222960 | Nov 2019 | WO |
2020010010 | Jan 2020 | WO |
2020191222 | Sep 2020 | WO |
Entry |
---|
U.S. Appl. No. 16/268,818, titled “Apparatuses and Methods for Managing Row Access Counts”, filed Feb. 6, 2019. |
U.S. Appl. No. 16/358,587, titled “Semiconductor Device Having CAM That Stores Address Signals”, dated Mar. 19, 2019. |
U.S. Appl. No. 16/020,863, titled “Semiconductor Device”, filed Jun. 27, 2018. |
U.S. Appl. No. 16/176,932, titled “Apparatuses and Methods for Access Based Refresh Timing”, filed Oct. 31, 2018. |
U.S. Appl. No. 16/237,291, titled “Apparatus and Methods for Refreshing Memory”, filed Dec. 31, 2018. |
PCT Application No. PCT/US18/55821 “Apparatus and Methods for Refreshing Memory” filed Oct. 15, 2018., pp. all. |
U.S. Appl. No. 16/411,698 title “Semiconductor Device” filed May 14, 2019. |
U.S. Appl. No. 16/411,573 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed May 14, 2019. |
U.S. Appl. No. 16/427,330 titled “Apparatuses and Methods for Storing Victim Row Data” filed May 30, 2019. |
U.S. Apppl. No. 16/428,625 titled “Apparatuses and Methods for Tracking Victim Rows” filed May 31, 2019. |
U.S. Appl. No. 16/459,520 titled “Apparatuses and Methods for Monitoring Word Line Accesses”, filed Jul. 1 2019, pp. all. |
U.S. Appl. No. 15/881,256 titled ‘Apparatuses and Methods for Detecting a Row Hammer Attack With a Bandpass Filter’ filed Jan. 26, 2018, pp. all. |
U.S. Appl. No. 15/789,897, titled “Apparatus and Methods for Refreshing Memory”, filed Oct. 20, 2017; pp. all. |
U.S. Appl. No. 15/796,340, titled: “Apparatus and Methods for Refreshing Memory” filed Oct. 27, 2017; pp. all. |
U.S. Appl. No. 15/876,566 titled ‘Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device’ filed Jan. 22, 2018, pp. all. |
Kim, et al., “Flipping Bits in MemoryWithout Accessing Them: An Experimental Study of DRAM Disturbance Errors”, IEEE, Jun. 2014, 12 pgs. |
International Search Report and Written Opinion for PCT Appl. No. PCT/US2016/037673 dated Jun. 18, 2019. |
U.S. Appl. No. 16/546,027 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Aug. 20, 2019. |
U.S. Appl. No. 16/548,027 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Aug. 22, 2019. |
U.S. Appl. No. 16/549,942 titled “Apparatuses and Methods for Lossy Row Access Counting” filed Aug. 23, 2019. |
U.S. Appl. No. 16/425,525 titled “Apparatuses and Methods for Tracking All Row Accesses” filed May 29, 2019. |
U.S. Appl. No. 16/427,105 titled “Apparatuses and Methods for Priority Targeted Refresh Operations” filed May 30, 2019. |
U.S. Appl. No. 16/427,140 titled “Apparatuses and Methods for Tracking Row Access Counts Between Multiple Register Stacks” filed May 30, 2019. |
U.S. Appl. No. 16/437,811 titled “Apparatuses, Systems, and Methods for Determining Extremum Numerical Values” filed Jun. 11, 2019. |
U.S. Appl. No. 16/886,284, titled “Apparatuses and Methods for Access Based Refresh Timing”, dated May 28, 2020. |
U.S. Appl. No. 16/797,658, titles “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 21, 2020. |
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. |
Thomas, et al., “Voltage Source Based Voltage-to-Time Converter”, IEEE, 2020, pp. All. |
U.S. Appl. No. 15/884,192 entitled ‘Semiconductor Device Performing Row Hammer Refresh Operation’ filed on Jan. 30, 2018. |
U.S. Appl. No. 16/936,297 titled “Apparatuses and Methods for Managing Row Access Counts” filed Jul. 22, 2020. |
U.S. Appl. No. 17/102,266, titled “Apparatuses and Methods for Tracking Word Line Accesses”, dated Nov. 23, 2020. |
U.S. Appl. No. 17/154,945 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed Jan. 21, 2021, pp. all. |
U.S. Appl. No. 17/168,036 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Feb. 4, 2021, pp. all. |
U.S. Appl. No. 17/170,616 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Feb. 8, 2021, pp all. |
U.S. Appl. No. 16/818,981 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Mar. 13, 2020, pp. all. |
U.S. Appl. No. 16/824,460, titied “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 19, 2020, pp. all. |
U.S. Appl. No. 16/025,844, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, filed Jul. 2, 2018, pp. all. |
U.S. Appl. No. 16/783,063. titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, dated Feb. 5, 2020, pp. all. |
U.S. Appl. No. 16/232,837, titled “Apparatuses and Methods for Distributed Targeted Refresh Operations”, filed Dec. 26, 2018, pp. all. |
U.S. Appl. No. 16/818,989, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 13, 2020, pp. ail. |
U.S. Appl. No. 16/286,187 titled “Apparatuses and Methods for Memory Mat Refresh Sequencing” filed on Feb. 26, 2019; pp. all. |
U.S. Appl. No. 16/084.119, titled “Apparatuses and Methods for Pure-Time, Self Adopt Sampling for Row Hammer Refresh Sampling”, filed Sep. 11, 2018, pp. all. |
U.S. Appl. No. 16/375,716 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed on Apr. 4, 2019 pp. all. |
U.S. Appl. No. 17/060,403 titled “Apparatuses and Methods for Adjusting Victim Data” filed Oct. 1, 2020, pp. all. |
U.S. Appl. No. 16/549,411 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Aug. 23, 2019, pp. all. |
U.S. Appl. No. 16/655,110 titied “Apparatuses and Methods for Dynamic Targeted Refresh Steals” filed Oct. 16, 2019, pp. all. |
International Application No. PCT/US19/40169 titled “Apparatus and Methods for Triggering Row Hammer Address Sampling” filed Jul. 1, 2019, pp. all. |
International Application No. PCT/US19/64028, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Dec. 2, 2019, pp. all. |
International Application No. PCT/US20/26689. titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations”, dated Apr. 3, 2020, pp. all. |
U.S. Appl. No. 16/788,657, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Feb. 12, 2020, pp. all. |
U.S. Appl. No. 16/537,981 titled “Apparatuses and Methods for Controlling Targeted Refresh Rates” filed Aug. 12, 2019, pp. all. |
U.S. Appl. No. 17/153,555 titled “Apparatuses and Methods for Dynamically Allocated Aggressor Detection” filed Jan. 20, 2021, pp. all. |
U.S. Appl. No. 17/201,941 titled “Apparatuses and Methods for Sketch Circuits for Refresh Binning” filed Mar. 15, 2021, pp. all. |
U.S. Appl. No. 17/301,533 titled “Semiconductor Device Having Cam That Stores Address Signals” filed Apr. 6, 2021, pp. all. |
U.S. Appl. No. 16/208,217, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Dec. 3, 2018, pp. all. |
U.S. Appl. No. 16/230,300, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Dec. 21, 2018, pp. all. |
U.S. Appl. No. 16/290,730, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 1, 2019, pp. all. |
U.S. Appl. No. 16/374,623, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Apr. 3, 2019, pp. all. |
U.S. Appl. No. 16/431,641 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 4, 2019, pp. all. |
U.S. Appl. No. 16/682,606, titled “Apparatuses And Methods For Distributing Row Hammer Refresh Events Across A Memory Device”, filed Nov. 13 2019, pp. all. |
U.S. Appl. No. 16/459,507 titled “Apparatuses and Methods for Adjusting Victim Data”, filed Jul. 1, 2019, pp. all. |
U.S. Appl. No. 17/375,817 titled “Apparatuses and Methods for Monitoring Word Line Accesses” filed Jul. 14, 2021, pp. all. |
U.S. Appl. No. 17/443,056 titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences” filed Jul. 20, 2021, pp. all. |
U.S. Appl. No. 17/446,710 titled “Apparatuses, Systems, and Methods for Determining Extremum Numerical Values” filed Sep. 1, 2021, pp. all. |
Number | Date | Country | |
---|---|---|---|
20190385667 A1 | Dec 2019 | US |