New High Performance Deterministic Interleavers for Turbo Codes

Abstract

Turbo codes offer extraordinary performance, especially at low signal to noise ratios, due to a low multiplicity of low weight code words. The interleaver design is critical in order to realize an apparent randomness of the code, thus further enhancing its performance, especially for short block frames. This paper presents four new deterministic interleaver design methods, that lead to highly performing turbo coding systems, namely the block-spread, the block-backtracking and their variations the linearly-spread and linearly-backtracking interleavers. The design methods are explained in depth and the results are compared against some of the most wide-spread turbo code interleavers. Furthermore, the selection method of the generator polynomials used in the simulations is explained.

Keywords

• channel coding
• concatenated coding
• deterministic algorithms
• error correction coding
• interleaved coding