# US 2012/0254693 A1 · Encoding a data word for writing the encoded data word in a multi-level solid state memory

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

- Number: US 2012/0254693 A1
- Document ID: US20120254693A1
- Status: Published application
- Kind: A1
- Application number: 13/418,423
- Filed: 2012-03-13
- Published: 2012-10-04
- Earliest claimed: 2011-03-31
- Assignees: International Business Machines Corporation
- Inventors: Thomas Mittelholzer; Nikolaos Papandreou; Charalampos Pozidis
- Web page: https://patentgrep.com/patent/US20120254693A1

## CPC

- H03M 13/251: {with block coding}
- G11C 11/5678: {using amorphous/crystalline phase transition storage elements}
- H03M 13/253: {with concatenated codes}
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/31: combining coding for error detection or correction and efficient use of the spectrum (without error detection or correction H03M5/14 {, H03M5/145})
- H03M 13/353: {Adaptation to the channel}
- G06F 11/1072: {in multilevel memories}
- G11C 29/00: Checking stores for correct operation {; Subsequent repair}; Testing stores during standby or offline operation
- G11C 29/70: {Masking faults in memories by using spares or by reconfiguring}
- G11C 2211/5641: Multilevel memory having cells with different number of storage levels
- H03M 13/1515: {Reed-Solomon codes}
- H03M 13/19: Single error correction without using particular properties of the cyclic codes, e.g. Hamming codes, extended or generalised Hamming codes
- 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)
- G11C: STATIC STORES (semiconductor memory devices H10B)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for encoding a data word for writing an encoded data word in N cells of a solid state memory. Each of the N cells can be programmed in one of q nominal levels. The method includes encoding the data word as a codeword of a first codeword type having q symbol values or as a codeword of a second codeword type having (q-d) symbol values, d ε [1, . . . , q−1], depending on a state of the N cells.

## Claims

### Claim 1

A method for encoding a data word for writing an encoded data word in N cells of a solid state memory, each of the N cells having q programmable levels, the method comprising:
encoding the data word as a codeword of a first codeword type having q symbol values or as a codeword of a second codeword type having (q-d) symbol values, d ε [1, . . . , q−1], depending on a state of the N cells.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the data word is encoded as the codeword of the first codeword type, if the state of the N cells indicates that all N cells have been correctly written, and as the codeword of the second codeword type, if the state of the N cells indicates that at least one of the N cells has been incorrectly written.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the data word is encoded as the codeword of the first codeword type such that the codeword has N components, wherein each of the N components is mapped to one of the N cells and has one of the q symbol values, each of the q symbol values being mapped to one of the q levels of the mapped cell.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the data word is encoded as the codeword of the second codeword type such that the codeword has N components, wherein each of the N components is mapped to one of the N cells and has one of the (q-d) symbol values, each of the (q-d) symbol values is mapped to one of the (q-d) levels of the mapped cell.

### Claim 5 (depends on 1)

The method according claim 1, further comprising:
encoding the data word as the codeword of the first codeword type, if the N components of the codeword of the first codeword type can be written correctly in the N cells, and otherwise
encoding the data word as the codeword of the second codeword type.

### Claim 6 (depends on 1)

The method according to claim 1, further comprising:
encoding the data word as the codeword of the first codeword type, if each of the symbol values of the N components can be written correctly in the respective mapped level of the respective cell of the N cells, and otherwise
encoding the data word as the codeword of the second codeword type.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the encoding is sequentially executed for a plurality of data words.

### Claim 8 (depends on 1)

The method according to claim 1, wherein each codeword of the second codeword type has a Euclidean distance to each codeword of the first codeword type which is greater or equal to a minimum Euclidean distance between the codewords of the first codeword type.

### Claim 9 (depends on 1)

The method according to claim 1, wherein the data word is encoded as a codeword of the first codeword type by means of a translation-stable code or the data word is encoded as a codeword of the second codeword type by means of the translation-stable code.

### Claim 10 (depends on 9)

