Title :
Irregular turbo code design for the binary erasure channel
Author :
Kraidy, Ghassan M. ; Savin, Valentin
Author_Institution :
CEA-LETI, MINATEC, Grenoble
Abstract :
In this paper, the design of irregular turbo codes for the binary erasure channel is investigated. An analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This expression will be used to study the density evolution of turbo codes over the binary erasure channel, that will allow for the design of capacity-approaching irregular turbo codes. Next, we propose a graph-optimal interleaver for irregular turbo codes. Simulation results for different coding rates are shown at the end.
Keywords :
binary codes; convolutional codes; probability; turbo codes; binary erasure channel; capacity-approaching irregular turbo codes; coding rates; erasure probability; irregular turbo code design; punctured recursive systematic convolutional code; Channel capacity; Convolutional codes; Error correction codes; Gaussian channels; Iterative decoding; Parity check codes; Performance analysis; Protection; Tree graphs; Turbo codes;
Conference_Titel :
Turbo Codes and Related Topics, 2008 5th International Symposium on
Conference_Location :
Lausanne
Print_ISBN :
978-1-4244-2862-5
Electronic_ISBN :
978-1-4244-2863-2
DOI :
10.1109/TURBOCODING.2008.4658711
