Design of Robust Turbo Code Interleaver by Differential Evolution and Genetic Algorithms

V. Glory, Ch.Ravi Kumar, Dr.K.Padma Raju


These Since their appearance in 1993, first approaching the Shannon limit, turbo codes gave a new direction in the channel encoding field, especially since they have been adopted for multiple telecommunication norms. To obtain good performance, it is necessary to design a robust turbo code interleaver and the code rate. Compared to 1/3 Code rate 2/3 coder has less redundancy. So in this project we are using the code rate of 2/3. This paper proposes a  differential evolution approach to find above average turbo code interleavers. Performance is compared with the conventional genetic algorithm approach and the empirical results illustrate that DE performs well.


BER, convolutional code capacity, evolutionary algprithms(EA), free distance, non trivial optimization problems, optimal code, random keys encoding, rate.


A.Burr “Turbo-codes: the ultimate error control codes?,” in Electronic & Communication Engineering Journal, vol. 13, pp. 155–165, IEEE, August 2001. ISSN: 0954-0695.

C.Berrou, A.Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: turbo codes,” in Proc. Int. Conf. on Commun., pp. 1064–1070, 1993.

J. Hokfelt and T. Maseng, “Methodical interleaver design for turbo codes,” International Symposium on Turbo Codes, 1997.

R. Garello, F. Chiaraluce, P. Pierleoni, M. Scaloni, and S. Benedetto, “On error floor and free distance of turbo codes,” in IEEE International Conference on Communications (ICC 2001), vol. 1, pp. 45–49, 2001. ISBN 0-7803-7097-1.

M. Dianati, I. Song, and M. Treiber, “An introduction to genetic algorithms and evolution strategies,” technical report, University of Waterloo, Ontario, N2L 3G1, Canada, July 2002.

U. Bodenhofer, “Genetic Algorithms: Theory and Applications,” lecture notes, Fuzzy Logic Laboratorium Linz-Hagenberg, Winter 2003/2004.

M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA: MIT Press, 1996.

G. Jones, “Genetic and evolutionary algorithms,” in Encyclopedia of Computational Chemistry (P. von Rague, ed.), John Wiley and Sons, 1998.

N. Durand, J. Alliot, and B. Bartolomé, “Turbo codes optimization using genetic algorithms,” in Proceedings of the Congress on Evolutionary Computation (P. J. Angeline, Z. Michalewicz, M. Schoenauer, X. Yao, and A. Zalzala, eds.), vol. 2, (Mayflower Hotel, Washington D.C., USA), pp. 816– 822, IEEE Press, 6-9 1999.

S. Rekh, S. Rani, W. Hordijk, P. Gift, and Shanmugam, “Design of an interleaver for turbo codes using genetic algorithms,” The International Journal of Artificial Intelligence and Machine Learning, vol. 6, pp. 1–5, 2006.

A. S. Wu, R. K. Lindsay, and R. Riolo, “Empirical observations on the roles of crossover and mutation,” in Proc. of the Seventh Int. Conf. on Genetic Algorithms (T. Bäck, ed.), (San Francisco, CA), pp. 362–369, Morgan Kaufmann, 1997.

L. V. Snyder and M. S. Daskin, “A random-key genetic algorithm for the generalized traveling salesman problem,” European Journal of Operational Research, vol. 174, no. 1, pp. 38–53, 2006.

K. V. Price, R. M. Storn, and J. A. Lampinen, Differential Evolution A Practical Approach to Global Optimization. Natural Computing Series, Berlin,

Full Text: PDF


  • There are currently no refbacks.


All Rights Reserved © 2012 IJARCSEE

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.