Name
Abstract | ||
|---|---|---|
parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the first encoder are scrambled by the interleaver before entering the second encoder. The codewords of the parallel concatenated code consist of the information bits followed by the parity check bits of both encoders. Parallel concatenated codes (turbo codes), decoded through an iterative decoding algorithm of relatively low complexity, have recently been shown to yield remarkable coding gains close to theoretical limits. In this paper, we characterize the separate contributions that the interleaver length and constituent codes give to the overall performance of the parallel concatenated code, and present some guidelines for the optimal design of the constituent convolutional codes. Zndex Terms- Iterative decoding, concatenated codes, turbo codes. range of results that help to understand this new coding scheme. In this paper, we will show how the interleaver and the constituent codes (CC's) contribute to the good performance of PCCC's and propose design guidelines to find "optimum" CC for a given memory. We will define a new parameter, called efSective free distance, that strongly influences the performance of a PCCC, show how to maximize it and give a table of the best rate-1/2 CC's with number of states ranging from 2-32. The optimization criterion is the minimization of the bit error probability. In Section 11, we will briefly recall the results from (6) that are necessary to understand what follows. In Section 111, we will prove that in order to achieve large interleaver gains, PCCC's need recursive convolutional encoders. Section IV shows analytically, and with the support of simulations, that PCCC performance is strictly related to the effective free distance of the CC's, and presents a theorem on how to obtain a large value for it. The results are then applied to find the "best" CC and to present bit error probability bounds for the optimized PCCC. Finally, a summary of the main results of the paper will be presented in Section V. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/26.494303 | IEEE Transactions on Communications |
Keywords | Field | DocType |
concatenated codes,convolutional codes,decoding,interleaved codes,iterative methods,optimisation,codewords,coding gains,convolutional codes design,convolutional encoders,information bits,interleaver length,iterative decoding algorithm,low complexity algorithm,optimal design,parallel concatenated convolutional codes,parity check bits,performance,turbo codes | Parity bit,Concatenated error correction code,Convolutional code,Computer science,Turbo code,Serial concatenated convolutional codes,Algorithm,Electronic engineering,Theoretical computer science,Linear code,Encoder,Decoding methods | Journal |
Volume | Issue | ISSN |
44 | 5 | 0090-6778 |
Citations | PageRank | References |
158 | 55.82 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Benedetto | 1 | 883 | 167.24 |
| Guido Montorsi | 2 | 1032 | 179.05 |