# US 2013/0156133 A1 · Flexible Channel Decoder

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

- Number: US 2013/0156133 A1
- Document ID: US20130156133A1
- Status: Published application
- Kind: A1
- Application number: 12/990,721
- Filed: 2010-09-08
- Published: 2013-06-20
- Earliest claimed: 2010-09-08
- Assignees: Agence Spatiale Europeenne
- Inventors: Giuseppe Gentile; Massimo Rovini; Paolo Burzigotti; Luca Fanucci
- Web page: https://patentgrep.com/patent/US20130156133A1

## CPC

- H04L 25/02: Details {; arrangements for supplying electrical power along data transmission lines (systems for transmitting signals via power distribution lines H04B3/54)}
- H03M 13/1111: {Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms}
- H03M 13/1114: {Merged schedule message passing algorithm with storage of sums of check-to-bit node messages or sums of bit-to-check node messages, e.g. in order to increase the memory efficiency}
- 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}
- H03M 13/1137: {Partly parallel processing, i.e. sub-blocks or sub-groups of nodes being processed in parallel}
- H03M 13/114: {Shuffled, staggered, layered or turbo decoding schedules}
- H03M 13/2957: {Turbo codes and decoding}
- H03M 13/2972: {Serial concatenation using convolutional component codes}
- H03M 13/3905: {Maximum a posteriori probability [MAP] decoding or approximations thereof based on trellis or lattice decoding, e.g. forward-backward algorithm, log-MAP decoding, max-log-MAP decoding}
- H03M 13/3972: {using sliding window techniques or parallel windows}
- H03M 13/6508: {Flexibility, adaptability, parametrability and configurability of the implementation}
- H03M 13/6513: {Support of multiple code types, e.g. unified decoder for LDPC and turbo codes}
- H03M 13/6519: {Support of multiple transmission or communication standards}
- H03M 13/6525: {3GPP LTE including E-UTRA}
- H03M 13/6527: {IEEE 802.11 [WLAN]}
- H03M 13/653: {3GPP HSDPA, e.g. HS-SCCH or DS-DSCH related}
- H03M 13/6541: {DVB-H and DVB-M}
- H03M 13/6544: {IEEE 802.16 (WIMAX and broadband wireless access)}
- H03M 13/6552: {DVB-T2}
- H03M 13/6555: {DVB-C2}
- H03M 13/6566: {Implementations concerning memory access contentions}
- H03M 13/6569: {Implementation on processors, e.g. DSPs, or software implementations}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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 configurable Turbo-LDPC decoder comprising: A set of P>1 Soft-Input-Soft-Output decoding units (DP0-DPP-1; DPi) for iteratively decoding both Turbo- and LDPC-encoded input data, each of said decoding units having first (I1i) and second (I2i) input ports and first (O1i) and second (O2i) output ports for intermediate data; First and second memories (M1, M2) for storing said intermediate data, each of said first and second memories comprising P independently readable and writable memory blocks having respective input and output ports; and A configurable switching network (SN) for connecting the first input and output ports of said decoding units to the output and input ports of said first memory, and the second input and output ports of said decoding units to the output and input ports of said second memory.

## Claims

### Claim 1

A configurable Turbo-LDPC decoder comprising:
A set of P>1 Soft-Input-Soft-Output decoding units (DP0-DPP-1; DPi) for iteratively decoding both Turbo- and LDPC-encoded input data, each of said decoding units having first (I1i) and second (I2i) input ports and first (O1i) and second (O2i) output ports for intermediate data;
First and second memories (M1, M2) for storing said intermediate data, each of said first and second memories comprising P independently readable and writable memory blocks having respective input and output ports; and
A configurable switching network (SN) for connecting the first input and output ports of said decoding units to the output and input ports of said first memory, and the second input and output ports of said decoding units to the output and input ports of said second memory.

### Claim 2 (depends on 1)

A configurable Turbo-LDPC decoder according to claim 1 wherein
each of said P>1 Soft-Input-Soft-Output decoding units (DP0-DPP-1; DPi) has:
a first input port (I1i) for input reliabilities (λ) used in Turbo-decoding, and for check-to-variable metrics (c2v) used in LDPC-decoding;
a second input port (I2i) for extrinsic reliabilities (□) used in Turbo-decoding and for intermediate soft outputs (SO) used for LDPC-decoding;
a first output port (O1i) for check-to-variable metrics updated during LDPC-decoding; and
a second output port (O2i) for extrinsic reliabilities obtained as intermediate or final results of Turbo-decoding, and for soft outputs obtained as intermediate or final results of LDPC-decoding; and
said configurable switching network comprises:
A first and second P×P permutation network (PN1, PN2);
A P×P circular switching network (PSN);
First switching means (SW1) connecting the input ports of said first memory with either the first output ports of said decoding units or with a first input port (ID1) of the Turbo-LDPC decoder;
Second switching means (SW2) connecting the input ports of said second memory with either the second output ports of said decoding units through said first P×P permutation network, or with a second input port (ID2) of the Turbo-LDPC decoder;
Third switching means (SW3) connecting the output ports of said first memory with the first input ports of said decoding units either directly or through said P×P circular switching network; and
Fourth switching means (SW4) connecting the output ports of said first memory with either the second input ports of said decoding units through said second P×P permutation network, or with an output port (OD) of the Turbo-LDPC decoder.

