High spread highly randomized generatable interleavers

A method for generating an interleaver for use in a Turbo Code comprising the step of:

• a) Setting the first 40 addresses to the seed values set forth in column 3 of Table VI described herein;
• b) Subtracting 40 from each value in the previous 40 values, modulo 2080, thereby generating 40 additional addresses;
• c) repeating step b) until 2080 addresses have been generated.

A method for generating an interleaver for use in a Turbo Code comprising the step of:

• a) Setting the first 22 addresses to the seed values set forth in column 4 of Table VI described herein;
• b) Subtracting 22 from each value in the previous 22 values, modulo 1056, thereby generating 22 additional addresses;
• c) repeating step b) until 1056 addresses have been generated.

A method for generating an interleaver for use in a Turbo Code comprising the step of:

• a) Setting the first 8 addresses to the seed values set forth in column 5 of Table VI described herein;
• b) Subtracting 8 from each value in the previous 8 values, modulo 64, thereby generating 8 additional addresses;
• c) repeating step b) until 64 addresses have been generated.

A circuit for generating an interleaver of size N comprising:

• ROM for storing a set of seed values which are in a pseudo random order:
• subtraction circuit for generating a first set of addresses by subtracting a set value from said set of seeds, and for generating additional addresses by subtracting a set value from the first set of addresses.