# US 12,190,959 B2 · Erase suspend with configurable forward progress

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

- Number: US 12,190,959 B2
- Document ID: US12190959B2
- Status: Granted
- Kind: B2
- Application number: 17/893,755
- Filed: 2022-08-23
- Published: 2024-02-29
- Granted: 2025-01-07
- Earliest claimed: 2022-08-23
- Assignees: Micron Technology, Inc.
- Applicants: Micron Technology, Inc.
- Inventors: Phil Reusswig
- Web page: https://patentgrep.com/patent/US12190959B2

## CPC

- G11C 16/16: for erasing blocks, e.g. arrays, words, groups
- G11C 16/24: Bit-line control circuits
- G11C 16/26: Sensing or reading circuits; Data output circuits
- G11C 16/3445: {Circuits or methods to verify correct erasure of nonvolatile memory cells}
- G11C 16/349: {Arrangements for evaluating degradation, retention or wearout, e.g. by counting erase cycles}
- G11C 16/0483: {comprising cells having several storage transistors connected in series}
- G11C 16/32: Timing circuits
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

Aspects of the present disclosure configure a memory sub-system processor to manage memory erase operations. The processor accesses a configuration register to identify a quantity of memory slices to erase. The processor divides a set of memory components into a plurality of portions based on the identified quantity of memory slices to erase and performs one or more read operations in association with the memory sub-system between erasure of each of the plurality of portions of the set of memory components.

## Claims

### Claim 1

A system comprising:
a set of memory components of a memory sub-system; and
a processing device operatively coupled to the set of memory components, the processing device being configured to perform operations comprising:
accessing a configuration register to identify a quantity of memory slices to erase;
dividing the set of memory components into a plurality of portions based on the identified quantity of memory slices to erase; and
performing one or more read operations in association with the memory sub-system between erasure of each of the plurality of portions of the set of memory components.

### Claim 2 (depends on 1)

The system of claim 1, wherein the operations comprise:
applying a first erase pulse to a first portion of the plurality of portions;
suspending the erase operation associated with the set of memory components;
performing the one or more read operations; and
after performing the one or more read operations, applying a second erase pulse to a second portion of the plurality of portions.

### Claim 3 (depends on 1)

The system of claim 1, wherein the operations comprise initiating an erase operation to perform in association with the set of memory components, wherein sizes of each of the plurality of portions are equal.

### Claim 4 (depends on 1)

The system of claim 1, wherein the erase operation corresponds to erasing 16 memory slices, each of the plurality of portions corresponding to a subset of the 16 memory slices.

### Claim 5 (depends on 1)

The system of claim 1, wherein the operations comprise:
receiving configuration information from a host specifying the quantity of memory slices; and
storing the configuration information in the configuration register.

### Claim 6 (depends on 1)

The system of claim 1, wherein the processing device and the set of memory components are implemented on a same memory die.

### Claim 7 (depends on 1)

The system of claim 1, wherein the processing device is implemented by firmware of the memory sub-system, and wherein the set of memory components is implemented on a memory die.

### Claim 8 (depends on 1)

The system of claim 1, wherein the operations comprise:
in response to initiating the erase operation, charging a bitline associated with a first portion of the plurality of portions;
after the bitline is charged, applying an erase pulse to the first portion of the plurality of portions;
after the erase pulse is applied, discharging the bitline; and
suspending the erase operation to prevent erasing a second portion of the plurality of portions prior to performing the one or more read operations.

### Claim 9 (depends on 8)

The system of claim 8, wherein the operations comprise:
initializing a forward progress slice counter;
adjusting the forward progress slice counter as each slice of the first portion is being erased by the erase pulse;
comparing a value of the forward progress slice counter to the quantity of memory slices to erase; and
determining whether the value of the forward progress slice counter transgresses the quantity of memory slices to erase.

### Claim 10 (depends on 9)

The system of claim 9, wherein the operations comprise:
in response to determining that the value of the forward progress slice counter transgresses the quantity of memory slices to erase, suspending the erase operation.

### Claim 11 (depends on 9)

The system of claim 9, wherein the operations comprise:
in response to determining that the value of the forward progress slice counter fails to transgress the quantity of memory slices to erase, erasing another slice of the first portion.

### Claim 12 (depends on 1)

The system of claim 1, wherein the operations comprise:
initializing an erase loop counter; and
adjusting the erase loop counter after each of the plurality of portions has been erased.

### Claim 13 (depends on 12)

The system of claim 12, wherein the operations comprise:
in response to determining that a value of the erase loop counter transgresses a threshold quantity representing a maximum quantity of memory slices in a collection of memory slices:
suspending the erase operation; and
performing erase verification of the plurality of portions of the set of memory components.

### Claim 14 (depends on 12)

The system of claim 12, wherein the operations comprise:
in response to determining that a value of the erase loop counter fails to transgress a threshold quantity, erasing additional slices of the memory sub-system.

### Claim 15

A computerized method comprising:
accessing a configuration register to identify a quantity of memory slices to erase;
dividing a set of memory components into a plurality of portions based on the identified quantity of memory slices to erase; and
performing one or more read operations in association with a memory sub-system between erasure of each of the plurality of portions of the set of memory components.

### Claim 16 (depends on 15)

The method of claim 15, further comprising:
applying a first erase pulse to a first portion of the plurality of portions;
suspending the erase operation associated with the set of memory components;
performing the one or more read operations; and
after performing the one or more read operations, applying a second erase pulse to a second portion of the plurality of portions.

### Claim 17 (depends on 15)

The method of claim 15, wherein sizes of each of the plurality of portions are equal.

### Claim 18

A non-transitory computer-readable storage medium comprising instructions that, when executed by a processing device, cause the processing device to perform operations comprising:
accessing a configuration register to identify a quantity of memory slices to erase;
dividing a set of memory components into a plurality of portions based on the identified quantity of memory slices to erase; and
performing one or more read operations in association with a memory sub-system between erasure of each of the plurality of portions of the set of memory components.

### Claim 19 (depends on 18)

The non-transitory computer-readable storage medium of claim 18, further comprising:
applying a first erase pulse to a first portion of the plurality of portions;
suspending the erase operation associated with the set of memory components;
performing the one or more read operations; and
after performing the one or more read operations, applying a second erase pulse to a second portion of the plurality of portions.

### Claim 20 (depends on 18)

The non-transitory computer-readable storage medium of claim 18, wherein sizes of each of the plurality of portions are equal.
