Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs
classification
💻 cs.IT
math.IT
keywords
interleaversconstructiongraphshamiltonianparametersregularturbobecomes
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.