By Topic

Transfer function bounds on performance of turbo codes for M-ary orthogonal signals

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ohtsuki, T. ; Dept. of Electr. Eng., Sci. Univ. of Tokyo, Japan ; Kahn, J.M.

We obtain upper bounds on the bit-error rate (BER) for maximum-likelihood (ML) decoding of turbo codes constructed with uniform interleavers for M-ary orthogonal signals. We use transfer function bounding techniques to obtain the above bounds. Thus, the upper bounds result in the average bound over all interleavers of a given length. We apply the techniques to parallel concatenated coding (PCC) schemes where recursive convolutional codes are used as constituent codes. We present the average bounds on the BER of turbo codes with constraint length 3 for M-ary orthogonal signals on additive white Gaussian noise (AWGN) channels. We show that the performance advantage of turbo-coded 4-ary orthogonal signals over turbo-coded binary orthogonal signals is smaller than the performance advantage in the absence of coding, which is 3.0 dB

Published in:

Global Telecommunications Conference, 1999. GLOBECOM '99  (Volume:1A )

Date of Conference:

1999