A code-matched collision-free S-random interleaver for turbo codes

Due to the increasing throughput requirements of wireless applications, turbo decoders with parallel processing are needed. Interleavers with no memory collisions should to be used in such decoders to avoid overall throughput reduction. In this paper, a new collision-free S-random interleaver design is introduced. The proposed interleaver adds the excellent performance of code-matched interleavers to the collision-free interleaving property. The algorithm for the proposed interleaver construction is detailed. Simulation results show a better error performance for the presented interleaver over the non-code-matched collision-free random interleaver.