# US 6,192,493 B1 · Data element interleaving/deinterleaving

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

- Number: US 6,192,493 B1
- Document ID: US6192493B1
- Status: Granted
- Kind: B1
- Application number: 09/000,273
- Filed: 1998-01-27
- Granted: 2001-02-20
- Earliest claimed: 1995-07-27
- Assignees: France Telecom; Telediffusion de France
- Inventors: Pierre Combelles; Damien Castelain; Denis Callonnec
- Web page: https://patentgrep.com/patent/US6192493B1

## 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: 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

To interleave or deinterleave data elements in first and second blocks transmitted alternately and each having N data elements with rank n lying between 0 and N−1, N being an integer, the data elements with ranks 0, . . . n, . . . N−1 in the first blocks are ordered in accordance with the successive ranks A(0), . . . A(n), . . . A(N−1) and the data elements with ranks 0, . . . n, . . . N−1 in the second block are ordered in accordance with the successive ranks A−1(0), . . . A−1(n), . . . A−1(N−1). A and A−1 are different functions such that A−1(A(n))=n.

## Claims

### Claim 1

A method of modifying the order of data elements in first and second blocks transmitted alternately and each having N data elements with rank n lying between 0 and N−1, N being an integer, the method comprising ordering the data elements with ranks 0, . . . n, . . . N−1 in the first blocks in accordance with the successive ranks A(0), . . . A(n), . . . A(N−1) and ordering the data elements with ranks 0, . . . n, . . . N−1 in the second blocks in accordance with the successive numbers A−1(0), . . . A−1(n), . . . A−1(N−1), where A and A−1 are different first and second functions such that A−1(A(n))=n.

### Claim 2 (depends on 1)

The method of claim 1 wherein the following steps are performed in a memory having N data element cells with addresses 0 through N−1 and relating to a first block, a second next block and a first next block:
a) reading elements of the first block ordered in accordance with the first function A and simultaneously writing elements of the second next block in the memory so that an element with a rank A(n) in the first block is read in a cell having the address A(n) and an element with the rank n in the second next block is written in the cell having the address A(n), and
b) reading elements of the second next block ordered in accordance with the second function A−1 and simultaneously writing elements of the first next block (B2k+2) in the memory so that an element with the rank A−1(n) in the second next block is read in a cell having the address n and an element with the rank n in the first next block is written in the cell having the address n.

### Claim 3 (depends on 2)

The method of claim 2 wherein the integer N is even, the integers A(n) and n have the same parity, and replacing the memory by first and second memories, alternately addressing the first and second memories in write mode and in read mode at the timing rate of the data elements so the data elements respectively having even and odd ranks are written and read in the first and second memories in each of the blocks.
