Near optimum error correcting coding and decoding: turbo-codes

  title={Near optimum error correcting coding and decoding: turbo-codes},
  author={Claude Berrou and Alain Glavieux},
  journal={IEEE Trans. Commun.},
This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving. Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic information. For sufficiently large interleaving sizes, the correcting performance of turbo-codes, investigated by… 

Figures from this paper

A Review on Punctured Analysis of Turbo codes
The desired turbo coding rates are provided providing methods using the puncturing process and also the effect of this process on BER.
Improvements in Turbo Decoding
The implementation principle of turbo codes is extended and an encoder is used, which uses one additional recursive systematic convolutional (RSC) encoder and an interleaver, and it is shown that this multiple turbo code performs better than the standard turbo code.
Iterative Decoding of Turbo Codes
This paper presents a study of turbo codes as an error-control Code and the software implementation of two different decoders, namely the Maximum a Posteriori (MAP), and soft- Output Viterbi Algorithm (SOVA) decmoders, which are compared to have less complexity and which can produce better performance.
Predictions on Turbo-Decoding Performance for Adaptive Channel Coding
The proposed method enables the determination of the error- free decoding threshold and of the number of iterations to achieve error-free decoding and offers an accuracy close to that of EXIT charts.
Capacity-Approaching Irregular Turbo Codes for the Binary Erasure Channel
An analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived and 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 infinite-length irregular turbo codes.
Multifold turbo codes
The multifold turbo coding, designed to provide multiple extrinsic estimates and LLRs on a bit basis during decoding iterations, is introduced to bring the weight distribution closer to the binomial distribution of a random code.
Performance Evaluation of Interleavers for Turbo Codes
  • Shridhar B. Devamane, R. Itagi
  • Computer Science
    2018 International Conference on Electrical, Electronics, Communication, Computer, and Optimization Techniques (ICEECCOT)
  • 2018
Evaluated the effectiveness of Block, Helical and Random interleaver with their performance analysis of turbo code performance.
Minimum-delay decoding of turbo codes for upper-layer FEC
  • G. Kraidy, V. Savin
  • Computer Science
    2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications
  • 2008
The proposed algorithm performs ldquoon-the-flyrdquo decoding, i.e. it starts decoding as soon as the first symbols are received, in that it propagates in the trellises of the turbo code by removing transitions in the same way edges are removed in a bipartite graph under message-passing decoding.
Design and performance of turbo Gallager codes
  • G. Colavolpe
  • Computer Science
    IEEE Transactions on Communications
  • 2004
With properly chosen component convolutional codes, a turbo code can be successfully decoded by means of the decoding algorithm used for LDPC codes, i.e., the belief-propagation algorithm working on the code Tanner graph.
An Iterative, Turbo-like Approach to Convolutional Decoding
The method is based on the Turbo principle which was originally proposed to decode parallel concatenated convolutional codes and shows that each iteration can improve the decoding performance while the original BCJR algorithm marks the upper limit.


Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder is built using a
Near optimum decoding of product codes
A new iterative decoding algorithm for product codes (block) based on soft decoding and soft decision output of the component codes is described in the paper, attractive for digital transmission systems requiring powerful coding schemes with a high code rate.
Separable MAP "filters" for the decoding of product and concatenated codes
The decoding of multidimensional product codes, using separable symbol-by-symbol maximum a posteriori filters, and the extension of the concept to concatenated convolutional codes is given and some simulation results are presented.
Convolutional Codes and Their Performance in Communication Systems
This tutorial paper begins with an elementary presentation of the fundamental properties and structure of convolutional codes and proceeds with the development of the maximum likelihood decoder, which yields for arbitrary codes both the distance properties and upper bounds on the bit error probability.
A Simplification of the Modified Bahl Decoding Algorithm for Systematic Convolutional Codes
A soft-in/soft-out algorithm which estimates the a posteriori probabilities for each transmitted bit is investigated and has the advantage of providing the APP for each decoded bit.
Iterative correction of intersymbol interference: Turbo-equalization
The results obtained show that turbo-equalization manages to overcome multipath effects, totally on Gauss channels, and partially but still satisfactorily on Rayleigh channels.
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.
Channel coding with multilevel/phase signals
A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel coding with expanded
Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.)
The structure of punctured convolutional cedes is described, and it is indicated how their use simplifies the design of maximum likelihood decoders. The best codes of this class for rates 2/3 and 3/4
High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding
The high-rate punctured codes of rates 2/3 through 13/14 are derived from rate 1/2 specific convolutional codes with maximal free distance based on their bit error rate performances under soft decision Viterbi decoding.