Design of chaotic interleaver for turbo codes

This paper presents chaotic interleaver algorikhm which utilizos the choatic map as permutation mode.It is simulated under SOVA and MAP algorithms respectivehy over AWGN channel.The simulation results of chaotic interleaver are compared with random interleaver under the same conditions.It shows that performances of chaotic interleavers are better than or equivalent those of random interleavers and there are no "error floor" those of random interleavers and there are no "error floor" at 10-5-10-6 of BER.