# US 2004/0083334 A1 · Method and apparatus for managing the integrity of data in non-volatile memory system

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

- Number: US 2004/0083334 A1
- Document ID: US20040083334A1
- Status: Published application
- Kind: A1
- Application number: 10/679,000
- Filed: 2003-10-02
- Published: 2004-04-29
- Earliest claimed: 2002-10-28
- Assignees: SanDisk Corporation
- Inventors: Robert C. Chang; Bahman Qawami; Farshid Sabet-Sharghi
- Web page: https://patentgrep.com/patent/US20040083334A1

## CPC

- G06F 11/1008: {in individual solid state devices (G06F11/1004 takes precedence)}
- G06F 11/1068: {in sector programmable memories, e.g. flash disk (G06F11/1072 takes precedence)}
- G06F 2211/109: Sector level checksum or ECC, i.e. sector or stripe level checksum or ECC in addition to the RAID parity calculation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods and apparatus for encoding data associated with a page by dividing the page into segments and separately encoding the segments using extended error correction code (ECC) calculations are disclosed. According to one aspect of the present invention, a method for encoding data associated with a page which has a data area and an overhead area within a non-volatile memory of a memory system includes dividing at least a part of the page into at least two segments of the data, the at least two segments of the data including a first segment and a second segment, and performing ECC calculations on the first segment to encode the first segment. The method also includes performing the ECC calculations on the second segment to encode the second segment substantially separately from the first segment.

## Claims

### Claim 1

A method for encoding data associated with a page within a non-volatile memory of a memory system, the page having a data area and an overhead area, the method comprising:
dividing at least a part of the page into at least two segments of the data, the at least two segments of the data including a first segment and a second segment;
performing error correction code (ECC) calculations on the first segment to encode the first segment; and
performing the ECC calculations on the second segment to encode the second segment, wherein the second segment is encoded substantially separately from the first segment.

### Claim 2 (depends on 1)

The method of claim 1 wherein the first segment includes the data area and the second segment includes the overhead area.

### Claim 3 (depends on 1)

The method of claim 1 wherein the first segment includes a first section of the data area and the second segment includes a second section of the data area.

### Claim 4 (depends on 1)

The method of claim 1 wherein the ECC calculations are associated with an ECC algorithm that is arranged to detect up to two incorrect bits and to correct up to one of the incorrect bits in each of the first segment and the second segment.

### Claim 5 (depends on 4)

The method of claim 4 wherein the ECC algorithm is a Hamming Code ECC algorithm.

### Claim 6 (depends on 1)

The method of claim 1 wherein dividing the at least part of the page into the at least two segments of the data includes:
dividing the page into three segments, the three segments including the first segment, the second segment, and a third segment.

### Claim 7 (depends on 6)

The method of claim 6 further including:
performing the ECC calculations on the third segment to encode the third segment, wherein the third segment is encoded substantially separately from the first segment and the second segment.

### Claim 8 (depends on 6)

The method of claim 6 wherein the first segment includes a first section of the data area, the second segment includes a second section of the data area, and the third segment includes the overhead area.

### Claim 9 (depends on 6)

The method of claim 6 wherein the first segment includes a first section of the data area, the second segment includes a second section of the data area, and the third segment includes a third section of the data area.

### Claim 10 (depends on 1)

The method of claim 1 wherein the non-volatile memory is one of a NAND flash memory and an MLC NAND flash memory.

### Claim 11

A memory system comprising:
a non-volatile memory, the non-volatile memory including a page, the page having a data area and an overhead area, the data area and the overhead area being arranged to contain bits of data;
code devices for dividing at least a part of the page into at least two segments, the at least two segments including a first segment and a second segment;
code devices for performing error correction code (ECC) calculations on the first segment to encode the first segment and on the second segment to encode the second segment, wherein the second segment is encoded substantially separately from the first segment; and
a memory area for storing the code devices.

### Claim 12 (depends on 11)

The memory system of claim 11 further including:
a controller, the controller being arranged to process the code devices.

### Claim 13 (depends on 11)

The memory system of claim 11 wherein the first segment includes the data area and the second segment includes the overhead area.

### Claim 14 (depends on 11)

The memory system of claim 11 wherein the first segment includes a first section of the data area and the second segment includes a second section of the data area.

### Claim 15 (depends on 1)

The memory system of claim 1 wherein the ECC calculations are associated with an ECC algorithm that is arranged to detect up to two incorrect bits and to correct up to one of the incorrect bits in each of the first segment and the second segment.

### Claim 16 (depends on 15)

The memory system of claim 15 wherein the ECC algorithm is a Hamming Code ECC algorithm.

### Claim 17 (depends on 11)

The memory system of claim 11 wherein the code devices for dividing the at least part of the page into the at least two segments include:
code devices for dividing the page into three segments, the three segments including the first segment, the second segment, and a third segment.

### Claim 18 (depends on 17)

The memory system of claim 17 further including:
code devices for performing the ECC calculations on the third segment to encode the third segment, wherein the third segment is encoded substantially separately from the first segment and the second segment.

### Claim 19 (depends on 17)

The memory system of claim 17 wherein the first segment includes a first section of the data area, the second segment includes a second section of the data area, and the third segment includes the overhead area.

### Claim 20 (depends on 17)

The memory system of claim 17 wherein the first segment includes a first section of the data area, the second segment includes a second section of the data area, and the third segment includes a third section of the data area.

### Claim 21 (depends on 11)

The memory system of claim 11 wherein the non-volatile memory is one of a NAND flash memory and an MLC NAND flash memory.

### Claim 22 (depends on 11)

The memory system of claim 11 wherein the code devices are one of software code devices and firmware code devices.

### Claim 23

A memory system comprising:
a non-volatile memory, the non-volatile memory including a page, the page having a data area and an overhead area, the data area and the overhead area being arranged to contain bits of data;
means that divide at least a part of the page into at least two segments, the at least two segments including a first segment and a second segment; and
means that perform error correction code (ECC) calculations on the first segment to encode the first segment and on the second segment to encode the second segment, wherein the second segment is encoded substantially separately from the first segment.

### Claim 24 (depends on 23)

The memory system of claim 23 wherein the first segment includes the data area and the second segment includes the overhead area.

### Claim 25 (depends on 23)

The memory system of claim 23 wherein the first segment includes a first section of the data area and the second segment includes a second section of the data area.

### Claim 26 (depends on 1)

The memory system of claim 1 wherein the ECC calculations are associated with a Hamming Code ECC algorithm that is arranged to correct up to one incorrect bit included in the first segment and up to one incorrect bit included in the second segment.

### Claim 27 (depends on 23)

The memory system of claim 23 wherein the means that divide the at least part of the page into the at least two segments include:
means that divide the page into three segments, the three segments including the first segment, the second segment, and a third segment.

### Claim 28 (depends on 27)

The memory system of claim 27 further including:
means that perform the ECC calculations on the third segment to encode the third segment, wherein the third segment is encoded substantially separately from the first segment and the second segment.

### Claim 29 (depends on 27)

The memory system of claim 27 wherein the first segment includes a first section of the data area, the second segment includes a second section of the data area, and the third segment includes the overhead area.

### Claim 30 (depends on 27)

The memory system of claim 27 wherein the first segment includes a first section of the data area, the second segment includes a second section of the data area, and the third segment includes a third section of the data area.

### Claim 31 (depends on 23)

The memory system of claim 23 wherein the non-volatile memory is one of a NAND flash memory and an MLC NAND flash memory.
