Evolutionary Algorithm Aided Interleaver Design for Serially Concatenated Codes

Previous interleavers designed for Serially Concatenated Codes (SCCs) have achieved a limited Minimum Hamming Distance (MHD) between the legitimate permutations of the encoded bit sequence. Hence, we propose a novel Evolutionary Algorithm (EA) capable of designing improved interleavers for SCCs, without artificially limiting the achievable MHD. As a result, increased MHDs and therefore reduced error floors are achieved, even if only a modest EA complexity can be afforded.

[1]  Marco Breiling.  Analysis and design of turbo code interleavers , 2002 .

[2]  Lajos Hanzo,et al.  Iterative Decoding Convergence and Termination of Serially Concatenated Codes , 2010, IEEE Transactions on Vehicular Technology.

[3]  Luc Vandendorpe,et al.  Design and performance analysis of joint source-channel turbo schemes with variable length codes , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[4]  Marie-Laure Boucheret,et al.  Interleaver design for serial concatenated convolutional codes , 2004, IEEE Communications Letters.

[5]  Michael Tuchler,et al.  EXIT charts of irregular codes , 2002 .

[6]  Norbert Goertz,et al.  The turbo principle in joint source-channel coding , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[7]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[8]  Branka Vucetic,et al.  Recent Advances in Turbo Code Design and Theory , 2007, Proceedings of the IEEE.

[9]  Shlomo Shamai,et al.  Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial , 2006, Found. Trends Commun. Inf. Theory.

[10]  Jörg Kliewer,et al.  On the achievable extrinsic information of inner decoders in serial concatenation , 2006, 2006 IEEE International Symposium on Information Theory.

[11]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

[12]  Fred Daneshgaran,et al.  An Efficient Algorithm for Obtaining the Distance Spectrum of Turbo Codes , 1997 .

[13]  Thomas L. Sterling,et al.  BEOWULF: A Parallel Workstation for Scientific Computation , 1995, ICPP.

[14]  N. Wehn,et al.  Macro Interleaver Design for Bit Interleaved Coded Modulation with Low-Density Parity-Check Codes , 2008, VTC Spring 2008 - IEEE Vehicular Technology Conference.

[15]  Sergio Benedetto,et al.  Iterative decoding of serially concatenated convolutional codes , 1996 .

[16]  Branka Vucetic,et al.  A code-matched interleaver design for turbo codes , 2002, IEEE Trans. Commun..

[17]  Roberto Garello,et al.  Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications , 2001, IEEE J. Sel. Areas Commun..

[18]  Lajos Hanzo,et al.  Quadrature Amplitude Modulation , 2011 .

[19]  Ali Ghrayeb,et al.  Improved interleaver design for turbo coded intersymbol interference channels , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).