### Claim 3 (depends on 1)

A configurable Turbo-LDPC decoder according to claim 1 also comprising control means (CM) for driving said switching network and said decoding units in order to selectively implement:
simultaneous decoding of several Turbo-encoded frames by at least some of said P decoding units;
parallelized decoding of a single Turbo-encoded frame by at least some of said P decoding units; and
parallelized decoding of a single LDPC-encoded frame by at least some of said P decoding units, each processing one or more parity-check constraints.

### Claim 4 (depends on 2)

A configurable Turbo-LDPC decoder according to claim 2 also comprising control means (CM) for driving said first and second permutation network, said circular switching network, said first, second, third and fourth switching means and said decoding units in order to selectively implement:
simultaneous decoding of several Turbo-encoded frames by at least some of said P decoding units, whose first input ports are connected to the output ports of said first memory through said circular switching network, the Turbo-encoded frames to be decoded being received through said first input port of the decoder and stored in said first memory;
parallelized decoding of a single Turbo-encoded frame by at least some of said P decoding units, each processing a portion of a code trellis, whose first input ports are directly connected to the output ports of said first memory, the Turbo-encoded frames to be decoded being received through said first input port of the decoder and stored in said first memory; or
parallelized decoding of a single LDPC-encoded frame by at least some of said P decoding units, each processing one or more parity-check constraints, the LDPC-encoded frames to be decoded being received through said second input port of the decoder and stored in said second memory.

### Claim 5 (depends on 1)

A configurable Turbo-LDPC decoder according to claim 1 wherein said first and second memories are single-port memories, respective temporary buffers being provided to avoid read/write collisions.

### Claim 6 (depends on 1)

A configurable Turbo-LDPC decoder according to claim 1 wherein said decoding units are adapted for performing Turbo- and LDPC-decoding using a BCJR, or forward-backward, algorithm.

### Claim 7 (depends on 6)

A configurable Turbo-LDPC decoder according to claim 6 wherein said decoding units are adapted for performing LDPC-decoding using a TDMP algorithm.

### Claim 8 (depends on 1)

A configurable Turbo-LDPC decoder according to claim 1 comprising a number P of decoding units comprised between 4 and 16.

### Claim 9 (depends on 1)

A configurable Turbo-LDPC decoder according to claim 1 comprising means for switching off or on part of the decoding units and of the memory blocks of said first and second memory depending on a required decoding throughput.

### Claim 10 (depends on 1)

A configurable Turbo-LDPC decoder according to claim 1 wherein each of said decoding units comprises a single processing core for both Turbo- and LDPC-decoding.

### Claim 11 (depends on 10)

A configurable Turbo-LDPC decoder according to claim 10 wherein each of said decoding units (DPi) comprises the following functional blocks:
A by-passable channel cumulative computation unit (CCC) for computing channel cumulative messages (γ) by adding-up input reliabilities;
A state-metric recursive unit (SMRU) for successively performing recursive computation of forward (α) and backward (β) metrics, taking said channel cumulative messages (γ) as inputs;
A state-metric memory (SMM) for storing already-computed forward metrics while the state-metric recursive unit is computing backward metrics, or vice-versa; and
An extrinsic reliabilities processor (EP) for computing extrinsic reliabilities (A), for Turbo-decoding, and soft outputs and check-to-variable metrics (c2v), for LDPC decoding, taking said forward metrics, backward metrics and channel cumulative messages as its inputs.

### Claim 12 (depends on 11)

A configurable Turbo-LDPC decoder according to claim 11 wherein each of said decoding units also comprises configurable distribution networks (CMD, CCD, ED, SMD, σD) for transferring data from the input ports of the decoding units to its functional blocks, and between said functional blocks, according to different data formats and decoding algorithms.

### Claim 13 (depends on 11)

A configurable Turbo-LDPC decoder according to claim 11 wherein the extrinsic reliabilities processor of each decoding unit comprises:
input ports for receiving forward (α), backward (β) and channel cumulative messages (γ), or combinations thereof (σ), corresponding to different trellis edges;
a first stage of adders, for adding forward, backward and channel cumulative messages corresponding to a same trellis edge;
a number 2M of max* or max trees equal to the number of said alphabet symbols;
a number K of 2M×2M permutation networks equal to the number of said trellis states, connecting output ports of said adders to input ports of said max* or max trees, wherein each of said max* or max trees has K input ports, each one being connected to a different one of said permutation networks;
a third stage of adders for computing extrinsic reliabilities (□) as sums of outputs of said max* or max trees; and
fourth and fifth stages of adders for computing updated check-to-variable metrics (c2v) and LDPC-soft outputs (SO) by combining input and outputs of first stages of said max* or max trees.

### Claim 14 (depends on 11)

