Unveiling turbo codes: some results on parallel concatenated coding schemes
- 1 March 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (2) , 409-428
- https://doi.org/10.1109/18.485713
Abstract
A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the first encoder followed by the parity check bits of both encoders. This construction can be generalized to any number of constituent codes. Parallel concatenated schemes employing two convolutional codes as constituent codes, in connection with an iterative decoding algorithm of complexity comparable to that of the constituent codes, have been previously shown to yield remarkable coding gains close to theoretical limits. They have been named, and are known as, “turbo codes”. We propose a method to evaluate an upper bound to the bit error probability of a parallel concatenated coding scheme averaged over all interleavers of a given length. The analytical bounding technique is then used to shed some light on some crucial questions, which have been floating around in the communications community since the proposal of turbo codesKeywords
This publication has 18 references indexed in Scilit:
- A Viterbi algorithm with soft-decision outputs and its applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A low complexity soft-output Viterbi decoder architecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Separable MAP "filters" for the decoding of product and concatenated codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Near optimum decoding of product codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Turbo codes for PCS applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Dependence of the error performance of turbo-codesonthe interleaver structure in short frame transmission systemsElectronics Letters, 1994
- Performance evaluation of turbo codes for shortframetransmission systemsElectronics Letters, 1994
- Certain generalizations of concatenated codes--Exponential error bounds and decoding complexityIEEE Transactions on Information Theory, 1980
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974