# US 2008/0187055 A1 · Method for interleaving bits, a base station, a user terminal and a communication network therefor

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

- Number: US 2008/0187055 A1
- Document ID: US20080187055A1
- Status: Published application
- Kind: A1
- Application number: 12/025,384
- Filed: 2008-02-04
- Published: 2008-08-07
- Earliest claimed: 2007-02-05
- Assignees: Alcatel Lucent
- Inventors: Carsten HAASE; Holger Heimpel; Michael Ohm; Hans-Peter Mayer
- Web page: https://patentgrep.com/patent/US20080187055A1

## CPC

- H03M 13/2789: {Interleaver providing variable interleaving, e.g. variable block sizes}
- H03M 13/2707: {Simple row-column interleaver, i.e. pure block interleaving}
- 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 invention concerns a method for interleaving a dedicated set of bits that is divided in an appropriate number of blocks using for each block an interleaver matrix with a predefined first dimension for interleaving the bits within each block, whereby said appropriate number of blocks is estimated in such a way that a value of a second dimension of the interleaver matrix that is needed to interleave the bits within each block lies within a dedicated range, a base station (BS1-BS8), a user terminal (T1-T4) and a communication network (CN) therefor.

## Claims

### Claim 1

A method for interleaving a dedicated set of bits that is divided in an appropriate number of blocks using for each block an interleaver matrix with a predefined first dimension for interleaving the bits within each block, wherein said appropriate number of blocks is chosen so that a value of a second dimension of the interleaver matrix that is needed to interleave the bits within each block lies within a dedicated range.

### Claim 2 (depends on 1)

A method according to claim 1, wherein
said appropriate number of blocks is estimated based on a defined lowest value of the second dimension of the interleaver matrix that is allowed to occur for the number of bits of the dedicated set of bits being higher than the value of the first dimension multiplied with the lowest value of the second dimension,
the highest possible number of blocks for which an auxiliary matrix has no vacant array element when interleaving the bits within each block is estimated using said auxiliary matrix with said predefined first dimension and said lowest value as a value for the second dimension,
if said highest possible number of blocks is at least one, said appropriate number of blocks is equal to said highest possible number of blocks,
if said highest possible number of blocks is zero, said appropriate number of blocks is one.

### Claim 3 (depends on 2)

A method according to claim 2, wherein a lowest limit for the second dimension of the interleaver matrix is estimated that allows for an interleaving of the dedicated set of bits in said appropriate number of blocks.

### Claim 4 (depends on 3)

A method according to claim 3, wherein the dedicated set of bits is divided in the appropriate number of blocks in such a way, that the difference between the number bits in each block is as low as possible.

### Claim 5 (depends on 1)

A method according to claim 1, wherein the predefined first dimension of said interleaver matrix is calculated or chosen based on the number of bits of the dedicated set of bits.

### Claim 6

A base station for interleaving a dedicated set of bits that is divided in an appropriate number of blocks using for each block an interleaver matrix with a predefined first dimension for interleaving the bits within each block, wherein said base station comprises at least one processing means adapted to perform a choice of said appropriate number of blocks in such a way that a value of a second dimension of the interleaver matrix that is needed to interleave the bits within each block lies within a dedicated range.

### Claim 7

A user terminal for interleaving a dedicated set of bits that is divided in an appropriate number of blocks using for each block an interleaver matrix with a predefined first dimension for interleaving the bits within each block, wherein said user terminal comprises at least one processing means adapted to perform a choice of said appropriate number of blocks in such a way that a value of a second dimension of the interleaver matrix that is needed to interleave the bits within each block lies within a dedicated range.

### Claim 8

A communication network comprising base stations and user terminals wherein at least one of said base stations or one of said user terminals comprises at least one processing means adapted to perform a choice of said appropriate number of blocks in such a way that a value of a second dimension of the interleaver matrix that is needed to interleave the bits within each block lies within a dedicated range.
