Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs

Details Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs

2005-12-23

arxiv.org/abs/cs/0512093v1

IEEE Communications Letters, pp. 284-286, Vol. 10, Issue 4, April, 2006.

Computer Science

Information Theory

This paper has been accepted for publication in IEEE Communication Letters

Scientific paper

10.1109/LCOMM.2006.04013

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.

Affiliated with

Also associated with

No associations

Rating

Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149685