Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs
<|reference_start|>Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs: 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.<|reference_end|>
@article{mazumdar2005construction,
    title={Construction of Turbo Code Interleavers from 3-Regular Hamiltonian
  Graphs},
    author={Arya Mazumdar, A K Chaturvedi, Adrish Banerjee},
    journal={IEEE Communications Letters, pp. 284-286, Vol. 10, Issue 4, April,
  2006.},
    year={2005},
    doi={10.1109/LCOMM.2006.04013},
    archivePrefix={arXiv},
    eprint={cs/0512093},
    primaryClass={cs.IT math.IT}
}