# US 2011/0087949 A1 · Reconfigurable turbo interleavers for multiple standards

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

- Number: US 2011/0087949 A1
- Document ID: US20110087949A1
- Status: Published application
- Kind: A1
- Application number: 12/996,783
- Filed: 2009-06-06
- Published: 2011-04-14
- Earliest claimed: 2008-06-09
- Assignees: NXP B.V.
- Inventors: Angelo Raffaele Dilonardo; Nur Engin
- Web page: https://patentgrep.com/patent/US20110087949A1

## CPC

- H03M 13/2775: {Contention or collision free turbo code internal interleaver}
- H03M 13/2739: {Permutation polynomial interleaver, e.g. quadratic permutation polynomial [QPP] interleaver and quadratic congruence interleaver}
- H03M 13/2753: {Almost regular permutation [ARP] interleaver}
- H03M 13/2764: {Circuits therefore}
- H03M 13/2957: {Turbo codes and decoding}
- H03M 13/6519: {Support of multiple transmission or communication standards}
- H03M 13/6525: {3GPP LTE including E-UTRA}
- H03M 13/6544: {IEEE 802.16 (WIMAX and broadband wireless access)}
- 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 data processing system, a turbo decoding system, an address generator and a method of reconfiguring a turbo decoding method is provided. The data processing system (101) comprises the turbo decoding system (100). The turbo decoding system (100) comprises electronic circuits. The electronic circuits comprises: a memory (108), the address generator (102), and a Soft Input Soft Output decoder (106). The address generator (102) is operative to produce a sequence of addresses according to an interleaving scheme. The address generator can support multiple interleaving schemes. The address generator (102) is operative to receive reconfiguration information. The address generator (102) is operative to reconfigure during operational use the interleaving scheme in dependency on the reconfiguration information.

## Claims

### Claim 1

A data processing system comprising:
a turbo decoding system including a plurality of electronic circuits, the electronic circuits including a memory, an address generator, and a Soft Input Soft Output decoder, wherein:
the memory is operative to store a first information;
the address generator is operative to produce a sequence of addresses according to an interleaving scheme;
the memory is operative to retrieve the first information as indicated by the sequence of addresses;
the Soft Input Soft Output decoder is operative to produce a second information by performing a turbo decoding half-iteration on the retrieved first information;
the memory is operative to store the second information as indicated by the sequence of addresses;
the address generator is operative to receive reconfiguration information; and
the address generator is operative to reconfigure during operational use the interleaving scheme in dependency on the reconfiguration information.

### Claim 2 (depends on 1)

A data processing system as in claim 1, wherein:
the interleaving scheme is based on a polynomial;
the address generator includes a polynomial evaluator, the polynomial evaluator is operative to produce a polynomial evaluation;
the polynomial evaluator includes a first plurality of parameters representative of the polynomial; and
the reconfiguration information includes at least one second plurality of parameters representative of a reconfigured polynomial.

### Claim 3 (depends on 2)

A data processing system as in claim 2, wherein
the polynomial evaluator includes:
a third plurality of adders, a fourth plurality of buffers and a configuration unit;
the third plurality of adders is ordered linearly, the third plurality of adders includes a first adder and a last adder;
to each specific one of the third plurality of adders is associated a specific one of the fourth plurality of buffers;
each specific one of the third plurality of adders is configured to produce a specific output by adding, modulo a first number, a specific fifth plurality of inputs, the specific fifth plurality of inputs includes a contents of the specific buffer associated with the specific adder; the specific adder is configured to store the specific output in the specific buffer;
the specific fifth plurality of inputs to each specific one of the third plurality of adders, except the first adder, includes a contents of a specific previous buffer associated with a specific previous adder;
the last adder produces a last output, which last output is representative of the polynomial evaluation; and
the configuration unit is operative to store in each specific one of the fourth plurality of buffers a specific one of the first plurality of parameters representative of one of the polynomial and the second plurality of parameters representative of the reconfigured polynomial.

### Claim 4 (depends on 3)

A data processing system as in claim 3, wherein the address generator comprises a further memory and a counter; wherein:
the further memory is operative to store a seventh plurality of numbers;
the turbo decoding system is operative to increment the counter in conjunction with the Soft Input Soft Output decoder performing the turbo decoding half-iteration;
the further memory is operative to retrieve a specific one of the seventh plurality of numbers in dependency on the counter;
the last adder is operative to receive as input an eighth plurality of inputs, the eighth plurality of inputs includes the specific number.

### Claim 5 (depends on 3)

A data processing system as in claim 3, wherein the address generator comprises a further memory and a counter; wherein:
the further memory is operative to store a seventh plurality of numbers;
the turbo decoding system is operative to increment the counter in conjunction with the Soft Input Soft Output decoder performing the turbo decoding half-iteration;
the further memory is operative to retrieve a specific one of the seventh plurality of numbers in dependency on the counter;
a particular one of the third plurality of adders is configured to receive an input from a particular previous adder and the specific number;
the particular adder is operative to select one of the input from the particular previous adder and the specific number, for use in the adding.

### Claim 6 (depends on 1)

A mobile communication device including the data processing system as in claim 1.

### Claim 7 (depends on 1)

A turbo decoding system for use in a data processing system as in claim 1.

### Claim 8 (depends on 1)

An address generator for use in a data processing system as in claim 1.

### Claim 9

A method of reconfiguring a turbo decoding method, including:
receiving reconfiguration information; and
reconfiguring during operational use of the turbo decoding method an interleaving scheme in dependency on the reconfiguration information;
the turbo decoding method comprising:
producing a sequence of addresses according to the interleaving scheme;
retrieving a first information from a memory as indicated by the sequence of addresses;
producing a second information by performing a turbo decoding half-iteration on the retrieved first information; and
storing the second information as indicated by the sequence of addresses.

### Claim 10 (depends on 9)

A computer program product comprising computer code for implementing the method as defined in claim 9.
