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. An auto refresh operation may be carried out where a sequence of memory cells are periodically refreshed. Repeated access to a particular memory cell or group of memory cells (often referred to as a ‘row hammer’ attack) may cause an increased rate of data degradation in nearby memory cells. Similarly, an extended activation of a row may cause an increased rate of data degradation in nearby memory cells (often referred to as a ‘clobber’ attack). It may be desirable to identify and refresh memory cells affected by the attack in a targeted refresh operation in addition to the auto refresh operation. Identifying memory cells affected by the row hammer may require additional circuitry and/or increase timing requirements.
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.
Information in a volatile memory device may be stored in memory cells (e.g., as a charge on a capacitive element), and may decay over time. The memory cells may be organized into rows (word lines) and columns (bit lines) of a memory array, and the memory cells may be refreshed on a row-by-row basis. In order to prevent information from being lost or corrupted due to this decay, the memory device may carry out refresh operations. During a refresh operation, information may be rewritten to the word line to restore its initial state. Auto refresh operations may be performed on the word lines of the memory in a sequence such that over time each of the word lines of the memory are refreshed at a rate faster than the expected rate of data degradation.
Various patterns of access to the memory (generally referred to as attacks) may cause an increased rate of data degradation in one or more memory cells, such that they would decay before they can be refreshed as part of the auto-refresh operation. For example, repeated access to a particular row of memory or extended activations (e.g., holding a row at an active voltage level) of a particular row (e.g., an aggressor row) may cause an increased rate of decay in rows (e.g., victim rows) which are close to the aggressor row. These repeated accesses and extended activation periods may be part of a deliberate attack against the memory and/or may be due to ‘natural’ access patterns of the memory. The increased rate of decay in the victim rows may require that they be refreshed as part of a targeted refresh operation. The memory device may periodically perform targeted refresh operations. The targeted refresh operations may be in addition to the auto refresh operations. For example, the memory device may perform a set of refresh operations including a number of auto refresh operations, and a number of targeted refresh operations and then repeat this cycle. In some memories, the targeted refresh operations may ‘steal’ timeslots which would otherwise be used for auto refresh operations. A memory device may generally cycle between performing access operations for a period of time, performing refresh operations for a period of time, performing access operations and so forth.
Memory devices may include circuitry for detecting aggressor rows and determining the corresponding victim rows to be refreshed during targeted refresh operations. Detecting aggressor rows may include tracking access of rows, for example, during read or write operations. When the access of a row meets one or more criteria, the row may be determined to be an aggressor row. For example, when a number of accesses of a row reaches a threshold within a certain period of time, the memory device may determine the row is an aggressor row. Victim rows of the aggressor row may then be determined and refreshed during targeted refresh operations.
Typically, one or more sampling techniques are used to track row accesses (e.g., non-random, semi-random, pseudo-random, and/or random sampling). That is, only some of the accesses of word lines are tracked. Thus, some aggressor rows may be missed, particularly, if an attacker discovers a technique for avoiding the sampling periods. Furthermore, techniques that track numbers of accesses may miss aggressor rows where a word line is activated (e.g., “held open”) for an extended period of time rather than repeatedly accessed. Accordingly, deterministic techniques for detecting aggressor rows of both row hammer and clobber attacks may be desirable.
According to embodiments of the present disclosure, individual word lines of a memory may include one or more memory cells designated to track accesses of the word line (e.g., count value memory cells). The count value memory cells may be read by a count control circuit each time the word line is accessed. The count value memory cells may store a value that represents a number of times the word line has been accessed (e.g., access count value, or simply count value). If the value is below a threshold value, the value may be changed by the count control circuit and written back to the count value memory cells. In some embodiments, the count control circuit may include a timer that may track how long the word line is activated. If the word line is activated over a certain interval of time, the count control circuit may change the value to be written back to the count value memory cells. Thus, the access count value may also represent a length of time the word line has been accessed. In some embodiments, the value may be changed for every interval of time the word line is activated. In some embodiments, the value may be written back to the count value memory cells after the value has been changed by the count control circuit. In some embodiments, the value may not be written back until a precharge command is received.
If the value is equal to or above the threshold value, the count control circuit may determine the word line is an aggressor row. In some embodiments, when an aggressor row is determined, victim rows corresponding to the aggressor row may be refreshed during a next scheduled targeted refresh operation. In some embodiments, the memory device may halt access operations and perform targeted refresh operations on the victim rows. In some embodiments, the memory device may provide an alert signal to a memory controller to indicate that the memory device is performing targeted refresh operations.
In some embodiments, count value memory cells may implement multiple counters per word line, each storing a value. One or more of the values may be used to inter the access count value for the word line. In some applications, the multiple counters may reduce or eliminate the risk of the access count value being lost due to corruption during writing the value back to the count value memory cells.
Optionally, in some embodiments, additional memory cells may be included with the count value memory cells for storing error correction code (ECC) data for the values stored in the count value memory cells. In embodiments when multiple counters are included, separate count value memory cells may be provided for storing ECC data for each counter.
The semiconductor device 100 includes a memory array 118. The memory array 118 is shown as including multiple memory banks. In the embodiment of
Optionally, the count value memory cells 126 may further store error correction code (ECC) information. In some embodiments, one or more count value memory cells for storing ECC information may be provided for each counter when multiple counters are included for a word line. The ECC information for the count value memory cells 126 may be used to detect bit errors in the count value memory cells 126, which may alter the value stored in the count value memory cells 126.
The selection of the word line WE is performed by a row decoder circuit 108 and the selection of the bit lines BE and /BL is performed by a column decoder circuit 110. In the embodiment of
The semiconductor device 100 may employ a plurality of external terminals that include command and address (C/A) terminals coupled to a command and address bus to receive commands and addresses, and a CS signal, clock terminals to receive clocks CK_t and CK_c, 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_t and CK_c that are provided to an input circuit 112. The external clocks may be complementary. The input circuit 112 generates an internal clock ICLK based on the CK_t and CK_c clocks. The ICLK clock is provided to the command decoder circuit 110 and to an internal clock generator 114. The internal clock generator 114 provides various internal clocks LCLK based on the ICLK clock. The LCLK clocks may be used for timing operation of various internal circuits. The internal data clocks LCLK are provided to the input/output circuit 122 to time operation of circuits included in the input/output, circuit 122, for example, to data receivers to time the receipt of write data.
The C/A terminals may be supplied with memory addresses. The memory addresses supplied to the C/A terminals are transferred, via a command/address input circuit 202, to an address decoder 104. The address decoder 104 receives the address and supplies a decoded row address XADD to the row decoder circuit 108 and supplies a decoded column address YADD to the column decoder circuit 110. The address decoder 104 may also supply a decoded bank address BADD, which may indicate the bank of the memory array 118 containing the decoded row address XADD and column address YADD. The C/A terminals may be supplied with commands, Examples of commands include access commands for accessing the memory, such as commands for performing read operations and commands for performing write operations. The access commands may be associated with one or more of a row address XADD, column address YADD, and/or bank address BADD to indicate the memory cell(s) to be accessed. In some embodiments, the commands and/or addresses may be provided by a component external to the device 100, for example, as shown in
The commands may be provided as internal command signals to a command decoder circuit 106 via the command/address input circuit 102. The command decoder circuit 106 includes circuits to decode the internal command signals to generate various internal signals and commands for performing operations. For example, the command decoder 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 access commands for performing read operations. When the commands are received, and a bank address, a row address and a column address are timely supplied with the commands, read data is read from memory cells MC in the memory array 118 corresponding to the row address and column address. The commands are received by the command decoder circuit 106, which provides internal commands so that read data from the memory array 118 is provided to the read/write amplifiers 120. The read data is output to outside from the data terminals DQ via the input/output circuit 122. The access count XCount stored in the count value memory cells 126 of the word line associated with the row address XADD are read to the count control circuit 128. The count control circuit 128 may update the access count XCount and provide the updated access count to the memory array 118 to write back to the count value memory cells 126 of the word line associated with the row address XADD. In embodiments with multiple counters, access count XCount may include multiple values (e.g., XCount0-XCountN).
The device 100 may receive access commands for performing write operations. When the commands are received, and a bank address, a row address and a column address are timely supplied with the commands, write data supplied to the data terminals DQ is written to a memory cells in the memory array 118 corresponding to the row address and column address. The commands are received by the command decoder circuit 106, which provides internal commands so that the write data is received by data receivers in the input/output circuit 122. Write clocks may also be provided to the external clock terminals for timing the receipt of the write data by the data receivers of the input/output circuit 122. The write data is supplied via the input/output circuit 122 to the read/write amplifiers 120, and by the read/write amplifiers 120 to the memory array 118 to be written into the memory cell MC. The access count XCount stored in the count value memory cells 126 of the word line associated with the row address XADD are read to the count control circuit 128. The count control circuit 128 may update the access count XCount and provide the updated access count to the memory array 118 to write back to the count value memory cells 126 of the word line associated with the row address XADD.
After various access commands have been received, such as those described above, a precharge command may be received. In some embodiments, the precharge command may be indicated by an active precharge signal Pre. In some embodiments, a deactivation of the activation ACT signal may indicate the active precharge signal Pre. A word line may be deactivated (e.g., “closed”) responsive to the Pre signal. In some cases, if an operation is being performed on the word line (e.g., writing data to the word line) when the active precharge signal Pre is received, the operation may not be completed. In some cases, an incomplete operation may lead to incorrect or corrupted data on the word line.
Returning to the count control circuit 128, when an access count XCount is provided for a word line, the count control circuit 128 may compare the access count XCount to a threshold value. If the access count XCount is below the threshold value, the count control circuit 128 may change (e.g., increment, decrement) the access count XCount for the word line and provide the updated access count to the memory array 118 as described previously. If the access count XCount is equal to or greater than the threshold value, the count control circuit 128 may activate an aggressor row detection signal RHR_TRIG, which may be provided to a refresh control circuit 116. In some embodiments, the count control circuit 128 may change the access count XCount after activating the RHR_TRIG signal (e.g., reset to an initial value, reset to zero).
In some embodiments, the count control circuit 128 may include a timer (not shown in
In some embodiments, the count control circuit 128 may write the updated access count to the memory array 118 after the active precharge signal Pre has been received. This may reduce the risk of or prevent the value from being corrupted while the value is being written to the count value memory cells 126. In some embodiments, the count control circuit 128 may write the updated access count value to one of multiple counters included in a word line of the memory array 118 regardless of the state of the Pre. In these embodiments, prior to comparing and/or updating the count value, the values of the multiple counters may be used to infer a correct value of the counter, even if the activation of the precharge signal causes the value written to the counter to be corrupted.
The device 100 may also receive commands causing it to carry out one or more refresh operations as part of a self-refresh mode. The device 100 may be periodically placed in a refresh mode. Thus, refresh operations may be performed periodically each time the memory device is in the refresh mode. In some embodiments, the refresh mode command may be externally issued to the memory device 100. In some embodiments, the refresh mode command may be periodically generated by a component of the device. In some embodiments, when an external signal indicates a refresh mode entry command (e.g., an external refresh command), the refresh signal AREF may also be activated. The refresh signal AREF may be a pulse signal which is activated when the command decoder circuit 106 receives a signal which indicates entry to the self-refresh mode. The refresh signal AREF may be activated once immediately after command input, and thereafter may be cyclically activated at desired internal timing. In some embodiments, the refresh signal AREF may cause more than one refresh operation to be performed, which may be referred to as a “multi pump” refresh. In some embodiments, the refresh signal AREF may be active during the refresh mode. In some embodiments, the refresh signal AREF may be active during the multiple refresh operations. The refresh signal AREF may be used to control the timing of refresh operations during the refresh mode. A self-refresh exit command may cause the automatic activation of the refresh signal AREF to stop and may cause the device 100 to return to an idle state and/or resume other operations.
The refresh signal AREF is supplied to the refresh control circuit 116. The refresh control circuit 116 supplies a refresh row address RXADD to the row decoder circuit 108, which may refresh one or more word lines WL indicated by the refresh row address RXADD. In some embodiments, the refresh address RXADD may represent a single word line. In some embodiments, the refresh address RXADD may represent multiple word lines, which may be refreshed sequentially or simultaneously by the row decoder circuit 108. In some embodiments, the number of word lines represented by the refresh address RXADD may vary from one refresh address to another. The refresh control circuit 116 may control a timing of the refresh operation, and may generate and provide the refresh address RXADD. The refresh control circuit 116 may be controlled to change details of the refreshing address RXADD (e.g., how the refresh address is calculated, the timing of the refresh addresses, the number of word lines represented by the address), or may operate based on internal logic.
The refresh control circuit 116 may selectively output a targeted refresh address (e.g., which specifies one or more victim address based on an aggressor) or an automatic refresh address (e.g., from a sequence of auto refresh addresses) as the refresh address RXADD. Based on the type of refresh address RXADD, the row decoder circuit 108 may perform a targeted refresh or auto refresh operation. The automatic refresh addresses may be from a sequence of addresses which are provided based on activations of the refresh signal AREF and/or pumps generated responsive to AREF. The refresh control circuit 116 may cycle through the sequence of auto refresh addresses at a rate determined by AREF. In some embodiments, the auto refresh operations may generally occur with a timing such that the sequence of auto refresh addresses is cycled such that no information is expected to degrade in the time between auto refresh operations for a given word line. In other words, auto refresh operations may be performed such that each word line is refreshed at a rate faster than the expected rate of information decay.
The refresh control circuit 116 may also determine targeted refresh addresses which are addresses that require refreshing (e.g., victim addresses corresponding to victim rows) based on the access pattern of nearby addresses (e.g., aggressor addresses corresponding to aggressor rows) in the memory array 118. For example, in some embodiments, the refresh control circuit 116 may latch a current row address XADD as an aggressor row address responsive to an active RHR_TRIG signal provided by the count control circuit 128. The refresh address RXADD may be calculated based on the latched row addresses XADD provided by the address decoder 104. The refresh address RXADD may be provided with a timing based on a timing of the refresh signal AREF.
While in general the present disclosure refers to determining aggressor and victim word lines and addresses, it should be understood that as used herein, an aggressor word line does not necessarily need to cause data degradation in neighboring word lines, and a victim word line does not necessarily need to be subject to such degradation. The device 100 may use some criteria to judge whether an address is an aggressor address, which may capture potential aggressor addresses rather than definitively determining which addresses are causing data degradation in nearby victims. Similarly, victim addresses may be determined based on which word lines are expected to be effected by aggressors, rather than a definitive determination of which word lines are undergoing an increased rate of data decay.
The refresh address RXADD may be provided with a timing based on a timing of the refresh signal AREF. During the periodic refresh operations of a refresh mode, the refresh control circuit 116 may have time slots corresponding to the timing of AREF, and may provide one or more refresh addresses RXADD during each time slot. In some embodiments, the targeted refresh address may be issued in (e.g., “steal”) a time slot which would otherwise have been assigned to an auto refresh address. In some embodiments, certain time slots may be reserved for targeted refresh addresses, and the refresh control circuit 116 may determine whether to provide a targeted refresh address, not provide an address during that time slot, or provide an auto refresh address instead during the time slot.
The refresh control circuit 116 may use multiple methods to determine the timing of targeted refresh operations. The refresh control circuit 116 may have periodic targeted refresh operations during a refresh mode, where the refresh control circuit 116 performs auto refresh operations and targeted refresh operations (e.g., by providing a targeted refresh address as the refresh address RXADD) based on a periodic schedule. For example, after entering a refresh mode, the refresh control circuit 116 may perform a certain number of auto refresh operations, and then perform (e.g., steal) a certain number of targeted refresh operations. For multi pump refresh operations, each time the active refresh signal AREF is received, the refresh control circuit 116 may perform M different refresh operations, by providing M different refresh addresses RXADD. The refresh control circuit 116 may have a fixed pattern where some pumps are assigned to auto refresh operation and some pumps are assigned to targeted refresh operations.
In some embodiments, the refresh control circuit 116 may perform targeted refresh operations responsive to an active RHR_TRIG signal provided by the count control circuit 128. Targeted refresh operations performed responsive to the active RHR_TRIG may be in addition to or instead of period targeted refresh operations. In some embodiments, the targeted refresh operations responsive to the active RHR_TRIG signal may be performed outside of a regularly scheduled refresh mode. In some embodiments, the refresh control circuit may activate a busy signal BUSY, which may be provided to an external pin of device 100, such as an alert pin ALERT. The busy signal BUSY may be received by an external device, such as the memory controller 101, via the external pin. The busy signal BUSY may notify the external device that the device 100 is performing targeted refresh operations and is not available to perform access operations. Once the targeted refresh operations have been completed, the refresh control circuit 116 may deactivate the busy signal BUSY.
Although the count control circuit 128 is shown as a separate component in
The power supply terminals are supplied with power supply potentials VDD and VSS. The power supply potentials VDD and VSS are supplied to an internal voltage generator circuit 124. The internal voltage generator circuit 124 generates various internal potentials VPP, VOD, VARY, VPERI, and the like based on the power supply potentials VDD and VSS supplied to the power supply terminals. The internal potential VPP is mainly, used in the row decoder 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 122. The power supply potentials VDDQ and VSSQ supplied to the power supply, terminals may be the same potentials as the power supply potentials VDD and VSS supplied to the power supply terminals in an embodiment of the disclosure. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals may be different potentials from the power supply potentials VDD and VSS supplied to the power supply terminals in another embodiment of the disclosure. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals are used for the input/output circuit 122 so that power supply noise generated by the input/output circuit 122 does not propagate to the other circuit blocks.
As used herein, an activation of a signal may refer to any portion of a signal's waveform to which that a circuit responds. For example, if a circuit responds to a rising edge, then a signal switching from a low level to a high level may be an activation. One example type of activation is a pulse, where a signal switches from a low level to a high level for a period of time, and then back to the low level. This may trigger circuits which respond to rising edges, falling edges, and/or signals being at a high logical level.
Each of the memory cells MC may store information. In some embodiments, the information may be stored as a binary code, and each memory cell MC may store a bit, which may be either at a logical high or a logical low level. Example memory cell 230 shows a particular implementation which may be used to store a bit of information in some embodiments. Other types of memory cells may be used in other examples. In the example memory cell 230, a capacitive element stores the bit of information as a charge. A first charge level may represent a logical high level, while a second charge level may represent a logical low level. One node of the capacitive element is coupled to a reference voltage (e.g., VSS). The other node of the capacitive element is coupled to a switch. In the example memory cell 230, the switch is implemented using a transistor. A sense node of the switch (e.g., the gate of the transistor) is coupled to the word line. The word line WL may be accessed by the row driver 234 setting a voltage along the word line such that the switches in the memory cells MC are closed, coupling the capacitive elements (or other bit storage element) to the associated bit lines BL.
The sense amplifiers 232 may read or write a value of a bit of information along the bit line BL to memory cell MC at the accessed word line WL. The sense amplifiers may convert a signal along the bit line to a signal which is ‘readable’ by other elements of the memory device (e.g., by amplifying a voltage). The bit lines may be coupled to an input/output circuit (e.g., input/output circuit 122 of
In an example read operation, when a word line WL is accessed, the memory cells MC may provide their charge onto the coupled bit lines BL which may cause a change in a voltage and/or current along the bit line BL. The sense amplifier 232 may determine a logical level of the accessed memory cell MC based on the resulting voltage and/or current along the bit line BL, and may provide a signal corresponding to the logical level through the column select transistor to the input/output circuit.
In an example write operation, the sense amplifiers 232 may receive a signal indicating a logical level to be written to the accessed memory cells from the input/output circuit. The sense amplifier 232 may provide a voltage and/or current along the coupled bit line BL (e.g., along the bit lines with active column select transistors) at a level corresponding to the logical level to be written. The voltage and/or current along the bit line BL may charge the capacitive element at the intersection of the bit line with an accessed word line to a charge level associated with the written logical level. In this manner, by specifying the row which is accessed, and which bit lines to record data from (and/or write data to), specific memory cells MC may be accessed during one or more operations of the memory device.
During an example refresh operation (either targeted or auto-refresh), the word line WL to be refreshed may be read, and then logical value read from each of the memory cells along that may be written back to the same memory cells. In this manner the level of charge in the refreshed memory cells MC may be restored to the full value associated with the logical level stored in that memory cell.
Certain memory cells along each of the word lines may be count value memory cells 226. The count value memory cells 226 may generally be similar to the other memory cells of the memory array 200. In some embodiments, the count value memory cells 226 may be physically the same as the other memory cells MC. However, rather than being coupled to the input/output circuit of the memory, the count value memory cells 226 may be coupled to a count control circuit (e.g., count control circuit 128 of
In some embodiments, the count value memory cells 226 may be organized along particular bit lines of the memory array 200, Thus, there may be counter bit lines (and associated counter sense amplifiers 232) which are coupled to the count value memory cells 226. The count value memory cells 226 may be arranged at the intersection of the counter bit lines and the word lines. The counter bit lines may include counter select transistors (similar to the column select transistors), which selectively allow data from the counter bit lines to be read to the count control circuit. In some embodiments, the time duration over which the counter select transistors are active may be different (e.g., the counter select transistors may be active longer) than the time the column select transistor(s) are active in a given access operation. The counter bit lines and counter sense amplifiers may be coupled through a data bus to a count control circuit. In some embodiments, the count value memory cells 226 may be positioned along an end of the memory array 200. This may decrease a length of the counter data bus. For example, if there are some number n of count value memory cells 226 along each word line, the count value memory cells 226 may be the first n memory cells of the word line, or the last n memory cells of the word line.
For clarity of illustration, only a few word lines WL and bit lines BL (and their corresponding memory cells MC) are shown in
Optionally, additional count value memory cells 226 may be included when ECC information is stored for each counter. Thus, some of the count value memory cells 226 may store data corresponding to ECC information for count value memory cells 226 storing data related to a count value. The ECC information from the count value memory cells 226 may be provided to the count control circuit in a similar manner to the count value data stored on the count value memory cells 226.
A DRAM interface 340 may provide one or more signals to the address refresh control circuit 316 and row decoder 308 which in turn (along with a column decoder, not shown) may perform access operations on the memory array 318. The DRAM interface 340 may represent one or more components which provides signals to components of the bank. In some embodiments, the DRAM interface 340 may include a memory controller coupled to the semiconductor memory device (e.g., memory controller 101). In some embodiments, the DRAM interface 340 may represent one or more components of a semiconductor device (e.g., device 100) such as the command address input circuit 102, the address decoder 104, and/or the command decoder circuit 106 of
The count control circuit 328 may be coupled to the memory array 318, particularly, to the count value memory cells 326 of the memory array 318. The count value memory cells 326 may be used to implement the count value memory cells 126 and/or 226 in some embodiments. When a word line of the memory array 318 is accessed, the value XCount of the count value memory cells 326 along that word line are read to the count control circuit 328. In embodiments with multiple counters, the value XCount may include multiple values (XCount0-N). The count control circuit 328 may determine a value of the access count for that row based on the value(s) read from the count value memory cells 326. The count control circuit 328 may determine if the value of the access count for the word line exceeds a threshold value (e.g., if the value is greater than the threshold value) or is equal to a threshold value. If the value is not equal to or does not exceed the threshold (e.g., if the value is less than the threshold), then the count control circuit 328 may update (e.g., change) a value of the access count and write the updated count back to the count value memory cells 326. Updating the count may include incrementing or decrementing the count in some embodiments. If the value does equal or exceed the threshold, then the current address XADD may be determined to be an aggressor address. If the current address XADD is an aggressor address, an active aggressor row detection signal RHR_TRIG may be provided to the refresh control circuit 316, which may record (e.g., latch) the current value of the row address XADD. In some embodiments, the active aggressor row detection signal RHR_TRIG may further trigger a targeted refresh operation. In some embodiments, if the value of the count exceeds the threshold, then the count control circuit 328 may reset a value of the count, for example, by writing an initial value of the count (e.g., 0) back to the count value memory cells 326.
In some embodiments, the count control circuit 328 may further update the value of the count responsive to the passage of a period of time over which the word line is activated. For example, the count control circuit 328 may update the count value every time some number of nanoseconds has passed. The updated value of the count may be compared to the threshold value as described above after each update of the count value (e.g., after each period of time the word line remains activated). Various techniques may be used to determine how long a word line is activated. For example, in some embodiments, the count control circuit 328 may receive the ACT/Pre signal from the DRAM interface 340. The length of time the word line is activated may be based, at least in part, on a length of time the ACT signal is active. In another example, a charge on the word line may be detected. The length of time the word line is activated may be based, at least in part, on a length of time the charge (e.g., voltage) of the word line is equal to or above an activation level.
In some embodiments, the refresh control circuit 316 may include an RHR state control circuit 342, an aggressor address register 344, and a refresh address generator 350.
The RHR state control circuit 342 may receive the AREF signal from the DRAM interface and the RHR_TRIG signal from the count control circuit 328. The RHR state control circuit 342 may provide an active signal RHR to indicate that a targeted refresh operation, such as a row hammer refresh (e.g., a refresh of the victim rows corresponding to an identified aggressor row) should occur. In some embodiments, the RHR state control circuit 342 may further provide a BUSY signal to the DRAM interface 340 to indicate performance of the targeted refresh operation. The REM state control circuit 342 may also provide an active internal refresh signal IREF, to indicate that an auto-refresh operation should occur. The auto-refresh signal AREF may be periodically activated and may be used to control the timing of refresh operations. In some embodiments, the signals RHR and IREF may be activated 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 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 activated in order to indicate that the device should refresh a particular targeted row (e.g., a victim row) instead of an address from the sequence of auto-refresh addresses. The RHR state control circuit 342 may use internal logic to provide the active RHR signal. For example, in some embodiments, the RHR state control circuit 342 may provide the active RHR signal based on certain number of activations of AREF (e.g., every 4th activation of AREF). Additionally or alternatively, the RHR state control circuit 342 may activate the RHR signal responsive to receiving an active RHR_TRIG signal from the count control circuit 328. In some embodiments, the active RHR_TRIG may trigger the refresh control circuit 316 to cause a targeted refresh operation to be performed outside the time period of a regularly scheduled refresh operation.
In some embodiments, the RHR state control circuit 342 may activate the BUSY signal during targeted refresh operations. In some embodiments, the BUSY signal may be activated when the RIM signal is activated. In some embodiments, the BUSY signal may be activated only when the RHR signal is activated outside a regularly scheduled refresh period. The active BUSY signal may notify other components of the semiconductor device including the refresh control circuit 316 or a component in communication with the device (e.g., a memory controller) that the memory array 318 is unavailable for access operations. In some embodiments, the BUSY signal may be provided to an externally available pin of a semiconductor device including the refresh control circuit 316 (e.g., an alert pin). When the targeted refresh operation is completed, the RHR state control circuit 342 may deactivate the BUSY signal.
Responsive to an activation of RHR, the aggressor address register 344 may provide an aggressor address HitXADD, and the refresh address generator 350 may provide a refresh address RXADD, which may be one or more victim addresses associated with HitXADD (e.g., row addresses of victim rows of the identified aggressor row). Responsive to IREF, the refresh address generator 350 may provide an auto-refresh address as the refresh address RXADD. The row decoder 308 may perform a refresh operation responsive to the refresh address RXADD and the targeted refresh signal RHR. The row decoder 308 may perform an auto-refresh operation based on the refresh address RXADD and the internal refresh signal IREF.
The aggressor address register 344 may store one or more row addresses which have been identified as aggressor addresses by the count control circuit 328. Responsive to the command signal RHR_TRIG from the count control circuit 328, the aggressor address register 344 may store the current row address XADD which is being accessed. The aggressor address register 344 may provide the stored address as a match address HitXADD to the refresh address generator 350, which may calculate one or more victim addresses associated with the match address HitXADD. In some embodiments, the aggressor address register 344 may be a latch circuit which stores a single address. In some embodiments, the aggressor address register 344 may be a buffer which stores multiple addresses, and provides the first stored address as the match address HitXADD. The aggressor address register 344 may switch to a next address in the register after the victim row(s) associated with the first address have been refreshed.
The refresh address generator 350 may receive the targeted refresh signal RHR and the match address HitXADD. The match address HitXADD may represent an aggressor row. The refresh address generator 350 may determine the locations of one or more victim rows based on the match address HitXADD and provide them as the refresh address RXADD. In some embodiments, the victim rows may include rows which are physically adjacent to the aggressor row or rows (e.g., HitXADD+1 and HitXADD−1). Other relationships between victim rows and the identified aggressor rows may also or alternatively be used in other examples.
The refresh address generator 350 may determine the value of the refresh address RXADD based on the targeted refresh signal RHR and the internal auto-refresh signal IREF. In some embodiments, when the signal IREF is active, the refresh address generator 350 may provide one of a sequence of auto refresh addresses. When the signal RIM is active, the refresh address generator 350 may provide a targeted refresh address, such as a victim address, as the refresh address RXADD. In some embodiments, multiple targeted refresh addresses may be provided for a refresh operation. For example, for a multi pump refresh operation, a different targeted refresh address may be provided for each pump (e.g., HitXADD+1 and HitXADD−1).
The row decoder 308 may perform one or more operations on the memory array 318 based on the received signals and addresses. For example, responsive to the activation signal ACT and the row address XADD (and IREF and MIR being inactive), the row decoder 308 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 308 may refresh the refresh address RXADD. In some embodiments, the count control circuit 328 may increment the access count stored in the count value memory cells 326 responsive to a refresh operation of a given row. In some embodiments, the count control circuit 328 may not increment the access count responsive to a refresh operation.
As illustrated in the example in
The count value XCount may be received from the count value memory cells by the count value register 452. The count value register 452 may store one or more count values XCount0-N. In some embodiments the count value register 452 may include multiple registers, one for storing each of the count values. In some embodiments, the number of count values stored and/or the number of registers in count value register 452 may be based, at least in part, on a number of counters implemented by the count value memory cells of the word lines of the memory array. For example, if count value memory cells of a word line implement three counters, the count value register 452 may store three count values. In another example, if the count value memory cells of the word line implement a single counter, the count value register 452 may store one count value. For example, if there are N counters, each of which stores an M-bit count value, then there may be N*M count memory cells along the word line.
The count value XCount may be provided to a threshold comparator 454. The threshold comparator 454 may compare the count value to a threshold value. In some embodiments, the threshold value may be a set value. In some embodiments, the threshold comparator 454 may include a programmable register or other programmable medium that can store a desired threshold value. In some embodiments, the threshold value may be provided to the threshold comparator 454 upon manufacturing or initialization of a device including the count control circuit 428. In some embodiments, the threshold value may be provided to the threshold comparator 454 by a memory controller (e.g., memory controller 101) and/or another component of the device (e.g., command decoder, mode register). If a count value is equal to or greater than the threshold value, the threshold comparator 454 may activate an aggressor row detection signal RHR_TRIG signal. As discussed with reference to
In some embodiments, the count value XCount may be provided to a count update circuit 456. The count update circuit 456 may update the value of the count and provide the updated count value back to the count value register 452. The count value register 452 may provide the updated count value received from the count update circuit 456 back to the count value memory cells of the word line of the memory array for storage. In some embodiments, updating the count value may include incrementing or decrementing the count value XCount. In some embodiments, the count update circuit 456 may update the count value XCount each time the count value is received responsive to an access operation on the word line. In some embodiments, the count update circuit 456 may update the count value responsive to an active interval signal INT is provided by a timer circuit 458.
The timer circuit 458 may measure a period of time the word line is activated. In some embodiments, such as the one shown in
Returning to the count update circuit 456, in some embodiments, the count update circuit 456 may reset a count value XCount to an initial value e.g., ‘0’) responsive to an active RHR_TRIG signal. Thus, once a word line is determined to be an aggressor word line, the count value associated with the word line may be reset in some embodiments.
In some embodiments, the updated count value from the count update circuit 456 stored in the count value register 452 may not be written back to the count value memory, cells of the word line until a precharge command is received and/or the ACT signal is inactive. In other embodiments, the updated count value may be written back to the count value memory cell after being received by the count value register 452 without regard to the receipt of a precharge command (e.g., before, during, or after the precharge command) and/or the state of the ACT signal.
In embodiments where the updated count value is written back to the count value memory cells of the word line without regard to the precharge command, there is a possibility that the count value written to the count value memory cells may be corrupted if the precharge command occurs while the count value is being written back to the count value memory cells. Thus, the next time the word line is activated and the count value XCount is provided to the count value register 452, the count value may be invalid. That is, the count value may no longer reflect the number of times the word line has been accessed.
As will be described in more detail with reference to
Optionally, in some embodiments, some of the count value memory cells may include error correction code (ECC) information ECC0-N (e.g., Hamming code information, parity bits) which may be used to correct errors in the count value provided by the remaining count value memory cells of a counter. In these embodiments, the count values XCount and ECC information are provided to the error correction circuit 462. The error correction circuit 462 may analyze the XCount and ECC information and correct errors in the XCount. The corrected XCount may then be provided to the count value register 452. When the count value register 452 provides updated count values to be written back to the count value memory cells, the error correction circuit 462 may calculate ECC information to be stored in the count value memory cells that store the ECC information for the count value.
Although the count control circuit 428 is shown as having multiple components, in some embodiments, one or more of the components may be combined and/or omitted. For example, in some embodiments, the count value register 452 and count update circuit 456 may be combined. In another example, the count inference circuit 460 may be omitted if count values are written back to the count value memory cells after the precharge command is received.
As noted above, in some embodiments, updated count values may not be provided from the count control circuit to count value memory cells of a word line until a precharge command is received. In some of these embodiments, the count value memory cells may implement a single counter. Implementing a single counter may reduce a number of memory cells of a word line that are used for count value memory cells. In some applications, this may reduce layout area of the memory array and/or reduce the number of memory cells unavailable to store data provided by an external component (e.g., memory controller 101). However, waiting for the precharge command may increase the row precharge time (tRP) of the memory because time must be provided after the precharge command for writing the updated count values back to the count value memory cells. Increasing the tRP may increase the delay between issuing the precharge command and performing an access operation on another word line. Thus, the operational throughput of the memory may be reduced.
In other embodiments, the count value may be written back to the count value memory cells without regard to the precharge command, which may cause an increase in the row active time (tRAS). However, an increase in tRAS may cause less of an impact on operation throughput of the memory compared to an increase in tRP. However, as previously, discussed, writing back count values at any time may lead to a risk of the count values being corrupted. Thus, multiple counters may be used for each word line to reduce the risk of corrupting the access count value. In some embodiments, after an initial setting of the access count value, one of the multiple counters may be updated at a time. Thus, in this manner, only one of the counters is likely to be corrupted if a precharge command is received when the access count value is written back to the count value memory cells. The next time the word line is accessed, the two uncorrupted count values may be used to infer the correct or approximate access count value for the word line. This technique may use a greater number of count value memory cells than when only one counter is implemented (e.g., 40 cells versus 10 cells) in some embodiments. However, in some applications, disadvantages of the increased number of count value memory cells may be offset by the reduced operation timing impact.
Initially, when a word line is accessed (e.g., read operation, write operation), the values of the counters Counter0-2 may be provided to a count value register (e.g., count value register 452) of a count control circuit (e.g., count control circuit 128, 328, and/or 428). Responsive to the initial activation of the word line, the count control circuit may determine an access count value for the word line and update the count value of all of the counters Counter0-2. In some embodiments, the access count value may be determined based, at least in part, on the relative values stored in the counters, as will be described in more detail below. The updated count value may be compared to a threshold value (e.g., threshold comparator 454). If the updated count value is below the threshold value, the updated count value is written back to the counters Counter0-2, and thus the counters Counter0-2 store the same access count value of X for the word line after the initial update (e.g., initial increment). If the updated count value is equal to or above the threshold value, the counter control circuit may activate a signal (e.g., RHR. TRIG) and/or reset the count value of all of the counters.
The count control circuit may further update the count value for the word line responsive to a length of time the word line remains activated (e.g., count update circuit 456 and/or timer circuit 458). However, to reduce the risk of corrupting the count value, the count control circuit may only provide the updated count value to one of the counters to write back. For example, after the word line has been activated for a first period of time, the count control circuit may update the count value for the word line and the updated count value may be written back to Counter0. In the example shown in
Although not shown in
The next time the word line is activated, the values of the counters Counter0-2 may again be provided to the count control circuit. The count control circuit may analyze the relative values stored in the counters to determine the access count value for the word line (e.g., count inference circuit 460). Once the count value is determined, the count control circuit may increment the count value and write it back to all of the counters Counter0-2 as discussed above.
Since only one counter is updated at a time, only one of the multiple counters is at risk of having the stored count value corrupted (e.g., due to the receipt of a precharge command). Furthermore, because the count value is updated by a known amount for each time period (e.g., 1 in the example shown in
In the 3-counter example where each counter is sequentially incremented by 1 shown in
When a count value is corrupted during writing back to a counter, the value stored in the counter may be random. In rare instances, a count value may be corrupted in such a way that makes it difficult to determine whether the count value has been corrupted or not. For example, returning to
The count control circuit may include logic to implement the inferences above for determining the access count value from the values stored in the counters (e.g., count inference circuit 460).
In other embodiments, other numbers of counters, counter sequence for updating, and/or updating method (e.g., decrement by 5) may be used. So long as the parameters are known, a set of inferences may be generated based on the relative values in the counters to determine the access count value for the word line.
Responsive to an activation of a word line, at block 602, “receiving a plurality of values, each of the plurality of values associated with at least one of a number of activations or a length of activation time of the word line” may be performed. In some embodiments, the values may be received by a count control circuit, such as count control circuit 128, 328, and/or 428. The values may be received from count value memory cells included with the word line, such as count value memory cells 126, 226, 326, and/or 426 in some embodiments. In some embodiments, the count values may be stored in one or more registers, such as count value register 452.
At block 604, “determining a correct value for the word line based, at least in part, on a comparison of the plurality of values.” In some embodiments, this may be performed by a count inference circuit, such as count inference circuit 460 included in the count control circuit.
At block 606, “generating an updated value by updating the correct value” may be performed. In some embodiments, this may be performed by a count update circuit, such as count update circuit 456. In some embodiments, updating the correct value may include incrementing the correct value. In some embodiments, the updating is performed each time the word line remains activated for an interval of time. For example, a timer, such as timer circuit 458 may measure a length an activation signal is active.
At block 608, “providing the updated value to a counter of a plurality of counters of the word line” may be performed. In some embodiments, the updated value is provided each time the updating is performed. In some embodiments, the updated value may be provided regardless of a state of an activation and/or precharge signal.
In some embodiments, the method may further include block 610 where “comparing at least one of the correct value or the updated value to a threshold value” may be performed. In some embodiments, the comparing may be performed by a threshold comparator, such as threshold comparator 454. When the correct value or the updated value is equal to or exceeds the threshold value, “activating a trigger signal” may be performed at block 612. In some embodiments, the method may further include resetting the correct value or the updated value when the correct value or the updated value is equal to or exceeds the threshold value.
In some embodiments, the method may further include “latching a current row address responsive to the active trigger signal” at block 614. In some embodiments, the latching may be performed by a refresh control circuit, such as refresh control circuit 116 and/or 316. At block 616, “activating a busy signal provided to an external pin” may be performed. At block 616, “performing a targeted refresh operation” may be performed. The activating and performing may be performed by the refresh control circuit in some embodiments.
Although blocks 610-618 are shown after block 608, in some embodiments, at least some of blocks 610-618 may be performed before or during performance of block 608. For example, block 610 may be performed before and after block 608 in some embodiments.
The apparatuses and methods disclosed herein may provide a deterministic technique for detecting various memory attacks, such as row hammer and clobber attacks. At least some of the apparatuses and methods disclosed herein may allow for tracking a number of activations and/or time of activation of word lines. Tracking values may be stored in count value memory cells associated with individual word lines. In some embodiments, the tracking values may be written back to the count value memory cells without waiting for a precharge command, which may minimize impact on tRP and/or other memory operation timing parameters. In some embodiments, the memory may alert an external device, such as a controller, when a targeted refresh is being performed, which may permit targeted refresh operations to be performed outside scheduled refresh modes.
Of course, it is to be appreciated that any one of the examples, embodiments or processes described herein may be combined with one or more other examples, embodiments and/or processes or be separated and/or performed amongst separate devices or device portions in accordance with the present systems, devices and methods.
Finally, the above-discussion is intended to be merely illustrative of the present system and should not be construed as limiting the appended claims to any particular embodiment or group of embodiments. Thus, while the present system has been described in particular detail with reference to exemplary embodiments, it should also be appreciated that numerous modifications and alternative embodiments may be devised by those having ordinary skill in the art without departing from the broader and intended spirit and scope of the present system as set forth in the claims that follow. Accordingly, the specification and drawings are to be regarded in an illustrative manner and are not intended to limit the scope of the appended claims.
This application is a divisional of U.S. patent application Ser. No. 17/102,266 filed Nov. 23, 2020 and issued as U.S. Pat. No. 11,462,291 on Oct. 4, 2022. 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 |
5617348 | Maguire | Apr 1997 | 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 | Narul et al. | Aug 2016 | B2 |
9418741 | Ramaraju et al. | Aug 2016 | B1 |
9424907 | Fujishiro | Aug 2016 | B2 |
9449675 | Wheeler | Sep 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 |
11854618 | Penney | Dec 2023 | B2 |
11984148 | Penney et al. | May 2024 | 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 |
20030095459 | Derner et al. | 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 | Hosce | 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 |
20140085995 | Greenfield 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 |
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 |
20160246525 | Jeffrey | 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 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 |
20180004592 | Bains et al. | Jan 2018 | 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 | Wolf | 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 | Cal 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 |
20190172521 | Morgan | 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 |
20190237131 | Ito | Aug 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 et al. | Nov 2019 | A1 |
20190348100 | Smith et al. | Nov 2019 | A1 |
20190348102 | Smith et al. | Nov 2019 | A1 |
20190348103 | Jeong et al. | Nov 2019 | A1 |
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 | Wolf | 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 |
20210407583 | 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 |
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 |
20240212738 | Akamatsu et al. | Jun 2024 | 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 |
101595528 | Dec 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 |
105493188 | Apr 2016 | CN |
105814636 | Jul 2016 | CN |
106710621 | May 2017 | CN |
107256717 | Oct 2017 | CN |
107871516 | Apr 2018 | CN |
108122581 | Jun 2018 | CN |
108154895 | Jun 2018 | CN |
109074305 | Dec 2018 | CN |
109408898 | Mar 2019 | 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 |
20180064940 | Jun 2018 | 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 |
2018217582 | Nov 2018 | 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/932,206, titled, “Apparatuses and Methods for Dynamically Allocated Aggressor Detection” filed Sep. 14, 2022; pp. all pages of application as filed. |
[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. |
U.S. Appl. No. 15/884,192 entitled ‘Semiconductor Device Performing Row Hammer Refresh Operation’ filed Jan. 30, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/797,658, titles “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 21, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 16/818,981 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Mar. 13, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 16/824,460, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 19, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 16/025,844, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, filed Jul. 2, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/783,063, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, dated Feb. 5, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 16/805,197, titled “Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device”, dated Feb. 28, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 16/232,837, titled “Apparatuses and Methods for Distributed Targeted Refresh Operations”, filed Dec. 26, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/818,989, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 13, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 16/268,818, titled “Apparatuses and Methods for Managing Row Access Counts”, filed Feb. 6, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/286,187 titled “Apparatuses and Methods for Memory Mat Refresh Sequencing” filed Feb. 26, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/084,119, titled “Apparatuses and Methods for Pure-Time, Self Adopt Sampling for Row Hammer Refresh Sampling”, filed Sep. 11, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/886,284 titled “Apparatuses and Methods for Access Based Refresh Timing” filed May 28, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 16/358,587, titled “Semiconductor Device Having Cam That Stores Address Signals”, dated Mar. 19, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/375,716 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Apr. 4, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/936,297 titled “Apparatuses and Methods for Managing Row Access Counts” filed Jul. 22, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 16/411,573 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed May 14, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/428,625 titled “Apparatuses and Methods for Tracking Victim Rows” filed May 31, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/513,400 titled “Apparatuses and Methods for Tracking Row Accesses” filed Jul. 16, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 17/060,403 titled “Apparatuses and Methods for Adjusting Victim Data” filed Oct. 1, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 16/548,027 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Aug. 22, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/549,942 titled “Apparatuses and Methods for Lossy Row Access Counting” filed Aug. 23, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/546,152 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Aug. 20, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/549,411 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Aug. 23, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/655,110 titled “Apparatuses and Methods for Dynamic Targeted Refresh Steals” filed Oct. 16, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 17/154,945 titled “Apparatuses, Systems, and Methods for a Content Addressable Memory Cell” filed Jan. 21, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/170,616 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Feb. 8, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/168,036 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Feb. 4, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/301,533 titled “Semiconductor Device Having Cam That Stores Address Signals” filed Apr. 6, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/443,056 titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences” filed Jul. 20, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/446,710 titled “Apparatuses, Systems, and Methods for Determining Extremum Numerical Values” filed Sep. 1, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/470,883 titled “Apparatuses and Methods for Tracking Victim Rows” filed Sep. 9, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/153,555 titled “Apparatuses and Methods for Dynamically Allocated Aggressor Detection” filed Jan. 20, 2021, pp. all pages of application as filed. |
International Search Report and Written Opinion for PCT Application No. PCT/US2021/058824, mailed Mar. 3, 2022, pp. all. |
U.S. Appl. No. 17/375,817 titled “Apparatuses and Methods for Monitoring Word Line Accesses” filed Jul. 14, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 16/788,657, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Feb. 12, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 15/881,256 entitled ‘Apparatuses and Methods for Detecting a Row Hammer Attack With a Bandpass Filter’ filed Jan. 26, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/425,525 titled “Apparatuses and Methods for Tracking All Row Accesses” filed May 29, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/427,105 titled “Apparatuses and Methods for Priority Targeted Refresh Operations” filed May 30, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/427,140 titled “Apparatuses and Methods for Tracking Row Access Counts Between Multiple Register Stacks” filed May 30, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/437,811 titled “Apparatuses, Systems, and Methods for Determining Extremum Numerical Values” filed Jun. 11, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/537,981 titled “Apparatuses and Methods for Controlling Targeted Refresh Rates” filed Aug. 12, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 17/007,069 titled “Apparatuses and Methods for Providing Refresh Addresses” filed Aug. 31, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 17/201,941 titled “Apparatuses and Methods for Sketch Circuits for Refresh Binning” filed Mar. 15, 2021, pp. all pages of application as filed. |
U.S. Appl. No. 17/444,925 titled “Apparatuses and Methods for Countering Memory Attacks” filed Aug. 12, 2021, pp. all pages of application as filed. |
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. 15/789,897, entitled “Apparatus and Methods for Refreshing Memory”, filed Oct. 20, 2017, pp. all pages of application as filed. |
U.S. Appl. No. 16/796,340, entitled: “Apparatus and Methods for Refreshing Memory” filed Oct. 27, 2017, pp. all pages of application as filed. |
U.S. Appl. No. 16/012,679, titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences”, filed Jun. 19, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/020,863, titled “Semiconductor Device”, filed Jun. 27, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/112,471 titled “Apparatuses and Methods for Controlling Refresh Operations” filed Aug. 24, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/160,801, titled “Apparatuses and Methods for Selective Row Refreshes” filed Oct. 15, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/176,932, titled “Apparatuses and Methods for Access Based Refresh Timing”, filed Oct. 31, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/208,217, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Dec. 3, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/230,300, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Dec. 21, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/231,327 titled “Apparatuses and Methods for Selective Row Refreshes”, filled Dec. 21, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/237,291, titled “Apparatus and Methods for Refreshing Memory”, filed Dec. 31, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/290,730, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 1, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/374,623, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Apr. 3, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/411,698 title “Semiconductor Device” filed May 14, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/427,330 titled “Apparatuses and Methods for Storing Victim Row Data” filed May 30, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/431,641 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 4, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 16/682,606, titled “Apparatuses and Methods for Distributing Row Hammer Refresh Events Across a Memory Device ”, filed Nov. 13 2019, pp. all pages of application as filed. |
U.S. Appl. No. 17/102,266, titled “Apparatuses and Methods for Tracking Word Line Accesses”, dated Nov. 23, 2020, pp. all pages of application as filed. |
U.S. Appl. No. 15/876,566 entitled ‘Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device’ filed Jan. 22, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 15/656,084, titled “Apparatuses and Methods for Targeted Refreshing of Memory”, filed Jul. 21, 2017, pp. all pages of application as filed. |
U.S. Appl. No. 16/459,520 titled “Apparatuses and Methods for Monitoring Word Line Accesses”, filed Jul. 1, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 15/715,846, entitled “Semiconductor Device”, filed Sep. 26, 2017, pp. all pages of application as filed. |
U.S. Appl. No. 15/888,993, entitled “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 5, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/190,627 titled “Apparatuses and Methods for Targeted Refreshing of Memory” filed Nov. 14, 2018, pp. all pages of application as filed. |
U.S. Appl. No. 16/459,507 titled “Apparatuses and Methods for Adjusting Victim Data”, filed Jul. 1, 2019, pp. all pages of application as filed. |
U.S. Appl. No. 15/281,818, entitled: “Semiconductor Device” filed Sep. 30, 2016, pp. all pages of application as filed. |
Kim, et al., “Flipping Bits in MemoryWithout Accessing Them: An Experimental Study of DRAM Disturbance Errors”, IEEE, Jun. 2014, 12 pgs. |
Stout, Thomas et al., “Voltage Source Based Voltage-to-Time Converter”, IEEE, downloaded Jul. 2020, p. All. |
Number | Date | Country | |
---|---|---|---|
20220415427 A1 | Dec 2022 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 17102266 | Nov 2020 | US |
Child | 17822033 | US |