A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codewords bits, and an inner encoder whose input words are the permuted outer codewords. The construction can be generalized to h cascaded encoders separated by h-1 interleavers. We obtain upper bounds to the average maximum-likelihood bit error probability of serially concatenated block and convolutional coding schemes. Then, we derive design guidelines for the outer and inner encoders that maximize the interleaver gain and the asymptotic slope of the error probability curves. Finally, we propose a new, low-complexity iterative decoding algorithm. Throughout the paper, extensive comparisons with parallel concatenated convolutional codes known as “turbo codes” are performed, showing that the new scheme can offer superior performance.
Serial concatenations of interleaved codes: performance analysis, design and iterative decoding / BENEDETTO S.; DIVSALAR D.; MONTORSI G.; POLLARA F.. - In: IEEE TRANSACTIONS ON INFORMATION THEORY. - ISSN 0018-9448. - 44:3(1998), pp. 909-926.
|Titolo:||Serial concatenations of interleaved codes: performance analysis, design and iterative decoding|
|Data di pubblicazione:||1998|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1109/18.669119|
|Appare nelle tipologie:||1.1 Articolo in rivista|