# US 2025/0095709 A1 · Memory with row hammer mitigation technique

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

- Number: US 2025/0095709 A1
- Document ID: US20250095709A1
- Status: Published application
- Kind: A1
- Application number: 18/970,899
- Filed: 2024-12-06
- Published: 2025-03-20
- Earliest claimed: 2021-11-23
- Assignees: SK hynix Inc.
- Applicants: SK hynix Inc.
- Inventors: Woongrae KIM; Hoiju CHUNG
- Web page: https://patentgrep.com/patent/US20250095709A1

## CPC

- G11C 11/40603: {Arbitration, priority and concurrent access to memory cells for read/write or refresh operations}
- G11C 11/40615: {Internal triggering or timing of refresh, e.g. hidden refresh, self refresh, pseudo-SRAMs}
- G11C 11/40611: {External triggering or timing of internal or partially internal refresh operations, e.g. auto-refresh or CAS-before-RAS triggered refresh}
- G11C 11/40622: {Partial refresh of memory arrays}
- G11C 11/4076: Timing circuits (for regeneration management G11C11/406)
- G11C 11/4078: Safety or protection circuits, e.g. for preventing inadvertent or unauthorised reading or writing; Status cells; Test cells (protection of memory contents during checking or testing G11C29/52)
- G11C 2211/4062: Parity or ECC in refresh operations
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

A memory includes: a memory core; a list storage circuit suitable for storing a weak row list of rows that are vulnerable to a row hammer attack in the memory core; and a row hammer attack detection circuit suitable for selecting rows that are row-hammer-attacked among rows in the memory core as hammered rows, and increasing a probability that the rows stored in the list storage circuit are selected as the hammered rows.

## Claims

### Claim 1

A memory comprising:
a memory core;
a list storage circuit suitable for storing a weak row list of rows that are vulnerable to a row hammer attack in the memory core;
a sampling circuit suitable for sampling and storing a portion of active addresses used for active operations of the memory core and increasing a sampling probability of an active address corresponding to the rows stored in the list storage circuit among the active addresses; and
a selection circuit suitable for selecting one among the sampled addresses stored in the sampling circuit as a hammered row address in a predetermined order whenever a smart refresh operation is performed.

### Claim 2 (depends on 1)

The memory of claim 1, wherein the sampling circuit includes:
a first random pulse generator suitable for generating a first random pulse;
a second random pulse generator suitable for generating a second random pulse that is activated more frequently than the first random pulse; and
a register circuit suitable for sampling and storing the row address when an active signal is activated in an activation period of the first random pulse and a row address does not correspond to one among the rows stored in the list storage circuit, and sampling and storing the row address when the active signal is activated in an activation period of the second random pulse and when the row address corresponds to one among the rows stored in the list storage circuit.

### Claim 3 (depends on 1)

The memory of claim 1, wherein rows positioned adjacent to the hammered row which is selected by the selection circuit are refreshed during a smart refresh operation of the memory.

### Claim 4 (depends on 1)

The memory of claim 1, wherein the sampling circuit includes:
a random pulse generator suitable for generating a random pulse signal; and
a register circuit suitable for sampling and storing a row address which is used for an active operation based on the random pulse signal,
wherein the register circuit samples the row address once whenever the random pulse signal pulses X times, where X is an integer equal to or greater than 1, when the row address corresponds to one among the rows stored in the list storage circuit, and samples the row address once whenever the random pulse signal pulses Y times, where Y>X, and Y is an integer greater than X, when the row address does not correspond to one among the rows stored in the list storage circuit.
