This disclosure relates generally to semiconductor devices, and more specifically to semiconductor memory devices. In particular, the disclosure relates to volatile memory, such as dynamic random access memory (DRAM). Information may be stored on individual memory cells of the memory as a physical signal (e.g., a charge on a capacitive element). The memory may be a volatile memory, and the physical signal may decay over time (which may degrade or destroy the information stored in the memory cells). It may be necessary to periodically refresh the information in the memory cells by, for example, rewriting the information to restore the physical signal to an initial value.
As memory components have decreased in size, the density of memory cells has greatly increased. Typically, memory cells are arranged in an array that includes a series of rows referred to as word lines and columns referred to as bit lines. An automatic refresh (e.g., auto-refresh) operation may be carried out where the memory cells of one or more word lines are periodically refreshed to preserve data stored in the memory cells. Repeated access to a particular memory cell or group of memory cells, such as a word line, may cause an increased rate of data degradation in nearby memory cells (e.g., adjacent word lines). This repeated access is often referred to as a ‘row hammer.’ To preserve the data in nearby memory cells, the word lines of the nearby memory cells may need to be refreshed at a rate higher than a rate of the auto-refresh. Targeted refresh operations may be performed on the nearby memory cells, but the targeted refresh operations may come at a cost to the auto-refresh operations. As the auto-refresh rate is reduced by targeted refresh operations, data degradation could occur in memory cells unaffected by the row hammer. Increasing the auto-refresh rate to compensate for the targeted refreshes may cause the memory to use more power and/or increase delays between memory access operations (e.g., read, write). Accordingly, minimizing the targeted refresh operations is desired.
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 plurality of memory cells. The memory cells may store information (e.g., as one or more bits), and may be organized at the intersection of word lines (rows) and bit lines (columns). A number of word lines and bit lines may be organized into a memory bank. A memory device may include a number of different memory banks. The memory device may receive one or more command signals which may indicate operations in one or more of the banks of one or more memory packages. The memory device may enter a refresh mode, in which word lines in one or more of the memory banks are refreshed.
Information in the memory cells may decay over time. The memory cells may be refreshed on a row-by-row basis to preserve information in the memory cells. During a refresh operation, the information in one or more word lines may be rewritten back to the respective word lines to restore an initial value of the information. Repeated access to a given word line (e.g., an aggressor word line) may cause an increased rate of information decay in one or more physically neighboring word lines (e.g., victim word lines). In some applications, victim word lines may be considered to be the word lines which are physically adjacent to the aggressor word line. For example, victim word lines may be located on either side of the aggressor word line (e.g., R+1 and R−1) as well as the word lines which are adjacent to the adjacent word lines (e.g., R+2 and R−2).
Accesses to different word lines of the memory may be tracked in order to determine if a word line is an aggressor word line. The row address of the accessed word lines and/or aggressor word lines may be stored in a register or other storage device in the memory. If a word line is determined to be an aggressor word line, victim word lines may be determined based, at least in part, on a row address of the aggressor word line. The victim word lines (e.g., R+1, R−1, R+2, and R−2) may be refreshed as part of a targeted (e.g., ‘row hammer’) refresh operation. There may be four victim row addresses for each aggressor row address in some applications.
When the aggressor word lines are tracked, the victim word lines associated with the aggressor word line must be refreshed during one or more targeted refresh operations. In some applications, this may require refreshing four word lines, which may require ‘stealing’ four refreshes from the auto-refresh operation. However, not all of the victim word lines may require immediate refreshing to preserve data. Furthermore, a victim word line may be a victim based on its proximity to more than one aggressor word line. Thus, the victim word line may be refreshed multiple times by targeted refresh operations based on victim determinations from the multiple aggressor word lines. This may result in the victim word line being refreshed more often than necessary to preserve data in the victim word line. In some applications, it may be desirable to reduce the number of unnecessary targeted refresh operations to reduce the impact on the auto-refresh rate and/or power consumption by a memory device.
The present disclosure is drawn to apparatuses and methods for tracking victim row addresses. The addresses of victim word lines may be determined based on word lines that are accessed in a memory. For example, row addresses provided with activation, read, and write commands. The victim addresses may be tracked (e.g., stored) and associated with a count value. In some embodiments, the count value may indicate a number of times a row address is determined to be a victim row address. For example, when a row address is determined to be a victim row address of an accessed word line. The count value for a victim row address may be adjusted every time the same victim row address is determined based on an accessed row address. When the count value for a victim row address reaches a threshold value, the victim word line associated with the victim row address may be refreshed during a targeted refresh operation to preserve data stored in the victim word line. After the victim word line has been refreshed, the count value may be reset. If no victim word line has a count value at or above the threshold value, an auto-refresh operation may be performed instead of a targeted refresh operation in some embodiments. This may reduce the steal rate in some applications. When a victim word line is accessed or refreshed by an auto-refresh operation, the count value may also be reset. This may reduce unnecessary refreshes of victim word lines in some applications. The data in more distant victim word lines may be less prone to data degradation than closer victim word lines. As a result, victim word lines closer to an aggressor word line (e.g., R+/−1) may be refreshed at a higher rate than more distant victim word lines (e.g., R+/−2). For example, in some embodiments of the disclosure, the count values for the victim row addresses may be adjusted for the closer victim word lines (e.g., R+/−1) by a greater amount than counts for the victim row addresses of more distant victim word lines (e.g., R+/−2).
The semiconductor device 100 includes a memory array 112. In some embodiments, the memory array 112 may include of a plurality of memory banks. Each memory bank includes a plurality of word lines WL, a plurality of bit lines BL and /BL, and a plurality of memory cells MC arranged at intersections of the plurality of word lines WL and the plurality of bit lines BL and /BL. The selection of the word line WL is performed by a row control circuit 108 and the selection of the bit lines BL and /BL is performed by a column control circuit 110. In some embodiments, there may be a row control circuit 108 and column control circuit 110 for each of the memory banks.
The bit lines BL and /BL are coupled to a respective sense amplifier (SAMP) 117. Read data from the bit line BL or /BL is amplified by the sense amplifier SAMP 117, and transferred to read/write amplifiers 120 over complementary local data lines (LIOT/B), transfer gate (TG) 118, and complementary main data lines (MIO). Conversely, write data outputted from the read/write amplifiers 120 is transferred to the sense amplifier 117 over the complementary main data lines MIO, the transfer gate 118, and the complementary local data lines LIOT/B, and written in the memory cell MC coupled to the bit line BL or /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, 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 a clock input circuit 122. The external clocks may be complementary. The clock input circuit 122 generates an internal clock ICLK based on the CK and /CK clocks. The ICLK clock is provided to the command control circuit 106 and to an internal clock generator circuit 124. The internal clock generator circuit 124 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 126 to time operation of circuits included in the input/output circuit 126, for example, to data receivers to time the receipt of write data.
The C/A terminals may be supplied with memory addresses. The memory addresses supplied to the C/A terminals are transferred, via a command/address input circuit 102, to an address decoder circuit 104. The address decoder circuit 104 receives the address and supplies a decoded row address XADD to the row control circuit 108 and supplies a decoded column address YADD to the column control circuit 110. The row address XADD may be used to specify one or more word lines WL of the memory array 112 and the column address YADD may specify one or more bit lines BL of the memory array 112. The address decoder circuit 104 may also provide a bank address BADD, which specifies a particular bank of the memory. The bank address BADD may be provided to the row control circuit 108 and/or column control circuit 110 to direct access operations to one or more of the banks. 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/or bank address BADD to indicate the memory cell(s) to be accessed.
The commands may be provided as internal command signals to a command control circuit 106 via the command/address input circuit 102. The command control circuit 106 includes circuits to decode the internal command signals to generate various internal signals and commands for performing operations. For example, the command control circuit 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 row activation command ACT. When the row activation command ACT is received, a row address XADD is timely supplied with the row activation command ACT.
The device 100 may receive an access command which is a read command. When a read command is received, a bank address BADD and a column YADD address are timely supplied with the read command, read data is read from memory cells in the memory array 112 corresponding to the row address XADD and column address YADD. The read command is received by the command control circuit 106, which provides internal commands so that read data from the memory array 112 is provided to the read/write amplifiers 120. The read data is output to outside from the data terminals DQ via the input/output circuit 126.
The device 100 may receive an access command which is a write command. When the write command is received, a bank address and a column address are timely supplied with the write command, write data supplied to the data terminals DQ is written to a memory cells in the memory array 112 corresponding to the row address and column address. The write command is received by the command control circuit 106, which provides internal commands so that the write data is received by data receivers in the input/output circuit 126. 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 126. The write data is supplied via the input/output circuit 126 to the read/write amplifiers 120, and by the read/write amplifiers 120 to the memory array 112 to be written into the memory cell MC.
The device 100 may also receive commands causing it to carry out refresh operations. A refresh signal AREF may be a pulse signal which is activated when the command control circuit 106 receives a signal which indicates a refresh mode. In some embodiments, the refresh command may be externally issued to the memory device 100. In some embodiments, the refresh command may be periodically generated by a component of the device. In some embodiments, when an external signal indicates a refresh entry command, the refresh signal AREF may also be activated. The refresh signal AREF may be activated once immediately after command input, and thereafter may be cyclically activated at desired internal timing. Thus, refresh operations may continue automatically. A self-refresh exit command may cause the automatic activation of the refresh signal AREF to stop and return to an IDLE state.
The refresh control circuit 116 supplies a refresh row address RXADD to the row control circuit 108, which may refresh one or more word lines WL indicated by the refresh row address RXADD. The refresh control circuit 116 may control a timing of the refresh operation based on the refresh signal AREF. In some embodiments, responsive to an activation of AREF, the refresh control circuit 116 may generate one or more activations of a pump signal, and may generate and provide a refresh address RXADD for each activation of the pump signal (e.g., each pump).
One type of refresh operation may be an auto-refresh operation. Responsive to an auto-refresh operation the memory bank may refresh a word line or a group of word lines of the memory, and then may refresh a next word line or group of word lines of the memory bank responsive to a next auto-refresh operation. The refresh control circuit 116 may provide a refresh address RXADD which indicates a word line or a group of word lines in the memory bank. The refresh control circuit 116 may generate a sequence of refresh addresses RXADD such that over time the auto-refresh operation may cycle through all the word lines WL of the memory bank. The timing of refresh operations may be such that each word line is refreshed with a frequency based, at least in part, on a normal rate of data degradation in the memory cells (e.g., auto-refresh rate).
Another type of refresh operation may be a targeted refresh operation. As mentioned previously, repeated access to a particular word line of memory (e.g., an aggressor word line) may cause an increased rate of decay in neighboring word lines (e.g., victim word lines) due, for example, to electromagnetic coupling between the word lines. In some embodiments, the victim word lines may include word lines which are physically adjacent to the aggressor word line. In some embodiments, the victim word lines may include word liens further away from the aggressor word line. Information in the victim word line may decay at a rate such that data may be lost if not refreshed before the next auto-refresh operation of that word line. In order to prevent information from being lost, it may be necessary to identify aggressor word lines and then carry out a targeted refresh operation where a refresh address RXADD associated with one or more associated victim word lines is refreshed.
The refresh address control circuit 116 may selectively output a targeted refresh address (e.g., a victim row address) or an automatic refresh address (e.g., auto-refresh address) as the refresh address RXADD. The auto-refresh addresses may be a sequence of addresses which are provided based on activations of the auto-refresh signal AREF. The refresh address control circuit 116 may cycle through the sequence of auto-refresh addresses at a rate determined by AREF.
The refresh address control circuit 116 may also determine targeted refresh addresses which are addresses that require refreshing (e.g., victim row addresses corresponding to victim word lines) based on the access pattern of nearby addresses (e.g., aggressor row addresses corresponding to aggressor word lines) in the memory array 118. The refresh address control circuit 116 may selectively use one or more signals of the device 100 to calculate the refresh address RXADD. For example, the refresh address RXADD may be calculated based on the row addresses XADD provided by the address decoder circuit 104. The refresh address control circuit 116 may receive the current value of the row address XADD provided by the address decoder circuit 104 and determine a targeted refresh address based on one or more of the received addresses.
The refresh address RXADD may be provided with a timing based on a timing of the refresh signal AREF. This may be referred to as the auto-refresh rate. The refresh address control circuit 116 may have time slots corresponding to the timing of AREF, and may provide one or more refresh addresses RXADD during each time slot. In some embodiments, a targeted refresh address may be issued in a time slot which would otherwise have been assigned to an auto-refresh address (e.g., “steal”). In some embodiments, certain time slots may be reserved for targeted refresh addresses. These time slots may be referred to as a targeted refresh intervals or targeted refresh time slots. The time period between time slots reserved for targeted refresh addresses may be referred to as the targeted refresh rate or steal rate. As the number of targeted refresh time slots increases, the steal rate increases, and the effective auto-refresh rate decreases. In some embodiments, the refresh address control circuit 116 may determine whether to provide a targeted refresh address, not provide an address during that time slot, or provide an auto-refresh address instead during the time slot. Thus, in some embodiments, the steal rate may not be constant over time.
The targeted refresh address may be based on the row addresses XADD received from the address decoder circuit 104. For example, the refresh control circuit 116 may determine row addresses for one or more victim word lines (e.g., victim row addresses) based on the row address XADD. The victim row addresses may be stored along with corresponding count values. Each time a row is determined to be a victim word line based on the row address XADD, the count value of the corresponding row address may be adjusted (e.g., increased). Once a count value reaches a threshold value, the corresponding victim row address may be provided as a targeted refresh address to be refreshed during a targeted refresh interval. In some cases, multiple count values may reach the threshold value between targeted refresh intervals. In this case, the victim row addresses may be stored in a queue and sequentially provided as targeted refresh addresses during sequential targeted refresh intervals. In some applications, multiple victim row addresses may be provided per targeted refresh interval. After the victim word line associated with the victim row address has been refreshed, the count value associated with the victim row address may be reset (e.g., set to a value of zero). If none of the count values have reached the threshold value, the refresh control circuit 116 may supply one or more auto-refresh addresses during the targeted refresh interval. In some embodiments, the row address XADD and/or the auto-refresh address may be compared to the victim row addresses stored in the refresh control circuit 116. If the row address or auto-refresh address matches a victim row address, the count value for the victim row address may be reset.
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 128. The internal voltage generator circuit 128 generates various internal potentials VPP, VOD, VARY, VPERI, and the like based on the power supply potentials VDD and VSS supplied to the power supply terminals. The internal potential VPP is mainly used in the row decoder circuit 108, the internal potentials VOD and VARY are mainly used in the sense amplifiers SAMP included in the memory array 118, and the internal potential VPERI is used in many peripheral circuit blocks.
The power supply terminals are also supplied with power supply potentials VDDQ and VSSQ. The power supply potentials VDDQ and VSSQ are supplied to the input/output circuit 126. 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 126 does not propagate to the other circuit blocks.
A DRAM interface 226 may provide one or more signals to a refresh control circuit 216 and row decoder circuit 208. The refresh control circuit 216 may include a victim row decoder circuit 230, a stack 232, a row hammer refresh (RHR) state control 236 and a refresh address generator 234. The DRAM interface 226 may provide one or more control signals, such as a refresh signal AREF, and a row address XADD.
The DRAM interface 226 may represent one or more components which provides signals to components of the bank 218. In some embodiments, the DRAM interface 226 may represent a memory controller coupled to the semiconductor memory device (e.g., device 100 of
The victim row decoder circuit 230 may receive the current row address XADD. In some embodiments, based on the row address XADD, the victim row decoder circuit 230 may determine one or more victim row addresses VADD corresponding to victim word lines. Thus, the word lines in close proximity to the aggressor word line associated with row address XADD are referred to herein as victim word lines. The one or more victim row addresses VADD determined by the victim row decoder circuit 230 may be provided to the stack 232 for storage. For example, the victim row decoder circuit 230 may determine addresses for the R+1 and R−1 victim word lines, that is, those word lines physically adjacent to a word line associated with the row address XADD. In some embodiments, the victim row decoder circuit 230 may determine addresses for the R+2 and R−2 word lines associated with the row address XADD, that is victim word lines adjacent to the R+/−1 word lines. In some embodiments, more distant victim word lines may be calculated. For a given row address XADD, there may not be an even number of victim word lines. For example, if an aggressor word line corresponding to row address XADD is at a physical edge of a memory cell array, there may be only one R+1/R−1 victim word line in some applications.
The row address XADD may change as the DRAM interface 226 directs access operations (e.g., read and write operations) to different rows of the memory cell array (e.g., memory cell array 118 of
The stack 232 may be configured to store the victim row addresses VADD received from the victim row decoder circuit 230. The stack 232 may further store a count value for each victim row address. Each time a particular victim row address is provided to the stack 232, the count value for the particular victim row address may be adjusted, for example, the count value may be increased. In some embodiments, the amount the count value is adjusted may be based, at least in part, on the proximity of the victim word line associated with the victim row address to an aggressor word line associated with the row address XADD. That is, a first victim row address may be associated with a first victim word line having a first distance to an aggressor word line and a second victim row address may be associated with a second victim word line having a second distance to the aggressor word line and the second distance is greater than the first distance. The count value for the first victim row address may be adjusted by a greater amount than the count value for the second victim row address. For example, if a victim word line is located immediately next to the aggressor word line (e.g., R+1 or R−1), the count value may be increased by ten, whereas if the victim word line is more distant (e.g., R+2 or R−2), the count value may be increased by one. Other differences in adjusting the count value based on proximity may also be used. In some embodiments, the victim row decoder 230 may indicate a proximity associated with a provided victim row address and/or an amount to adjust the count value of a victim address in the stack 232. When a count value stored in the stack 232 reaches a threshold value, the stack 232 may provide the corresponding victim row address to the refresh address generator 234 as a targeted address HitXADD.
The RHR state control 236 may control the timing of targeted refresh operations (e.g., the steal rate). The RHR state control 236 may provide an active signal RHR to indicate that a targeted refresh (e.g., a refresh of the victim word lines), also referred to as a row hammer refresh, should occur. The RHR state control 236 may also provide an active internal refresh signal IREF, to indicate that an auto-refresh should occur. Responsive to an activation of RHR, the refresh address generator 234 may provide a refresh address RXADD, which may be an auto-refresh address or may be a victim address for a victim word line corresponding to the targeted address HitXADD. The row decoder circuit 208 may perform a targeted refresh operation responsive to the refresh address RXADD and the signal RHR. The row decoder circuit 208 may perform an auto-refresh operation based on the refresh address RXADD and the active internal refresh signal IREF. In some embodiments, the row decoder circuit 208 may receive the auto-refresh signal AREF provided by the DRAM interface 226, and the internal refresh signal IREF may not be used.
The RHR state control 236 may receive the auto-refresh signal AREF and provide the row hammer refresh signal RHR. The auto-refresh signal AREF may be periodically generated and may be used to control the timing of refresh operations. The memory device may carry out a sequence of auto-refresh operations in order to periodically refresh the rows of the memory device. The RHR signal may be generated in order to indicate that a particular targeted row address should be refreshed instead of an address from the sequence of auto-refresh addresses. For example, if a count value associated with a victim row address has reached or exceeded a threshold value. The RHR state control 236 may use internal logic to provide the RHR signal. In some embodiments, the RHR state control 236 may provide the RHR signal based on certain number of activations of AREF (e.g., every 4th activation of AREF). The RHR state control 236 may also provide an internal refresh signal IREF, which may indicate that an auto-refresh operation should take place. In some embodiments, the signals RHR and IREF may be generated such that they are not active at the same time (e.g., are not both at a high logic level at the same time).
The refresh address generator 234 may receive the AREF signal, the row hammer refresh signal RHR and the targeted row address HitXADD. The targeted row address HitXADD may represent a victim word line. The refresh address generator 234 may determine whether a targeted row address HitXADD should be provided or an auto-refresh address as the refresh address RXADD. The refresh address generator 234 may determine the value of the refresh address RXADD based, at least in part, on the row hammer refresh signal RHR. In some embodiments, when the signal RHR is not active, the refresh address generator 234 may provide one of a sequence of auto-refresh addresses. When the signal RHR is active, the refresh address generator 234 may check if a targeted row address is available and if so, provide the targeted row address HitXADD, as the refresh address RXADD. If no targeted row address HitXADD is available (e.g., none of the count values stored in the stack have reached the threshold value), the refresh address generator 234 may provide an auto-refresh address as the refresh address RXADD, even if the RHR signal is active. In other embodiments, if no targeted row address HitXADD is available, no refresh operation may be performed. The refresh address RXADD may be provided to the stack 232, and a count value associated with a victim row address matching the refresh address RXADD may be reset.
The row decoder circuit 208 may perform one or more operations on the memory array (not shown) based on the received signals and addresses. For example, responsive to the activation signal ACT and the row address XADD (and IREF and RHR being at a low logic level), the row decoder circuit 208 may direct one or more access operations (for example, a read operation) on the specified row address XADD. Responsive to the RHR signal being active, the row decoder circuit 208 may refresh the refresh address RXADD.
Each time a victim row address VADD is provided (e.g. from a victim row decoder circuit, such as victim row decoder circuit 230 in
The stack 300 may receive row address XADD and refresh address RXADD. Row address XADD may be received during a memory access operation (e.g., activation, read, write) and refresh address RXADD may be received during a refresh operation. The row address XADD and refresh address RXADD may be compared to fields 304. If the row address XADD or refresh address RXADD is stored in one of the registers 302, the count value in field 306 of the register 302 may be reset (e.g., set to zero). Resetting the count value for victim row addresses after they have been accessed or refreshed may reduce a number of unnecessary refresh operations on victim word lines.
The comparator 308 may compare the count values in fields 306 to a threshold value to determine if a count value for a victim row address has matched or exceeded the threshold value (e.g., 2,000, 3,000, 5,000). In some embodiments, the comparator 308 may further compare the count values to determine which victim row address is associated with the lowest count value. The fields 306 corresponding to the minimum count value and count values that meet or exceed the threshold value may be provided to a counter scrambler 310, which may match the above threshold value fields and minimum count value field to their respective associated row address fields 304. The pointers 312 may point to the victim row addresses in fields 304 associated with count values at or above the threshold value and may point to the fields 304 associated with the minimum count value in fields 306. The threshold value pointer(s) may be used to provide the corresponding victim row address(es) to the refresh address generator as HitXADD. When a targeted refresh operation is carried out based on the address HitXADD, the count value in field 306 associated with the victim row address may be reset. The minimum count value pointer may be used to overwrite a register 302 when a new victim row address VADD is received and there is no open register 302 to store it in.
Although increasing the count value to track a number of times a word line is a victim of an aggressor word line has been described, other methods of adjusting the count value may be used. For example, the count value may start at an initial value (e.g., 3,000) and the count value may be decreased each time the victim row address VADD is received by the stack 300. Once the count value reaches zero, the corresponding victim row address may be provided as HitXADD.
The refresh cycle generator 402 determines if an auto-refresh operation or a targeted refresh operation will occur. The refresh cycle generator 402 receives the refresh signal AREF and selectively provides an active command signal RHR in response. The active command signal RHR may indicate a targeted refresh operation is to be performed (e.g., a targeted refresh interval). The refresh cycle generator 402 may periodically provide the active command signal RHR based on a rate of the auto-refresh signal AREF.
The AREF address generator 406 generates an auto-refresh address Pre_RXADD in response to the refresh signal AREF. The auto-refresh address Pre_RXADD may be part of a sequence of addresses to be refreshed as part of an auto-refresh operation. The refresh address generator 406 may update the current auto-refresh address Pre_RXADD to a next address in the sequence in response to an active refresh signal AREF. The refresh address generator 406 is also provided the command signal RHR from cycle generator 402. When the command signal RHR is active, the refresh address generator 406 may be controlled to stop updating the auto-refresh address Pre_RXADD even if the auto-refresh signal AREF is active in some embodiments. As described herein, since the active command signal RHR indicates that a targeted refresh operation is to be conducted instead of an auto-refresh operation, this allows the auto-refresh operation to be suspended while the targeted refresh is carried out, and resumed when the command signal RHR is not active. However, as will be described in more detail, in some embodiments, an active Empty signal provided by the targeted address queue 408 may override the command signal RHR to prevent suspension of the auto-refresh operation.
The targeted address queue 408 may receive targeted refresh address HitXADD1 from stack 404 and provide the targeted refresh address HitXADD2 based on the targeted refresh address HitXADD1. Targeted address queue 408 may store one or more targeted refresh addresses HitXADD1 received from the stack 404. As mentioned previously, count values for multiple victim row addresses may meet or exceed the threshold value between targeted refresh intervals. In some embodiments, the victim row addresses may be stored in the targeted address queue 408 for refreshing during sequential targeted refresh intervals. The targeted address queue 408 may be a “first-in-first-out” queue in some embodiments. In some embodiments, the targeted address queue 408 may include a plurality of registers. However, other storage structures may be used. In some embodiments, the targeted address queue 408 may have a pointer that points to a victim row address to be output as targeted refresh address HitXADD2. Responsive to an active command signal RHR, the pointer may be incremented to the next victim row address in the queue and the next victim row address may be output as HitXADD2. In some embodiments, the targeted address queue 408 may clear a register once the victim row address stored in the register is provided as HitXADD2. In some embodiments, the targeted address queue 408 may use a flag to indicate a victim row address has been provided as HitXADD2. Clearing the register and/or setting flags may allow the targeted address queue 408 to determine when a register is available for rewriting and/or the queue is empty. Other techniques for controlling the queue and determining the status of the queue may also be used. If the targeted address queue 408 determines the queue of victim row addresses is empty, the targeted address queue 408 may activate an Empty signal in some embodiments.
The multiplexer 410 accepts the auto-refresh address Pre_RXADD provided by the AREF address generator 406 and the targeted refresh address HitXADD2 provided by the targeted address queue 408 and outputs one of them as the refresh address RXADD. The multiplexer 410 may select between the two refresh addresses based on the command signal RHR and Empty signal. Control logic 412 is provided the command signals RHR and Empty and an output is provided to the multiplexer 410 to control selection of providing the Pre_RXADD or HitXADD2 addresses as the refresh address RXADD. The control logic 412 outputs a first logic level if command signal RHR is active and Empty is inactive. The multiplexer 410 outputs the targeted address HitXADD2 in response to the first logic level. If command signal RHR is inactive, the control logic 412 may output a second logic level regardless of the Empty signal. The multiplexer 410 outputs the auto-refresh address Pre_RXADD in response to the second logic level. If the command signal RHR is active, but the Empty signal is active (e.g., the targeted address queue 408 is empty), the control logic 412 may output the second logic level and the multiplexer 410 may output the auto-refresh address Pre_RXADD. As mentioned previously, the active Empty command may override the command signal RHR provided to the AREF address generator 406, so a current Pre_RXADD is provided. Thus, even during a targeted refresh interval, if no victim rows require refreshing, an auto-refresh operation may be performed in some embodiments. In some applications, this may reduce the steal rate.
In other embodiments, if the targeted address queue 408 is empty, no refresh operation may be performed. That is, a number of refresh operations dedicated to targeted refresh operations may remain constant. However, because not all victim rows are refreshed at the same rate, refreshing of victim rows during both targeted and auto-refresh operations are tracked, and/or accesses to victim row addresses are tracked, a memory may be designed with a lower steal rate.
At block 506, a step of “storing the victim row address” may be performed. In some embodiments, the victim row address may be stored in a register, such as register 302 shown in
At block 512, “refreshing a victim word line” may be performed. The victim word line may be associated with the victim row address. The refreshing may be performed during a targeted refresh interval. The refresh operation may be performed by a refresh control circuit, such as refresh control circuit 116 in
In some embodiments, at block 516, a step of “comparing the row address to a stored victim row address” may be performed. If the row address matches the stored victim row address, at block 518, a step of “resetting a count value” may be performed. The count value may be associated with the stored victim row address. The dashed line shown for blocks 516 and 518 represents that in some embodiments of the disclosure, one or both of the steps are optional and may not be included.
The CAM cell 600 includes a latch portion 602 and a comparator portion 604. The CAM cell 600 may generally use voltages to represent the values of various bits. The CAM cell 600 may include conductive elements (e.g., nodes, conductive lines) which carry a voltage representing a logical value of that bit. For example, a high logical level may be represented by a first voltage (e.g., a system voltage such as VPERI), while a low logical level may be represented by a second voltage (e.g., a ground voltage, such as VSS).
The latch portion 602 includes a first transistor 606 which has a source coupled to a node which provides a voltage VPERI, which may represent a high logical level. The first transistor 606 has a drain coupled to a node 617 having a voltage which represents the value of the signal Q and a gate coupled to a node 619 having a voltage which represents a value of the complementary signal QF. The signal Q represents the logical level of a bit stored in the latch portion 602. The first transistor 606 may be a p-type transistor. The latch portion 602 also includes a second transistor 607 which has a source coupled to the node which provides VPERI, a gate coupled to the node 617 and a drain coupled to the node 619. The second transistor 607 may be a p-type transistor.
The latch portion 602 includes a third transistor 608 which has a drain coupled to the node 617, a gate coupled to the node 619, and a source coupled to a node providing a ground voltage VSS, which may represent a low logical level. The third transistor 608 may be an n-type transistor. The latch portion 602 includes a fourth transistor 609 which has a drain coupled to the node 619, a gate coupled to the node 617, and a source coupled to the node providing the ground voltage VSS. The fourth transistor 609 may be an n-type transistor. The transistors 606 and 608 may form an inverter circuit and the transistors 607 and 609 may form another inverter circuit, and the two inverter circuits are cross-coupled to one another.
In operation, the first, second, third, and fourth transistors 606-609 may work to store the value of the stored signals Q and QF. The transistors 606-609 may work together to couple the node 617 carrying Q and the node 619 carrying QF to a node providing the system voltage (e.g., VPERI or VSS) associated with the value of the signals Q and QF. For example, if the stored signal Q is at a high logical level, then the inverse signal QF is at a low logical level. The first transistor 606 may be active, and VPERI may be coupled to the node 617. The second transistor 607 and the third transistor 608 may be inactive. The fourth transistor 609 may be active and may couple VSS to the node 619. This may keep the node 617 at a voltage of VPERI, which represents a high logical level, and the node 619 at a voltage of VSS, which represents a low logical level. In another example, if the stored signal Q is at a low logical level, then the inverse signal QF may be at a high logical level. The first transistor 606 and the fourth transistor 609 may both be inactive. The second transistor 607 may be active and may couple VPERI to the node 619. The third transistor 608 may also be active and may couple VSS to the node 617. In this manner, the stored signal Q and QF may be coupled to a respective system voltage corresponding to their current logical levels, which may maintain the current logical value of the stored bit.
The latch portion 602 also includes a fifth transistor 610 and a sixth transistor 611. The transistors 610 and 611 may act as switches which may couple a signal line which carries input data D and a signal line carrying inverse input data DF to the nodes 617 and 619 carrying Q and QF respectively when a write signal Write is active. The fifth transistor 610 has a gate coupled to a line carrying the Write signal, a drain coupled to the signal D, and a source coupled to the node 619. The sixth transistor 611 has a gate coupled to the Write signal, a drain coupled to the signal DF, and a source coupled to the node 619. Accordingly, when the Write signal is at a high level (e.g., at a voltage such as VPERI), the transistors 610 and 611 may be active, and the voltages of the signals D and DF may be coupled to the nodes 617 and 619 carrying Q and QF respectively.
In some embodiments, the first through sixth transistors 606-611 may generally all be the same size as each other.
The CAM cell 600 also includes a comparator portion 604. The comparator portion 604 may compare the signals Q and QF to the signals X_Compare and XF_Compare. The signal X_Compare may represent a logical level of an external bit provided to the comparator portion 604. If there is not a match between the signals Q and X_Compare (and therefore between QF and XF_Compare), then the comparator portion 606 may change a state of from the BitMatch signal from a first logical level (e.g., a high logical level) to a second logical level (e.g., a low logical level). For example, if the stored and external bits do not match, the comparator portion 604 may couple the ground voltage VSS to a signal line carrying the signal BitMatch. In some embodiments, if there is a match between the stored and external bits, then the comparator portion 606 may do nothing. In some embodiments, the signal BitMatch may be precharged to a voltage associated with a high logical level (e.g., VPERI) before a comparison operation.
The comparator portion includes a seventh transistor 612, an eighth transistors 613, a ninth transistor 614, and a tenth transistor 615. The seventh transistor 612 includes a drain coupled to the signal BitMatch, a gate coupled to the node 617 (e.g., the signal Q), and a source coupled to a drain of the ninth transistor 614. The ninth transistor 614 also has a gate coupled to the signal XF_Compare and a source coupled to a signal line providing the ground voltage VSS.
The eighth transistor 613 has a drain coupled to the signal BitMatch, a gate coupled to the node 619 (e.g., the signal QF), and a source coupled to a drain of the tenth transistor 615. The tenth transistor has a gate coupled to the signal X_Compare and a source coupled to the ground voltage VSS.
Since the signal Q is complementary to the signal QF, the comparator portion 602 may operate by comparing the external signal X_Compare to the signal QF to see if they match, and the inverse external signal XF_Compare to the stored signal Q to see if they match. If they do match, it may indicate that the signal X_Compare does not match the signal Q and that the signal XF_Compare does not match the signal QF, and thus that the external bits do not match the associated stored bits.
The comparator portion 604 may use relatively few components, since it changes the signal BitMatch from a known state (e.g., a precharged high logical level) to a low logical level. Thus, it may not be necessary to include additional components (e.g., additional transistors) to change the logical level of the signal BitMatch from low to high, or from an unknown level to either low or high. The comparator portion 604 may take advantage of this to provide dynamic logic. For example, the comparator portion 604 has two portions (e.g., transistors 612/614 and transistors 614/615) either of which may couple the signal BitLine to the voltage VSS if there is not a match between the stored and external bit. Since only one of the portions is active at a time, only the state of the signal Q or QF needs to be checked by the active portion. Either of the portions is equally capable of changing the signal BitMatch to a low logical level.
In an example operation, if the stored signal Q is at a high logical level (and thus the signal QF is low) and the external signal X_Compare is also high (and the signal XF_Compare is low), then the external signals may match the stored signals, and the transistors 612 and 615 may be active while the transistors 614 and 613 are inactive. This may prevent the ground voltage VSS from being coupled to the signal BitMatch. If the signal X_Compare is low (e.g., if there is not a match), then the external signals may not match the stored signals, and the transistors 612 and 614 may be active wile transistors 613 and 615 are inactive. The transistors 612 and 614 being active at the same time may couple the ground voltage VSS to the signal BitMatch.
In another example operation if the stored signal Q is low (and thus the signal QF is high) then the transistor 612 may be inactive while the transistor 613 is active. If the external signal X_Compare is low (and XF_Compare is high) then the external signal may match the stored bits, and the transistor 614 is active while transistor 615 is inactive. If the signal X_Compare is high (and the signal XF_Compare is low) then the external signal may not match the stored signal and the transistor 614 may be inactive while the transistor 615 is active. Accordingly, the signal BitMatch may be coupled to ground voltage VSS through active transistors 613 and 615.
In some embodiments, the transistors 612-615 of the comparator portion 604 may generally all have the same size to each other. In some embodiments, the transistors 612-615 of the comparator portion 604 may be a different size than the transistors 606-611 of the latch portions 602.
In some applications, using the CAM cell to implement registers and/or stacks may allow for victim row addresses calculated by a victim row decoder circuit (e.g., victim row decoder circuit 230), to be compared to the victim row addresses already stored in the register and/or stack within a time period that does not impede the operation of the memory. If any of the victim row addresses are not in the register and/or stack, they may be timely written to the stack. If any of the victim row addresses are already stored in the register and/or stack, count values associated with the victim row address may be timely adjusted. In some applications, using the CAM cell to implement registers and/or stacks may allow for row addresses and/or refresh addresses to be compared to the victim row addresses already stored in the register and/or stack within a time period that does not impede the operation of the memory. If any of the row or refresh addresses are already stored in the register and/or stack, count values associated with the victim row address may be timely reset. Thus, in some applications, the CAM cell may allow for tracking of word line accesses and storage of information related to victim word lines. However, in other applications, other memory cell structures may be used.
The apparatuses, systems, and methods described herein may provide for tracking of victim rows, such as by storing victim row addresses. Storing data regarding victim rows may allow for a reduction in steal rates and/or reduction in power consumption in some applications.
Of course, it is to be appreciated that any one of the examples, embodiments or processes described herein may be combined with one or more other examples, embodiments and/or processes or be separated and/or performed amongst separate devices or device portions in accordance with the present systems, devices and methods.
Finally, the above-discussion is intended to be merely illustrative of the present system and should not be construed as limiting the appended claims to any particular embodiment or group of embodiments. Thus, while the present system has been described in particular detail with reference to exemplary embodiments, it should also be appreciated that numerous modifications and alternative embodiments may be devised by those having ordinary skill in the art without departing from the broader and intended spirit and scope of the present system as set forth in the claims that follow. Accordingly, the specification and drawings are to be regarded in an illustrative manner and are not intended to limit the scope of the appended claims.
This application is a continuation of U.S. patent application Ser. No. 16/428,625 filed May 31, 2019 and issued as U.S. Pat. No. 11,158,364 on Oct. 16, 2021. The aforementioned application, and issued patent, is incorporated herein by reference, in its entirety, for any purpose.
Number | Name | Date | Kind |
---|---|---|---|
3633175 | Harper | Jan 1972 | A |
4679173 | Sato | Jul 1987 | A |
5089957 | Stultz et al. | Feb 1992 | A |
5291198 | Dingwall et al. | Mar 1994 | A |
5299159 | Balistreri et al. | Mar 1994 | A |
5422850 | Sukegawa et al. | Jun 1995 | A |
5638317 | Tran | Jun 1997 | A |
5699297 | Yamazaki et al. | Dec 1997 | A |
5751655 | Yamazaki et al. | May 1998 | A |
5768196 | Bloker et al. | Jun 1998 | A |
5874907 | Craft | Feb 1999 | A |
5933377 | Hidaka | Aug 1999 | A |
5943283 | Wong et al. | Aug 1999 | A |
5970507 | Kato et al. | Oct 1999 | A |
5999471 | Choi | Dec 1999 | A |
6002629 | Kim et al. | Dec 1999 | A |
6011734 | Pappert | Jan 2000 | A |
6061290 | Shirley | May 2000 | A |
6212118 | Fujita | Apr 2001 | B1 |
6310806 | Higashi et al. | Oct 2001 | B1 |
6317381 | Gans et al. | Nov 2001 | B1 |
6373738 | Towler et al. | Apr 2002 | B1 |
6392952 | Chen et al. | May 2002 | B1 |
6424582 | Ooishi | Jul 2002 | B1 |
6434064 | Nagai | Aug 2002 | B2 |
6452868 | Fister | Sep 2002 | B1 |
6480931 | Buti et al. | Nov 2002 | B1 |
6515928 | Sato et al. | Feb 2003 | B2 |
6567340 | Nataraj et al. | May 2003 | B1 |
6950364 | Kim | Sep 2005 | B2 |
7027343 | Sinha et al. | Apr 2006 | B2 |
7057960 | Fiscus et al. | Jun 2006 | B1 |
7082070 | Hong | Jul 2006 | B2 |
7187607 | Koshikawa et al. | Mar 2007 | B2 |
7203113 | Takahashi et al. | Apr 2007 | B2 |
7203115 | Eto et al. | Apr 2007 | B2 |
7209402 | Shinozaki et al. | Apr 2007 | B2 |
7215588 | Lee | May 2007 | B2 |
7283380 | Srinivasan et al. | Oct 2007 | B1 |
7304875 | Lien et al. | Dec 2007 | B1 |
7319602 | Srinivasan et al. | Jan 2008 | B1 |
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 |
7870362 | Hong et al. | Jan 2011 | B2 |
7872907 | Okayama et al. | Jan 2011 | 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 |
8676725 | Lin et al. | Mar 2014 | B1 |
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 |
9087554 | Park | Jul 2015 | B1 |
9087602 | Youn et al. | Jul 2015 | B2 |
9117544 | Bains et al. | Aug 2015 | B2 |
9123447 | Lee et al. | Sep 2015 | B2 |
9153294 | Kang | Oct 2015 | B2 |
9190137 | Kim et al. | Nov 2015 | B2 |
9190139 | Jung et al. | Nov 2015 | B2 |
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 | Tomishima | Sep 2017 | B1 |
9786351 | Lee et al. | Oct 2017 | B2 |
9799391 | Wei | Oct 2017 | B1 |
9805782 | Liou | Oct 2017 | B1 |
9805783 | Ito et al. | Oct 2017 | B2 |
9818469 | Kim et al. | Nov 2017 | B1 |
9847118 | Won | Dec 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 |
10607686 | Akamatsu | Mar 2020 | B2 |
10629286 | Lee et al. | Apr 2020 | B2 |
10679710 | Hirashima et al. | Jun 2020 | B2 |
10705900 | Jin | Jul 2020 | B2 |
10770127 | Shore et al. | Sep 2020 | B2 |
10811066 | Jones et al. | Oct 2020 | B2 |
10832792 | Penney et al. | Nov 2020 | B1 |
10861519 | Jones et al. | Dec 2020 | B2 |
10867660 | Akamatsu | Dec 2020 | B2 |
10930335 | Bell et al. | Feb 2021 | B2 |
10943636 | Wu et al. | Mar 2021 | B1 |
10950289 | Ito et al. | Mar 2021 | B2 |
10964378 | Ayyapureddi et al. | Mar 2021 | B2 |
11011215 | Parry et al. | May 2021 | B1 |
11043254 | Enomoto et al. | Jun 2021 | B2 |
11139015 | Brown et al. | Oct 2021 | B2 |
11152050 | Morohashi et al. | Oct 2021 | B2 |
11158364 | Penney et al. | Oct 2021 | B2 |
11158373 | Penney et al. | Oct 2021 | B2 |
11200942 | Jenkinson et al. | Dec 2021 | B2 |
11222682 | Enomoto et al. | Jan 2022 | B1 |
11257535 | Shore et al. | Feb 2022 | B2 |
11264096 | Schreck et al. | Mar 2022 | B2 |
11322192 | Morohashi et al. | May 2022 | B2 |
11361808 | Bell et al. | Jun 2022 | B2 |
11386946 | Ayyapureddi et al. | Jul 2022 | B2 |
11398265 | Wu et al. | Jul 2022 | B2 |
11424005 | Penney et al. | Aug 2022 | B2 |
11462291 | Pan | Oct 2022 | B2 |
11482275 | Ayyapureddi et al. | Oct 2022 | B2 |
11521669 | Enomoto et al. | Dec 2022 | B2 |
11568918 | Ayyapureddi et al. | Jan 2023 | B2 |
11600314 | Ayyapureddi et al. | Mar 2023 | B2 |
11600326 | Schreck et al. | Mar 2023 | B2 |
11664063 | Lovett | May 2023 | B2 |
11688451 | Zhang et al. | Jun 2023 | B2 |
11694738 | Morohashi et al. | Jul 2023 | B2 |
11699476 | Brown et al. | Jul 2023 | B2 |
20010008498 | Ooishi | Jul 2001 | A1 |
20020007476 | Kishino | Jan 2002 | A1 |
20020078311 | Matsuzaki et al. | Jun 2002 | A1 |
20020080677 | Watanabe et al. | Jun 2002 | A1 |
20020181301 | Takahashi et al. | Dec 2002 | A1 |
20030063512 | Takahashi et al. | Apr 2003 | A1 |
20030067825 | Shimano et al. | Apr 2003 | A1 |
20030090400 | Barker | May 2003 | A1 |
20030123301 | Jang et al. | Jul 2003 | A1 |
20030193829 | Morgan et al. | Oct 2003 | A1 |
20030231540 | Lazar et al. | Dec 2003 | A1 |
20040004856 | Sakimura et al. | Jan 2004 | A1 |
20040008544 | Shinozaki et al. | Jan 2004 | A1 |
20040022093 | Lee | Feb 2004 | A1 |
20040052142 | Ikehashi et al. | Mar 2004 | A1 |
20040114446 | Takahashi et al. | Jun 2004 | A1 |
20040130959 | Kawaguchi | Jul 2004 | A1 |
20040174757 | Garverick et al. | Sep 2004 | A1 |
20040184323 | Mori et al. | Sep 2004 | A1 |
20040213035 | Cavaleri et al. | Oct 2004 | A1 |
20040218431 | Chung et al. | Nov 2004 | A1 |
20050041502 | Perner | Feb 2005 | A1 |
20050105315 | Shin et al. | May 2005 | A1 |
20050243629 | Lee | Nov 2005 | A1 |
20050265104 | Remaklus et al. | Dec 2005 | A1 |
20060039229 | Nakano | Feb 2006 | A1 |
20060059196 | Sato et al. | Mar 2006 | A1 |
20060083099 | Bae et al. | Apr 2006 | A1 |
20060087903 | Riho et al. | Apr 2006 | A1 |
20060119406 | Henzler et al. | Jun 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 |
20070153611 | Lee | Jul 2007 | A1 |
20070230264 | Eto | Oct 2007 | A1 |
20070237016 | Miyamoto et al. | Oct 2007 | A1 |
20070297252 | Singh | Dec 2007 | A1 |
20080028260 | Oyagi et al. | Jan 2008 | A1 |
20080031068 | Yoo et al. | Feb 2008 | A1 |
20080062742 | Wang | Mar 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 |
20080301362 | Cavanna et al. | Dec 2008 | A1 |
20080313494 | Hummler et al. | Dec 2008 | A1 |
20080316845 | Wang et al. | Dec 2008 | A1 |
20090021999 | Tanimura et al. | Jan 2009 | A1 |
20090059641 | Jeddeloh | Mar 2009 | A1 |
20090077571 | Gara et al. | Mar 2009 | A1 |
20090161457 | Wakimoto | Jun 2009 | A1 |
20090168571 | Pyo et al. | Jul 2009 | A1 |
20090185440 | Lee | Jul 2009 | A1 |
20090201752 | Riho et al. | Aug 2009 | A1 |
20090213675 | Shino | Aug 2009 | A1 |
20090251971 | Futatsuyama | Oct 2009 | A1 |
20090296510 | Lee et al. | Dec 2009 | A1 |
20100005217 | Jeddeloh | Jan 2010 | A1 |
20100005376 | Laberge et al. | Jan 2010 | A1 |
20100054011 | Kim | Mar 2010 | A1 |
20100074042 | Fukuda et al. | Mar 2010 | A1 |
20100080074 | Ohmaru et al. | Apr 2010 | A1 |
20100110809 | Kobayashi et al. | May 2010 | A1 |
20100110810 | Kobayashi | May 2010 | A1 |
20100131812 | Mohammad | May 2010 | A1 |
20100157693 | Iwai et al. | Jun 2010 | A1 |
20100182863 | Fukiage | Jul 2010 | A1 |
20100260003 | Oh | Oct 2010 | A1 |
20100329069 | Ito et al. | Dec 2010 | A1 |
20110026290 | Noda et al. | Feb 2011 | A1 |
20110051530 | Kushida | Mar 2011 | A1 |
20110055495 | Remaklus, Jr. et al. | Mar 2011 | A1 |
20110069572 | Lee et al. | Mar 2011 | A1 |
20110122987 | Neyer | May 2011 | A1 |
20110216614 | Hosoe | Sep 2011 | A1 |
20110225355 | Kajigaya | Sep 2011 | A1 |
20110286271 | Chen | Nov 2011 | A1 |
20110310648 | Iwamoto et al. | Dec 2011 | A1 |
20110317462 | Gyllenhammer et al. | Dec 2011 | A1 |
20120014199 | Narui | Jan 2012 | A1 |
20120059984 | Kang et al. | Mar 2012 | A1 |
20120151131 | Kilmer et al. | Jun 2012 | A1 |
20120213021 | Riho et al. | Aug 2012 | A1 |
20120254472 | Ware et al. | Oct 2012 | A1 |
20130003467 | Klein | Jan 2013 | A1 |
20130003477 | Park et al. | Jan 2013 | A1 |
20130057173 | Yao et al. | Mar 2013 | A1 |
20130107623 | Kavalipurapu et al. | May 2013 | A1 |
20130173971 | Zimmerman | Jul 2013 | A1 |
20130254475 | Perego et al. | Sep 2013 | A1 |
20130279284 | Jeong | Oct 2013 | A1 |
20130304982 | Jung et al. | Nov 2013 | A1 |
20140006703 | Bains et al. | Jan 2014 | A1 |
20140006704 | Greenfield et al. | Jan 2014 | A1 |
20140013169 | Kobla et al. | Jan 2014 | A1 |
20140013185 | Kobla et al. | Jan 2014 | A1 |
20140050004 | Mochida | Feb 2014 | A1 |
20140078841 | Chopra | Mar 2014 | A1 |
20140078842 | Oh et al. | Mar 2014 | A1 |
20140078845 | Song | Mar 2014 | A1 |
20140089576 | Bains et al. | Mar 2014 | A1 |
20140095780 | Bains et al. | Apr 2014 | A1 |
20140095786 | Moon et al. | Apr 2014 | A1 |
20140119091 | You et al. | May 2014 | A1 |
20140136763 | Li et al. | May 2014 | A1 |
20140143473 | Kim et al. | May 2014 | A1 |
20140177370 | Halbert et al. | Jun 2014 | A1 |
20140177376 | Song | Jun 2014 | A1 |
20140189215 | Kang et al. | Jul 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 |
20140317344 | Kim | Oct 2014 | A1 |
20140355332 | Youn et al. | Dec 2014 | A1 |
20140369109 | Lee et al. | Dec 2014 | A1 |
20140379978 | Kim et al. | Dec 2014 | A1 |
20150049567 | Chi | Feb 2015 | A1 |
20150055420 | Bell et al. | Feb 2015 | A1 |
20150078112 | Huang | Mar 2015 | A1 |
20150089326 | Joo et al. | Mar 2015 | A1 |
20150155027 | Abe et al. | Jun 2015 | A1 |
20150162067 | Kim et al. | Jun 2015 | A1 |
20150170728 | Jung et al. | Jun 2015 | A1 |
20150199126 | Jayasena et al. | Jul 2015 | A1 |
20150206572 | Lim et al. | Jul 2015 | A1 |
20150213872 | Mazumder et al. | Jul 2015 | A1 |
20150213877 | Darel | Jul 2015 | A1 |
20150228341 | Watanabe et al. | Aug 2015 | A1 |
20150243339 | Bell et al. | Aug 2015 | A1 |
20150255140 | Song | Sep 2015 | A1 |
20150262652 | Igarashi | Sep 2015 | A1 |
20150279441 | Greenberg et al. | Oct 2015 | A1 |
20150279442 | Hwang | Oct 2015 | A1 |
20150294711 | Gaither et al. | Oct 2015 | A1 |
20150340077 | Akamatsu | Nov 2015 | A1 |
20150356048 | King | Dec 2015 | A1 |
20160019940 | Jang et al. | Jan 2016 | A1 |
20160027498 | Ware et al. | Jan 2016 | A1 |
20160027531 | Jones et al. | Jan 2016 | A1 |
20160027532 | Kim | Jan 2016 | A1 |
20160042782 | Narui et al. | Feb 2016 | A1 |
20160078845 | Lin et al. | Mar 2016 | A1 |
20160078911 | Fujiwara et al. | Mar 2016 | A1 |
20160078918 | Hyun et al. | Mar 2016 | A1 |
20160086649 | Hong et al. | Mar 2016 | A1 |
20160086651 | Kim | Mar 2016 | A1 |
20160093402 | Kitagawa et al. | Mar 2016 | A1 |
20160099043 | Tu | Apr 2016 | A1 |
20160111140 | Joo et al. | Apr 2016 | A1 |
20160125931 | Doo et al. | May 2016 | A1 |
20160133314 | Hwang et al. | May 2016 | A1 |
20160140243 | Adams et al. | May 2016 | A1 |
20160163372 | Lee et al. | Jun 2016 | A1 |
20160172056 | Huh | Jun 2016 | A1 |
20160180917 | Chishti et al. | Jun 2016 | A1 |
20160180921 | Jeong | Jun 2016 | A1 |
20160196863 | Shin et al. | Jul 2016 | A1 |
20160202926 | Benedict | Jul 2016 | A1 |
20160211008 | Benedict et al. | Jul 2016 | A1 |
20160224262 | Mandava et al. | Aug 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 |
20170139641 | Cha et al. | May 2017 | A1 |
20170140807 | Sun et al. | May 2017 | A1 |
20170140811 | Joo | May 2017 | A1 |
20170148504 | Saifuddin et al. | May 2017 | A1 |
20170177246 | Miller et al. | Jun 2017 | A1 |
20170186481 | Oh et al. | Jun 2017 | A1 |
20170213586 | Kang et al. | Jul 2017 | A1 |
20170221546 | Loh et al. | Aug 2017 | A1 |
20170263305 | Cho | Sep 2017 | A1 |
20170287547 | Ito | Oct 2017 | A1 |
20170323675 | Jones et al. | Nov 2017 | A1 |
20170352399 | Yokoyama et al. | Dec 2017 | A1 |
20170371742 | Shim et al. | Dec 2017 | A1 |
20170372767 | Kang et al. | Dec 2017 | A1 |
20180005690 | Morgan et al. | Jan 2018 | A1 |
20180025770 | Ito et al. | Jan 2018 | A1 |
20180025772 | Lee et al. | Jan 2018 | A1 |
20180060194 | Ryu et al. | Mar 2018 | A1 |
20180061483 | Morgan | Mar 2018 | A1 |
20180082737 | Lee | Mar 2018 | A1 |
20180084314 | Koyama | Mar 2018 | A1 |
20180090199 | Kim et al. | Mar 2018 | A1 |
20180096719 | Tomishima et al. | Apr 2018 | A1 |
20180102776 | Chandrasekar et al. | Apr 2018 | A1 |
20180107417 | Shechter et al. | Apr 2018 | A1 |
20180114561 | Fisch et al. | Apr 2018 | A1 |
20180114565 | Lee | Apr 2018 | A1 |
20180158504 | Akamatsu | Jun 2018 | A1 |
20180158507 | Bang | 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 |
20180342282 | Morgan | Nov 2018 | A1 |
20180366182 | Hyun et al. | Dec 2018 | A1 |
20190013059 | Akamatsu | Jan 2019 | A1 |
20190043558 | Suh et al. | Feb 2019 | A1 |
20190051344 | Bell et al. | Feb 2019 | A1 |
20190066759 | Nale | Feb 2019 | A1 |
20190066762 | Koya | Feb 2019 | A1 |
20190088315 | Saenz et al. | Mar 2019 | A1 |
20190088316 | Inuzuka et al. | Mar 2019 | A1 |
20190096492 | Cai et al. | Mar 2019 | A1 |
20190103147 | Jones et al. | Apr 2019 | A1 |
20190130961 | Bell et al. | May 2019 | A1 |
20190139599 | Ito et al. | May 2019 | A1 |
20190147941 | Qin et al. | May 2019 | A1 |
20190147964 | Yun et al. | May 2019 | A1 |
20190161341 | Howe | May 2019 | A1 |
20190172518 | Chen et al. | Jun 2019 | A1 |
20190187745 | Murali et al. | Jun 2019 | A1 |
20190196730 | Imran | Jun 2019 | A1 |
20190198078 | Hoang et al. | Jun 2019 | A1 |
20190198090 | Lee | Jun 2019 | A1 |
20190198099 | Mirichigni et al. | Jun 2019 | A1 |
20190205253 | Roberts | Jul 2019 | A1 |
20190207736 | Ben-tovim et al. | Jul 2019 | A1 |
20190228810 | Jones et al. | Jul 2019 | A1 |
20190228813 | Nale et al. | Jul 2019 | A1 |
20190228815 | Morohashi et al. | Jul 2019 | A1 |
20190237132 | Morohashi | Aug 2019 | A1 |
20190243708 | Cha et al. | Aug 2019 | A1 |
20190252020 | Rios et al. | Aug 2019 | A1 |
20190267077 | Ito et al. | Aug 2019 | A1 |
20190279706 | Kim | Sep 2019 | A1 |
20190333573 | Shin et al. | Oct 2019 | A1 |
20190347019 | Shin | Nov 2019 | A1 |
20190348100 | Smith et al. | Nov 2019 | A1 |
20190348102 | Smith et al. | Nov 2019 | A1 |
20190348103 | Jeong et al. | Nov 2019 | A1 |
20190348107 | Shin et al. | Nov 2019 | A1 |
20190349545 | Koh et al. | Nov 2019 | A1 |
20190362774 | Kuramori et al. | Nov 2019 | A1 |
20190371391 | Cha et al. | Dec 2019 | A1 |
20190385661 | Koo et al. | Dec 2019 | A1 |
20190385667 | Morohashi et al. | Dec 2019 | A1 |
20190386557 | Wang et al. | Dec 2019 | A1 |
20200005857 | Ito et al. | Jan 2020 | A1 |
20200075106 | Tokutomi et al. | Mar 2020 | A1 |
20200082873 | Wolff | Mar 2020 | A1 |
20200090760 | Purahmad et al. | Mar 2020 | A1 |
20200135263 | Brown et al. | Apr 2020 | A1 |
20200194050 | Akamatsu | Jun 2020 | A1 |
20200194056 | Sakurai et al. | Jun 2020 | A1 |
20200201380 | Murali et al. | Jun 2020 | A1 |
20200202921 | Morohashi et al. | Jun 2020 | A1 |
20200211626 | Hiscock et al. | Jul 2020 | A1 |
20200211633 | Okuma | Jul 2020 | A1 |
20200211636 | Hiscock et al. | Jul 2020 | A1 |
20200251158 | Shore et al. | Aug 2020 | A1 |
20200294576 | Brown et al. | Sep 2020 | A1 |
20200302994 | Enomoto et al. | Sep 2020 | A1 |
20200321049 | Meier et al. | Oct 2020 | A1 |
20200349995 | Shore et al. | Nov 2020 | A1 |
20200365208 | Schreck et al. | Nov 2020 | A1 |
20200381040 | Penney et al. | Dec 2020 | A1 |
20200395072 | Penney et al. | Dec 2020 | A1 |
20200411095 | Kim | Dec 2020 | A1 |
20210005229 | Hiscock et al. | Jan 2021 | A1 |
20210005240 | Brown et al. | Jan 2021 | A1 |
20210020223 | Ayyapureddi et al. | Jan 2021 | A1 |
20210020262 | Penney et al. | Jan 2021 | A1 |
20210026732 | Park et al. | Jan 2021 | A1 |
20210057012 | Ayyapureddi et al. | Feb 2021 | A1 |
20210057013 | Jenkinson et al. | Feb 2021 | A1 |
20210057021 | Wu et al. | Feb 2021 | A1 |
20210065755 | Kim et al. | Mar 2021 | A1 |
20210065764 | Cheng et al. | Mar 2021 | A1 |
20210142852 | Schreck et al. | May 2021 | A1 |
20210158851 | Ayyapureddi et al. | May 2021 | A1 |
20210158860 | Wu et al. | May 2021 | A1 |
20210158861 | Jeong et al. | May 2021 | A1 |
20210201984 | Khasawneh et al. | Jul 2021 | A1 |
20210225432 | Enomoto et al. | Jul 2021 | A1 |
20210241810 | Hollis et al. | Aug 2021 | A1 |
20210265504 | Ishizu et al. | Aug 2021 | A1 |
20210343324 | Brown et al. | Nov 2021 | A1 |
20210350844 | Morohashi et al. | Nov 2021 | A1 |
20210398592 | Penney et al. | Dec 2021 | A1 |
20220068348 | Bennett et al. | Mar 2022 | A1 |
20220069992 | Ayyapureddi | Mar 2022 | A1 |
20220165347 | Pan | May 2022 | A1 |
20220230672 | Ayyapureddi et al. | Jul 2022 | A1 |
20220293166 | Ayyapureddi et al. | Sep 2022 | A1 |
20220415427 | Pan | Dec 2022 | A1 |
20230010619 | Ayyapureddi et al. | Jan 2023 | A1 |
20230047007 | Lovett | Feb 2023 | A1 |
20230170008 | Zhang et al. | Jun 2023 | A1 |
20230205428 | Kim et al. | Jun 2023 | A1 |
20230206980 | He et al. | Jun 2023 | A1 |
20230206989 | He et al. | Jun 2023 | A1 |
Number | Date | Country |
---|---|---|
1144434 | Mar 1997 | CN |
1195173 | Oct 1998 | CN |
1371100 | Sep 2002 | CN |
101038785 | Sep 2007 | CN |
101067972 | Nov 2007 | CN |
101331554 | Dec 2008 | CN |
101346775 | Jan 2009 | CN |
101458658 | Jun 2009 | CN |
101622607 | Jan 2010 | CN |
102074268 | May 2011 | CN |
102113058 | Jun 2011 | CN |
102364991 | Feb 2012 | CN |
102483952 | May 2012 | CN |
103366808 | Oct 2013 | CN |
103544987 | Jan 2014 | CN |
103928048 | Jul 2014 | CN |
104350546 | Feb 2015 | CN |
106710621 | May 2017 | CN |
107256717 | Oct 2017 | CN |
107871516 | Apr 2018 | CN |
108122581 | Jun 2018 | CN |
108154895 | Jun 2018 | CN |
109074305 | Jul 2023 | CN |
H0773682 | Mar 1995 | JP |
H10241385 | Sep 1998 | JP |
2005-216429 | Aug 2005 | JP |
2011-258259 | Dec 2011 | JP |
4911510 | Jan 2012 | JP |
2013-004158 | Jan 2013 | JP |
20150002112 | Jan 2015 | KR |
20150002783 | Jan 2015 | KR |
20170058022 | May 2017 | KR |
1020180064940 | Jun 2018 | KR |
1020180085184 | Jul 2018 | KR |
20190048049 | May 2019 | KR |
2014120477 | Aug 2014 | WO |
2015030991 | Mar 2015 | WO |
2017171927 | Oct 2017 | WO |
2019222960 | Nov 2019 | WO |
2020010010 | Jan 2020 | WO |
2020191222 | Sep 2020 | WO |
2021003085 | Jan 2021 | WO |
2022108808 | May 2022 | WO |
Entry |
---|
US 11,264,075 B2, 03/2022, Bell et al. (withdrawn) |
U.S. Appl. No. 17/456,849 titled “Apparatuses, Systems, and Methods for Main Sketch and Slim Sketch Circuitfor Row Address Tracking” filed Nov. 29, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/565,119 titled “Apparatuses and Methods for Row Hammer Counter Mat” filed Dec. 29, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/565,187 titled “Apparatuses and Methods for Row Hammer Counter Mat” filed Dec. 29, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/932,206, titled, “Apparatuses and Methods for Dynamically Allocated Aggressor Detection” filed Sep. 14, 2022; pp. all pages of application as filed. |
U.S. Appl. No. 17/822,033, titled, “Apparatuses and Methods for Tracking Word Line Accesses” filed Aug. 24, 2022, 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. |
U.S. Appl. No. 15/884,192 entitled ‘Semiconductor Device Performing Row Hammer Refresh Operation’ filed Jan. 30, 2018, pp. all. |
U.S. Appl. No. 16/797,658, titles “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 21, 2020, pp. all. |
U.S. Appl. No. 16/818,981 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Mar. 13, 2020, pp. all. |
U.S. Appl. No. 16/824,460, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 19, 2020, pp. all. |
U.S. Appl. No. 16/025,844, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, filed Jul. 2, 2018, pp. all. |
U.S. Appl. No. 16/783,063, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, dated Feb. 5, 2020, pp. all. |
U.S. Appl. No. 16/805,197, titled “Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device”, dated Feb. 28, 2020, pp. all. |
U.S. Appl. No. 16/232,837, titled “Apparatuses and Methods for Distributed Targeted Refresh Operations”, filed Dec. 26, 2018, pp. all. |
U.S. Appl. No. 16/818,989, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 13, 2020, pp. all. |
U.S. Appl. No. 16/268,818, titled “Apparatuses and Methods for Managing Row Access Counts”, filed Feb. 6, 2019, pp. all. |
U.S. Appl. No. 16/286,187 titled “Apparatuses and Methods for Memory Mat Refresh Sequencing” filed Feb. 26, 2019, pp. all. |
U.S. Appl. No. 16/084,119, titled “Apparatuses and Methods for Pure-Time, Self Adopt Sampling for Row Hammer Refresh Sampling”, filed Sep. 11, 2018, pp. all. |
U.S. Appl. No. 16/886,284 titled “Apparatuses and Methods for Access Based Refresh Timing” filed May 28, 2020, pp. all. |
U.S. Appl. No. 16/886,284, titled “Apparatuses and Methods for Access Based Refresh Timing”, dated May 28, 2020, pp. all. |
U.S. Appl. No. 16/358,587, titled “Semiconductor Device Having Cam That Stores Address Signals”, dated Mar. 19, 2019, pp. all. |
U.S. Appl. No. 16/375,716 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Apr. 4, 2019; pp. all. |
U.S. Appl. No. 16/936,297 titled “Apparatuses and Methods for Managing Row Access Counts” filed Jul. 22, 2020, pp. all. |
U.S. Appl. No. 16/411,573 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed May 14, 2019, pp. all. |
U.S. Appl. No. 16/428,625 titled “Apparatuses and Methods for Tracking Victim Rows” filed May 31, 2019, pp. all. |
U.S. Appl. No. 16/513,400 titled “Apparatuses and Methods for Tracking Row Accesses” filed Jul. 16, 2019, pp. all. |
U.S. Appl. No. 17/060,403 titled “Apparatuses and Methods for Adjusting Victim Data” filed Oct. 1, 2020, pp. all. |
U.S. Appl. No. 16/548,027 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Aug. 22, 2019, pp. all. |
U.S. Appl. No. 16/549,942 titled “Apparatuses and Methods for Lossy Row Access Counting” filed Aug. 23, 2019, pp. all. |
U.S. Appl. No. 16/546,152 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Aug. 20, 2019, pp. all. |
U.S. Appl. No. 16/549,411 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Aug. 23, 2019, pp. all. |
U.S. Appl. No. 16/655,110 titled “Apparatuses and Methods for Dynamic Targeted Refresh Steals” filed Oct. 16, 2019, pp. all. |
U.S. Appl. No. 17/154,945 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed Jan. 21, 2021, pp. all. |
U.S. Appl. No. 17/170,616 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Feb. 8, 2021, pp. all. |
U.S. Appl. No. 17/168,036 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Feb. 4, 2021, pp. all. |
U.S. Appl. No. 17/301,533 titled “Semiconductor Device Having Cam That Stores Address Signals” filed Apr. 6, 2021, pp. all. |
International Application No. PCT/US19/40169 titled “Apparatus and Methods for Triggering Row Hammer Address Sampling” filed Jul. 1, 2019, pp. all. |
International Application No. PCT/US19/64028, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Dec. 2, 2019, pp. all. |
International Application No. PCT/US20/26689, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations”, dated Apr. 3, 2020, pp. all. |
International Application No. PCT/US20/40077, titled “Apparatuses and Methods for Monitoring Word Line Accesses”, dated Jun. 29, 2020, pp. all. |
U.S. Appl. No. 16/788,657, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Feb. 12, 2020, pp. all. |
U.S. Appl. No. 15/881,256 entitled ‘Apparatuses and Methods for Detecting a Row Hammer Attack With a Bandpass Filter’ filed Jan. 26, 2018, pp. all. |
U.S. Appl. No. 16/425,525 titled “Apparatuses And Methods For Tracking All Row Accesses” filed May 29, 2019, pp. all. |
U.S. Appl. No. 16/427,105 titled “Apparatuses And Methods For Priority Targeted Refresh Operations” filed May 30, 2019, pp. all. |
U.S. Appl. No. 16/427,140 titled “Apparatuses And Methods For Tracking Row Access Counts Between Multiple Register Stacks” filed May 30, 2019, pp. all. |
U.S. Appl. No. 16/437,811 titled “Apparatuses, Systems, And Methods For Determining Extremum Numerical Values” filed Jun. 11, 2019, pp. all. |
U.S. Appl. No. 16/537,981 titled “Apparatuses and Methods for Controlling Targeted Refresh Rates” filed Aug. 12, 2019, pp. all. |
U.S. Appl. No. 17/007,069 titled “Apparatuses and Methods for Providing Refresh Addresses” filed Aug. 31, 2020, pp. all. |
U.S. Appl. No. 17/153,555 titled “Apparatuses and Methods for Dynamically Allocated Aggressor Detection” filed Jan. 20, 2021, pp. all. |
U.S. Appl. No. 17/201,941 titled “Apparatuses and Methods for Sketch Circuits for Refresh Binning” filed Mar. 15, 2021, pp. all. |
U.S. Appl. No. 17/375,817 titled “Apparatuses and Methods for Monitoring Word Line Accesses” filed Jul. 14, 2021, pp. all. |
U.S. Appl. No. 17/443,056 titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences” filed Jul. 20, 2021, pp. all. |
U.S. Appl. No. 17/444,925 titled “Apparatuses and Methods for Countering Memory Attacks” filed Aug. 12, 2021, pp. all. |
U.S. Appl. No. 17/446,710 titled “Apparatuses, Systems, and Methods for Determining Extremum Numericalvalues” filed Sep. 1, 2021, pp. all. |
U.S. Appl. No. 15/789,897, entitled “Apparatus and Methods for Refreshing Memory”, filed Oct. 20, 2017; pp. all. |
U.S. Appl. No. 15/796,340, entitled: “Apparatus and Methods for Refreshing Memory” filed Oct. 27, 2017; pp. all. |
U.S. Appl. No. 16/012,679, titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences”, filed Jun. 19, 2018, pp. all. |
U.S. Appl. No. 16/020,863, titled “Semiconductor Device”, filed Jun. 27, 2018, pp. all. |
U.S. Appl. No. 16/112,471 titled “Apparatuses and Methods for Controlling Refresh Operations” filed Aug. 24, 2018, pp. all. |
U.S. Appl. No. 16/160,801, titled “Apparatuses and Methods for Selective Row Refreshes” filed Oct. 15, 2018, pp. all. |
U.S. Appl. No. 16/176,932, titled “Apparatuses and Methods for Access Based Refresh Timing”, filed Oct. 31, 2018, pp. all. |
U.S. Appl. No. 16/208,217, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Dec. 3, 2018, pp. all. |
U.S. Appl. No. 16/230,300, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Dec. 21, 2018, pp. all. |
U.S. Appl. No. 16/231,327 titled “Apparatuses and Methods for Selective Row Refreshes”, filed Dec. 21, 2018, pp. all. |
U.S. Appl. No. 16/237,291, titled “Apparatus and Methods for Refreshing Memory”, filed Dec. 31, 2018, pp. all. |
U.S. Appl. No. 16/290,730, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 1, 2019, pp. all. |
U.S. Appl. No. 16/374,623, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Apr. 3, 2019, pp. all. |
U.S. Appl. No. 16/411,698 title “Semiconductor Device” filed May 14, 2019, pp. all. |
U.S. Appl. No. 16/427,330 titled “Apparatuses and Methods for Storing Victim Row Data” filed May 30, 2019, pp. all. |
U.S. Appl. No. 16/431,641 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 4, 2019, pp. all. |
U.S. Appl. No. 16/682,606, titled “Apparatuses And Methods For Distributing Row Hammer Refresh Events Across A Memory Device”, filed Nov. 13, 2019, pp. all. |
U.S. Appl. No. 17/102,266, titled “Apparatuses and Methods for Tracking Word Line Accesses”, dated Nov. 23, 2020, pp. all. |
U.S. Appl. No. 15/876,566 entitled ‘Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device’ filed Jan. 22, 2018, pp. all. |
International Application for Application No. PCT/US20/32684, titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell”, dated May 13, 2020, pp. all. |
U.S. Appl. No. 15/656,084, titled “Apparatuses And Methods For Targeted Refreshing Of Memory”, filed Jul. 21, 2017, pp. all. |
U.S. Appl. No. 16/459,520 titled “Apparatuses and Methods for Monitoring Word Line Accesses”, filed Jul. 1, 2019, pp. all. |
PCT Application No. PCT/US18/55821 “Apparatus and Methods for Refreshing Memory” filed Oct. 15, 2018., pp. all. |
U.S. Appl. No. 15/715,846, entitled “Semiconductor Device”, filed Sep. 26, 2017, pp. all. |
U.S. Appl. No. 15/888,993, entitled “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 5, 2018, pp. all. |
U.S. Appl. No. 16/190,627 titled “Apparatuses and Methods for Targeted Refreshing of Memory” filed Nov. 14, 2018, pp. all. |
U.S. Appl. No. 16/459,507 titled “Apparatuses and Methods for Adjusting Victim Data”, filed Jul. 1, 2019, pp. all. |
U.S. Appl. No. 15/281,818, entitled: “Semiconductor Device” filed Sep. 30, 2016, pp. all. |
Kim, et al., “Flipping Bits in MemoryWithout Accessing Them: An Experimental Study of DRAM Disturbance Errors”, IEEE, Jun. 2014, 12 pgs. |
Stout, Thomas et al., “Voltage Source Based Voltage-to-Time Converter”, IEEE, downloaded Jul. 2020, p. all. |
[English Abstract] Zheng, Bin , et al., “Design of Built-in DRAM for TFT-LCD Driver Chip LCD and display,” Issue 4, Aug. 15, 2009; pp. all. |
Number | Date | Country | |
---|---|---|---|
20210407583 A1 | Dec 2021 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16428625 | May 2019 | US |
Child | 17470883 | US |