The method according to claim 9, wherein the translation-stable code includes a number of initial vectors having N components, each of the N components having one of q symbol values for providing codewords of the first codeword type, and at least one further initial vector having N components, each of the N components having one of (q-d) symbol values for providing codewords of the second codeword type.

### Claim 11 (depends on 1)

The method according to claim 1, wherein the state of the N cells is determined in dependence on a write scheme for writing the encoded data word in the N cells.

### Claim 12

A method for writing a data word as an encoded data word in N cells of a solid state memory by a writing scheme having M iterations, each of the N cells having q programmable levels, the method comprising:
encoding the data word as a codeword of a first codeword type having q symbol values;
supplying a first write signal to the N cells for writing the codeword of the first codeword type in the N cells,
repeating said step of supplying a first write signal to the N cells for writing the codeword of the first codeword type in N cells is repeated at most (M−1) times, until the codeword of the first codeword type is correctly written in the N cells; and
if the codeword of the first codeword type is not correctly written in the N cells:
encoding the data word as a codeword of a second codeword type having (q-d) symbol values, d ε [1, . . . , q−1]; and
supplying a second write signal to the N cells for writing the codeword of the second codeword type in the N cells.

### Claim 13

A method for writing a data word as an encoded data word in N cells of a solid state memory by a writing scheme using a list of partially-defective cells, each of the N cells having q programmable levels, the method comprising:
if none of the N cells is listed in the list of partially-defective cells, encoding the data word as a codeword of a first codeword type having q symbol values and supplying a first write signal to the N cells for writing the codeword of the first codeword type, and
if at least one of the N cells is listed in the list of partially-defective cells, encoding the data word as a codeword of a second codeword type having (q-d) symbol values, d ε [1, . . . , q−1], and supplying a second write signal to the N cells for writing the codeword of the second codeword type.

### Claim 14 (depends on 1)

A method for decoding a codeword written in N cells of a solid state memory, each of the N cells having q programmable levels, said codeword being encoded by the method according to claim 1, the method comprising:
receiving a read back signal from the N cells for reading back the written codeword,
determining if the written codeword is of the second codeword type in dependence on the received read back signal; and
providing side information to an error correcting code in dependence on a determined written codeword of the second codeword type.

### Claim 15

An encoder for encoding a data word for writing an encoded data word in N cells of a solid state memory, each of the N cells having q programmable levels, wherein the encoder is configured to encode the data word as a codeword of a first codeword type having q symbol values or as a codeword of a second codeword type having (q-d) symbol values, d ε [1, . . . , q−1], in dependence on a state of the N cells.

### Claim 16

A decoder for decoding a codeword written in N cells of a solid state memory, each of the N cells having q programmable levels, said codeword being encoded by an encoder, the decoder comprising:
a receiver which is configured to receive a read back signal from the N cells for reading back the written codeword; and
a processor which is configured to determine if the written codeword is of the second codeword type in dependence on the received read back signal and which is configured to provide side information to an error correcting code in dependence on a determined written codeword of the second codeword type.

### Claim 17 (depends on 16)

The decoder according to claim 16, wherein said encoder is for encoding a data word for writing an encoded data word in N cells of a solid state memory, each of the N cells having q programmable levels, wherein the encoder is configured to encode the data word as a codeword of a first codeword type having q symbol values or as a codeword of a second codeword type having (q-d) symbol values, d ε [1, . . . , q−1], in dependence on a state of the N cells.

### Claim 18 (depends on 1)

A computer readable non-transitory storage medium tangibly embodying a computer readable program code having computer readable instructions which, when implemented, cause a computer to carry out the steps of the method according to claim 1.

### Claim 19 (depends on 12)

A computer readable non-transitory storage medium tangibly embodying a computer readable program code having computer readable instructions which, when implemented, cause a computer to carry out the steps of the method according to claim 12.

### Claim 20 (depends on 13)

A computer readable non-transitory storage medium tangibly embodying a computer readable program code having computer readable instructions which, when implemented, cause a computer to carry out the steps of the method according to claim 13.
