Patent ID: 8311017

Claim:
A method for interleaving, in a packet network, a dedicated set of bits that is divided into a number of blocks of data, said method comprising: using for each block of data an interleaver matrix with a predefined first dimension for interleaving the bits within each block of data; wherein said number of blocks of data is chosen so that a value of a second dimension of the interleaver matrix that is needed to interleave the bits within each block of data lies within a dedicated range, and said number of blocks of data is estimated, by at least one element of the packet network, 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; wherein a highest possible number of blocks of data, for which a given interleaver matrix has no vacant array element when interleaving the bits within each block of data , is estimated using the given interleaver matrix with said predefined first dimension and said defined lowest value as a value for the second dimension; wherein if said highest possible number of blocks of data is at least one, said appropriate number of blocks of data is equal to said highest possible number of blocks of data ; and if said highest possible number of blocks of data is zero, said number of blocks of data is one.