Genetic Algorithms for Turbo Codes

This paper proposes a scheme for introducing genetic algorithms (GA) into the turbo code structure to enable the systematic data to be discarded at the encoder and reconstructed at the decoder. The scheme enables code rates of frac12 to be achieved without puncturing the parity data. The paper also shows that the speed of convergence of GAs, when implemented in the proposed structure, can be used to reduce the computational overhead involved in the turbo decoder

[1]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[2]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[3]  Luke Hebbes Turbo codes for real-time applications , 2004 .

[4]  Alister G. Burr Turbo-codes: the ultimate error control codes? , 2001 .

[5]  L. Hebbes,et al.  Computational complexities and the relative performance of turbo codes , 2001, EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439).

[6]  Andre LaMothe,et al.  Tricks of the Windows Game Programming Gurus , 1999 .