Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs
信息论
2014-11-17 v1 math.IT
摘要
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.
关键词
引用
@article{arxiv.cs/0512093,
title = {Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs},
author = {Arya Mazumdar and A K Chaturvedi and Adrish Banerjee},
journal= {arXiv preprint arXiv:cs/0512093},
year = {2014}
}
备注
This paper has been accepted for publication in IEEE Communication Letters