Interleaver design for turbo codes with reduced memory requitement

The interleaving and deinterleaving performed in turbo codes require that the interleaver rule is either stored in memory or that it can be calculated in real time. For large interleavers, and for systems where many different interleaver sizes are used, the interleaver rule storage becomes memory demanding. This input document presents and evaluates two interleaver structures that reduce the required storage area. Each structure offer memory savings of approximately 50%, and since they can be combined, a total saving of approximately 75% is achievable. Simulation results show that these savings are achieved without a significant degradation of the performance of the turbo codes.