Selection of component codes for asymmetric turbo codes matched to QPP interleaver

This paper proposes a new selection algorithm for the generator polynomials of the component convolutional codes matched to an imposed interleaver. The algorithm leads to better performances than the existing ones for high SNR values. We illustrate this fact by simulation with polynomials for memory...

Full description

Saved in:
Bibliographic Details
Published in2010 8th International Conference on Communications pp. 203 - 206
Main Authors Cojocariu, Elena, Trifina, Lucian, Lazar, Alexandru Georgian
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
AWGN
Bit error rate
Concatenated codes
Convolutional codes
Garello's algorithm
Information technology
Iterative algorithms
Iterative decoding
Polynomials
QPP interleaver
turbo code
Turbo codes
Upper bound
Online AccessGet full text

Cover

More Information
Summary:This paper proposes a new selection algorithm for the generator polynomials of the component convolutional codes matched to an imposed interleaver. The algorithm leads to better performances than the existing ones for high SNR values. We illustrate this fact by simulation with polynomials for memory orders 3 with length of 40 and a QPP interleaver.
ISBN:1424463602
9781424463602
DOI:10.1109/ICCOMM.2010.5509004