Capacity-approaching irregular turbo codes for the binary erasure channel

Authors:
Ghassan M. Kraidy;Valentin Savin
Affiliations:
Department of Electronics and Telecommunications, Norwegian University of Science and Technology, Trondheim, Norway and CEA, LETI, MINATEC, Grenoble, France;CEA, LETI, MINATEC, Grenoble Cedex 9, France
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 16
Cited 0

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
An algorithm for identifying rate (n-1)/n catastrophic punctured convolutional encoders

IEEE Transactions on Information Theory
Efficient erasure correcting codes

IEEE Transactions on Information Theory
Improved low-density parity-check codes using irregular graphs

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
A logarithmic upper bound on the minimum distance of turbo codes

IEEE Transactions on Information Theory
A new upper bound on the minimum distance of turbo codes

IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
Capacity-achieving ensembles for the binary erasure channel with bounded complexity

IEEE Transactions on Information Theory
On the stopping distance and the stopping redundancy of codes

IEEE Transactions on Information Theory
On quasi-cyclic interleavers for parallel turbo codes

IEEE Transactions on Information Theory
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets

IEEE Transactions on Information Theory
Turbo Codes in Binary Erasure Channel

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a class of irregular turbo codes that approach the capacity of the binary erasure channel. First, an analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This expression will then be used to study the density evolution of turbo codes over the binary erasure channel, that will allow for the design of capacity-approaching infinite-length irregular turbo codes. Next, a graph-optimal interleaver for finite-length irregular turbo codes is proposed. Finally, simulation results for different coding rates are shown.