Irregular turbo code design for the binary erasure channel

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.

• Publication year

  2008

• Venue

  2008 5th International Symposium on Turbo Codes and Related Topics

• Publication date

  2008-04-03

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/TURBOCODING.2008.4658711arXiv 0804.0539
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Raptor codes

  2011cited by this paper
• Minimum-delay decoding of turbo codes for upper-layer FEC

  2008cited by this paper
• Near Optimum Error Correcting Coding and Decoding: TurboCodes

  2007cited by this paper
• On the performance of turbo codes over the binary erasure channel

  2007cited by this paper
• Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets

  2006cited by this paper
• Regular and irregular progressive edge-growth tanner graphs

  2005influential reference
• Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces

  2004cited by this paper
• Capacity-achieving ensembles for the binary erasure channel with bounded complexity

  2004cited by this paper
• Capacity-achieving ensembles for the binary erasure channel with bounded complexity

  2004cited by this paper
• A logarithmic upper bound on the minimum distance of turbo codes

  2004cited by this paper
• Analysis of convolutional codes on the erasure channel

  2004cited by this paper
• Further analytic properties of exit-like curves and applications

  2003cited by this paper
• Exact probability of erasure and a decoding algorithm for convolutional codes on the binary erasure channel

  2003cited by this paper
• Turbo code at 0.03 dB from capacity limit

  2002cited by this paper
• Stopping sets and the girth of Tanner graphs

  2002cited by this paper
• LT codes

  2002cited by this paper
• Finite-length analysis of low-density parity-check codes on the binary erasure channel

  2002cited by this paper
• On the construction of turbo code interleavers based on graphs with large girth

  2002cited by this paper
• Convergence behavior of iteratively decoded parallel concatenated codes

  2001cited by this paper
• Design of capacity-approaching irregular low-density parity-check codes

  2001cited by this paper
• Efficient erasure correcting codes

  2001cited by this paper
• Improved low-density parity-check codes using irregular graphs and belief propagation

  1998cited by this paper
• Practical loss-resilient codes

  1997cited by this paper
• Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces

  1997cited by this paper
• Near optimum error correcting coding and decoding: turbo-codes

  1996cited by this paper
• Codes and Decoding on General Graphs

  1996cited by this paper
• Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

  1974cited by this paper
• Optimal decoding of linear codes for minimizing symbol error rate

  1974cited by this paper
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

  1967cited by this paper
• Low-density parity-check codes

  1962cited by this paper

• Capacity Approaching Coding Strategies for Machine-to-Machine Communication in IoT Networks

  2016cites this paper