# US 2023/0054732 A1 · Memory system

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

- Number: US 2023/0054732 A1
- Document ID: US20230054732A1
- Status: Published application
- Kind: A1
- Application number: 17/976,085
- Filed: 2022-10-28
- Published: 2023-02-23
- Earliest claimed: 2019-05-24
- Assignees: Kioxia Corporation
- Applicants: KIOXIA Corporation
- Inventors: Yasuyuki IMAIZUMI; Satoshi SHOJI; Mitsunori TADOKORO; Takashi ISHIGURO; Yifan TANG
- Web page: https://patentgrep.com/patent/US20230054732A1

## CPC

- H03M 13/1515: {Reed-Solomon codes}
- H03M 13/2948: {Iterative decoding (H03M13/2957 takes precedence)}
- G06F 11/1012: {using codes or arrangements adapted for a specific type of error (G06F11/1048 takes precedence)}
- G06F 11/1032: {Simple parity}
- G06F 11/1044: {with specific ECC/EDC distribution}
- G06F 11/3037: {where the computing system component is a memory, e.g. virtual memory, cache (accessing, addressing or allocating within memory systems or architectures G06F12/00; checking stores for correct operation G11C29/00)}
- H03M 13/1102: {Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes}
- H03M 13/1108: {Hard decision decoding, e.g. bit flipping, modified or weighted bit flipping}
- H03M 13/1111: {Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms}
- H03M 13/154: {Error and erasure correction, e.g. by using the error and erasure locator or Forney polynomial}
- H03M 13/2909: {Product codes}
- H03M 13/293: {with erasure setting}
- H03M 13/373: {with erasure correction and erasure determination, e.g. for packet loss recovery or setting of erasures for the decoding of Reed-Solomon codes}
- H03M 13/3746: {with iterative decoding}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A memory system includes a non-volatile memory and a controller. The controller is configured to perform iterative correction on a plurality of frames of data read from the non-volatile memory. The iterative correction includes performing a first error correction on each of the frames including a first frame having errors not correctable by the first error correction, generating a syndrome on a set of second frames that include the first frame, performing a second error correction on the second frames using the syndrome, and performing a third error correction on the first frame. Each of the frames includes user data and first parity data used in the first error correction, the first parity data of the first frame also being used in the third error correction.

## Claims

### Claim 1

A memory system comprising:
a non-volatile memory; and
a controller configured to perform iterative correction on a plurality of frames of data read from the non-volatile memory, wherein
the iterative correction includes performing a first error correction on each of the frames including a first frame having errors not correctable by the first error correction, generating a syndrome on a set of second frames that include the first frame, performing a second error correction on the second frames using the syndrome, and performing a third error correction on the first frame, and
each of the frames includes user data and first parity data used in the first error correction, the first parity data of the first frame also being used in the third error correction.
