# US 2015/0149872 A1 · Data encoding in solid-state storage apparatus

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

- Number: US 2015/0149872 A1
- Document ID: US20150149872A1
- Status: Published application
- Kind: A1
- Application number: 14/496,416
- Filed: 2014-09-25
- Published: 2015-05-28
- Earliest claimed: 2013-11-28
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Thomas Mittelholzer; Nikolaos Papandreou; Charalampos Pozidis
- Web page: https://patentgrep.com/patent/US20150149872A1

## CPC

- G06F 11/1068: {in sector programmable memories, e.g. flash disk (G06F11/1072 takes precedence)}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/064: {Management of blocks}
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- G11C 29/52: Protection of memory contents; Detection of errors in memory contents
- G11C 29/70: {Masking faults in memories by using spares or by reconfiguring}
- H03M 13/13: Linear codes
- H03M 13/63: {Joint error correction and other techniques (H03M13/31 and H03M13/33 take precedence)}
- H03M 13/152: {Bose-Chaudhuri-Hocquenghem [BCH] codes}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G11C: STATIC STORES (semiconductor memory devices H10B)
- 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)

## Abstract

A method for encoding an input data block for storage in q-level cells of solid-state memory includes producing a preliminary block from the input data block by modulation encoding at least part of the input block into a first group of qary symbols via a first drift-tolerant encoding scheme, the preliminary block comprising the first group of qary symbols and any remainder of the input block not encoded via the first encoding scheme; generating parity data for the preliminary block via an error-correction encoding scheme; modulation encoding the parity data and any remainder of the input block into a second group of qary symbols via a second drift-tolerant encoding scheme; and supplying the qary symbols of the first and second groups for storage in respective q-level memory cells.

## Claims

### Claim 1

A method for encoding an input data block for storage in q-level cells of solid-state memory, the method comprising:
producing a preliminary block from the input data block by modulation encoding at least part of the input block into a first group of qary symbols via a first drift-tolerant encoding scheme, the preliminary block comprising the first group of qary symbols and any remainder of the input block not encoded via the first encoding scheme;
generating parity data for the preliminary block via an error-correction encoding scheme;
modulation encoding the parity data and any remainder of the input block into a second group of qary symbols via a second drift-tolerant encoding scheme; and
supplying the qary symbols of the first and second groups for storage in respective q-level memory cells.

### Claim 2 (depends on 1)

The method of claim 1, wherein each of the first and second drift-tolerant encoding schemes comprises a permutation-based encoding scheme.

### Claim 3 (depends on 1)

The method of claim 1, wherein the first drift-tolerant encoding scheme uses at least one drift-tolerant modulation code having a length of at least about 28 qary symbols.

### Claim 4 (depends on 2)

The method of claim 2, wherein the first drift-tolerant encoding scheme uses a single permutation modulation code.

### Claim 5 (depends on 1)

The method of claim 1, wherein the second drift-tolerant encoding scheme uses at least one drift-tolerant modulation code having a dimensionless rate of at least about 0.9.

### Claim 6 (depends on 1)

The method of claim 1, wherein the second drift-tolerant encoding scheme is adapted to inhibit error propagation on decoding.

### Claim 7 (depends on 6)

The method of claim 6, wherein the second drift-tolerant encoding scheme uses at least one single-parity-check code.

### Claim 8 (depends on 1)

The method of claim 1, wherein the error-correction encoding scheme uses at least one BCH code.

### Claim 9 (depends on 1)

The method of claim 1, wherein q>2.

### Claim 10

A method for recording an input data block in q-level cells of solid-state memory, the method comprising:
encoding the input block by producing a preliminary block from the input data block by modulation encoding at least part of the input block into a first group of qary symbols via a first drift-tolerant encoding scheme, the preliminary block comprising the first group of qary symbols and any remainder of the input block not encoded via the first encoding scheme, generating parity data for the preliminary block via an error-correction encoding scheme, modulation encoding the parity data and any remainder of the input block into a second group of qary symbols via a second drift-tolerant encoding scheme, and supplying the qary symbols of the first and second groups for storage in respective q-level memory cells; and
storing the qary symbols of the first and second groups in respective q-level memory cells.

