Interleaver structures for turbo codes with reduced storage memory requirement

This paper describes two interleaver structures that reduce the memory requirement for the storage of interleaver rules. The first structure offers memory reductions of more than 50%, compared to storing the entire interleaver vector. The second structure is useful when a range of interleaver sizes are to be stored, offering memory reductions asymptotically approaching 50%. By combining the two structures, a total memory reduction of approximately 75% is achieved. This is obtained without any significant reduction of the error correcting performance of the codes