# US 2021/0175901 A1 · Hybrid ldpc decoder with mixed precision components

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

- Number: US 2021/0175901 A1
- Document ID: US20210175901A1
- Status: Published application
- Kind: A1
- Application number: 17/183,223
- Filed: 2021-02-23
- Published: 2021-06-10
- Earliest claimed: 2021-02-23
- Assignees: Intel Corporation
- Applicants: Intel Corporation
- Inventors: Debarnab Mitra; Santhosh K. Vanaparthy
- Web page: https://patentgrep.com/patent/US20210175901A1

## CPC

- H03M 13/1111: {Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms}
- H03M 13/1171: {Parity-check or generator matrices with non-binary elements, e.g. for non-binary LDPC codes}
- G06F 11/1068: {in sector programmable memories, e.g. flash disk (G06F11/1072 takes precedence)}
- H03M 13/1128: {Judging correct decoding and iterative stopping criteria other than syndrome check and upper limit for decoding iterations}
- H03M 13/6577: {Representation or format of variables, register sizes or word-lengths and quantization}
- 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

An embodiment of an electronic apparatus may comprise one or more substrates, and a decoder coupled to the one or more substrates, the decoder including logic to perform a first decode stage with a first fixed quantization width, and perform a second decode stage with a second fixed quantization width that is different from the first fixed quantization width. Other embodiments are disclosed and claimed.

## Claims

### Claim 1

An electronic apparatus, comprising:
one or more substrates; and
a decoder coupled to the one or more substrates, the decoder including logic to:
perform a first decode stage with a first fixed quantization width, and
perform a second decode stage with a second fixed quantization width that is different from the first fixed quantization width.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein the first decode stage corresponds to a sum-stage of the decoder, the second decode stage corresponds to a min-stage in a delta domain of the decoder, and the first fixed quantization width is greater than the second fixed quantization width.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the logic is further to:
iteratively pass messages back and forth between check nodes and variable nodes, wherein a first number of bits allocated to messages sent from a variable node to a check node is greater than a second number of bits allocated to messages sent from a check node to a variable node.

### Claim 4 (depends on 3)

The apparatus of claim 3, wherein the logic is further to:
pad messages sent from the check nodes to the variable nodes to fit the first number of bits.

### Claim 5 (depends on 4)

The apparatus of claim 4, wherein the logic is further to:
perform a left shift to pad the messages sent from the check node to the variable node and preserve the most significant bits of the messages.

### Claim 6 (depends on 3)

The apparatus of claim 3, wherein the logic is further to:
truncate messages sent from the variable nodes to the check nodes to fit the second number of bits.

### Claim 7 (depends on 6)

The apparatus of claim 6, wherein the logic is further to:
perform a right shift to truncate the messages sent from the variable nodes to the check nodes and preserve the most significant bits of the message.

### Claim 8

An electronic system, comprising:
a controller;
memory; and
a decoder communicatively coupled to the controller and the memory, the decoder including logic to:
perform a first decode stage with a first fixed quantization width, and
perform a second decode stage with a second fixed quantization width that is different from the first fixed quantization width.

### Claim 9 (depends on 8)

The system of claim 8, wherein the first decode stage corresponds to a sum-stage of the decoder, the second decode stage corresponds to a min-stage in a delta domain of the decoder, and the first fixed quantization width is greater than the second fixed quantization width.

### Claim 10 (depends on 8)

The system of claim 8, wherein the logic is further to:
iteratively pass messages back and forth between check nodes and variable nodes, wherein a first number of bits allocated to messages sent from a variable node to a check node is greater than a second number of bits allocated to messages sent from a check node to a variable node.

### Claim 11 (depends on 10)

The system of claim 10, wherein the logic is further to:
pad messages sent from the check nodes to the variable nodes to fit the first number of bits.

### Claim 12 (depends on 11)

The system of claim 11, wherein the logic is further to:
perform a left shift to pad the messages sent from the check node to the variable node and preserve the most significant bits of the messages.

### Claim 13 (depends on 10)

The system of claim 10, wherein the logic is further to:
truncate messages sent from the variable nodes to the check nodes to fit the second number of bits.

### Claim 14 (depends on 13)

The system of claim 13, wherein the logic is further to:
perform a right shift to truncate the messages sent from the variable nodes to the check nodes and preserve the most significant bits of the message.

### Claim 15

A method of decoding parity information, comprising:
performing a first decode stage of a decoder with a first fixed quantization width; and
performing a second decode stage of the decoder with a second fixed quantization width that is different from the first fixed quantization width.

### Claim 16 (depends on 15)

The method of claim 15, wherein the first decode stage corresponds to a sum-stage of the decoder, the second decode stage corresponds to a min-stage in a delta domain of the decoder, and the first fixed quantization width is greater than the second fixed quantization width.

### Claim 17 (depends on 15)

The method of claim 15, further comprising:
iteratively passing messages back and forth between check nodes and variable nodes, wherein a first number of bits allocated to messages sent from a variable node to a check node is greater than a second number of bits allocated to messages sent from a check node to a variable node.

### Claim 18 (depends on 17)

The method of claim 17, further comprising:
padding messages sent from the check nodes to the variable nodes to fit the first number of bits.

### Claim 19 (depends on 18)

The method of claim 18, further comprising:
performing a left shift to pad the messages sent from the check node to the variable node and preserve the most significant bits of the messages.

### Claim 20 (depends on 17)

The method of claim 17, further comprising:
truncating messages sent from the variable nodes to the check nodes to fit the second number of bits.