A configurable Turbo-LDPC decoder according to claim 11 wherein the state-metric recursive unit (SMRU) of each decoding unit comprises a plurality of state metric processors (SMP0-SMP7) for computing forward and backward metrics of respective states of a code trellis, interconnected by a configurable recursion network.

### Claim 15 (depends on 14)

A configurable Turbo-LDPC decoder according to claim 14 wherein each said state metric processor comprises:
first input ports for receiving, through said recursion network (RN), forward (α)/backward (β) metrics;
second input ports for receiving channel cumulative messages (γ) corresponding to different edges reaching a same state of a code trellis;
a first stage of adders, for adding forward/backward and channel cumulative messages corresponding to a same trellis edge;
third input ports for receiving a posteriori reliabilities (Λ)/Soft-outputs (SO);
a second stage of adders, for adding said a posteriori reliabilities to the sums performed by the adders of said first stages;
a max* or max tree taking as inputs the sums computed by the adders of said second stage; and
first output ports for updated values of said forward/backward metrics.

### Claim 16 (depends on 14)

A configurable Turbo-LDPC decoder according to claim 14 wherein each said state metric processor further comprises second output ports for the sums (σ) of forward/backward and channel cumulative messages corresponding to a same trellis edge.

### Claim 17 (depends on 1)

A configurable Turbo-LDPC decoder according to claim 1, implemented as an Application Specific Integrated Circuit.

### Claim 18

A Soft-Input-Soft-Output Turbo- and LDPC-decoding unit (DPi) having:
a first input port (I1i) for input reliabilities (λ) used in Turbo-decoding, and for check-to-variable metrics (c2v) used in LDPC-decoding;
a second input port (I2i) for extrinsic reliabilities (Δ, Λ) used in Turbo-decoding and for intermediate soft outputs SO used for LDPC-decoding;
a first output port (O1i) for check-to-variable metrics updated during LDPC-decoding; and
a second output port (O2i) for extrinsic reliabilities obtained as intermediate or final results of Turbo-decoding, and for soft outputs obtained as intermediate or final results of LDPC-decoding;
said decoding unit comprising the following functional blocks:
A by-passable channel cumulative computation unit (CCC) for computing channel cumulative messages by adding-up input reliabilities;
A state-metric recursive unit (SMRU) for successively performing recursive computation of forward- and backward metrics, taking said channel cumulative messages as inputs;
A state-metric memory (SMM) for storing already-computed forward metrics while the state-metric recursive unit is computing backward metrics, or vice-versa; and
An extrinsic reliabilities processor (EP) for computing extrinsic reliabilities, for Turbo-decoding, and soft outputs and check-to-variable metrics, for LDPC decoding, taking said forward metrics, backward metrics and channel cumulative messages as its inputs.

### Claim 19 (depends on 18)

A Soft-Input-Soft-Output Turbo- and LDPC-decoding unit according to claim 18, also comprising configurable distribution networks (CMD, CCD, ED, SMD, σD) for transferring data from the input ports of the decoding units to its functional blocks, and between said functional blocks, according to different data formats and decoding algorithms.

### Claim 20

An extrinsic reliability processor for computing extrinsic reliabilities in Turbo-decoding, and soft outputs and check-to-variable metrics, in LDPC decoding, having input ports for forward metrics, backward metrics and channel cumulative messages corresponding to different trellis edges:
a first stage of adders, for adding forward, backward and channel cumulative messages corresponding to a same trellis edge;
a number 2M of max* or max trees equal to the number of said alphabet symbols;
a number K of 2M×2M permutation networks equal to the number of said trellis states, connecting output ports of said adders to input ports of said max* or max trees, wherein each of said max* or max trees has K input ports, each one being connected to a different one of said permutation networks;
a third stage of adders for computing extrinsic reliabilities as sums of outputs of said max* or max trees; and
fourth and fifth stages of adders for computing updated check-to-variable metrics and LDPC-soft outputs by combining input and outputs of first stages of said max* or max trees.

### Claim 21

A state-metric recursive unit (SMRU) for performing recursive computation of forward- and backward metrics according to the BCJR algorithm, comprising a plurality of state metric processors (SMPi) for computing forward and backward metrics of respective states of a code trellis, interconnected by a configurable recursion network (RN), wherein each said state metric processor comprises
first input ports for receiving, through said recursion network, forward (α)/backward (β) metrics;
second input ports for receiving channel cumulative messages (γ) corresponding to different edges reaching a same state of a code trellis;
a first stage of adders, for adding forward, backward and channel cumulative messages corresponding to a same code symbol;
third input ports for receiving a posteriori reliabilities (Λ)/Soft-outputs (SO);
a second stage of adders, for adding said a posteriori reliabilities to the sums performed by the adders of said first stages;
a max* or max tree taking as inputs the sums computed by the adders of said second stage; and
first output ports for updated values of said forward/backward metrics.

### Claim 22 (depends on 21)

A state-metric recursive unit according to claim 21 wherein each said state metric processor further comprises second output ports for the sums (σ) of forward/backward and channel cumulative messages corresponding to a same trellis edge.
