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

Performance Study of Turbo Code with Interleaver Design

Mojaiana Synthia, Md. Shipon Ali

چکیده

This paper begins with an investigation of the optimization of binary turbo code through good interleaver design. For this purpose, different types of interleaver have designed here and have evaluated their performance. Basically the performances of the turbo code using block interleaver, helical interleaver, random interleaver and odd-even interleaver have evaluated. From this investigation it has been seen that for small code length the performance of the block interleaver is superior in non-puncturing case and the performance of the odd-even interleaver is superior in puncturing case, but for large code length the performance of the random interleaver is better in both of puncturing and non-puncturing condition. In this paper, it has investigated that the performance of the odd-even interleaver (block interleaver with odd number of rows and columns) significantly increased in puncturing conditions.

اسناد مشابه

  • 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 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 hig

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

  • Space-Time Turbo Coded Modulation: Design and Applications

    سند علمی۲۰۰۲EURASIP J. Adv. Sig. Proc.Djordje Tujkovic, Markku J. Juntti, Matti Latva-aho

    A design method for recursive space-time trellis codes and parallel-concatenated space-time turbo coded modulation is proposed that can be applied to an arbitrary existing space-time trellis code. The method enables a large, systematic increase in coding gain while preserving the

  • Ber Analysis of Turbo Code Interleaver

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