# US 2014/0208180 A1 · Systems and Methods for Reusing a Layered Decoder to Yield a Non-Layered Result

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

- Number: US 2014/0208180 A1
- Document ID: US20140208180A1
- Status: Published application
- Kind: A1
- Application number: 13/746,301
- Filed: 2013-01-21
- Published: 2014-07-24
- Earliest claimed: 2013-01-21
- Assignees: LSI Corporation
- Applicants: Lsi Corporation
- Inventors: Shu Li; Zongwang Li; Shaohua Yang; Fan Zhang; Chung-Li Wang
- Web page: https://patentgrep.com/patent/US20140208180A1

## CPC

- H03M 13/112: {with correction functions for the min-sum rule, e.g. using an offset or a scaling factor}
- H03M 13/1102: {Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes}
- H03M 13/1105: {Decoding}
- H03M 13/1122: {storing only the first and second minimum values per check node}
- H03M 13/1128: {Judging correct decoding and iterative stopping criteria other than syndrome check and upper limit for decoding iterations}
- H03M 13/114: {Shuffled, staggered, layered or turbo decoding schedules}
- H03M 13/2957: {Turbo codes and decoding}
- H03M 13/3707: {Adaptive decoding and hybrid decoding, e.g. decoding methods or techniques providing more than one decoding algorithm for one code}
- H03M 13/3753: {using iteration stopping criteria}
- H03M 13/6331: {Error control coding in combination with equalisation}
- H03M 13/6343: {Error control coding in combination with techniques for partial response channels, e.g. recording}
- H03M 13/658: {Scaling by multiplication or division}
- H03M 13/27: using interleaving techniques
- 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

The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for performing data decoding.

## Claims

### Claim 1

A data processing system, the data processing system comprising:
a data decoder circuit selectably configurable to operate as one of:
a layered data decoder circuit; and
a non-layered data decoder circuit.

### Claim 2 (depends on 1)

The data processing system of claim 1, wherein the layered data decoder circuit is a layered low density parity check decoder circuit, and wherein the non-layered data decoder circuit is a non-layered low density parity check decoder circuit.

### Claim 3 (depends on 1)

The data processing system of claim 1, wherein the data processing system further comprises:
a data detector circuit operable to apply a data detection algorithm to a data input to yield a decoder input, wherein the data decoder circuit applies the selected one of the layered data decoder circuit or the non-layered data decoder circuit to the decoder input to yield a decoded output.

### Claim 4 (depends on 3)

The data processing system of claim 3, wherein the data detector circuit is selected from a group consisting of: a Viterbi algorithm data detector circuit, and a maximum a posteriori data detector circuit.

### Claim 5 (depends on 1)

The data processing system of claim 1, wherein the data processing system is implemented as an integrated circuit.

### Claim 6 (depends on 1)

The data processing system of claim 1, wherein the data processing system is incorporated in a device selected from a group consisting of: a storage device, and a data transmission device.

### Claim 7 (depends on 1)

The data processing system of claim 1, wherein the data decoder circuit comprises:
a first selector circuit operable to select between a first codeword and a second codeword to provide a decoder input, wherein the second codeword was processed by a preceding local iteration through the data decoder circuit;
a second selector circuit operable to select between a first value and a check node to variable node new message as a first summation input;
a third selector circuit operable to select between a second value and a check node to variable node old message as a second summation input; and
wherein selectably configuring the data decoder circuit is controlled at least in part based upon controlling selections by the first selector circuit, the second selector circuit, and the third selector circuit.

### Claim 8 (depends on 7)

The data processing system of claim 7, wherein the first value and the second value are zero.

### Claim 9 (depends on 7)

The data processing system of claim 7, wherein the data decoder circuit further comprises:
a first summation circuit operable to add the decoder input to the first summation input to yield a first sum;
a shifter circuit operable to apply a circulant shift to the first sum to yield a shifted output; and
a second summation circuit operable to subtract the second summation input from the shifted output.

### Claim 10 (depends on 9)

The data processing system of claim 9, wherein the data decoder circuit further comprises:
a check node to variable node updating circuit operable to update the check node to variable node old message and the check node to variable node new message.

### Claim 11

A data processing system, the data processing system comprising:
a dual pass data decoder circuit operable to:
access a data set from a memory for a first pass through the dual pass data decoder circuit;
update a check node to variable node message based at least in part on the data set during the first pass;
re-access the data set from the memory for a second pass through the dual pass data decoder circuit; and
apply the check node to variable node message during the second pass to yield an output.

### Claim 12 (depends on 11)

The data processing system of claim 11, wherein the data decoder circuit comprises:
a first selector circuit operable to select between a first codeword and a second codeword to provide a decoder input, wherein the second codeword was processed by a preceding local iteration through the data decoder circuit;
a second selector circuit operable to select between a first value and a check node to variable node new message as a first summation input; and
a third selector circuit operable to select between a second value and a check node to variable node old message as a second summation input.

### Claim 13 (depends on 12)

The data processing system of claim 12, wherein the first value and the second value are zero.

### Claim 14 (depends on 12)

The data processing system of claim 12, wherein the data decoder circuit further comprises:
a first summation circuit operable to add the decoder input to the first summation input to yield a first sum;
a shifter circuit operable to apply a circulant shift to the first sum to yield a shifted output; and
a second summation circuit operable to subtract the second summation input from the shifted output.

### Claim 15 (depends on 14)

The data processing system of claim 14, wherein the data decoder circuit further comprises:
a check node to variable node updating circuit operable to update the check node to variable node old message and the check node to variable node new message.

### Claim 16 (depends on 15)

The data processing system of claim 15, wherein the data decoder circuit is operable to:
select the first codeword via the first selector circuit as the decoder input during the first pass and the second pass;
select the first value via the second selector circuit as the first summation input during the first pass;
select the check node to variable node new message via the second selector circuit as the first summation input during the second pass; and
select the second value via the third selector circuit as the second summation input during the first pass and the second pass.

### Claim 17 (depends on 15)

The data processing system of claim 15, wherein the data decoder circuit is operable to:
select the second codeword via the first selector circuit as the decoder input during the first pass;
select the first codeword via the first selector circuit as the decoder input during the second pass;
select the first value via the second selector circuit as the first summation input during the first pass;
select the check node to variable node new message via the second selector circuit as the first summation input during the second pass;
select the check node to variable node old message via the third selector circuit as the second summation input during the first pass; and
select the second value via the third selector circuit as the second summation input during the second pass.

### Claim 18 (depends on 11)

The data processing system of claim 11, wherein the system is implemented as an integrated circuit.

### Claim 19 (depends on 11)

The data processing system of claim 11, wherein the data processing system is incorporated in a device selected from a group consisting of: a storage device, and a data transmission device.

### Claim 20

A method for data processing, the method comprising:
providing a data decoder circuit selectably configurable to operate as one of:
a layered data decoder circuit; and
a non-layered data decoder circuit;
configuring the data decoder circuit to operate as a layered data decoder circuit;
applying a layered data decoding algorithm to a data set using the layered data decoder circuit;
determining a failure of convergence of the layered data decoder circuit;
re-configuring the data decoder circuit to operate as a non-layered data decoder circuit; and
applying a non-layered data decoding algorithm to a data set using the non-layered data decoder circuit.
