# US 2019/0379399 A1 · Log-likelihood-ratio (llr) generation algorithm for low-density-parity-check (ldpc) codes used in flash memory

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

- Number: US 2019/0379399 A1
- Document ID: US20190379399A1
- Status: Published application
- Kind: A1
- Application number: 16/004,273
- Filed: 2018-06-08
- Published: 2019-12-12
- Earliest claimed: 2018-06-08
- Assignees: Goke US Research Laboratory
- Applicants: Goke US Research Laboratory
- Inventors: Chandra Varanasi
- Web page: https://patentgrep.com/patent/US20190379399A1

## CPC

- H03M 13/1111: {Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms}
- H03M 13/1125: {using different domains for check node and bit node processing, wherein the different domains include probabilities, likelihood ratios, likelihood differences, log-likelihood ratios or log-likelihood difference pairs}
- G06F 11/1012: {using codes or arrangements adapted for a specific type of error (G06F11/1048 takes precedence)}
- G06F 11/1068: {in sector programmable memories, e.g. flash disk (G06F11/1072 takes precedence)}
- G11C 29/52: Protection of memory contents; Detection of errors in memory contents
- H03M 13/1108: {Hard decision decoding, e.g. bit flipping, modified or weighted bit flipping}
- H03M 13/1148: {Structural properties of the code parity-check or generator matrix}
- H03M 13/6325: {Error control coding in combination with demodulation}
- G11C 2029/0411: {Online error correction}
- 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)
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

Apparatuses and methods suitably configured to utilize at least one algorithm for generating log-likelihood-ratio (LLR) values for low-density-parity-check (LDPC) codes used in flash memory-based systems. Additionally, at least one algorithm sets soft-read thresholds in the memory in such a way as to maximize the mutual information (MI) of the channel created by those thresholds for preventing errors.

## Claims

### Claim 1

A system for generating log-likelihood-ratio (LLR) values for low-density-parity-check (LDPC) codes stored on a memory, comprising;
a low-density-parity-check (LDPC) encoder communicatively coupled to the memory, the memory having a plurality of cells each configured to store at least one data bit;
a LDPC decoder communicatively coupled to the memory;
a controller having control circuitry communicatively coupled to the LDPC decoder, the controller configured to:
generate binary data in the plurality of the cells;
write the binary data in the plurality of cells;
determine hard-decisions based on a predefined hard-read voltage threshold for each of the plurality of cells;
generate soft-read threshold settings;
determine probabilities corresponding to each soft-read threshold setting;
determine mutual information (MI) for the set of probabilities generated by the soft-read threshold settings;
determine the soft-read thresholds that resulted in maximum mutual information (MI); and
generate log-likelihood-ratio (LLR) values for the LDPC for the set of soft-read thresholds that maximized the mutual information (MI).

### Claim 2 (depends on 1)

The system according to claim 1, wherein the mutual information (MI) is determined by the following first equation:
I

(
X
;
Y
)
=
H

(
Y
)
-
H

(
Y
|
X
)
H

(
Y
)
=
-
∑
i
=
1
n

Pr

(
Y
=
y
i
)

log
2

(
Pr

(
Y
=
y
i
)
)
H

(
Y
|
X
)
=
∑
i
=
1
m

Pr

(
X
=
x
i
)

H

(
Y
|
X
=
x
i
)
where X is the input bit, Y is the output sense voltage, H is the entropy of the random variable, and Pr is a probability that ‘Y’ is ‘1’ or ‘0’

### Claim 3 (depends on 1)

The system according to claim 1, wherein the log-likelihood-ratio (LLR) values are determined by the following second equation:
P

(
Y
=
Bin


1
)
=
Total


Bin


1
Total


Y


Counts
P

(
Y
=
Bin


2
)
=
Total


Bin


2
Total


Y


Counts
P

(
Y
=
Bin


3
)
=
Total


Bin


3
Total


Y


Counts
P

(
Y
=
BinN
)
=
Total


BinN
Total


Y


Counts
P

(
X
=
0
)
=
Counts


of


X
=
0
Counts


of


X
=
0
+
Counts


of


X
=
1
P

(
X
=
1
)
=
Counts


of


X
=
1
Counts


of


X
=
0
+
Counts


of


X
=
1
where Y takes a value from the set Y={bin 1, bin2, bin3, . . . , bin N} where N is the number of distinct bins, which in turn, equal (number of reads+1).

### Claim 4 (depends on 1)

The system according to claim 1, wherein the generated binary data in the plurality of the cells is generated for at least one block.

### Claim 5 (depends on 1)

The system according to claim 1, wherein the binary data is written in the plurality of cells at a desired Bit Error Rate (BER).

### Claim 6 (depends on 2)

The system according to claim 2, wherein the first equation maximizes the mutual information (MI) of the communication channel created by the soft-read thresholds in the memory such that the code rate of the LDPC is below the maximum MI of said communication channel for preventing errors.

### Claim 7 (depends on 1)

The system according to claim 1, wherein the memory is flash memory.

### Claim 8

An apparatus comprising;
a memory device having a plurality of cells each configured to store at least one bit;
a LDPC encoder communicatively coupled to the memory device;
a LDPC decoder communicatively coupled to the memory device;
a controller having control circuitry communicatively coupled to a LDPC decoder, the controller configured to:
generate binary data in the plurality of the cells;
write the binary data in the plurality of cells;
generate soft-read threshold settings;
determine probabilities corresponding to each soft-read threshold setting;
determine mutual information (MI) for the set of probabilities generated by the soft-read threshold settings;
determine the soft-read thresholds that resulted in maximum mutual information (MI); and
generate log-likelihood-ratio (LLR) values for the LDPC for the set of soft-read thresholds that maximized the mutual information (MI).

