Construction of turbo code interleavers from 3-regular Hamiltonian graphs

Arya Mazumdar, A. K. Chaturvedi, Adrish Banerjee

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)284-286
Number of pages3
JournalIEEE Communications Letters
Issue number4
StatePublished - Apr 2006


  • Hamiltonian cycle
  • Interleaver
  • Minimum distance
  • Regular graph
  • Summary distance
  • Turbo code


Dive into the research topics of 'Construction of turbo code interleavers from 3-regular Hamiltonian graphs'. Together they form a unique fingerprint.

Cite this