# US 2026/0029925 A1 · Power-Efficient Monitoring for Usage-Based-Disturbance Mitigation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0029925 A1
- Document ID: US20260029925A1
- Status: Published application
- Kind: A1
- Application number: 18/785,945
- Filed: 2024-07-26
- Published: 2026-01-29
- Earliest claimed: 2024-07-26
- Assignees: Micron Technology, Inc.
- Applicants: Micron Technology, Inc.
- Inventors: Yang Lu
- Web page: https://patentgrep.com/patent/US20260029925A1

## CPC

- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/0673: {Single storage device}
- G11C 11/406: Management or control of the refreshing or charge-regeneration cycles
- G11C 11/4074: Power supply or voltage generation circuits, e.g. bias voltage generators, substrate voltage generators, back-up power, power control circuits
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

Apparatuses and techniques are described implementing power-efficient monitoring for usage-based-disturbance mitigation. In a first aspect, a memory device takes a less strict approach for monitoring worse-case conditions associated with usage-based disturbance. In particular, the memory device conserves power by foregoing updating a list of rows associated with worse-case conditions until an unlisted row has a substantially worse condition than any one of the listed rows. This decreases how often the memory device expends power to update the list. In an optional second aspect, the memory device performs a partial bit-width comparison operation to evaluate the “substantially worse” criterion. The partial bit-width comparison enables a comparator to be implemented with a smaller footprint and operate with less power as compared to a comparator that is capable of performing a full bit-width comparison operation.

## Claims

### Claim 1

A method performed by a memory device, the method comprising:
storing, within a queue of the memory device, information corresponding to a first row of a memory array, the first row having an activation count that meets a condition for mitigating usage-based disturbance;
determining that an activation count of a second row of the memory array is greater than the activation count of the first row by at least a threshold; and
responsive to the determination, updating the queue to store information to the second row instead of the information that corresponds to the first row.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
the storing of the information corresponding to the first row comprises storing the activation count of the first row; and
the determining that the activation count of the second row is greater than the activation count of the first row by at least the threshold comprises determining that the activation count of the second row is greater than a summation of the activation count of the first row and the threshold.

### Claim 3 (depends on 2)

The method of claim 2, wherein a value of the threshold is equal to a power of two.

### Claim 4 (depends on 3)

The method of claim 3, wherein the value of the threshold is greater than or equal to 32.

### Claim 5 (depends on 4)

The method of claim 4, wherein the value of the threshold is greater than or equal to 64.

### Claim 6 (depends on 3)

The method of claim 3, wherein the determining that the activation count of the second row is greater than the activation count of the first row by at least a threshold comprises performing a partial bit-width comparison between the activation count of the first row and the activation count of the second row.

### Claim 7 (depends on 6)

The method of claim 6, wherein the performing of the partial bit-width comparison comprises:
comparing a first set of most-significant bits corresponding to the activation count of the first row to a second set of most-significant bits corresponding to the activation count of the second row, the first set and the second set having a same quantity of bits; and
determining that the second set of most-significant bits is greater than the first set of most-significant bits.

### Claim 8 (depends on 7)

The method of claim 7, wherein:
the activation count of the first row and the activation count of the second row each comprise a first quantity of bits;
the first set of most-significant bits and the second set of most-significant bits each comprise a second quantity of bits; and
a value of the threshold is determined based on a difference between the first quantity of bits and the second quantity of bits.

### Claim 9 (depends on 2)

The method of claim 2, further comprising:
determining that an activation count of a third row of the memory array is not greater than the activation count of the second row by at least the threshold; and
responsive to the determination that the activation count of the third row is not greater than the activation count of the second row by at least the threshold, continue storing, within the queue, the information corresponding to the second row.

### Claim 10 (depends on 9)

The method of claim 9, wherein the determining that the activation count of the third row is not greater than the activation count of the second row by at least the threshold comprises one of the following:
determining that the activation count of the third row is less than a summation of the activation count of the second row and the threshold; or
determining that a third set of most-significant bits corresponding to the activation count of the third row is less than a second set of most-significant bits corresponding to the activation count of the second row.

### Claim 11

A memory device comprising:
a memory array comprising a first row and a second row;
a queue configured to store information corresponding to the first row, the first row having an activation count that meets a condition for mitigating usage-based disturbance; and
a circuit configured to:
determine that an activation count of the second row is greater than the activation count of the first row by at least a threshold; and
responsive to the determination, cause the queue to store information corresponding to the second row instead of the information corresponding to the first row.

### Claim 12 (depends on 11)

The memory device of claim 11, wherein the circuit comprises a comparator configured to determine that the activation count of the second row is greater than a summation of the activation count of the first row and the threshold.

### Claim 13 (depends on 11)

The memory device of claim 11, wherein a value of the threshold is equal to a power of two.

### Claim 14 (depends on 13)

The memory device of claim 13, wherein the circuit comprises a comparator configured to:
compare a first set of most-significant bits corresponding to the activation count of the first row to a second set of most-significant bits corresponding to the activation count of the second row, the first set and the second set having a same quantity of bits; and
determine that the second set of most-significant bits is greater than the first set of most-significant bits.

### Claim 15 (depends on 11)

The memory device of claim 11, wherein:
the memory array comprises a third row; and
the circuit is configured to:
determine that an activation count of the third row is not greater than the activation count of the second row by at least the threshold; and
responsive to the determination that the activation count of the third row is not greater than the activation count of the second row by at least the threshold, cause the queue to continue storing the information corresponding to the second row.

### Claim 16 (depends on 15)

The memory device of claim 15, wherein the circuit is configured to determine that the activation count of the third row is not greater than the activation count of the second row by at least the threshold based on one of the following:
a determination that the activation count of the third row is less than a summation of the activation count of the second row and the threshold; or a determination that a third set of most-significant bits corresponding to the activation count of the third row is less than a second set of most-significant bits corresponding to the activation count of the second row.

### Claim 17

A memory device comprising:
a queue configured to store, within an entry of the queue, an activation count of a first row and an address of the first row, the activation count meeting a condition for mitigating usage-based disturbance; and
a comparator coupled to the queue and configured to:
compare the activation count of the first row with an activation count of an active row; and
responsive to the comparison indicating the activation count of the active row is greater than the activation count of the first row by at least a threshold, cause the queue to update the entry to store the activation count of the active row and an address of the active row; or
responsive to the comparison indicating the activation count of the active row is not greater than the activation count of the first row by at least the threshold, cause the queue to continue storing the activation count and the address of the first row.

### Claim 18 (depends on 17)

The memory device of claim 17, wherein the comparator is configured to determine that the activation count of the active row is greater than a summation of the activation count of the first row and the threshold.

### Claim 19 (depends on 18)

The memory device of claim 18, wherein a value of the threshold is equal to a power of two.

### Claim 20 (depends on 19)

The memory device of claim 19, wherein the comparator is configured to:
compare a first set of most-significant bits corresponding to the activation count of the first row to a second set of most-significant bits corresponding to the activation count of the active row, the first set and the second set having a same quantity of bits; and
determine that the second set of most-significant bits is greater than the first set of most-significant bits.
