# US 2008/0304576 A1 · Efficient decoding

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

- Number: US 2008/0304576 A1
- Document ID: US20080304576A1
- Status: Published application
- Kind: A1
- Application number: 12/217,962
- Filed: 2008-07-10
- Published: 2008-12-11
- Earliest claimed: 2005-03-25
- Assignees: Teranetics, Inc.
- Inventors: Dariush Dabiri; Nitin Barot
- Web page: https://patentgrep.com/patent/US20080304576A1

## CPC

- H03M 13/1137: {Partly parallel processing, i.e. sub-blocks or sub-groups of nodes being processed in parallel}
- H03M 13/1111: {Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms}
- H03M 13/114: {Shuffled, staggered, layered or turbo decoding schedules}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- 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

Embodiments of a method and apparatus for decoding signals are disclosed. The method includes receiving modulated signals, generating bits representing the signals, and associated reliability of each bit. The method further includes executing a first stage of decoding the bits using a first component code, and simultaneously executing the first stage of decoding again using a second component code, and executing a second stage of decoding using the first component code. The first and second stages of decoding are used to generate the bit stream. Another method includes receiving modulated signals, generating bits representing the signals, and associated reliability of each bit. The method further includes executing a first stage of N stages for decoding the bits, the first stage using a first of M component codes, and simultaneously executing a plurality of the N stages of decoding, each of the plurality of N stages using a different one of the M component codes. The plurality of N stages of decoding are used to generate the bit stream.

## Claims

### Claim 1

A method of decoding signals to generate a received bit stream, comprising:
receiving modulated signals;
generating bits representing the modulated signals, and beliefs representing an associated reliability of each bit;
a bit node computation block receiving the bits and associated beliefs, and generating a plurality of bit node messages;
a plurality of M serially-connected pipeline stages receiving the bit node messages and after M decoding cycles, generating a plurality of check node messages once per decoding cycle, comprising;
for each iteration cycle, each of the M serially-connected pipeline stages performing check node computations using all of J component codes, wherein each one of the M serially-connected pipeline stages performs check node computations once per decoding cycle using a single component code that is different that component codes used for all other of the M serially-connected pipeline stages, wherein J is at least as great as M, and wherein each iteration includes M decoding cycles.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
every decoding cycle after M decoding cycles, the bit node computation block updating beliefs of the received bits using check node messages of a single one of the component codes per decoding cycle, wherein the single one component of the component codes changes for each decoding cycle according to a specific order of the component codes.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
every decoding cycle, updating all bit node messages of the received bits using check node to bit node messages of a single one of the component codes per decoding cycle, wherein the single one component of the component codes changes for each decoding cycle according to a specific order of the component codes.

### Claim 4 (depends on 1)

The method of claim 1, further comprising the bit node computation block generating a decoded received bit stream once every N iterations, wherein N is a pre-selected number of iterations.

### Claim 5 (depends on 4)

The method of claim 4, wherein N is dynamically selected depending on whether all parity checks of the component codes are satisfied.

### Claim 6 (depends on 1)

The method of claim 1, wherein the check node computations of each of the M serially-connected pipeline stages includes different functionality than all other of the M serially connected pipeline stages.

### Claim 7 (depends on 1)

The method of claim 1, wherein for each cycle of decoding, each of M−1 of the M serially-connected pipeline stage executing one step of check node computations and providing intermediate results to a next stage of the M serially-connected pipeline stages.

### Claim 8 (depends on 1)

The method of claim 1, wherein for each iteration, each stage of the M serially-connected pipeline stages of decoding using updated bit node messages including all previous iterations.

### Claim 9 (depends on 1)

The method of claim 1, further comprising configuring a first of the M serially-connected pipeline stages with a specific component codes, and configuring a last of the M serially-connected pipeline stages with another specific component code.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
a first sub-block of the first stage re-ordering bit node to check node messages, enabling processing of the a second sub-block of the first stage to remain static as the first stage cycles through processing using the J component codes.

### Claim 11 (depends on 10)

The method of claim 10, wherein the re-ordering of the bit node to check node messages changes every decoding cycle.

### Claim 12 (depends on 1)

The method of claim 1, wherein column weights of a parity check matrix of the component codes are non-zero.

### Claim 13 (depends on 1)

The method of claim 1, wherein each component code comprises a regular LDPC, and column weights of a parity matrix of the component codes are pre-selected values.

### Claim 14 (depends on 13)

The method of claim 13, wherein the pre-selected values are all the same.

### Claim 15 (depends on 14)

The method of claim 14, wherein hardware implementing the stages includes a repeated structure.

### Claim 16 (depends on 1)

The method of claim 1, wherein a parity check matrix of the component codes has column weights of one.

### Claim 17

A decoder comprising:
means for generating bits representing received signals, and beliefs representing a channel reliability of each bit;
a bit node computation block receiving the bits, associated channel reliability and check node messages, and generating a plurality of bit node messages and beliefs for each bit;
a plurality of M serially-connected pipeline stages for receiving the bit node messages and after M decoding cycles, generating a plurality of check node messages once per decoding cycle, wherein for each iteration cycle, each of the M serially-connected pipeline stages performs check node computations using all of J component codes, wherein each one of the M serially-connected pipeline stages performs check node computations once per decoding cycle using a single component code that is different than component codes used for all other of the M serially-connected pipeline stages, wherein J is at least as great as M, and wherein each iteration includes M decoding cycles.

### Claim 18 (depends on 17)

The decoder of claim 17, wherein each of the M serially-connected pipeline stages are clocked by a decoding cycle clock.

### Claim 19

A method of decoding signals to generate a received bit stream, comprising:
receiving modulated signals;
generating bits representing the signals, and associated reliability of each bit;
operating a first stage of N series-connected decoder stages for decoding the bits, the first stage operating using a first of M component codes; and
operating the N series-connected decoder stages simultaneously, each of the N series-connected decoder stages operating using a different one of M component codes, wherein each of the N series-connected decoder stages use all M component codes for each iteration of decoding, wherein M is at least as great as N, wherein N is greater than two; and wherein
the plurality of N stages of decoding are used to generate the bit stream.

### Claim 20 (depends on 19)

The method of claim 19, wherein iterations of decoding include all of the stages executing all of the component codes.

### Claim 21 (depends on 19)

The method of claim 19, wherein column weights of a parity check matrix of the component codes are non-zero.

### Claim 22 (depends on 19)

The method of claim 19, wherein each component code comprises a regular LDPC, and column weights of a parity matrix of the component codes are pre-selected values.

### Claim 23 (depends on 22)

The method of claim 22, wherein the pre-selected values are all the same.

### Claim 24 (depends on 23)

The method of claim 23, wherein hardware implementing the N series-connected decoder stages includes a repeated structure.
