Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs

TL;DR

This paper introduces a novel method for constructing turbo code interleavers using 3-regular Hamiltonian graphs, enabling large girth and high minimum distance with a parameter-based approach.

Contribution

It presents a new graph-theoretic construction of interleavers for turbo codes that can be efficiently generated with tunable parameters to optimize performance.

Findings

Interleavers achieve large girth, improving error correction.

Parameter selection influences interleaver properties and search space.

Interleavers function as their own de-interleavers.

Abstract

In this letter we present a new construction of interleavers for turbo codes from 3-regular Hamiltonian graphs. The interleavers can be generated using a few parameters, which can be selected in such a way that the girth of the interleaver graph (IG) becomes large, inducing a high summary distance. The size of the search space for these parameters is derived. The proposed interleavers themselves work as their de-interleavers.