### Claim 11 (depends on 10)

The method of claim 10, further comprising storing the symbols of the first and second groups in respective cells of a single solid-state memory array.

### Claim 12 (depends on 10)

The method of claim 10, further comprising:
recording the input data block in q-level cells of p parallel solid-state memory arrays, wherein the p parallel memory arrays have respective associated first encoders, for collectively implementing the first drift-tolerant encoding scheme, and respective associated second encoders, for collectively implementing the second drift-tolerant encoding scheme;
partitioning the at least part of the input data block into p first portions;
modulation encoding each first portion in a respective first encoder to produce a first set of qary symbols, whereby the p first sets of qary symbols collectively form the first group of qary symbols;
partitioning the parity data and any remainder of the input block into p second portions;
modulation encoding each second portion in a respective second encoder to produce a second set of qary symbols, whereby the p second sets of qary symbols collectively form the second group of qary symbols; and
storing the first and second sets of qary symbols output by the first and second encoders associated with each the memory array in q-level cells of that memory array.

### Claim 13 (depends on 10)

The method of claim 10, further comprising:
reading the memory cells storing the input block to obtain read signal components corresponding to respective qary symbols of the first and second groups;
processing the read signal components for the first group of qary symbols in dependence on the first drift-tolerant encoding scheme to obtain statistical data for the distribution of the read signal components corresponding to each of the q memory cell levels;
detecting at least one codeword of the first drift-tolerant encoding scheme corresponding to the read signal components for the first group of qary symbols;
using the statistical data to decode, in dependence on the second drift-tolerant encoding scheme, the parity data and any remainder of the input block from the read signal components for the second group of qary symbols;
decoding, in dependence on the error-correction encoding scheme, the preliminary block from the at least one codeword of the first drift-tolerant encoding scheme, the parity data and any remainder of the input block; and
decoding the input data block from the preliminary block in dependence on the first drift-tolerant encoding scheme.

### Claim 14 (depends on 13)

The method of claim 13, wherein the first and second encoding schemes are adapted such that the level error rate of the second scheme in the recording and reproducing method is within an order of magnitude of that of the first scheme.

### Claim 15

An encoder apparatus for encoding an input data block for storage in q-level cells of solid-state memory, comprising:
a first drift-tolerant encoding stage for modulation encoding at least part of the input block into a first group of qary symbols via a first drift-tolerant encoding scheme;
an error-correction encoder arranged for receiving a preliminary block, which comprises the first group of qary symbols and any remainder of the input block not encoded by the first encoding stage, and adapted to generate parity data for the preliminary block in accordance with an error-correction encoding scheme; and
a second drift-tolerant encoding stage for modulation encoding the parity data and any remainder of the input block into a second group of qary symbols via a second drift-tolerant encoding scheme;
the apparatus being adapted to supply, in use, the qary symbols of the first and second groups for storage in respective q-level memory cells.

### Claim 16 (depends on 1)

The apparatus of claim 1, wherein each of the first and second drift-tolerant encoding schemes comprises a permutation-based encoding scheme.

### Claim 17 (depends on 15)

The apparatus of claim 15, wherein the first drift-tolerant encoding scheme uses at least one drift-tolerant modulation code having a length of at least about 28 qary symbols.

### Claim 18 (depends on 17)

The apparatus of claim 17, wherein the first drift-tolerant encoding scheme uses a single permutation modulation code.

### Claim 19 (depends on 15)

The apparatus of claim 15, wherein the second drift-tolerant encoding scheme uses at least one drift-tolerant modulation code having a dimensionless rate of at least about 0.9.

### Claim 20 (depends on 15)

The apparatus of claim 15, wherein q>2.
