Performance of turbo codes with matrix interleavers

Abstract EN

Recently, turbo codes have attracted many researchers because of the codes astonishing performance at low BER.

The interleaver is an important part in the design of a turbo code.

Most of the work done on turbo codes assumes random interleaving.

In this paper, we study the performance of turbo codes with matrix interleaving.

Various issues related to the code performance are investigated.

These include the design of the relative dimensions of the matrix interleaver, the effect of the interleaver length, the interaction between the interleaver and the number of decoding iterations, and the effect of interchanging the interleaver.

Simulation results show that matrix interleavers can be very competitive to random interleavers for short frame lengths.