A simple algorithm for generation of collision free S-random interleavers for turbo codes

For the application of parallel turbo decoding, a simple algorithm is proposed for generation of collision free S-random (CFS) interleavers. The proposed algorithm can efficiently transform any semi-randomly designed collision free (CF) interleaver to be S-random for de-interleaving operations, where the spreading factor, S, can attain its upper bound, while the interleaver keeps collision free property for interleaving operations. Due to the large spreading factors, such CFS interleavers can result in excellent turbo decoding performance.