### Claim 9 (depends on 8)

The apparatus according to claim 8, wherein the controller is further configured to:
determine hard-decisions based on a predefined hard-read voltage threshold for the plurality of cells.

### Claim 10 (depends on 9)

The apparatus according to claim 9, wherein the mutual information (MI) is determined by the following first equation:
I

(
X
;
Y
)
=
H

(
Y
)
-
H

(
Y
|
X
)
H

(
Y
)
=
-
∑
i
=
1
n

Pr

(
Y
=
y
i
)

log
2

(
Pr

(
Y
=
y
i
)
)
H

(
Y
|
X
)
=
∑
i
=
1
m

Pr

(
X
=
x
i
)

H

(
Y
|
X
=
x
i
)
where X is the input bit, Y is the output sense voltage, H is the entropy of the random variable, and Pr is a probability that ‘Y’ is ‘1’ or ‘0’

### Claim 11 (depends on 9)

The apparatus according to claim 9, wherein the log-likelihood-ratio (LLR) values are determined by the following second equation:
P

(
Y
=
Bin


1
)
=
Total


Bin


1
Total


Y


Counts
P

(
Y
=
Bin


2
)
=
Total


Bin


2
Total


Y


Counts
P

(
Y
=
Bin


3
)
=
Total


Bin


3
Total


Y


Counts
P

(
Y
=
BinN
)
=
Total


BinN
Total


Y


Counts
P

(
X
=
0
)
=
Counts


of


X
=
0
Counts


of


X
=
0
+
Counts


of


X
=
1
P

(
X
=
1
)
=
Counts


of


X
=
1
Counts


of


X
=
0
+
Counts


of


X
=
1
where Y takes a value from the set Y={bin 1, bin2, bin3, . . . , bin N} where N is the number of distinct bins, which in turn, equal (number of reads+1).

### Claim 12 (depends on 8)

The apparatus according to claim 8, wherein the generated binary data in the plurality of the cells is generated for at least one block, and wherein the binary data is written in the plurality of cells at a desired Bit Error Rate (BER).

### Claim 13 (depends on 10)

The apparatus according to claim 10, wherein the first equation maximizes the mutual information (MI) of the communication channel created by the soft-read thresholds in the memory such that the code rate of the LDPC is below the maximum MI of said communication channel for preventing errors.

### Claim 14 (depends on 8)

The apparatus according to claim 8, wherein the memory is flash memory.

### Claim 15

A method for generating log-likelihood-ratio (LLR) values for low-density-parity-check (LDPC) codes stored in memory, the method comprising the steps of:
generating binary data in a plurality of cells stored in the memory;
writing the binary data in the plurality of cells;
determining hard-decisions based on a predefined hard-read voltage threshold for each of the plurality of cells;
generating soft-read threshold settings;
determining probabilities corresponding to each soft-read threshold setting;
determining mutual information (MI) for the set of probabilities generated by the soft-read threshold settings;
determining the soft-read thresholds that resulted in maximum mutual (MI) information; and
generating log-likelihood-ratio (LLR) values for the LDPC for the set of soft-read thresholds that maximized the mutual information (MI).

### Claim 16 (depends on 15)

The method according to claim 15, wherein the mutual information (MI) is determined by the following first equation:
I

(
X
;
Y
)
=
H

(
Y
)
-
H

(
Y
|
X
)
H

(
Y
)
=
-
∑
i
=
1
n

Pr

(
Y
=
y
i
)

log
2

(
Pr

(
Y
=
y
i
)
)
H

(
Y
|
X
)
=
∑
i
=
1
m

Pr

(
X
=
x
i
)

H

(
Y
|
X
=
x
i
)
where X is the input bit, Y is the output sense voltage, H is the entropy of the random variable, and Pr is a probability that ‘Y’ is ‘1’ or ‘0’

### Claim 17 (depends on 16)

The method according to claim 16, wherein the log-likelihood-ratio (LLR) values are determined by the following second equation:
P

(
Y
=
Bin


1
)
=
Total


Bin


1
Total


Y


Counts
P

(
Y
=
Bin


2
)
=
Total


Bin


2
Total


Y


Counts
P

(
Y
=
Bin


3
)
=
Total


Bin


3
Total


Y


Counts
P

(
Y
=
BinN
)
=
Total


BinN
Total


Y


Counts
P

(
X
=
0
)
=
Counts


of


X
=
0
Counts


of


X
=
0
+
Counts


of


X
=
1
P

(
X
=
1
)
=
Counts


of


X
=
1
Counts


of


X
=
0
+
Counts


of


X
=
1
where Y takes a value from the set Y={bin 1, bin2, bin3, . . . , bin N} where N is the number of distinct bins, which in turn, equal (number of reads+1).

### Claim 18 (depends on 15)

The method according to claim 15, wherein the generated binary data in the plurality of the cells is generated for at least one block.

### Claim 19 (depends on 15)

The method according to claim 15, wherein the binary data is written in the plurality of cells at a desired Bit Error Rate (BER) and, wherein the memory is flash memory.

### Claim 20 (depends on 16)

The method according to claim 16, wherein the first equation maximizes the mutual information (MI) of the communication channel created by the soft-read thresholds in the memory such that the code rate of the LDPC is below the maximum MI of said communication channel for preventing errors.
