An incremental method for obtaining, starting from an initial S-random interleaver permutation Π, stored in memory means and having a spread S, a size K and a degree of parallelism M<K, and collision-free, an interleaver permutation with an increased size, which is also collision-free, through an expansion technique which is carried out by means of electronic processing means connected to said memory means;
- wherein in each of successive iterations, the initial interleaver permutation is added with M terms or elements which satisfy the following relationship:
- ∀
- i
- ∈
- [
- 0
- ;
- K
- M
- -
- 1
- ]
- ,
- ∀
- j
- ,
- k
- ∈
- [
- 0
- ;
- M
- -
- 1
- ]
- ,
-
- with
-
-
- j
- ≠
- k
-
- :
-
-
- ⌊
- Π
-
- (
- i
- +
- K
- M
-
- j
- )
- /
- (
- K
- /
- M
- )
- ⌋
- ≠
- ⌊
- Π
-
- (
- i
- +
- K
- M
-
- k
- )
- /
- (
- K
- /
- M
- )
- ⌋
- wherein i, j, k are indices which indicate the position of the terms or elements in the interleaver permutation, said M terms or elements being added in respective positions iz such that:
- i
- z
- +
- 1
- =
- (
- i
- z
- +
- K
- M
- )
- mod
-
-
- K
- ,
- z
- =
- 0
- ,
- …
-
- ,
- K
- -
- 1