ویراساینس.
سند علمی

Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs

Arya Mazumdar, A K Chaturvedi, Adrish Banerjee

چکیده

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.

اسناد مشابه

  • On the construction of turbo code interleavers based on graphs with large girth

    سند علمی۲۰۰۲ICCPascal O. Vontobel

    We discuss how interleavers for parallel concatenated turbo codes with good minimum distance can be derived from graphs having large girth, i.e. graphs whose length of the shortest cycle is large.

  • Construction of turbo code interleavers from 3-regular hamiltonian graphs

    مقاله‌ی دسترسی آزاد۲۰۰۶IEEE Communications LettersA.Mazumdar, A.K.Chaturvedi, A.Banerjee

  • Non-Binary Turbo Codes Interleavers

    سند علمی۲۰۰۵Maria KOVACI, Horia BALTA

    In this paper the particularities of the interleavers used in the case of the Recursive Systematic Convolutional Code (RSC), n/(n+2) rate, with n=2, unpunctured non-binary turbo codes (NBTC) were described. The interleavers: block, pseudo-random and new interleaving methods are p

  • Ber Analysis of Turbo Code Interleaver

    سند علمی۲۰۱۵Prabhavati D. Bahirgonde, Shantanu K. Dixit, Yang Sun, Joseph R. Cavallaro

    This paper presents a low complexity interleaver design that facilitates high throughput Turbo decoding required for next generation wireless systems. When a parallel decoder structure is considered, interleaver design is the most important issue. In such parallel decoder, the co

  • Construction schemes for fault-tolerant Hamiltonian graphs

    سند علمی۲۰۰۰NetworksJeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu

    In this paper, we present three construction schemes for fault-tolerant Hamiltonian graphs. We show that applying these construction schemes on fault-tolerant Hamiltonian graphs generates graphs preserving the original Hamiltonicity property. We apply these construction schemes t

  • Ber Analysis of Turbo Code Interleaver

    مقاله‌ی دسترسی آزاد۲۰۱۵International Journal of Computer ApplicationsPrabhavatiD., ShantanuK.