Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1

@article{Berrou1993NearSL,
  title={Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1},
  author={C. Berrou and A. Glavieux and P. Thitimajshima},
  journal={Proceedings of ICC '93 - IEEE International Conference on Communications},
  year={1993},
  volume={2},
  pages={1064-1070 vol.2}
}
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 parallel concatenation of two recursive systematic convolutional codes, and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders.<<ETX>> 
Near optimum error correcting coding and decoding: turbo-codes
TLDR
A new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving appears to be close to the theoretical limit predicted by Shannon. Expand
Joint source and channel coding using turbo codes over rings
TLDR
This work presents a new turbo coding scheme where the component codes are convolutional codes (CCs) over the ring of integers modulo M, with M being the alphabet size of the source encoder. Expand
An IC for turbo-codes encoding and decoding
TLDR
A turbo-code is the parallel concatenation of two recursive systematic convolutional codes separated by a non-uniform interleaving, made up of 2 soft-output Viterbi algorithm decoders, interleaved modules, some delay lines, and a synchronization block that also features supervision functions. Expand
Factor graphs based iterative decoding of turbo codes
TLDR
A new scheme based on factor graphs and sum-product algorithm is developed that can reduce the decoding complexity of turbo codes greatly, and also has some guides in the designing of interleaver and the choosing of recursive systematic convolutional (RSC) constituent codes. Expand
Threshold decoding of turbo-codes
The idea of iterative decoding of two-dimensional systematic convolutional codes-so-called turbo-codes-is extended to threshold decoding, which is presented in "soft-in/soft-out" form. TheExpand
Low Power Design of near Shannon Limit Coding: Turbo Codes
In this paper secure channel coding schemes based on Turbo Codes are suggested and implemented. The design of encoder using Recursive Systematic Code (RSC) with puncturing techniques is presented.Expand
Combining variable length codes and turbo codes
  • K. Lakovic, J. Villasenor
  • Computer Science
  • Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367)
  • 2002
TLDR
An iterative joint source-channel decoder is designed, which exhibits decoding convergence at a low signal-to-noise ratio (SNR) and exhibits superior performance at all SNR levels, relative to a standard system that involves turbo codes and Huffman codes. Expand
On list sequence turbo decoding
TLDR
An algorithm for decoding Turbo codes that combines conventional Turbo decoding and list sequence maximum a posteriori probability decoding is presented and evaluated and performance improvements in the order of 0.7 dB are obtained. Expand
AN ANALYTICAL PERFORMANCE BOUNDS OF NON-SYSTEMATIC PUNCTURED PARALLEL CONCATENATED CODES
TLDR
An analytical performance bound for high rate parallel concatenated turbo codes is derived based on random puncturing of non-systematic bits of low rate turbo codes. Expand
Error-Correcting Codes
TLDR
In Chapter 4, several prevailing error-correcting codes and their decoding strategies are covered and soft-input soft-output iterative decoding. Expand
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
TLDR
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. Expand
A low complexity soft-output Viterbi decoder architecture
TLDR
A means to adapt the classical architecture of a Viterbi decoder to make it able to provide soft (weighted) decisions is presented and an application to the decoding of concatenated convolutional codes, with the proposed soft-output decoder as the inner decoder is examined. Expand