DMCA
Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes (1995)
Cached
Download Links
- [ftp.tlc.polito.it]
- [www.ima.umn.edu]
- [www.tlc.polito.it]
- [www.tlc.polito.it]
- DBLP
Other Repositories/Bibliography
| Citations: | 314 - 6 self |
BibTeX
@MISC{Benedetto95unveilingturbo,
author = {Sergio Benedetto and Guido Montorsi},
title = {Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
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 recently 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 s...
Keyphrases
turbo code constituent code parallel concatenated coding scheme input bit first encoder analytical bounding technique iterative decoding algorithm convolutional code second encoder bit error probability scheme consists simple constituent systematic encoders theoretical limit parallel concatenated code upper bound parity check bit
