# US 2013/0254252 A1 · Variable Node Processing Unit

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

- Number: US 2013/0254252 A1
- Document ID: US20130254252A1
- Status: Published application
- Kind: A1
- Application number: 13/892,589
- Filed: 2013-05-13
- Published: 2013-09-26
- Earliest claimed: 2008-08-04
- Assignees: LSI Corporation
- Applicants: LSI Corporation
- Inventors: Alexander Andreev; Sergey Gribok; Oleg Izyumin
- Web page: https://patentgrep.com/patent/US20130254252A1

## CPC

- G06F 7/575: Basic arithmetic logic units, i.e. devices selectable to perform either addition, subtraction or one of several logical operations, using, at least partially, the same circuitry
- H03M 13/1102: {Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes}
- H03M 13/1111: {Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms}
- H03M 13/1117: {using approximations for check node processing, e.g. an outgoing message is depending on the signs and the minimum over the magnitudes of all incoming messages according to the min-sum rule}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- 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 low-density parity check min-sum decoder including a variable node processing unit having N+1 inputs. A first bank of N+1 two-input adders each have an associated output, and at least one of the N+1 inputs go to more than two of the adders of the first bank. A second bank of N two-input adders has no adders in common with the first bank. At least one of the adders of the first bank provides its associated output to more than one adder of the second bank. The banks of adders are disposed in series. A sign module outputs a sign value produced from one of the inputs and an output from one of the adders of the second bank. N+1 outputs are provided, where one of the outputs is the sign value.

## Claims

### Claim 1

A low-density parity check min-sum decoder including a variable node processing unit comprising:
N+1 inputs,
a first bank of N+1 two-input adders, each having an associated output, at least one of the N+1 inputs going to more than two of the adders of the first bank,
a second bank of N two-input adders, the first bank and the second bank having no adders in common,
at least one of the adders of the first bank providing its associated output to more than one adder of the second bank,
the banks of adders disposed in series,
a sign module for outputting a sign value produced from one of the inputs and an output from one of the adders of the second bank, and
N+1 outputs, where one of the outputs is the sign value.

### Claim 2 (depends on 1)

The decoder of claim 1, wherein at least one of the two-input adders is a signed ripple-carry adder.

### Claim 3 (depends on 1)

The decoder of claim 1, wherein at least one of the two-input adders is a signed ripple-carry adder that includes logic elements and a flip-flop interjected between two adjacent ones of the logic elements.

### Claim 4 (depends on 1)

The decoder of claim 1, wherein each of the two-input adders is a signed ripple-carry adder with logic elements and a flip-flop interjected between two adjacent ones of the logic elements.

### Claim 5

A variable node processing unit comprising:
N+1 inputs,
a first bank of N+1 two-input adders, at least one of the N+1 inputs going to more than two of the adders of the first bank, each having an associated output,
a second bank of N two-input adders, the first bank and the second bank having no adders in common,
at least one of the adders of the first bank providing its associated output to more than one adder of the second bank,
the banks of adders disposed in series,
a sign module for outputting a sign value produced from one of the inputs and an output from one of the adders of the second bank, and
N+1 outputs, where one of the outputs is the sign value.

### Claim 6 (depends on 5)

The variable node processing unit of claim 5, wherein at least one of the two-input adders is a signed ripple-carry adder.

### Claim 7 (depends on 5)

The variable node processing unit of claim 5, wherein at least one of the two-input adders is a signed ripple-carry adder that includes logic elements and a flip-flop interjected between two adjacent ones of the logic elements.

### Claim 8 (depends on 5)

The variable node processing unit of claim 5, wherein each of the two-input adders is a signed ripple-carry adder with logic elements and a flip-flop interjected between two adjacent ones of the logic elements.

### Claim 9

A method for electronically decoding a parity check, the method comprising:
electronically providing N+1 inputs to a first bank of N+1 two-input adders, each having an associated output, at least one of the N+1 inputs going to more than two of the adders of the first bank,
electronically providing the outputs from the first bank to a second bank of N two-input adders that is disposed in series with the first bank,
electronically providing the output from at least one of the adders of the first bank to more than one adder of the second bank,
electronically outputting a sign value produced from one of the inputs and an output from one of the adders of the second bank, and
electronically producing N+1 outputs, where one of the outputs is the sign value.

### Claim 10 (depends on 9)

The method of claim 9, wherein at least one of the two-input adders is a signed ripple-carry adder.

### Claim 11 (depends on 9)

The method of claim 9, wherein at least one of the two-input adders is a signed ripple-carry adder that includes logic elements and a flip-flop interjected between two adjacent ones of the logic elements.

### Claim 12 (depends on 9)

The method of claim 9, wherein each of the two-input adders is a signed ripple-carry adder with logic elements and a flip-flop interjected between two adjacent ones of the logic elements.
