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.
An auto-refresh operation may be carried out where different groups of memory cells are periodically refreshed in a sequence. A refresh signal may be periodically activated. One or more refresh addresses may be refreshed responsive to the activations of the refresh signal. The refresh addresses may be provided following a particular order to ensure reliable operation of the memory.
The following description of certain embodiments is merely exemplary in nature and is in no way intended to limit the scope of the disclosure or its applications or uses. In the following detailed description of embodiments of the present systems and methods, reference is made to the accompanying drawings which form a part hereof, and which are shown by way of illustration specific embodiments in which the described systems and methods may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice presently disclosed systems and methods, and it is to be understood that other embodiments may be utilized and that structural and logical changes may be made without departing from the spirit and scope of the disclosure. Moreover, for the purpose of clarity, detailed descriptions of certain features will not be discussed when they would be apparent to those with skill in the art so as not to obscure the description of embodiments of the disclosure. The following detailed description is therefore not to be taken in a limiting sense, and the scope of the disclosure is defined only by the appended claims.
A memory cell array may include a large number of memory cells, which may be organized at the intersection of rows (word lines) and columns (bit lines). A memory cell array may be organized into a number of memory banks. Each memory bank may include a number of sets of memory mats. Each memory mat may include a number of word lines and bit lines (and their respective memory cells). A memory address which specifies a particular row or column of the memory may thus include a number of bits which specify the bank, a number of bits which specify the set of memory mats, a number of bits which specify the mat, and a number of bits which specify the particular row or column within the mat. The mats may be laid out such that they extend along the wordline direction. Mats may share certain components, such as sense amplifiers, which may be shared between sets of mats as well. The shared components may be activated when either of the mats which share the shared components are activated (e.g., as part of a refresh).
Information in the memory cells may decay over time. To prevent loss of information, the memory cells may be refreshed on a row-by-row basis. During a refresh operation, the information in one or more rows may be rewritten back to the respective rows. A refresh signal (such as auto-refresh signal AREF) may control a timing of the refresh operations. Each time a refresh operation happens, all of the sets of memory mats within one or more of the banks may be activated, and a wordline in one of the mats of the set may be refreshed in each of the activated sets. For example, a wordline in a first mat in each of the sets will be refreshed responsive to a first activation of the refresh signal, a wordline in a second mat in each of the sets will be refreshed responsive to a second activation of the refresh signal etc. Once all of the mats in each of the sets have been refreshed, the cycle may repeat, and a different wordline in the first mats may be refreshed.
Since the various mats (and sets of mats) may share components, the refresh operation in a given mat may generate noise which may affect nearby mats (e.g., physically adjacent mats) if they perform a subsequent refresh operation. The noise may lead to undesirable outcomes, such as corrupting data stored in the mats during the refresh operation. In order to prevent this, it may be desirable to refresh the mats in a sequence such that each time a mat is refreshed, the next mat in the sequence is not physically adjacent to the refreshed mat (e.g., such that there is at least one other mat between a pair of sequentially refreshed mats). Similarly, since sets of mats may be adjacent to each other, it may be important to ensure that adjacent mats between a pair of adjacent sets (e.g., the last mat of a first set and the first mat of a second set) are not subsequently refreshed either.
The present disclosure is aimed at apparatuses and methods for the sequence of memory mat refreshes. A refresh control circuit may provide a sequence of refresh addresses over time, each of which may indicate that a particular mat in each of the sets of mats should be refreshed. The sequence may be such that each time a mat in a given set is refreshed, the next mat which is refreshed is not adjacent to the mat which was just refreshed. The sequence may be such that adjacent mats are not sequentially refreshed between different sets of memory mats as well as within a set of memory mats. In some embodiments, there may be at least two other mats between each pair of sequentially refreshed mats.
The refresh addresses may each include a portion which is a mat address which specifies a particular mat. The refresh control circuit may change the mat address each time a refresh address is provided to indicate the refresh sequence. In some embodiments, the mat addresses may reflect a refresh order of the mats within the set. In some embodiments, the mat addresses may reflect the physical order of the mats within a set and the refresh control circuit may control the sequence based on the way it counts through the mat addresses to determine the sequence. The refresh control circuit may update the mat addresses based on a pre-determined sequence of mat addresses, or may use logic (e.g., counter logic) to generate a new mat address based on a previous mat address in the sequence.
The semiconductor device 100 includes a memory array 112. In some embodiments, the memory array 112 may include of a plurality of memory banks. Each memory bank includes a plurality of word lines WL, a plurality of bit lines BL and /BL, and a plurality of memory cells MC arranged at intersections of the plurality of word lines WL and the plurality of bit lines BL and /BL. The selection of the word line WL is performed by a row control 108 and the selection of the bit lines BL and /BL is performed by a column control 110. 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 117, and transferred to read/write amplifiers 120 over complementary local data lines (LIOT/B), transfer gate (TG) 118, and complementary main data lines (MIO). Conversely, write data outputted from the read/write amplifiers 120 is transferred to the sense amplifier 117 over the complementary main data lines MIO, the transfer gate 118, and the complementary local data lines LIOT/B, and written in the memory cell MC coupled to the bit line BL or /BL.
The semiconductor device 100 may employ a plurality of external terminals that include command and address (C/A) terminals coupled to a command and address bus to receive commands and addresses, clock terminals to receive clocks CK and /CK, data terminals DQ to provide data, and power supply terminals to receive power supply potentials VDD, VSS, VDDQ, and VSSQ.
The clock terminals are supplied with external clocks CK and /CK that are provided to a clock input circuit 122. The external clocks may be complementary. The clock input circuit 122 generates an internal clock ICLK based on the CK and /CK clocks. The ICLK clock is provided to the command control 106 and to an internal clock generator 124. The internal clock generator 124 provides various internal clocks LCLK based on the ICLK clock. The LCLK clocks may be used for timing operation of various internal circuits. The internal data clocks LCLK are provided to the input/output circuit 126 to time operation of circuits included in the input/output circuit 126, for example, to data receivers to time the receipt of write data.
The C/A terminals may be supplied with memory addresses. The memory addresses supplied to the C/A terminals are transferred, via a command/address input circuit 102, to an address decoder 104. The address decoder 104 receives the address and supplies a decoded row address XADD to the row control 108 and supplies a decoded column address YADD to the column control 110. The address decoder 104 may also supply a decoded bank address BARD, which may indicate the bank of the memory array 118 containing the decoded row address XADD and column address YADD. The C/A terminals may be supplied with commands. Examples of commands include timing commands for controlling the timing of various operations, access commands for accessing the memory, such as read commands for performing read operations and write commands for performing write operations, as well as other commands and operations. The access commands may be associated with one or more row address XADD, column address YADD, and bank address BADD to indicate the memory cell(s) to be accessed.
The commands may be provided as internal command signals to a command control 106 via the command/address input circuit 102. The command control 106 includes circuits to decode the internal command signals to generate various internal signals and commands for performing operations. For example, the command control 106 may provide a row command signal to select a word line and a column command signal to select a bit line.
The device 100 may receive an access command which is a row activation command ACT. When the row activation command ACT is received, a bank address BADD and a row address XADD are timely supplied with the row activation command ACT.
The device 100 may receive an access command which is a read command. When a read command is received, a bank address and a column address are timely supplied with the read command, read data is read from memory cells in the memory array 112 corresponding to the row address and column address. The read command is received by the command control 106, which provides internal commands so that read data from the memory array 112 is provided to the read/write amplifiers 120. The read data is output to outside from the data terminals DQ via the input/output circuit 126.
The device 100 may receive an access command which is a write command. When the write command is received, a bank address and a column address are timely supplied with the write command, write data supplied to the data terminals DQ is written to a memory cells in the memory array 112 corresponding to the row address and column address. The write command is received by the command control 106, which provides internal commands so that the write data is received by data receivers in the input/output circuit 126. Write clocks may also be provided to the external clock terminals for timing the receipt of the write data by the data receivers of the input/output circuit 126. The write data is supplied via the input/output circuit 126 to the read/write amplifiers 120, and by the read/write amplifiers 120 to the memory array 112 to be written into the memory cell MC.
The device 100 may also receive commands causing it to carry out refresh operations. The refresh signal AREF may be a pulse signal which is activated when the command control 106 receives a signal which indicates a refresh mode. In some embodiments, the refresh command may be externally issued to the memory device 100. In some embodiments, the refresh command may be periodically generated by a component of the device. In some embodiments, when an external signal indicates a refresh entry command, the refresh signal AREF may also be activated. The refresh signal AREF may be activated once immediately after command input, and thereafter may be cyclically activated at desired internal timing. Thus, refresh operations may continue automatically. A self-refresh exit command may cause the automatic activation of the refresh signal AREF to stop and return to an IDLE state.
The refresh signal AREF is supplied to the refresh control circuit 116. The refresh control circuit 116 supplies a refresh row address RXADD to the row control 108, which may refresh a wordline WL indicated by the refresh row address RXADD. 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), or may operate based on internal logic.
The refresh row address RXADD may indicate that multiple wordlines should be simultaneously refreshed as part of a refresh operation. For example, as discussed in more detail herein, the memory cells may be organized into memory mats which in turn are organized into memory mat sets. The refresh row address RXADD may specify a particular wordline within a mat, and a particular mat within a set, but may not specify a particular mat set. Accordingly, the specified wordline in the specified mat may be simultaneously refreshed in all of the corresponding mats of the other mat sets responsive to the refresh row address RXADD.
When a row is refreshed, the sense amplifiers 117 coupled to the memory cells of that row may be used to rewrite the data back to the row. The sense amplifiers 117 may be arranged into sense amplifier arrays, which may be shared between different memory mats. A sense amplifier 117 is not activated twice in a row during a refresh operation, as residual noise in the sense amplifier 117 from the first refresh operation may interfere with the second refresh operation.
The row refresh addresses RXADD may be provided from the refresh control circuit 116 in a refresh sequence, such that no two memory mats which share sense amplifiers 117 (or other components) between them are refreshed sequentially (e.g., one right after another). Since mats may generally arranged along a line (e.g., along the wordline direction) mats may be considered to be physically adjacent if there is no other mat between them along that line. Other components (e.g., sense amplifiers, conductive elements) may still be positioned between a pair of adjacent mats. In some embodiments, one or more memory mats may share sense amplifiers. For example, physically adjacent memory mats may share a sense amplifier array between them. The refresh addresses RXADD may be provided in a sequence such that no pair of physically adjacent memory mats are refreshed sequentially (e.g., there is at least one other mat between the sequentially refreshed mats). In some embodiments, to further reduce noise, the refresh address sequence may ensure that there are at least two other mats between any pair of sequentially refreshed memory mats.
The refresh control circuit 116 may provide row refresh addresses which include a mat address portion. The value mat address portion may specify a given mat. Responsive to activation of AREF, the refresh control circuit 116 may provide a new refresh address RXADD with an updated mat address portion which indicates a next mat in the refresh sequence. In some embodiments, the refresh control circuit 116 may use logic to determine a next value of the mat address portion based on the previous value of the mat address portion. In some embodiments, the value of the mat address may indicate a refresh order of the mats (e.g., a first mat address is associated with the first mat to be refreshed in the sequence). In some embodiments, the value of the mat address may indicate a physical placement of the mats (e.g., the first mat address is associated with the first mat along a line of mats).
The power supply terminals are supplied with power supply potentials VDD and VSS. The power supply potentials VDD and VSS are supplied to an internal voltage generator circuit 128. The internal voltage generator circuit 128 generates various internal potentials VPP, VOD, VARY, VPERI, and the like based on the power supply potentials VDD and VSS supplied to the power supply terminals. The internal potential VPP is mainly used in the row control 108, the internal potentials VOD and VARY are mainly used in the sense amplifiers SAMP included in the memory array 112, and the internal potential VPERI is used in many peripheral circuit blocks.
The power supply terminals are also supplied with power supply potentials VDDQ and VSSQ. The power supply potentials VDDQ and VSSQ are supplied to the input/output circuit 126. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals may be the same potentials as the power supply potentials VDD and VSS supplied to the power supply terminals in an embodiment of the disclosure. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals may be different potentials from the power supply potentials VDD and VSS supplied to the power supply terminals in another embodiment of the disclosure. The power supply potentials VDDQ and VSSQ supplied to the power supply terminals are used for the input/output circuit 126 so that power supply noise generated by the input/output circuit 126 does not propagate to the other circuit blocks.
The example memory array 200 includes 16 memory banks 232. The memory banks 232 are arranged into four groups 230 of four memory banks 232 each. The different groups 230 are separated from each other by a peripheral region 234 of the memory array 200. As described in more detail in
A refresh control circuit (e.g., 116 of
The memory bank 300 is organized into four regions 336a-d, each of which is grouped into one of two halves 335a-b. The first and second regions 336a-b are part of the first half 335a, while the third and fourth regions 336c-d are part of the second half 335b. The memory bank 300 may be addressed by a row address RA which is 18 bits long (e.g., from bit 0 to bit 17). The 17th and 18th bit of the row address (e.g., RA16-17) may be used to specify which of the regions 336a-d is being addressed (e.g., the 17th bit RA16 specifies the half 335a or 335b, and the 18th bit RA17 specifies the region within that half). The refresh address (e.g., RXADD of
Each of the four regions 336a-d includes a number of memory mats, organized into sets of 8 mats each. The sets of mats are described in more detail in regards to
Within a region 336a-d, the wordlines within the mats may be accessed by the main wordline driver (MWD) 337 and the FX drivers (FXD) 338a-b. The wordlines in the mats are organized into sets of 8 sub word lines (SWL) which are activated via a main word line (MWL). There may be 128 MWLs in a given mat (e.g., 1024 total word lines per mat). The MWLs may be activated by the MWD 337, and the 4th through 10th bits RA3-9 of the row address RA may specify which MWL is to be activated. The SWLs may be activated by the FXDs 338a-b, and bits RA0-2 may specify which SWL to activate. Although the MWD 337 and the FXDs 338a-b are both shown as a single block, it should be understood that the block represents many MWDs and FXDs, and that they may be laid out in more (or fewer) regions of the memory bank 300. When a given wordline is activated, two sense amplifiers (not shown) on either side of the mat including the activated wordline are also activated to amplify the data along the activated wordline.
The bits RA10-12 may be used to specify which of the 8 mats within a given set of mats to activate, while the bits RA13-15 may be used to specify which set of mats to activate. In this manner, different portions of the row address RA may specify different regions of the memory bank 300 to activate.
For illustration purposes, the memory bank 300 is shown with a particular number of memory mats, and a particular organization of the wordlines into memory mats. It should be understood that other embodiments may use more or fewer memory mats, which may be arranged in any number of different ways. Similarly, while
During a refresh operation multiple sets 440a-b may be activated at the same time, and a particular mat in each set may be activated, and may have a particular word line in that mat refreshed. For example, if a row address which includes RA10-12 as 000 is provided, both sets 440a-b may be activated, and a first wordline in mat 442e and mat 442m, both of which are associated with RA10-12=000, may be refreshed. Once a first mat has been refreshed, a next mat in each of the sets 440a-b may be refreshed. For example, a refresh address with RA10-12 as 001 may be provided and mats 442a and 442i may both be refreshed. The numerals shown in each of the boxes representing the mats 442a-p may represent the order that the different mats 442a-p are refreshed in. After the mats labelled 7 (e.g., 442h and 442p) are refreshed, the first mats (e.g., 442e and 442m) may be refreshed.
The order of the refresh operation may be controlled by a refresh signal (e.g., AREF). Each time the refresh signal (e.g. AREF) is activated, a refresh control circuit (e.g., 116 of
Each pair of physically adjacent memory mats (e.g., 442g and 442h, or 442h and 442i) may share a group of sense amplifiers between them. When a wordline in the memory mat is activated (e.g., as part of a refresh operation), data from the activated mat and activated wordline may be read out (or in) through the sense amplifier. The activation of a mat may lead to noise in the sense amplifier bank, which may interfere with the activation of the other mat which shares that sense amplifier bank. For example, if mat 442a is refreshed, a sense amplifier bank shared with mat 442h may be used. That sense amplifier bank may contain residual noise for a time after the refresh operation. If mat 442b were refreshed immediately after mat 442a, then the residual noise in the shared sense amplifier bank may interfere with properly refreshing the data in the mat 442b.
Since the groups of sense amplifiers are shared between adjacent mats 442a-p, a refresh operation may need to be carried out such that the mats 442a-p are refreshed in a sequence such that after each mat is refreshed, the next sequential mat to be refreshed is not physically adjacent to the just refresh mat. The numbers shown in the boxes used to represent the mats 442a-p show an example embodiment of such a refresh sequence.
In the example embodiment of
The first 10 bits of the row address (e.g., bits RA0-9) may refer to a particular word line within a mat. The next three bits (e.g., bits RA10-12) may refer to a particular mat within a set. The remaining bits of the row address (e.g., bits RA13-17) may be ignored during a refresh operation, since all of the sets of mats may be activated together. The three bits (e.g., RA10-12) which specify the memory mat within a set may have 8 possible states, each of which may be associated with one of the eight memory mats 442a-h or 442i-p in a set 440a-b.
The value of the number represented by the three bits (e.g., RA10-12) which specify the mats may increment by one following a binary counting scheme each time a mat is refreshed. Thus, the first address (000) may be assigned to the first mat in the sequence (e.g., mat 442e), the second address (001) may be assigned to the second mat in the sequence (e.g., mat 442a), and so forth. After the eighth mat (e.g., 442h, associated with address 111) is refreshed, the wordline portion of the address (e.g., in RA0-9) may be changed (e.g., incremented) and the sequence may begin again from the first address (000) (e.g., mat 442e).
As may be seen from the sequence of numerals in each of the sets 440a-b, none of the mats are physically adjacent to a mat which is immediately previous or subsequent in the refresh sequence. In other words, mat n is not physically adjacent to mat n−1 or n+1. The sequence may be arranged so that this is true both within a set 440a-b and also between the sets 440a-b. For example, a wordline in the mat 442i is not refreshed immediately after a wordline in mat 442h is refreshed.
The embodiment of
In one embodiment, the order that the mats are refreshed may be controlled by the way the addresses are assigned to the different mats within the group, in a manner similar to that described in
In one embodiment, the order that the mats are refreshed may be controlled by the sequence of addresses provided by a refresh control circuit. In this embodiment, the adjacent mats may be assigned sequential addresses and the order of the addresses may indicate the physical order of the mats, as shown by the lower portion of
The refresh control circuit may provide a first refresh address which includes the first mat address 000, and the first mat 542a may be refreshed. The address may then be incremented by three, and a refresh address including the mat address 011 may be provided and may cause the fourth mat 542d to be refreshed. After that, the seventh mat 542g associated with 110 may be refreshed. When the address 110 is incremented by three, it may wrap (e.g., modulo addition) back to the address 001, and the second mat 542b may be refreshed.
The refresh control circuit 600 includes a plurality of latches RA0-RA12. Each of the latches stores a bit of a refresh address RA, which is provided to refresh memory mats in a sequence. The refresh control circuit 600 controls the way in which the bits of the refresh address RA are changed in order to control the sequence that the mats are refreshed in. The number of bits of the RA, and hence the latches, may be split into a row address portion 652 and a mat address portion 650. The row address portion 652 includes a number of bits (in this example, 10 bits labelled RA0-RA9) which are associated with a particular wordline within a memory mat. The mat address portion 650 includes a number of bits (in this example, 3 bits labelled RA10-12) which are associated with a particular mat within a set of memory mats. The refresh address may have additional bits, however they may not be used during a refresh operation.
The refresh control circuit 600 may include counter logic circuits 654 and 656 which control the generation of new refresh addresses as part of a sequence of refresh addresses. The counter logic circuits 654 and 656 may control the way that the latches update the values of the bits of the mat address portion 650 and the row address portion 652 of the refresh address change between each refresh operation. In particular, the bits of the refresh address may be considered to be a binary number, and the counter logic circuits 654 and 656 may increment that number to a next refresh address in a sequence of refresh addresses.
The counter logic circuits 654 and 656 each receive a refresh clock signal RfshClk, which may be used to control the timing of refresh operations. In some embodiments, RfshClk may be linked to the auto-refresh signal AREF. Each activation of RfshClk may indicate that a refresh operation has occurred, and that the values of RA0-RA12 should be updated to generate a new refresh address in the sequence.
The mat address counter 654 may control the values of the mat address portion 650 of the refresh address. The mat address counter 654 receives RfshClk and provides a mat clock MatClk, which updates the values of the latches in the mat address portion 650. The first latch (e.g., RA10) has a clock terminal coupled to MatClk and an output terminal coupled to its own input through an inverter, and to the clock terminal of the next latch e.g., RA11). The second latch (e.g., RA11) has an output coupled to its input through an inverter, and the output is also coupled to a clock terminal of the third latch (e.g., RA12), which also has an output coupled through an inverter to its input. The outputs of all three latches RA10-12 are also coupled to the row address counter 656. Accordingly, when the mat address counter 654 provides MatClk at a high level, the numerical value stored in the mat address portion 650 may increment. The mat address counter 654 may use internal logic to determine how many times to provide MatClk for each activation of RfshClk.
In some embodiments where the values of the mat addresses portion 650 indicate the refresh order, the mat address counter 654 may increase the value of the mat address portion 650 by one for each activation of RfshClk. In some embodiments where the values of the mat addresses indicate the physical order of the mats within a set of mats, the mat address counter 654 may increase the value of the mat address portion 650 by more than one. For example, to achieve the sequence of
The row address counter 656 may control the values of the row address portion 652 in a manner similar to the operation of the mat address counter 654. The latches of the row address portion 652 may be coupled together in a manner similar to the latches of the mat address portion 650. The row address counter 656 provides a row address clock signal RowClk based on RfshClk and on the value of the mat address portion 650. In some embodiments, the row address counter 656 may increase the value of the row address portion 652 after a number of activations of RfshClk. The row address portion 652 may be updated after all of the values of the mat address portion 650 have been expressed. In other words, after all of the mats in a set of mats have been refreshed, the row address counter 656 may change the value of the row address portion 652. For example, the row address counter 656 may monitor the value of the mat address portion 650, and only provide RowClk when the mat address portion 650 has reached its final value (e.g., 101) and then provide RowClk the next time RfshClk is provided. In some embodiments, the value of the row address portion 652 may be increased by one (e.g., RowClk may be provided once each time all the values of the mat address portion 650 have been expressed).
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 |
5654929 | Mote, Jr. | Aug 1997 | A |
5867442 | Kim et al. | Feb 1999 | A |
5956288 | Bermingham | Sep 1999 | A |
5959923 | Matteson | Sep 1999 | A |
5999471 | Choi | Dec 1999 | A |
6002629 | Kim et al. | Dec 1999 | A |
6064621 | Tanizaki et al. | May 2000 | A |
6306721 | Teo et al. | Oct 2001 | B1 |
6310814 | Hampel | Oct 2001 | B1 |
6363024 | Fibranz | Mar 2002 | B1 |
6392952 | Chen et al. | May 2002 | B1 |
6535950 | Funyu et al. | Mar 2003 | B1 |
7002868 | Takahashi | Feb 2006 | B2 |
7082070 | Hong | Jul 2006 | B2 |
7203113 | Takahashi et al. | Apr 2007 | B2 |
7692993 | Iida et al. | Apr 2010 | B2 |
8174921 | Kim et al. | May 2012 | B2 |
8400805 | Yoko | Mar 2013 | B2 |
8572423 | Isachar et al. | Oct 2013 | B1 |
9076499 | Schoenborn et al. | Jul 2015 | B2 |
9236110 | Bains et al. | Jan 2016 | B2 |
9251885 | Greenfield et al. | Feb 2016 | B2 |
9299400 | Bains et al. | Mar 2016 | B2 |
9311984 | Hong et al. | Apr 2016 | B1 |
9396786 | Yoon et al. | Jul 2016 | B2 |
9406358 | Lee | Aug 2016 | B1 |
9418723 | Chishti | Aug 2016 | B2 |
9570201 | Morgan et al. | Feb 2017 | B2 |
9653139 | Park | May 2017 | B1 |
9685240 | Park | Jun 2017 | B1 |
9691466 | Kim | Jun 2017 | B1 |
9734887 | Tavva | Aug 2017 | B1 |
9761297 | Tomishima | Sep 2017 | B1 |
9812185 | Fisch et al. | Nov 2017 | B2 |
9818469 | Kim et al. | Nov 2017 | B1 |
9831003 | Sohn et al. | Nov 2017 | B2 |
9865328 | Desimone et al. | Jan 2018 | B1 |
9978430 | Seo et al. | May 2018 | B2 |
10020045 | Riho | Jul 2018 | B2 |
10020048 | Uemura | Jul 2018 | B2 |
10049716 | Proebsting | Aug 2018 | B2 |
10090038 | Shin | Oct 2018 | B2 |
10141042 | Richter | Nov 2018 | B1 |
10170174 | Ito et al. | Jan 2019 | B1 |
10192608 | Morgan | Jan 2019 | B2 |
10297307 | Raad et al. | May 2019 | B1 |
10381327 | Ramachandra et al. | Aug 2019 | B2 |
10446256 | Ong et al. | Oct 2019 | B2 |
10468076 | He et al. | Nov 2019 | B1 |
10490250 | Ito et al. | Nov 2019 | B1 |
10504577 | Alzheimer | Dec 2019 | B1 |
10510396 | Notani | Dec 2019 | B1 |
10572377 | Zhang et al. | Feb 2020 | B1 |
10573370 | Ito et al. | Feb 2020 | B2 |
10607679 | Nakaoka | Mar 2020 | B2 |
10685696 | Brown et al. | Jun 2020 | B2 |
10699796 | Benedict et al. | Jun 2020 | B2 |
10790005 | He et al. | Sep 2020 | B1 |
10825505 | Rehmeyer | Nov 2020 | B2 |
10832792 | Penney et al. | Nov 2020 | B1 |
10930335 | Bell et al. | Feb 2021 | B2 |
10943636 | Wu et al. | Mar 2021 | B1 |
10950289 | Ito et al. | Mar 2021 | B2 |
10957377 | Noguchi | Mar 2021 | B2 |
10964378 | Ayyapureddi et al. | Mar 2021 | B2 |
10978132 | Rehmeyer et al. | Apr 2021 | B2 |
11017833 | Wu et al. | May 2021 | B2 |
11081160 | Ito et al. | Aug 2021 | B2 |
11302377 | Li et al. | Apr 2022 | B2 |
11380382 | Zhang et al. | Jul 2022 | B2 |
11417383 | Jenkinson et al. | Aug 2022 | B2 |
20020026613 | Niiro | Feb 2002 | A1 |
20020191467 | Matsumoto | Dec 2002 | A1 |
20030026161 | Yamaguchi | Feb 2003 | A1 |
20030067825 | Shimano | Apr 2003 | A1 |
20030081483 | De Paor | May 2003 | A1 |
20030161208 | Nakashima et al. | Aug 2003 | A1 |
20030231540 | Lazar et al. | Dec 2003 | A1 |
20040024955 | Patel | Feb 2004 | A1 |
20050002268 | Otsuka et al. | Jan 2005 | A1 |
20050105362 | Choi | May 2005 | A1 |
20050108460 | David | May 2005 | A1 |
20050213408 | Shieh | Sep 2005 | A1 |
20050243627 | Lee et al. | Nov 2005 | A1 |
20050265104 | Remaklus et al. | Dec 2005 | A1 |
20060018174 | Park | Jan 2006 | A1 |
20060104139 | Hur | May 2006 | A1 |
20060198220 | Yoon | Sep 2006 | A1 |
20060215474 | Hokenmaier | Sep 2006 | A1 |
20060233012 | Sekiguchi et al. | Oct 2006 | A1 |
20060262617 | Lee | Nov 2006 | A1 |
20060268643 | Schreck et al. | Nov 2006 | A1 |
20070002651 | Lee | Jan 2007 | A1 |
20070014175 | Min et al. | Jan 2007 | A1 |
20070028068 | Golding et al. | Feb 2007 | A1 |
20070147154 | Lee | Jun 2007 | A1 |
20070263442 | Cornwell et al. | Nov 2007 | A1 |
20080212386 | Riho | Sep 2008 | A1 |
20080224742 | Pomichter | Sep 2008 | A1 |
20080253212 | Iida et al. | Oct 2008 | A1 |
20080253213 | Sato et al. | Oct 2008 | A1 |
20080270683 | Barth et al. | Oct 2008 | A1 |
20080306723 | De et al. | Dec 2008 | A1 |
20090021999 | Tanimura et al. | Jan 2009 | A1 |
20090052264 | Hong et al. | Feb 2009 | A1 |
20090059641 | Jeddeloh | Mar 2009 | A1 |
20090073760 | Betser et al. | Mar 2009 | A1 |
20090161468 | Fujioka | Jun 2009 | A1 |
20090168571 | Pyo et al. | Jul 2009 | A1 |
20090228739 | Cohen et al. | Sep 2009 | A1 |
20090296510 | Lee et al. | Dec 2009 | A1 |
20100005376 | Laberge et al. | Jan 2010 | A1 |
20100061153 | Yen et al. | Mar 2010 | A1 |
20100097870 | Kim et al. | Apr 2010 | A1 |
20100110809 | Kobayashi | May 2010 | A1 |
20100124138 | Lee et al. | May 2010 | A1 |
20100128547 | Kagami | May 2010 | A1 |
20100141309 | Lee | Jun 2010 | A1 |
20100182862 | Teramoto | Jul 2010 | A1 |
20100182863 | Fukiage | Jul 2010 | A1 |
20110055495 | Remaklus et al. | Mar 2011 | A1 |
20110134715 | Norman | Jun 2011 | A1 |
20110225355 | Kajigaya | Sep 2011 | A1 |
20110299352 | Fujishiro et al. | Dec 2011 | A1 |
20120014199 | Narui | Jan 2012 | A1 |
20120155173 | Lee et al. | Jun 2012 | A1 |
20120155206 | Kodama et al. | Jun 2012 | A1 |
20120254472 | Ware et al. | Oct 2012 | A1 |
20120287727 | Wang | Nov 2012 | A1 |
20120307582 | Marumoto et al. | Dec 2012 | A1 |
20120327734 | Sato | Dec 2012 | A1 |
20130028034 | Fujisawa | Jan 2013 | A1 |
20130051157 | Park | Feb 2013 | A1 |
20130051171 | Porter et al. | Feb 2013 | A1 |
20130077423 | Lee | Mar 2013 | A1 |
20130254475 | Perego | Sep 2013 | A1 |
20130279284 | Jeong | Oct 2013 | A1 |
20140006700 | Schaefer et al. | Jan 2014 | A1 |
20140013169 | Kobla et al. | Jan 2014 | A1 |
20140013185 | Kobla et al. | Jan 2014 | A1 |
20140016422 | Kim et al. | Jan 2014 | A1 |
20140022858 | Chen et al. | Jan 2014 | A1 |
20140043888 | Chen et al. | Feb 2014 | A1 |
20140089758 | Kwok et al. | Mar 2014 | A1 |
20140095780 | Bains et al. | Apr 2014 | A1 |
20140119091 | You | May 2014 | A1 |
20140143473 | Kim | May 2014 | A1 |
20140169114 | Oh | Jun 2014 | A1 |
20140177370 | Halbert et al. | Jun 2014 | A1 |
20140181453 | Jayasena et al. | Jun 2014 | A1 |
20140185403 | Lai | Jul 2014 | A1 |
20140189228 | Greenfield et al. | Jul 2014 | A1 |
20140219042 | Yu et al. | Aug 2014 | A1 |
20140321226 | Pyeon | Oct 2014 | A1 |
20150016203 | Sriramagiri et al. | Jan 2015 | A1 |
20150036445 | Yoshida et al. | Feb 2015 | A1 |
20150049566 | Lee et al. | Feb 2015 | A1 |
20150049567 | Chi | Feb 2015 | A1 |
20150078112 | Huang | Mar 2015 | A1 |
20150085564 | Yoon et al. | Mar 2015 | A1 |
20150092508 | Bains | Apr 2015 | A1 |
20150109871 | Bains et al. | Apr 2015 | A1 |
20150120999 | Kim et al. | Apr 2015 | A1 |
20150134897 | Sriramagiri | May 2015 | A1 |
20150155025 | Lee et al. | Jun 2015 | A1 |
20150162064 | Oh et al. | Jun 2015 | A1 |
20150206572 | Lim et al. | Jul 2015 | A1 |
20150213872 | Mazumder et al. | Jul 2015 | A1 |
20150356048 | King | Dec 2015 | A1 |
20150380073 | Joo et al. | Dec 2015 | A1 |
20160027498 | Ware et al. | Jan 2016 | A1 |
20160070483 | Yoon et al. | Mar 2016 | A1 |
20160078846 | Liu et al. | Mar 2016 | A1 |
20160125931 | Doo et al. | May 2016 | A1 |
20160155491 | Roberts | Jun 2016 | A1 |
20160180917 | Chishti et al. | Jun 2016 | A1 |
20160180921 | Jeong | Jun 2016 | A1 |
20160202926 | Benedict | Jul 2016 | A1 |
20160225433 | Bains et al. | Aug 2016 | A1 |
20160343423 | Shido | Nov 2016 | A1 |
20170011792 | Oh et al. | Jan 2017 | A1 |
20170052722 | Ware et al. | Feb 2017 | A1 |
20170092350 | Halbert et al. | Mar 2017 | A1 |
20170111792 | Correia Fernandes et al. | Apr 2017 | A1 |
20170133085 | Kim et al. | May 2017 | A1 |
20170133108 | Lee et al. | May 2017 | A1 |
20170140807 | Sun et al. | May 2017 | A1 |
20170140810 | Choi et al. | May 2017 | A1 |
20170140811 | Joo | May 2017 | A1 |
20170148504 | Saifuddin et al. | May 2017 | A1 |
20170148598 | Kim et al. | May 2017 | A1 |
20170186481 | Oh et al. | Jun 2017 | A1 |
20170263305 | Cho | Sep 2017 | A1 |
20170269861 | Lu et al. | Sep 2017 | A1 |
20170287547 | Ito et al. | Oct 2017 | A1 |
20170345482 | Balakrishnan | Nov 2017 | A1 |
20170352404 | Lee et al. | Dec 2017 | A1 |
20180005690 | Morgan et al. | Jan 2018 | A1 |
20180025772 | Lee et al. | Jan 2018 | A1 |
20180025773 | Bains et al. | Jan 2018 | A1 |
20180033479 | Lea | Feb 2018 | A1 |
20180047110 | Blackman et al. | Feb 2018 | A1 |
20180061476 | Kim | Mar 2018 | A1 |
20180061485 | Joo | Mar 2018 | A1 |
20180075927 | Jeong et al. | Mar 2018 | A1 |
20180096719 | Tomishima | Apr 2018 | A1 |
20180108401 | Choi et al. | Apr 2018 | A1 |
20180114561 | Fisch et al. | Apr 2018 | A1 |
20180114565 | Lee | Apr 2018 | A1 |
20180122454 | Lee et al. | May 2018 | A1 |
20180130506 | Kang et al. | May 2018 | A1 |
20180137005 | Wu et al. | May 2018 | A1 |
20180158504 | Akamatsu | Jun 2018 | A1 |
20180158507 | Bang | Jun 2018 | A1 |
20180190340 | Kim et al. | Jul 2018 | A1 |
20180218767 | Wolff | Aug 2018 | A1 |
20180226119 | Kim et al. | Aug 2018 | A1 |
20180233197 | Laurent | Aug 2018 | A1 |
20180240511 | Yoshida et al. | Aug 2018 | A1 |
20180247876 | Kim et al. | Aug 2018 | A1 |
20180254078 | We et al. | Sep 2018 | A1 |
20180261268 | Hyun et al. | Sep 2018 | A1 |
20180276150 | Eckert et al. | Sep 2018 | A1 |
20180285007 | Franklin et al. | Oct 2018 | A1 |
20180294028 | Lee et al. | Oct 2018 | A1 |
20180308539 | Ito et al. | Oct 2018 | A1 |
20190043558 | Suh | Feb 2019 | A1 |
20190065087 | Li et al. | Feb 2019 | A1 |
20190066759 | Nale | Feb 2019 | A1 |
20190066766 | Lee | Feb 2019 | A1 |
20190088315 | Saenz et al. | Mar 2019 | A1 |
20190088316 | Inuzuka et al. | Mar 2019 | A1 |
20190115069 | Lai | Apr 2019 | A1 |
20190122723 | Ito et al. | Apr 2019 | A1 |
20190129651 | Wuu et al. | May 2019 | A1 |
20190130960 | Kim | May 2019 | A1 |
20190161341 | Howe | May 2019 | A1 |
20190190341 | Beisele et al. | Jun 2019 | A1 |
20190196730 | Imran | Jun 2019 | A1 |
20190205253 | Roberts | Jul 2019 | A1 |
20190252020 | Rios et al. | Aug 2019 | A1 |
20190279706 | Kim | Sep 2019 | A1 |
20190294348 | Ware | Sep 2019 | A1 |
20190333573 | Shin et al. | Oct 2019 | A1 |
20190347019 | Shin et al. | Nov 2019 | A1 |
20190348102 | Smith et al. | Nov 2019 | A1 |
20190362774 | Kuramori et al. | Nov 2019 | A1 |
20190385661 | Koo et al. | Dec 2019 | A1 |
20190385667 | Morohashi et al. | Dec 2019 | A1 |
20190385668 | Fujioka et al. | Dec 2019 | A1 |
20190385670 | Notani | Dec 2019 | A1 |
20190391760 | Miura et al. | Dec 2019 | A1 |
20190392886 | Cox et al. | Dec 2019 | A1 |
20200051616 | Cho | Feb 2020 | A1 |
20200075086 | Hou et al. | Mar 2020 | A1 |
20200082873 | Wolff | Mar 2020 | A1 |
20200126611 | Riho et al. | Apr 2020 | A1 |
20200135263 | Brown et al. | Apr 2020 | A1 |
20200143871 | Kim et al. | May 2020 | A1 |
20200176050 | Ito et al. | Jun 2020 | A1 |
20200185026 | Yun et al. | Jun 2020 | A1 |
20200194056 | Sakurai et al. | Jun 2020 | A1 |
20200210278 | Rooney et al. | Jul 2020 | A1 |
20200211633 | Okuma | Jul 2020 | A1 |
20200211634 | Ishikawa et al. | Jul 2020 | A1 |
20200219556 | Ishikawa et al. | Jul 2020 | A1 |
20200265888 | Ito et al. | Aug 2020 | A1 |
20200273518 | Raad et al. | Aug 2020 | A1 |
20200279599 | Ware et al. | Sep 2020 | A1 |
20200294569 | Wu et al. | Sep 2020 | A1 |
20200294576 | Brown et al. | Sep 2020 | A1 |
20200321049 | Meier et al. | Oct 2020 | A1 |
20200381040 | Penney et al. | Dec 2020 | A1 |
20200388324 | Rehmeyer et al. | Dec 2020 | A1 |
20200388325 | Cowles et al. | Dec 2020 | A1 |
20200395063 | Rehmeyer | Dec 2020 | A1 |
20210057021 | Wu et al. | Feb 2021 | A1 |
20210118491 | Li et al. | Apr 2021 | A1 |
20210166752 | Noguchi | Jun 2021 | A1 |
20210183433 | Jenkinson et al. | Jun 2021 | A1 |
20210183435 | Meier et al. | Jun 2021 | A1 |
20210225431 | Rehmeyer et al. | Jul 2021 | A1 |
20210304813 | Cowles et al. | Sep 2021 | A1 |
20210335411 | Wu et al. | Oct 2021 | A1 |
20210406170 | Jung et al. | Dec 2021 | A1 |
20220093165 | Mitsubori et al. | Mar 2022 | A1 |
20220165328 | Ishikawa et al. | May 2022 | A1 |
20220189539 | Li et al. | Jun 2022 | A1 |
20220199144 | Roberts | Jun 2022 | A1 |
20220270670 | Wu et al. | Aug 2022 | A1 |
Number | Date | Country |
---|---|---|
104350546 | Feb 2015 | CN |
106710621 | May 2017 | CN |
107871516 | Apr 2018 | CN |
4911510 | Jan 2012 | JP |
6281030 | Jan 2018 | JP |
2020117686 | Jun 2020 | WO |
2020247163 | Dec 2020 | WO |
Entry |
---|
U.S. Appl. No. 16/549,411 titled “Apparatuses and Methods for Dynamic Refresh Allocation” filed Aug. 23, 2019. |
U.S. Appl. No. 16/783,063, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, dated Feb. 5, 2020. |
U.S. Appl. No. 16/537,981 titled “Apparatuses and Methods for Controlling Targeted Refresh Rates” filed Aug. 12, 2019. |
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. |
International Application No. PCT/US19/40169 titled “Apparatus and Methods for Triggering Row Hammer Address Sampling” filed Jul. 1, 2019. |
U.S. Appl. No. 16/431,641 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 4, 2019. |
U.S. Appl. No. 16/025,844, titled “Apparatus and Methods for Triggering Row Hammer Address Sampling”, filed Jul. 2, 2018. |
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. |
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/230,300, titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Dec. 21, 2018. |
U.S. Appl. No. 16/232,837, titled “Apparatuses and Methods for Distributed Targeted Refresh Operations”, filed Dec. 26, 2018. |
U.S. Appl. No. 16/290,730, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Mar. 1, 2019. |
U.S. Appl. No. 16/374,623, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Apr. 3, 2019. |
U.S. Appl. No. 16/375,716 titled “Stagger RHR Pumping Scheme Across Die Banks” filed Apr. 4, 2019; pp. all. |
U.S. Appl. No. 16/655,110 titled “Apparatuses and Methods for Dynamic Targeted Refresh Steals” filed Oct. 16, 2019. |
U.S. Appl. No. 16/886,284, titled “Apparatuses and Methods for Access Based Refresh Timing”, dated May 28, 2020. |
U.S. Appl. No. 16/788,657, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Feb. 12, 2020. |
U.S. Appl. No. 16/818,989, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 13, 2020. |
U.S. Appl. No. 16/818,981 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Mar. 13, 2020. |
U.S. Appl. No. 16/208,217, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, filed Dec. 3, 2018. |
U.S. Appl. No. 16/824,460, titled “Semiconductor Device Performing Row Hammer Refresh Operation”, dated Mar. 19, 2020. |
International Search Report & Written Opinion dated Aug. 28, 2020 for PCT Application No. PCT/US2020/032931. |
International Search Report and Written Opinion for PCT/US2020/026689 dated Jul. 22, 2020. |
U.S. Appl. No. 17/008,396 titled “Apparatuses and Methods for Staggered Timing of Targeted Refresh Operations” filed Aug. 31, 2020. |
IPRP dated Dec. 3, 2020 for PCT Application No. PCT/CN2018/088203. |
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/997,766 titled “Refresh Logic Circuit Layouts Thereof” filed Aug. 19, 2020. |
U.S. Appl. No. 17/095,978 titled “Apparatuses and Methods for Controlled Refresh Timing” filed Nov. 12, 2020. |
U.S. Appl. No. 17/175,485 titled “Apparatuses and Methods for Distributed Targeted Refresh Operations” filed Feb. 12, 2021. |
U.S. Appl. No. 17/303,018, titled “Apparatuses and Methods for Controlling Refresh Operations”, filed Sep. 23, 2020, pp. all. |
U.S. Appl. No. 17/324,621 titled “Apparatuses And Methods for Pure-Time, Self-Adopt Sampling For Row Hammer Refresh Sampling” filed May 19, 2021. |
U.S. Appl. No. 16/994,338 titled “Apparatuses, Systems, and Methods for Memory Directed Access Pause” filed Aug. 14. 2020. |
U.S. Appl. No. 16/997,659 titled “Apparatuses, Systems, and Methods for Refresh Modes” filed Aug. 19, 2020. |
U.S. Appl. No. 17/127,654 titled “Apparatuses and Methods for Row Hammer Based Cache Lockdown” filed Dec. 18, 2020. |
U.S. Appl. No. 17/347,957 titled “Apparatuses and Methods for Controlling Steal Rates” filed Jun. 15, 2021. |
“IPRP for PCT/US2020/026689, mailed Sep. 28, 2021”. |
U.S. Appl. No. 17/731,529, titled “Apparatuses and Methods for Access Based Refresh Dperations”; filed Apr. 28, 2022; pp. all pages of the application as filed. |
U.S. Appl. No. 17/731,645, titled “Apparatuses and Methods for Access Based Targeted Refresh Operations”, filed Apr. 28, 2022; pp. all pages of application as filed. |
Number | Date | Country | |
---|---|---|---|
20200273517 A1 | Aug 2020 | US |