# US 2003/0233605 A1 · Method and circuit for interlacing numeric data to reduce transmission errors

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

- Number: US 2003/0233605 A1
- Document ID: US20030233605A1
- Status: Published application
- Kind: A1
- Application number: 10/424,166
- Filed: 2003-04-25
- Published: 2003-12-18
- Earliest claimed: 2002-04-26
- Assignees: STMicroelectronics S.r.l.
- Inventors: Charaf Hanna
- Web page: https://patentgrep.com/patent/US20030233605A1

## CPC

- H03M 13/2785: {Interleaver using in-place interleaving, i.e. writing to and reading from the memory is performed at the same memory location}
- H03M 13/2707: {Simple row-column interleaver, i.e. pure block interleaving}
- H03M 13/2764: {Circuits therefore}
- 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 method for interlacing digital data to reduce transmission errors includes dividing a stream of digital data into consecutive blocks of bits, and interlacing each block of bits by writing to an interlacing table. The interlacing table is arranged in the form of rows and columns of memory addresses, with a number of the rows and columns corresponding to predetermined interlacing parameters. The access sequences to the memory addresses for interlacing the blocks of bits are different from each other. The method further includes reading a block of bits in the interlacing table according to a memory addresses access sequence, and also writing bits to a consecutive block of bits according to the memory addresses access sequence during the reading.

## Claims

### Claim 1

Method for interlacing digital data to reduce transmission errors in the said data, comprising the following steps in which a stream of digital data is divided into consecutive blocks (B) of bits, and each block of bits is interlaced by writing the block of bits into an interlacing table (28) arranged in the form of rows and columns of memory addresses in which the number of rows and columns corresponds to predetermined interlacing parameters (L, I; L, I1, I2), and reading bits written in the table according to a memory addresses access sequence for reading bits in a block, the bits in a consecutive block to the said addresses are written, the access sequences to the memory addresses for interlacing the blocks of bits being different from each other.

### Claim 2 (depends on 1)

Method according to claim 1, characterized in that the memory addresses access sequence is produced starting from at least one of the interlacing parameters (L, I; L, I1, I2).

### Claim 3 (depends on 2)

Method according to claim 2, characterized in that the interlacing parameters (L, I; L, I1, I2) are composed of the number of bits or number of sets of bits of coding words formed by the rows of the interlacing table and by the interlacing depth respectively.

### Claim 4 (depends on 3)

Method according to claim 3, characterized in that the addresses Ai of the interlacing table in which the bits or bit sets number i of a block of bits are written during a memory access sequence, are defined according to the following equation:
Ai=nbxLb
in which:
L denotes the number of bits or bit sets in the coding words;
nb denotes the order number of the memory access sequence and
b denotes the number of the memory access sequence.

### Claim 5 (depends on 4)

Method according to claim 4, characterized in that two interlacing depths (I1, I2) are used for interlacing blocks of bits such that the number of bits or bit sets in the last block of bits corresponds as closely as possible to the number of memory addresses in the interlacing table.

### Claim 6 (depends on 5)

Method according to claim 5, characterized in that the number of memory addresses (Ai) in the interlacing table (28) is chosen so that it is equal to the result of a multiplication between the length of coding words and the greatest interlacing depth (I1, I2).

### Claim 7 (depends on 5, 6)

Method according to either claim 5 or 6, characterized in that each access to memory addresses in each memory access sequence is associated with an order number, in the case in which the bits in a block of bits are written in the interlacing table with a depth greater than the number of coding words in the said block, such that excess positions in the interlacing table remain empty, the order numbers of each access sequence for which the positions in the interlacing table are empty are also identified, and these access orders are ignored when reading the bits in these locations.

### Claim 8 (depends on 7)

Method according to claim 7, characterized in that the order numbers (ni) corresponding to an empty location are identified according to the following series:
I1, I1+I2, I1+2I2, I1+3I2 . . . , L×I2−1,
in which I1 and I2 denote two interlacing depths respectively.

### Claim 9

Circuit for interlacing digital data, comprising an interlacing table (28) arranged in the form of rows and columns of memory addresses in which the number of rows and columns corresponds to predetermined interlacing parameters in which bits of blocks of incident bits are written and read in sequence, and addressing means (22, 24, 26) in the interlacing table adapted to produce access sequences to memory addresses for writing and reading blocks of bits in the interlacing table, characterized in that the addressing means comprise means that, during an access sequence to memory addresses to reading bits in a block, provoke writing of bits in a block consecutive to the said addresses, the access sequences to memory addresses for interlacing blocks of bits being different from each other.

### Claim 10 (depends on 9)

Interlacing circuit according to claim 9, characterized in that the addressing means comprise an incremental register (22) and memory means (24), the register being incremented during each access sequence to memory addresses during each reception of a number of bits or a bit set corresponding to the interlacing depth with a magnitude corresponding to the contents of the memory means (24), the contents of the register being transferred towards the memory means after reception of a number of bits or a bit set corresponding to the number of memory address in the interlacing table.

### Claim 11 (depends on 10)

Interlacing circuit according to claim 10, characterized in that it also comprises an addressing register (26) in which the memory address of the interlacing table (28) currently being accessed is stored and an adder (24) to add the contents of the memory means to the contents of the addressing register.

### Claim 12 (depends on 9, 10, 11)

Interlacing circuit according to any one of claims 9 to 11, characterized in that it comprises a row counter (14) that is incremented following each reception of a bit or a set of incident bits and capable of outputting a pulse after reception of a number of bits or a bit set corresponding to the length of a coding word, and a block counter (18) that is incremented at the time of each pulse sent by the row counter to output a pulse after reception of a number of rows corresponding to an interlacing depth and an empty memory address identification pulse when the rows are included between two interlacing depths.

### Claim 13 (depends on 9, 10, 11, 12)

Interlacing circuit according to any one of claims 9 to 12, characterized in that it also comprises a column counter (16) that is incremented following each reception of a bit or a set of incident bits to output a pulse after reception of a number of bits or bit sets corresponding to an interlacing depth and an empty memory addresses identification pulse when the rows are included between two interlacing depths.
