Patent ID: 7210076

Claim:
An interleaving sequence generator comprising: means which sets R blocks with a data length p based on a prime p and generates R different integers q 0 , q 1 q 2 , . . . , q R−1 relatively prime to (p−1); means which calculates the element on the finite field when a characteristic is the prime p by raising a primitive root ν to the powers of q 0 , q 1 q 2 , . . . , q R−1 , thus to generate and store values ν^q 0 (mod p), ν^q 1 (mod p), ν^q 2 (mod p), . . . , ν^q R−1 (mod p); means which raises the values ν^q 0 , ν^q 1 , ν^q 2 , . . . , ν^q R−1 (mod p) to the power of j on the finite field, thus to generate values (ν^q 0 )^j(mod p), (ν^q 1 )^j(mod p), (ν^q 2 )^j(mod p), . . . , (ν^q R−1 )^j(mod p); means which generates or records a block permutation pattern that is predetermined for permuting the blocks; and means iterates, when j=1 to (p−2), such an operation that one is sequentially added to a value obtained by multiplying, by p, an output from said means for generating or recording the block permutation pattern in the 0-th permutation and such an operation that said generated values (ν^q 0 )^j, (ν^q 1 )^j, (ν^q 2 )^j, . . . , (ν^q R−1 )^j(mod p) are sequentially added to a value obtained by multiplying, by p, an output from said means for generating or recording the block permutation pattern in the j-th permutation.