Construction of turbo code interleavers from 3-regular Hamiltonian graphs

Arya Mazumdar; A. K. Chaturvedi; Adrish Banerjee

doi:10.1109/LCOMM.2006.1613748

Construction of turbo code interleavers from 3-regular Hamiltonian graphs

Arya Mazumdar, A. K. Chaturvedi, Adrish Banerjee

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English (US)
Pages (from-to)	284-286
Number of pages	3
Journal	IEEE Communications Letters
Volume	10
Issue number	4
DOIs	https://doi.org/10.1109/LCOMM.2006.1613748
State	Published - Apr 2006
Externally published	Yes

Keywords

Hamiltonian cycle
Interleaver
Minimum distance
Regular graph
Summary distance
Turbo code

Publisher link

10.1109/LCOMM.2006.1613748

Find It

Find It at U of M Libraries

Cite this

@article{9f35b6a822a64d498e244a547b69f00c,

title = "Construction of turbo code interleavers from 3-regular Hamiltonian graphs",

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.",

keywords = "Hamiltonian cycle, Interleaver, Minimum distance, Regular graph, Summary distance, Turbo code",

author = "Arya Mazumdar and Chaturvedi, \{A. K.\} and Adrish Banerjee",

year = "2006",

month = apr,

doi = "10.1109/LCOMM.2006.1613748",

language = "English (US)",

volume = "10",

pages = "284--286",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Construction of turbo code interleavers from 3-regular Hamiltonian graphs

AU - Mazumdar, Arya

AU - Chaturvedi, A. K.

AU - Banerjee, Adrish

PY - 2006/4

Y1 - 2006/4

N2 - 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.

AB - 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.

KW - Hamiltonian cycle

KW - Interleaver

KW - Minimum distance

KW - Regular graph

KW - Summary distance

KW - Turbo code

UR - https://www.scopus.com/pages/publications/33645818372

UR - https://www.scopus.com/inward/citedby.url?scp=33645818372&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2006.1613748

DO - 10.1109/LCOMM.2006.1613748

M3 - Article

AN - SCOPUS:33645818372

SN - 1089-7798

VL - 10

SP - 284

EP - 286

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 4

ER -

Construction of turbo code interleavers from 3-regular Hamiltonian graphs

Abstract

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this