# US 2025/0208992 A1 · Wordline group-based identification of good memory blocks during a programming operation

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

- Number: US 2025/0208992 A1
- Document ID: US20250208992A1
- Status: Published application
- Kind: A1
- Application number: 18/982,336
- Filed: 2024-12-16
- Published: 2025-06-26
- Earliest claimed: 2023-12-20
- Assignees: Micron Technology, Inc.
- Applicants: Micron Technology, Inc.
- Inventors: Zhongguang Xu; Yang Liu; Lei Zhang; Hanping Chen
- Web page: https://patentgrep.com/patent/US20250208992A1

## CPC

- G06F 12/023: {Free address space management}
- G11C 16/08: Address circuits; Decoders; Word-line control circuits
- G11C 16/10: Programming or data input circuits
- G11C 29/4401: {for self repair}
- G11C 29/78: {using programmable devices}
- G11C 29/883: {using a single defective memory device with reduced capacity, e.g. half capacity}
- G06F 12/0215: {with look ahead addressing means}
- G06F 12/0284: {Multiple user address space allocation, e.g. using different base addresses (interprocessor communication G06F15/163)}
- G11C 16/0483: {comprising cells having several storage transistors connected in series}
- G11C 2029/1202: {Word line control}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

A processing device in a memory sub-system receives a request to execute a programming operation to program a target portion of a memory array of a memory device. In response to the request, a target wordline group associated with the target portion of the memory array is identified. Information associated with the target wordline group is identified, where the information identifies a first good portion of the target wordline group and a second bad portion of the target wordline group. The programming operation is caused to be executed to program the first good portion of the target wordline group and skip programming of the second bad portion of the target wordline group.

## Claims

### Claim 1

A memory device comprising:
a memory array; and
control logic, operatively coupled with the memory array, to perform operations comprising:
receiving a request to execute a programming operation to program a target portion of the memory array;
in response to the request, identifying a target wordline group associated with the target portion of the memory array;
identifying information associated with the target wordline group, wherein the information identifies a first good portion of the target wordline group and a second bad portion of the target wordline group; and
causing execution of the programming operation to program the first good portion of the target wordline group and skip programming of the second bad portion of the target wordline group.

### Claim 2 (depends on 1)

The memory device of claim 1, wherein the control logic is to perform further operations comprising performing a look-up operation of a data structure storing the information associated with the target wordline group.

### Claim 3 (depends on 1)

The memory device of claim 1, wherein the information associated with the target wordline group is identified during a power up operation associated with the memory device.

### Claim 4 (depends on 1)

The memory device of claim 1, wherein the target portion of the memory array corresponds to a first memory die and a second memory die of the memory device.

### Claim 5 (depends on 4)

The memory device of claim 4, wherein the first memory die comprises a first set of memory planes and the second memory die comprises a second set of memory planes.

### Claim 6 (depends on 5)

The memory device of claim 5, wherein the information identifying the second bad portion comprises address information corresponding to a block and a plane of the target wordline group.

### Claim 7 (depends on 1)

The memory device of claim 1, wherein the information identifying the second bad portion of the target wordline group is stored in a data structure of the memory device.

### Claim 8

A method comprising:
receiving a request to execute a programming operation to program a target portion of a memory array of a memory device;
in response to the request, identifying a target wordline group associated with the target portion of the memory array;
identifying information associated with the target wordline group, wherein the information identifies a first good portion of the target wordline group and a second bad portion of the target wordline group; and
causing execution of the programming operation to program the first good portion of the target wordline group and skip programming of the second bad portion of the target wordline group.

### Claim 9 (depends on 8)

The method of claim 8, further comprising performing a look-up operation of a data structure storing the information associated with the target wordline group.

### Claim 10 (depends on 8)

The method of claim 8, wherein the information associated with the target wordline group is identified during a power up operation associated with the memory device.

### Claim 11 (depends on 8)

The method of claim 8, wherein the target portion of the memory array corresponds to a first memory die and a second memory die of the memory device.

### Claim 12 (depends on 11)

The method of claim 11, wherein the first memory die comprises a first set of memory planes and the second memory die comprises a second set of memory planes.

### Claim 13 (depends on 12)

The method of claim 12, wherein the information identifying the second bad portion comprises address information corresponding to a block and a plane of the target wordline group.

### Claim 14 (depends on 8)

The method of claim 8, wherein the information identifying the second bad portion of the target wordline group is stored in a data structure of the memory device.

### Claim 15

A non-transitory computer-readable storage medium comprising instructions that, when executed by a processing device, cause the processing device to perform operations comprising:
receiving a request to execute a programming operation to program a target portion of a memory array of a memory device;
in response to the request, identifying a target wordline group associated with the target portion of the memory array;
identifying information associated with the target wordline group, wherein the information identifies a first good portion of the target wordline group and a second bad portion of the target wordline group; and
causing execution of the programming operation to program the first good portion of the target wordline group and skip programming of the second bad portion of the target wordline group.

### Claim 16 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, the operations further comprising performing a look-up operation of a data structure storing the information associated with the target wordline group.

### Claim 17 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the information associated with the target wordline group is identified during a power up operation associated with the memory device.

### Claim 18 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the target portion of the memory array corresponds to a first memory die and a second memory die of the memory device.

### Claim 19 (depends on 18)

The non-transitory computer-readable storage medium of claim 18, wherein the first memory die comprises a first set of memory planes and the second memory die comprises a second set of memory planes, and wherein the information identifying the second bad portion comprises address information corresponding to a block and a plane of the target wordline group.

### Claim 20 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the information identifying the second bad portion of the target wordline group is stored in a data structure of the memory device.
