This disclosure relates generally to semiconductor devices, and more specifically to semiconductor components used for storing bits. Semiconductor logic devices may generally operate with a binary logic, where signals and information are stored as one or more bits, each of which may be at a high logical level or a low logical level. There may be a number of applications where it is useful to store information and compare the stored information with external information. For example, a memory device may use a string of bits as a row address to refer to a particular group of memory cells. One or more row addresses may be stored, and may be compared to incoming row addresses to determine if there is a match between any of the stored row addresses and the incoming row address.
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 semiconductor device may generally be represented by one or more binary bits, with each bit being at a high logical level (e.g., 1) or a low logical level (e.g., 0). Information may be stored in circuits included in the semiconductor device, such as latch circuits. The latch circuits may store a particular bit of information, which may later be retrieved and/or overwritten by a new bit of information to be stored. A group of latch circuits may be organized together to form a register, which stores information (e.g., data) including a number of bits. A number of registers may be organized into a stack, to store multiple pieces of information (e.g., each register may have N latch circuits to store information including N bits, and there may be M registers in the stack). The number of registers in a stack may generally be referred to as a depth of the stack. There may be many applications where it is useful to be able to search a given register stack for the register containing particular information, however such circuits may be relatively space and power consuming.
The present disclosure is drawn to apparatuses, systems, and methods for a content addressable memory cell. In some embodiments of the disclosure, a content addressable memory (CAM) cell may store a bit of information and allow for the memory cell to be addressed (e.g., located within a group of CAM cells) based on the contents stored in the CAM cell. A CAM cell of the present disclosure includes a layout which may allow for each CAM cell to take up relatively little space on a semiconductor device (e.g., by using fewer components and/or smaller components), and may also allow for less power to be drawn when addressing the CAM cells.
A CAM cell according to some embodiments of the present disclosure include a latch portion and a comparator portion. In such embodiments, the latch portion may store a bit of information, while the comparator portion may compare the stored bit to a supplied external bit. If the comparator portion determines that there is not a match, the state of a match signal may be changed from a high logical level to a low logical level. If there is a match, the comparator portion may do nothing and the latch signal may remain at a high logical level. When multiple CAM cells are organized into a register, they may be coupled in common to a signal line and may share a latch signal.
The latch portion 102 stores a bit and provides signals Q and QF indicative of the logic level of the stored bit. The signals Q and QF may be binary signals, which are either at a high logical level (e.g., a first voltage) or a low logical level (e.g., a second voltage). The Q and QF signals are complementary to each other and have opposite logical values. For example, if the signal Q is a logical high, then the signal QF may be a logical low and vice versa. The signal Q may represent the logical level of the stored bit, while the signal QF may be complementary to the logical level of the stored bit. The latch portion 102 may continue to provide the signals Q and QF as long as the latch portion 102 is receiving power. In some embodiments, the latch portion 102 may receive power whenever the device containing the CAM cell 100 is powered on.
The CAM cell 100 may receive an input signal D and a complementary input signal DF. The input signals D and DF are complementary to each other and have opposite logical values. The input bit D may represent a logical value of an input bit which is provided to overwrite the stored bit currently in the CAM cell, When a write signal Write is at a high logical level, the value of the signals D and DF may be written to the CAM cell 100. This may cause the values of the input signals D and DF to overwrite the current values of the stored signals Q and QF, respectively. When the signal Write is at a low logical level, the values of the stored signals Q and QF may be maintained, even if the input signals D and DF are provided.
The CAM cell 100 may also include a comparator portion 104. The comparator portion 104 may be used when external signals X_Compare and XF_Compare are provided. The external signals X_Compare and XF_Compare are complementary to each other during a comparison operation. The signals X_Compare may represent the logical level of an external bit, while the signal XF_Compare may represent a complement to the logical level of the external bit. When a comparison operation is not being performed (e.g., when the signal X_Compare does not represent an external bit) both X_Compare and XF_Compare may be at a low logical level. The comparator portion 104 determines if the external signals X_Compare matches the stored signal Q, and if the complementary external signal XF_Compare matches the complementary stored signal QF. If the external signal X_Compare does not match the stored signal Q (and therefore the complementary external signal XF_Compare does not match the complementary stored signal QF), the comparator portion 104 may provide a BitMatch signal having a low logical level. In contrast, if the external signal X_Compare does match the stored signal Q (and therefore the inverse external signal XF_Compare matches the inverse stored signal QF), the comparator portion 104 may provide a BitMatch signal having a high logical level.
In some embodiments of the disclosure, before a comparison operation is performed (e.g., before X_Compare and XF_Compare are provided) the BitMatch signal may have a high logical level, Thus, if there is not a match between the external signals and the stored signals, the CAM cell 100 may change the state of the signal BitMatch to a low logical level. If the signals Q and X_Compare (and QF and XF_Compare) do match, the signal BitMatch may be left at a high logical level.
In some embodiments, the comparator portion 104 may include a first portion 101 and a second portion 103. Both the first portion 101 and the second portion 103 may be coupled to the signal BitMatch and either the first portion 101 or the second portion 103 may be capable of changing a logic level of the signal BitMatch. The first portion 101 may be activated when the signal XF_Compare is at a high logical level, and may be inactive otherwise. The second portion 103 may be activated when the signal X_Compare is at a high logical level. Since the signals X_Compare and XF_Compare are complementary to each other, only one of the first portion 101 or the second portion 103 may be active at a given time. When active, the first portion 101 may change the signal BitMatch from a high logical level to a low logical level if the signal Q is at a high level (e.g., if the signals Q and XF_Compare match). Similarly, when active, the second portion 102 may change the signal BitMatch from a high logical level to a low logical level if the signal QF is at a high logical level (e.g., if the signals QF and X_Compare match).
The latch portion 202 includes a first transistor 206 which has a source coupled to a node which provides a voltage VPERI, which may represent a high logical level. The first transistor 206 has a drain coupled to a node 217 having a voltage which represents the value of the signal Q and a gate coupled to a node 219 having a voltage which represents a value of the complementary signal QF. The signal Q represents the logical level of a bit stored in the latch portion 202. The first transistor 206 may be a p-type transistor. The latch portion 202 also includes a second transistor 207 which has a source coupled to the node which provides VPERI, a gate coupled to the node 217 and a drain coupled to the node 219. The second transistor 207 may be a p-type transistor.
The latch portion 202 includes a third transistor 208 which has a drain coupled to the node 217, a gate coupled to the node 219, and a source coupled to a node providing a ground voltage VSS, which may represent a low logical level. The third transistor 208 may be an n-type transistor. The latch portion 202 includes a fourth transistor 209 which has a drain coupled to the node 219, a gate coupled to the node 217, and a source coupled to the node providing the ground voltage VSS. The fourth transistor 209 may be an n-type transistor. The transistors 206 and 208 may form an inverter circuit and the transistors 207 and 209 may form another inverter circuit, and the two inverter circuits are cross-coupled to one another.
In operation, the first, second, third, and fourth transistors 206-209 may work to store the value of the stored signals Q and QF. The transistors 206-209 may work together to couple the node 217 carrying Q and the node 219 carrying QF to a node providing the system voltage (e.g., VPERI or VSS) associated with the value of the signals Q and QF. For example, if the stored signal Q is at a high logical level, then the inverse signal QF is at a low logical level. The first transistor 206 may be active, and VPERI may be inactive. The fourth transistor 209 may be active and may couple VSS to the node 219. This may keep the node 217 at a voltage of VPERI, which represents a high logical level, and the node 219 at a voltage of VSS, which represents a low logical level. In another example, if the stored signal Q is at a low logical level, then the inverse signal QF may be at a high logical level. The first transistor 206 and the fourth transistor 209 may both be inactive. The second transistor 207 may be active and may couple VPERI to the node 219. The third transistor 208 may also be active and may couple VSS to the node 217. In this manner, the stored signal Q and QF may be coupled to a respective system voltage corresponding to their current logical levels, which may maintain the current logical value of the stored bit.
The latch portion 202 also includes a fifth transistor 210 and a sixth transistor 211. The transistors 210 and 211 may act as switches which may couple a signal line which carries input data D and a signal line carrying inverse input data DF to the nodes 217 and 219 carrying Q and QF respectively when a write signal Write is active. The fifth transistor 210 has a gate coupled to a line carrying the Write signal, a drain coupled to the signal D, and a source coupled to the node 219. The sixth transistor 211 has a gate coupled to the Write signal, a drain coupled to the signal DF, and a source coupled to the node 219. Accordingly, when the Write signal is at a high level (e.g., at a voltage such as VPERI), the transistors 210 and 211 may be active, and the voltages of the signals D and DF may be coupled to the nodes 217 and 219 carrying Q and QF respectively.
In some embodiments, the first through sixth transistors 206-211 may generally all be the same size as each other. For example, the transistors 206-211 may have a gate width of about 300 nm. Other sizes of transistor 206-211 may be used in other examples. The CAM cell 200 also includes a comparator portion 204. The comparator portion 204 may compare the signals Q and QF to the signals X_Compare and XF_Compare. The signal X_Compare may represent a logical level of an external bit provided to the comparator portion 204. If there is not a match between the signals Q and X_Compare (and therefore between QF and XF_Compare), then the comparator portion 206 may change a state of from the BitMatch signal from a first logical level (e.g., a high logical level) to a second logical level (e.g., a low logical level). For example, if the stored and external bits do not match, the comparator portion 204 may couple the ground voltage VSS to a signal line carrying the signal BitMatch. In some embodiments, if there is a match between the stored and external bits, then the comparator portion 206 may do nothing. in some embodiments, the signal BitMatch may be precharged to a voltage associated with a high logical level (e.g., VPERI) before a comparison operation. During the precharge operation, both X_Compare and XF_Compare may be held at a low logical level.
The comparator portion includes a seventh transistor 212, an eighth transistors 213, a ninth transistor 214, and a tenth transistor 215. The seventh transistor 212 and the ninth transistor 214 may implement the first portion 101 of
The eighth transistor 213 has a drain coupled to the signal BitMatch, a gate coupled to the node 219 (e.g., the signal QF), and a source coupled to a drain of the tenth transistor 215. The tenth transistor has a gate coupled to the signal X_Compare and a source coupled to the ground voltage VSS.
Since the signal Q is complementary to the signal QF, the comparator portion 202. may operate by comparing the external signal X_Compare to the signal QF to see if they match, and the inverse external signal XF_Compare to the stored signal Q to see if they match. If they do match, it may indicate that the signal X_Compare does not match the signal Q and that the signal XF_Compare does not match the signal QF, and thus that the external bits do not match the associated stored bits.
The comparator portion 204 may use relatively few components, since it changes the signal BitMatch from a known state (e.g., a precharged high logical level) to a low logical level. Thus, it may not be necessary to include additional components (e.g., additional transistors) to change the logical level of the signal BitMatch from low to high, or from an unknown level to either low or high. The comparator portion 204 may take advantage of this to provide dynamic logic. For example, the comparator portion 204 has two portions (e.g., transistors 212/214 and transistors 214/215) either of which may couple the signal BitLine to the voltage VSS if there is not a match between the stored and external bit. Since only one of the portions is active at a time, only the state of the signal Q or QF needs to be checked by the active portion. Either of the portions is equally capable of changing the signal BitMatch to a low logical level.
In an example operation, if the stored signal Q is at a high logical level (and thus the signal QF is low) and the external signal X_Compare is also high (and the signal XF_Compare is low), then the external signals may match the stored signals, and the transistors 212 and 215 may be active while the transistors 214 and 213 are inactive. This may prevent the ground voltage VSS from being coupled to the signal BitMatch. If the signal X_Compare is low (e.g., if there is not a match), then the external signals may not match the stored signals, and the transistors 212 and 214 may be active wile transistors 213 and 215 are inactive. The transistors 212 and 214 being active at the same time may couple the ground voltage VSS to the signal BitMatch.
In another example operation if the stored signal Q is low (and thus the signal QF is high) then the transistor 212 may be inactive while the transistor 213 is active. If the external signal X_Compare is low (and XF_Compare is high) then the external signal may match the stored bits, and the transistor 214 is active while transistor 215 is inactive. If the signal X_Compare is high (and the signal XF_Compare is low) then the external signal may not match the stored signal and the transistor 214 may be inactive while the transistor 215 is active. Accordingly, the signal BitMatch may be coupled to ground voltage VSS through active transistors 213 and 215.
In some embodiments, the transistors 212-215 of the comparator portion 204 may generally all have the same size to each other, in some embodiments, the transistors 212-215 of the comparator portion 204 may be a different size than the transistors 206-211 of the latch portions 202. For example, the transistors 212-215 may have a gate width of about 400 nm and a gate length of about 45 nm. Other sizes for the transistors 212-215 may be used in other examples.
The CAM cell register 300 includes of a number of individual CAM cells 318, each of which may store a bit of information and provide signals Q and QF, where the signal QF has a complementary logic level of the signal Q. The signal Q may have a logic level which matches the logic level of the stored bit. The CAM cell register 300 may include a number of CAM cells 318 to hold multi-bit information. For example, the CAM cell register 300 may hold a row address which may be n bits long, and thus there may be n different CAM cells 318. The bits may be loaded into the CAM register 300 using the input terminals (e.g., which may receive the input signals D and DF of
During a comparison operation, data X_Compare may be provided to the CAM cell register 300. The data X_Compare may be the same type of information (e.g., a row address) as the information stored in the CAM cell register 300. The data X_Compare may be a multi-bit signal, and may have n bits to match the number of CAM cells 318 of the CAM cell register 300. When the data X_Compare is provided, it may be split into different individual bits and provided to an associated CAM cell 318. Thus a first external bit X_Compare(0) may be provided to the CAM cell 318(0) containing the stored bit Q(0), a second external bit X_Compare(1) may be provided to the CAM cell 318(1) containing the stored bit Q(1), etc. in some embodiments, the external data X_Compare may be provided along with complementary data XF_Compare. In some embodiments, only the data X_Compare may be provided, and one or more inverter circuits may be used to produce the complementary data XF_Compare and provide it to the CAM cells 318 of the CAM cell register 318.
Each of the CAM cells 318 may be coupled in common to a signal line that provides the signal RegisterMatch. The signal RegisterMatch may implement the signal BitMatch of
Accordingly, the signal RegisterMatch will only remain at a first voltage (e.g., a high logical level) if every bit of the external signals X_Compare matches each of the associated stored signals Q. In other words, RegisterMatch may act as if each of the CAM cells 318 provided a match signal (e.g., BitMatch of
During a search operation, external information X_Compare may be provided to each of the CAM cell registers 420. The external information X_Compare may be provided in common to the CAM cell registers 420, and may act as the external information X_Compare of
After a compare operation, the states of RegisterMatch(0-m) may be used to determine which of the CAM cell registers 420 contain an exact match for X_Compare. For example, if each of the CAM cell registers is associated with a physical location, then that location may be accessed if the associated signal line RegisterMatch is at the first voltage (e.g., the match bit is at a high logical level).
An example environment where CAM cells, registers, and stacks of the present disclosure may be useful are semiconductor memory devices. Memory devices may be used to store one or more bits of information in a memory cell array, which contains a plurality of memory cells each of which includes one or more bits of information. The memory cells may be organized at the intersection of rows (word lines) and columns (bit lines). During various operations, the memory device may access one or more memory cells along specified word lines or bit lines by providing a row and/or column address which specifies the word line(s) and bit line(s). There may be memory operations where the CAM cell, register, and stack (e.g., as described in
One example application are memory repair operations in a memory device. One or more of the memory cells of the memory device may become defective. The row and/or column address associated with the defective memory cell(s) may be reassigned to a redundant row/column of the memory array. This may be done, for example, by changing the state(s) of one or more fuses (and/or anti-fuses) in a fuse array. The state of the fuses may represent a row/column address to be repaired, which may be broadcast out to a fuse latch which is associated with the redundant row/column. When the memory attempts to access the repaired row/column, if the incoming row/column address matches the row/column address stored in the fuse latch, then the redundant row/column associated with that fuse latch is accessed instead of the defective row/column. The CAM cell registers (e.g., 300 of
Another example application for the CAM cells, registers, and stacks of the present disclosure are refresh operations in a memory device. Information in the memory cells may decay over time, and may need to be periodically refreshed (e.g., by rewriting the original value of the information to the memory cell). Repeated access to a particular row of memory (e.g., an aggressor row) may cause an increased rate of decay in neighboring rows (e.g., victim rows) due, for example, to electromagnetic coupling between the rows. This may generally be referred to as ‘hammering’ the row, or a row hammer event. In order to prevent information from being lost due to row hammering, it may be necessary to identify aggressor rows so that the corresponding victim rows can be refreshed (a ‘row hammer refresh’ or RHR). The row addresses of accessed rows may be stored and may be compared to new row addresses to determine if one or more rows requires an RHR operation. A CAM cell stack (e.g., 400 of
The semiconductor device 500 includes a memory array 542. In some embodiments, the memory array 542 may include of a plurality of memory banks. Each memory bank includes a plurality of word lines WL, a plurality of bit lines BL and /BL, and a plurality of memory cells MC arranged at intersections of the plurality of word lines WL and the plurality of bit lines BL and /BL. The selection of the word line WL is performed by a row control 534 and the selection of the bit lines BL and /BL is performed by a column control 540. The bit lines BL and /BL are coupled to a respective sense amplifier (SAMP). Read data from the bit line BL or /BL is amplified by the sense amplifier SAMP 547, and transferred to read/write amplifiers 550 over complementary local data lines (LIOT/B), transfer gate (TG) 548, and complementary main data lines (MIO). Conversely, write data outputted from the read/write amplifiers 550 is transferred to the sense amplifier 547 over the complementary main data lines MIO, the transfer gate 548, and the complementary local data lines LIOT/B, and written in the memory cell MC coupled to the bit line BL or /BL.
The semiconductor device 500 may employ a plurality of external terminals that include command and address (C/A) terminals coupled to a command and address bus to receive commands and addresses, clock terminals to receive clocks CK and /CK, data terminals DQ to provide data, and power supply terminals to receive power supply potentials VDD, VSS, VDDQ, and VSSQ.
The clock terminals are supplied with external clocks CK and /CK that are provided to a clock input circuit 552. The external clocks may be complementary. The clock input circuit 552 generates an internal clock ICLK based on the CK and /CK clocks. The ICLK clock is provided to the command control 536 and to an internal clock generator 554. The internal clock generator 554 provides various internal clocks ICLK 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 556 to time operation of circuits included in the input/output circuit 556, 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 532, to an address decoder 534. The address decoder 534 receives the address and supplies a decoded row address XADD to the row control 534 and supplies a decoded column address YADD to the column control 540. The address decoder 534 may also supply a decoded bank address BADD, which may indicate the bank of the memory array 548 containing the decoded row address XADD and column address YADD. The C/A terminals may be supplied with commands. Examples of commands include timing commands for controlling the timing of various operations, access commands for accessing the memory, such as read commands for performing read operations and write commands for performing write operations, as well as other commands and operations. The access commands may be associated with one or more row address XADD, column address YADD, and bank address BADD to indicate the memory cell(s) to be accessed.
The commands may be provided as internal command signals to a command control 536 via the command/address input circuit 532. The command control 536 includes circuits to decode the internal command signals to generate various internal signals and commands for performing operations. For example, the command control 536 may provide a row command signal to select a word line and a column command signal to select a bit line.
The device 500 may receive an access command which is a row activation command ACT. When the row activation command ACT is received, a bank address BADD and a row address XADD are timely supplied with the row activation command ACT.
The device 500 may receive an access command which is a read command. When a read command is received, a bank address and a column address are timely supplied with the read command, read data is read from memory cells in the memory array 542 corresponding to the row address and column address. The read command is received by the command control 536, which provides internal commands so that read data from the memory array 542 is provided to the read/write amplifiers 550. The read data is output to outside from the data terminals DQ via the input/output circuit 556.
The device 500 may receive an access command which is a write command. When the write command is received, a bank address and a column address are timely supplied with the write command, write data supplied to the data terminals DQ is written to a memory cells in the memory array 542 corresponding to the row address and column address. The write command is received by the command control 536, which provides internal commands so that the write data is received by data receivers in the input/output circuit 556. 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 556. The write data is supplied via the input/output circuit 556 to the read/write amplifiers 550, and by the read/write amplifiers 550 to the memory array 542 to be written into the memory cell MC.
One example application for the CAM cells described in the present disclosure are as the fuse latches 564 associated with redundant wordlines (.and/or redundant bit lines) of the memory array 542. While repair operations may generally be described with respect to redundant rows and row latches) it should be understood that redundant columns (and column latches) may operate in a similar fashion.
The fuse latches 564 may be used as part of a repair operation. During a repair operation, a memory address which previously was associated with a defective row of memory may be reassigned so that it is associated with one of the redundant wordlines instead. The repair operations may be performed by ‘blowing’ one or more fuses (and/or anti-fuses) of a fuse array 560. The fuse array 560 may include a number of fuses, each of which may have a state which represents a hit, The states of one or more fuses may be permanently changed (blown) to program in a particular piece of binary data. During a repair operation, an address to be repaired may be programmed into the fuse array 560 by blowing fuses.
Each redundant wordline and/or redundant bitline) may be associated with a fuse latch 564. The state of fuses in the fuse array 560 may be provided along a fuse bus. A fuse logic circuit 562 may provide a select signal (e.g., a write signal) which causes a repaired address represented by the values of the fuses in the fuse array 560 to be stored in a fuse latch 564. When the memory performs an access operation, the row address XADD may be compared to the addresses in the fuse latches 564, and if there is a match, the access operation may be performed on the redundant row associated with the fuse latch 564 instead of the original wordline that the address referred to. In this manner, the repaired address may be redirected to a redundant row.
Each of the fuse latches 564 may be CAM cell register such as the CAM cell register 300 of
When a row address XADD is provided, it may act as the external data X_Compare (e.g., of
Another example application for the CAM cells described in the present application include tracking aggressor addresses in order to refresh victim wordlines associated with those aggressor addresses The device 500 may also receive commands causing it to carry out refresh operations. The refresh signal AREF may be a pulse signal which is activated when the command control 536 receives a signal which indicates a refresh mode. In some embodiments, the refresh command may be externally issued to the memory device 500. In some embodiments, the refresh command may be periodically generated by a component of the device. In some embodiments, when an external signal indicates a refresh entry command, the refresh signal AREF may also be activated. The refresh signal AREF may be activated once immediately after command input, and thereafter may be cyclically activated at desired internal timing. Thus, refresh operations may continue automatically. A self-refresh exit command may cause the automatic activation of the refresh signal AREF to stop and return to an IDLE state.
The refresh signal AREF is supplied to the refresh control circuit 546. The refresh control circuit 546 supplies a refresh row address RXADD to the row control 534, which may refresh a wordline WL indicated by the refresh row address RXADD. The refresh control circuit 546 may control a timing of the refresh operation, and may generate and provide the refresh address RXADD. The refresh control circuit 546 may be controlled to change details of the refreshing address RXADD (e.g., how the refresh address is calculated, the timing of the refresh addresses), or may operate based on internal logic.
The memory device 500 may perform two types of refresh operations, auto-refresh operations and targeted refresh operations. Auto-refresh operations may involve refreshing the different wordlines of the memory array 542 in a sequence such that each wordline is refreshed at least once in a period based on an expected rate of decay of the information in the memory cell. The refresh control circuit 546 may provide refresh addresses RXADD from a sequence of refresh addresses. In some embodiments, a refresh address RXADD associated with an auto-refresh operation may cause multiple wordlines of the memory array 542 to be simultaneously refreshed.
Targeted refresh operations may be used to refresh the victim wordlines of identified aggressor wordlines. In some embodiments, refresh operations which would have normally been used for auto-refresh operations may be ‘stolen’ and used for targeted refresh operations instead. The victim wordlines may be physically near the aggressor wordline. For example, in some embodiments, the victim wordlines may include the wordlines which are physically adjacent to the aggressor wordline (e.g., R+1 and R−1). In some embodiments, the victim wordlines may include the wordlines which are adjacent to the adjacent wordlines (e.g., R+2 and R−2).
In order to perform targeted refresh operations, the aggressor wordlines must be identified, based on the access patterns to the wordlines. The refresh control circuit 546 may store row addresses XADD in a CAM register stack (e.g., the CAM register stack 400 of
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 558. The internal voltage generator circuit 558 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 control 534, the internal potentials VOD and VARY are mainly used in the sense amplifiers SAMP included in the memory array 542, 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 556. 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 556 so that power supply noise generated by the input/output circuit 556 does not propagate to the other circuit blocks.
Each row latch 664 and column latch 666 may be associated with a respective redundant row or column of memory. Each row latch 664 and column latch 666 may be a CAM cell register, with a plurality of CAM cells. The row latches 664 may have a number of CAM cells equal to a number of bits in a row address, while the column latches 666 may have a number of CAM cells equal to a number of bits in a column address. Taking the operation of a row latch 664 as an example, the row latch may receive a repaired row address from the fuse arrays 660a-b along a fuse bus. The row address may be accompanied by a select signal, which may act as write signals for the CAM cells of the row latch 664. Each bit of the row address may be stored in the latch portion (e.g., latch portion 102 of
The row latches 664 may receive an incoming row address XADD in common. In some embodiments, only some of the row latches 664 (e.g., the row latches 664 of a given bank) may receive the row address XADD in common. The row latches 664 which receive the row address may compare the row address to the address stored in the row latch 664. For example, each row latch 664 may be coupled to a signal line which may carry a voltage associated with the value of a match bit (e.g., the signal line RegisterMatch of
A fuse bus may be used to provide addresses from the fuse arrays 660a-b to the row latches 664 and column latches 666. In the particular embodiment of
The fuse arrays 660a-b may include groups of fuses which can be used to record memory addresses for repair. For example, when a defective memory row is identified, the address associated with the defective row may be programmed into one of the fuse arrays 660a-b by blowing one or more fuses. The group of fuses which were blown may be associated with a particular row of redundant memory. During a broadcast operation, the fuse arrays 660a-b may broadcast the row addresses stored in the fuse arrays 660a-b along the fuse bus. In some embodiments, the fuse logic circuit 662 may receive addresses from both the fuse arrays 660a-b, and may alternate providing addresses from the first fuse array 660a and the second fuse array 660b along the fuse bus to the row latches 664 and column latches 666.
After leaving the fuse logic circuit 662, the fuse bus may pass data through one or more options circuits 663. The options circuits 663 may include various settings of the memory which may interact with the addresses along the fuse bus. For example, the options circuits 663 may include fuse settings, such as the test mode and power supply fuses. Data stored in the fuse arrays 660a-b may be latched and/or read by the options circuits 663, which may then determine one or more properties of the memory based on the options data provided along the fuse bus.
After passing through the options circuits 663 the fuse bus may pass through the row latches 664 for all of the memory banks 668 before passing through the column latches 666 for all of the memory banks 668. As well as providing data (including address data) along the fuse bus, the fuse logic circuit 662 may also provide one or more select signals along the fuse bus. The select signals may be associated with a particular packet of data along the fuse bus, and may determine which circuit along the fuse bus the particular packet of data is associated with. The select signals may act as the Write signal described in
A DRAM interface 733 may provide one or more signals to an address refresh control circuit 746 and row control 738. The refresh control circuit 746 may include a sample signal generator 768, an address sampler 767, a row hammer refresh (MIR) state controller 765 and a refresh address generator 769. The DRAM interface 733 may represent one or more components of a memory device (e.g., device 500 of
The address sampler 767 may sample (e.g., latch) the current row address XADD responsive to an activation of ArmSample. The address sampler 767 may also provide one or more of the latched addresses to the refresh address generator 769 as the matched address HitXADD. The address sampler 767 may include a CAM register stack (e.g., CAM register stack 400 of
The RHR state controller 765 may provide the signal MIR to indicate that a row hammer refresh (e.g., a refresh of the victim rows corresponding to an identified aggressor row) should occur. The RHR state controller 765 may also provide an internal refresh signal IREF, to indicate that an auto-refresh should occur. Responsive to an activation of RHR, the refresh address generator 769 may provide a refresh address RXADD, which may be an auto-refresh address or may be one or more victim addresses corresponding to victim rows of the aggressor row corresponding to the match address HitXADD. The row control 738 may perform a refresh operation responsive to the refresh address RXADD and the row hammer refresh signal RHR. The row control 738 may perform an auto-refresh operation based on the refresh address RXADD and the internal refresh signal IREF.
The DRAM interface 733 may represent one or more components which provides signals to components of the bank. For example, the DRAM interface 733 may represent components such as the command address input circuit 532, the address decoder 534, and/or the command decoder 536 of
The sample signal generator 768 provides the sampling signal ArmSample. The address sampler 767 may receive the row address XADD from the DRAM interface 733 and. ArmSample from the sample signal generator 768. The row address XADD may change as the DRAM interface 733 directs access operations (e.g., read and write operations) to different rows of the memory cell array (e.g., memory cell array 542 of
The address sampler 767 may determine if one or more rows is an aggressor row based on the sampled row address XADD, and may provide the identified aggressor rows as the match address HitXADD. As part of this determination, the address sampler 767 may record (e.g., by latching and/or storing in a register) the current value of XADD responsive to the activation of ArmSample. The current value of XADD may be compared to previously recorded addresses in the address sampler 767 (e.g., the addresses stored in the latch/register), to determine access patterns over time of the sampled addresses. If the address sampler 767 determines that the current row address XADD is being repeatedly accessed (e.g., is an aggressor row), the activation of ArmSample may also cause the address sampler 767 to provide the address of the aggressor row as a match address HitXADD. In some embodiments, the match address (e.g., aggressor address) HitXADD may be stored in a latch circuit for later retrieval by the refresh address generator 769.
The address sampler 767 may store the value of sampled addresses in a CAM cell register of a CAM stack (e.g., CAM register stack 420 of
The RHR state controller 765 may receive the auto-refresh signal AREF and provide the row hammer refresh signal RHR. The auto-refresh signal AREF may be periodically generated and may be used to control the timing of refresh operations. The memory device may carry out a sequence of auto-refresh operations in order to periodically refresh the rows of the memory device. The RHR signal may be generated in order to indicate that 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 controller 765 may use internal logic to provide the RHR signal. In some embodiments, the RHR state controller 765 may provide the RHR signal based on certain number of activations of AREF (e.g., every 4th activation of AREF). The RHR state controller 765 may also provide an internal refresh signal IREF, which may indicate that an auto-refresh operation should take place. In some embodiments, the signals RHR and IREF may be generated such that they are not active at the same time (e.g., are not both at a high logic level at the same time).
The refresh address generator 769 may receive the row hammer refresh signal RHR and the match address HitXADD. The match address HitXADD may represent an aggressor row. The refresh address generator 769 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 (e.g., HitXADD+1 and HitXADD−1). In some embodiments, the victim rows may also include rows which are physically adjacent to the physically adjacent rows of the aggressor row (e.g., HitXADD+2 and HitXADD−2). Other relationships between victim rows and the identified aggressor rows may be used in other examples.
The refresh address generator 769 may determine the value of the refresh address RXADD based on the row hammer refresh signal RHR. In some embodiments, when the signal RHR is not active, the refresh address generator 769 may provide one of a sequence of auto refresh addresses. When the signal RHR is active, the refresh address generator 1092 may provide a targeted refresh address, such as a victim address, as the refresh address RXADD.
The row control 738 may perform one or more operations on the memory array (not shown) based on the received signals and addresses. For example, responsive to the activation signal ACT and the row address XADD (and IREF and RHR being at a low logic level), the row control 738 may direct one or more access operations (for example, a read operation) on the specified row address XADD. Responsive to either (or both) of the RHR or IREF signals being active, the row control 738 may refresh the refresh address RXADD.
The address sampler 800 may sample a current row address XADD responsive to the sample signal ArmSample. The sample signal ArmSample may also cause the address sampler 800 to determine if a sampled address (e.g., an address stored in one of the registers 870) is a row hammer address and store it on the address latch 875, where it can be provided to a refresh address generator (e.g., refresh address generator 769 of
Each time the sample signal Arm Sample is provided, the current row address XADD may be compared to the addresses stored in the CAM register stack 870. The current row address XADD may be provided as the external data. X_Compare (e.g., as in
If the current address XADD is already stored in one of the registers (e.g., if at least one of the match bits is at a high logical level), then the counter 871 associated with that register 870 may be incremented. If the current address XADD is not already stored in one of the CAM cell registers of the stack 870 if all of the match bits are at a low logical level), it may be added to one of the registers of the CAM register stack 870. If there is an open CAM cell register (e.g., a register without a latched address) then the sampled address XADD may be stored in the open register. If there is not an open register, then the register associated with the counter 871 which has the lowest value (as indicated by the pointer 874) may have its latched address replaced with the sampled address XADD. In either case, the row address XADD may be provided along with a write signal (e.g., the signal Write of
The ArmSample signal may also cause the comparator 872 to determine a counter 871 with a maximum and minimum value. These may be provided to a counter scrambler 873, which may match the maximum and minimum counter 871 to their respective associated registers 870. The pointer 874 may point to the CAM cell register of the CAM stack 870 associated with the maximum value of count in the counters 871 and may point to the CAM register stack 870 associated with the minimum value of count in the counters 871. The minimum pointer may be used to overwrite a register 870 when a new address XADD is sampled and there is no open register 870 to store it in. The signal ArmSample may cause the address stored in the CAM register stack 870 indicated by the maximum pointer to be stored in the address latch 875.
The address stored in the address latch 875 may be provided as the match address HitXADD. When a targeted refresh operation is carried out based on the address HitXADD, (e.g., when victim addresses associated with HitXADD are refreshed), the counter 871 associated with the refresh operation may be reset.
Of course, it is to be appreciated that any one of the examples, embodiments or processes described herein may be combined with one or more other examples, embodiments and/or processes or be separated and/or performed amongst separate devices or device portions in accordance with the present systems, devices and methods.
Finally, the above-discussion is intended to be merely illustrative of the present system and should not be construed as limiting the appended claims to any particular embodiment or group of embodiments. Thus, while the present system has been described in particular detail with reference to exemplary embodiments, it should also be appreciated that numerous modifications and alternative embodiments may be devised by those having ordinary skill in the art without departing from the broader and intended spirit and scope of the present system as set forth in the claims that follow. Accordingly, the specification and drawings are to be regarded in an illustrative manner and are not intended to limit the scope of the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5299159 | Balistreri et al. | Mar 1994 | A |
5422850 | Sukegawa et al. | Jun 1995 | A |
5699297 | Yamazaki et al. | Dec 1997 | A |
5768196 | Bloker et al. | Jun 1998 | A |
5933377 | Hidaka | Aug 1999 | A |
5943283 | Wong et al. | Aug 1999 | A |
5970507 | Kato et al. | Oct 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 |
6424582 | Ooishi | Jul 2002 | B1 |
6434064 | Nagai | Aug 2002 | B2 |
6452868 | Fister | Sep 2002 | B1 |
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 |
7187607 | Koshikawa et al. | Mar 2007 | B2 |
7203115 | Eto et al. | Apr 2007 | B2 |
7209402 | Shinozaki et al. | Apr 2007 | B2 |
7215588 | Lee | May 2007 | B2 |
7444577 | Best et al. | Oct 2008 | B2 |
7551502 | Dono et al. | Jun 2009 | B2 |
7830742 | Han | Nov 2010 | B2 |
8451677 | Okahiro et al. | May 2013 | B2 |
8625360 | Iwamoto et al. | Jan 2014 | B2 |
8681578 | Narui | Mar 2014 | B2 |
8811100 | Ku | Aug 2014 | B2 |
8862973 | Zimmerman et al. | Oct 2014 | B2 |
8938573 | Greenfield et al. | Jan 2015 | B2 |
9032141 | Bains et al. | May 2015 | B2 |
9047978 | Bell et al. | Jun 2015 | B2 |
9058900 | Kang | Jun 2015 | B2 |
9087602 | Youn et al. | Jul 2015 | B2 |
9117544 | Bains et al. | Aug 2015 | B2 |
9123447 | Lee et al. | Sep 2015 | B2 |
9153294 | Kang | Oct 2015 | B2 |
9190139 | Jung et al. | Nov 2015 | 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 |
9412432 | Narui et al. | Aug 2016 | B2 |
9424907 | Fujishiro | Aug 2016 | B2 |
9484079 | Lee | Nov 2016 | B2 |
9514850 | Kim | Dec 2016 | B2 |
9570143 | Lim et al. | Feb 2017 | B2 |
9646672 | Kim et al. | May 2017 | B1 |
9672889 | Lee et al. | Jun 2017 | B2 |
9685240 | Park | Jun 2017 | B1 |
9691466 | Kim | Jun 2017 | B1 |
9697913 | Mariani et al. | Jul 2017 | B1 |
9741409 | Jones et al. | Aug 2017 | B2 |
9741447 | Akamatsu | Aug 2017 | B2 |
9747971 | Bains et al. | Aug 2017 | B2 |
9786351 | Lee et al. | Oct 2017 | B2 |
9799391 | Wei | Oct 2017 | B1 |
9805782 | Liou | Oct 2017 | B1 |
9805783 | Ito et al. | Oct 2017 | B2 |
9818469 | Kim et al. | Nov 2017 | B1 |
9865326 | Bains et al. | Jan 2018 | B2 |
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 |
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 |
10387276 | Ryu et al. | Aug 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 | Jun 2020 | B2 |
10770127 | Shore et al. | Sep 2020 | B2 |
20010008498 | Ooishi | Jul 2001 | A1 |
20020181301 | Takahashi et al. | Dec 2002 | A1 |
20030063512 | Takahashi et al. | Apr 2003 | A1 |
20030067825 | Shimano et al. | Apr 2003 | A1 |
20030090400 | Barker | May 2003 | A1 |
20030123301 | Jang et al. | Jul 2003 | A1 |
20030193829 | Morgan et al. | Oct 2003 | A1 |
20040004856 | Sakimura et al. | Jan 2004 | A1 |
20040008544 | Shinozaki et al. | Jan 2004 | A1 |
20040022093 | Lee | Feb 2004 | A1 |
20040114446 | Takahashi et al. | Jun 2004 | A1 |
20040130959 | Kawaguchi | Jul 2004 | A1 |
20040174757 | Garverick et al. | Sep 2004 | A1 |
20040184323 | Mori et al. | Sep 2004 | A1 |
20040218431 | Chung et al. | Nov 2004 | A1 |
20050041502 | Perner | Feb 2005 | A1 |
20050105315 | Shin et al. | May 2005 | A1 |
20050243629 | Lee | Nov 2005 | A1 |
20060083099 | Bae et al. | Apr 2006 | A1 |
20060087903 | Riho et al. | Apr 2006 | A1 |
20060176744 | Stave | Aug 2006 | A1 |
20060262616 | Chen | Nov 2006 | A1 |
20070008799 | Dono et al. | Jan 2007 | A1 |
20070014174 | Ohsawa | Jan 2007 | A1 |
20070030746 | Best et al. | Feb 2007 | A1 |
20070133330 | Ohsawa | Jun 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 |
20080126893 | Harrand et al. | May 2008 | A1 |
20080130394 | Dono et al. | Jun 2008 | A1 |
20080181048 | Han | Jul 2008 | A1 |
20080253212 | Iida et al. | Oct 2008 | A1 |
20080266990 | Loeffler | Oct 2008 | A1 |
20080316845 | Wang et al. | Dec 2008 | A1 |
20090077571 | Gara et al. | Mar 2009 | A1 |
20090161457 | Wakimoto | Jun 2009 | A1 |
20090185440 | Lee | Jul 2009 | A1 |
20090201752 | Riho et al. | Aug 2009 | A1 |
20090251971 | Futatsuyama | Oct 2009 | A1 |
20090296510 | Lee et al. | Dec 2009 | 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 |
20100329069 | Ito et al. | Dec 2010 | A1 |
20110026290 | Noda et al. | Feb 2011 | A1 |
20110069572 | Lee et al. | Mar 2011 | A1 |
20110122987 | Neyer | May 2011 | A1 |
20110216614 | Hosoe | Sep 2011 | A1 |
20110286271 | Chen | Nov 2011 | A1 |
20110310648 | Iwamoto et al. | Dec 2011 | A1 |
20120014199 | Narui | Jan 2012 | A1 |
20120059984 | Kang et al. | Mar 2012 | A1 |
20120151131 | Kilmer et al. | Jun 2012 | A1 |
20120213021 | Riho et al. | Aug 2012 | A1 |
20130003467 | Klein | Jan 2013 | A1 |
20130003477 | Park et al. | Jan 2013 | A1 |
20130304982 | Jung et al. | Nov 2013 | A1 |
20140006703 | Bains et al. | Jan 2014 | A1 |
20140006704 | Greenfield et al. | Jan 2014 | A1 |
20140050004 | Mochida | Feb 2014 | A1 |
20140078841 | Chopra | Mar 2014 | A1 |
20140078842 | Oh et al. | Mar 2014 | A1 |
20140089576 | Bains et al. | Mar 2014 | A1 |
20140095780 | Bains et al. | Apr 2014 | A1 |
20140095786 | Moon et al. | Apr 2014 | A1 |
20140177370 | Halbert et al. | Jun 2014 | A1 |
20140189228 | Greenfield et al. | Jul 2014 | A1 |
20140219043 | Jones et al. | Aug 2014 | A1 |
20140237307 | Kobla et al. | Aug 2014 | A1 |
20140241099 | Seo et al. | Aug 2014 | A1 |
20140254298 | Dally | Sep 2014 | A1 |
20140269021 | Yang | Sep 2014 | A1 |
20140281206 | Crawford et al. | Sep 2014 | A1 |
20140281207 | Mandava et al. | Sep 2014 | A1 |
20140292375 | Angelini et al. | Oct 2014 | A1 |
20140355332 | Youn et al. | Dec 2014 | A1 |
20150049567 | Chi | Feb 2015 | A1 |
20150055420 | Bell et al. | Feb 2015 | A1 |
20150089326 | Joo et al. | Mar 2015 | A1 |
20150155027 | Abe et al. | Jun 2015 | A1 |
20150170728 | Jung et al. | Jun 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 |
20160019940 | Jang et al. | Jan 2016 | A1 |
20160027531 | Jones et al. | Jan 2016 | A1 |
20160027532 | Kim | Jan 2016 | A1 |
20160042782 | Narui et al. | Feb 2016 | A1 |
20160078911 | Fujiwara et al. | Mar 2016 | A1 |
20160086649 | Hong et al. | Mar 2016 | A1 |
20160093402 | Kitagawa et al. | Mar 2016 | A1 |
20160125931 | Doo et al. | May 2016 | A1 |
20160133314 | Hwang et al. | May 2016 | A1 |
20160140243 | Adams et al. | May 2016 | A1 |
20160172056 | Huh | Jun 2016 | A1 |
20160180917 | Chishti et al. | Jun 2016 | A1 |
20160196863 | Shin et al. | Jul 2016 | A1 |
20160202926 | Benedict | Jul 2016 | A1 |
20160225461 | Tuers et al. | Aug 2016 | A1 |
20170076779 | Bains et al. | Mar 2017 | A1 |
20170092350 | Halbert et al. | Mar 2017 | A1 |
20170117030 | Fisch et al. | Apr 2017 | A1 |
20170140811 | Joo | May 2017 | A1 |
20170213586 | Kang et al. | Jul 2017 | A1 |
20170263305 | Cho | Sep 2017 | A1 |
20170287547 | Ito et al. | Oct 2017 | A1 |
20170323675 | Jones et al. | Nov 2017 | A1 |
20170352399 | Yokoyama et al. | Dec 2017 | A1 |
20170371742 | Shim et al. | Dec 2017 | A1 |
20170372767 | Kang et al. | Dec 2017 | A1 |
20180005690 | Morgan et al. | Jan 2018 | A1 |
20180025770 | Ito et al. | Jan 2018 | A1 |
20180060194 | Ryu et al. | Mar 2018 | A1 |
20180090199 | Kim et al. | Mar 2018 | A1 |
20180158504 | Akamatsu | Jun 2018 | A1 |
20180182445 | Lee et al. | Jun 2018 | A1 |
20180203621 | Ahn et al. | Jul 2018 | A1 |
20180218767 | Wolff | Aug 2018 | A1 |
20180261268 | Hyun et al. | Sep 2018 | A1 |
20180294028 | Lee et al. | Oct 2018 | A1 |
20180308539 | Ito et al. | Oct 2018 | A1 |
20190013059 | Akamatsu | Jan 2019 | A1 |
20190051344 | Bell et al. | Feb 2019 | A1 |
20190066759 | Nale | Feb 2019 | A1 |
20190103147 | Jones et al. | Apr 2019 | A1 |
20190130961 | Bell et al. | May 2019 | A1 |
20190139599 | Ito et al. | May 2019 | A1 |
20190147964 | Yun et al. | May 2019 | A1 |
20190198078 | Hoang et al. | Jun 2019 | A1 |
20190198090 | Lee | Jun 2019 | A1 |
20190198099 | Mirichigni et al. | Jun 2019 | A1 |
20190207736 | Ben-tovim et al. | Jul 2019 | A1 |
20190228810 | Jones et al. | Jul 2019 | A1 |
20190228813 | Nale et al. | Jul 2019 | A1 |
20190228815 | Morohashi et al. | Jul 2019 | A1 |
20190237132 | Morohashi | Aug 2019 | A1 |
20190243708 | Cha et al. | Aug 2019 | A1 |
20190267077 | Ito et al. | Aug 2019 | A1 |
20190333573 | Shin et al. | Oct 2019 | A1 |
20190348100 | 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 |
20190385667 | Morohashi et al. | Dec 2019 | A1 |
20200075106 | Tokutomi et al. | Mar 2020 | A1 |
20200090760 | Purahmad et al. | Mar 2020 | A1 |
20200194050 | Akamatsu | Jun 2020 | A1 |
20200201380 | Murali et al. | Jun 2020 | A1 |
20200202921 | Morohashi et al. | Jun 2020 | A1 |
20200211633 | Okuma | Jul 2020 | A1 |
20200251158 | Shore et al. | Aug 2020 | A1 |
20200302994 | Enomoto et al. | Sep 2020 | A1 |
Number | Date | Country |
---|---|---|
1195173 | Oct 1998 | CN |
101038785 | Sep 2007 | CN |
101067972 | Nov 2007 | CN |
101331554 | Dec 2008 | CN |
101458658 | Jun 2009 | CN |
101622607 | Jan 2010 | CN |
102113058 | Jun 2011 | CN |
102483952 | May 2012 | CN |
2005-216429 | Aug 2005 | JP |
2011-258259 | Dec 2011 | JP |
2011-258259 | Dec 2011 | JP |
2013-004158 | Jan 2013 | JP |
1020180064940 | Jun 2018 | KR |
1020180085184 | Jul 2018 | KR |
2014120477 | Aug 2014 | WO |
2015030991 | Mar 2015 | WO |
2017171927 | Oct 2017 | WO |
2020191222 | Sep 2020 | WO |
Entry |
---|
U.S. Appl. No. 16/546,152 titled “Apparatuses and Methods for Analog Row Access Tracking” filed Aug. 20, 2019. |
U.S. Appl. No. 16/548,027 titled “Apparatuses, Systems, and Methods for Analog Row Access Rate Determination” filed Aug. 22, 2019. |
U.S. Appl. No. 16/549,942 titled “Apparatuses and Methods for Lossy Row Access Counting” filed Aug. 23, 2019. |
U.S. Appl. No. 16/425,525 titled “Apparatuses and Methods for Tracking All Row Accesses” filed May 29, 2019. |
U.S. Appl. No. 16/427,105 titled “Apparatuses and Methods for Priority Targeted Refresh Operations” filed May 30, 2019. |
U.S. Appl. No. 16/427,140 titled “Apparatuses and Methods for Tracking Row Access Counts Between Multiple Register Stacks” filed May 30, 2019. |
U.S. Appl. No. 16/437,811 titled “Apparatuses, Systems, and Methods for Determining Extremum Numerical Values” filed Jun. 11, 2019. |
U.S. Appl. No. 16/411,698 title “Semiconductor Device” filed May 14, 2019. |
U.S. Appl. No. 16/427,330 titled “Apparatuses and Methods for Storing Victim Row Data” filed May 30, 2019. |
U.S. Appl. No. 16/428,625 titled “Apparatuses and Methods for Tracking Victim Rows” filed May 31, 2019. |
U.S. Appl. No. 16/459,520 titled “Apparatuses and Methods for Monitoring Word Line Accesses”, filed Jul. 1, 2019, pp. all. |
U.S. Appl. No. 16/797,658, titles “Apparatuses and Methods for Controlling Refresh Operations”, filed Feb. 21, 2020. |
U.S. Appl. No. 16/513,400 titled “Apparatuses and Methods for Tracking Row Accesses” filed Jul. 16, 2019. |
U.S. Appl. No. 16/805,197, titled “Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device”, filed Feb. 28, 2020. |
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. |
U.S. Appl. No. 15/789,897, entitled “Apparatus and Methods for Refreshing Memory”, filed Oct. 20, 2017; pp. all. |
U.S. Appl. No. 15/796,340, entitled: “Apparatus and Methods for Refreshing Memory” filed Oct. 27, 2017; pp. all. |
U.S. Appl. No. 16/012,679, titled “Apparatuses and Methods for Multiple Row Hammer Refresh Address Sequences”, filed Jun. 19, 2018. |
U.S. Appl. No. 16/020,863, titled “Semiconductor Device”, filed Jun. 27, 2018. |
U.S. Appl. No. 16/176,932, titled “Apparatuses and Methods for Access Based Refresh Timing”, filed Oct. 31, 2018. |
U.S. Appl. No. 16/237,291, titled “Apparatus and Methods for Refreshing Memory”, filed Dec. 31, 2018. |
U.S. Appl. No. 16/268,818, titled “Apparatuses and Methods for Managing Row Access Counts”, filed Feb. 6, 2019. |
U.S. Appl. No. 16/358,587, titled “Semiconductor Device Having Cam That Stores Address Signals”, dated Mar. 19, 2019. |
U.S. Appl. No. 15/876,566 entitled ‘Apparatuses and Methods for Calculating Row Hammer Refresh Addresses in a Semiconductor Device’ filed Jan. 22, 2018. |
PCT Application No. PCT/US18/55821 “Apparatus and Methods for Refreshing Memory” filed Oct. 15, 2018., pp. all. |
U.S. Appl. No. 15/715,846, entitled “Semiconductor Device”, filed Sep. 26, 2017 pp. all. |
U.S. Appl. No. 15/281,818, entitled: “Semiconductor Device” filed Sep. 30, 2016. |
Kim, et al., “Flipping Bits in MemoryWithout Accessing Them: An Experimental Study of DRAM Disturbance Errors”, IEEE, Jun. 2014, 12 pgs. |
U.S. Appl. No. 15/884,192 entitled ‘Semiconductor Device Performing Row Hammer Refresh Operation’ filed Jan. 30, 2018. |
U.S. Appl. No. 16/936,297 titled “Apparatuses and Methods for Managing Row Access Counts” filed Jul. 22, 2020. |
Thomas, et al., “Voltage Source Based Voltage-to-Time Converter”, IEEE, 2020, p. all. |
U.S. Appl. No. 17/102,266, titled “Apparatuses and Methods for Tracking Word Line Accesses”, dated Nov. 23, 2020. |
Number | Date | Country | |
---|---|---|---|
20200365208 A1 | Nov 2020 | US |