Transfer function bounds on performance of binary turbo-coding followed by M-ary orthogonal signal mapping through interleaver

Tomoaki Ohtsuki, Joseph M. Kahn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We obtain upper bounds on the bit-error rate (BER) for maximum-likelihood (ML) decoding of binary turbo-codes followed by M-ary orthogonal signal mapping through a uniform interleaven. We use the transfer function bounding techniques to obtain the above bounds. Thus, the upper bounds correspond to the average bound over all inter-leavers 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 for a given increase in interleaver length, the improvement in BER is larger for turbo-coded 4-ary orthogonal signals than for turbo-coded binary orthogonal signals. We also show that the coding gains of turbo code for M-ary orthogonal signals becomes smaller as M is increased when the block length N is short.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages623-627
Number of pages5
Volume2
Publication statusPublished - 2000
Externally publishedYes
Event2000 IEEE International Conference on Communications - New Orleans, LA, USA
Duration: 2000 Jun 182000 Jun 22

Other

Other2000 IEEE International Conference on Communications
CityNew Orleans, LA, USA
Period00/6/1800/6/22

Fingerprint

Turbo codes
Bit error rate
Transfer functions
Convolutional codes
Maximum likelihood
Decoding

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ohtsuki, T., & Kahn, J. M. (2000). Transfer function bounds on performance of binary turbo-coding followed by M-ary orthogonal signal mapping through interleaver. In IEEE International Conference on Communications (Vol. 2, pp. 623-627)

Transfer function bounds on performance of binary turbo-coding followed by M-ary orthogonal signal mapping through interleaver. / Ohtsuki, Tomoaki; Kahn, Joseph M.

IEEE International Conference on Communications. Vol. 2 2000. p. 623-627.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ohtsuki, T & Kahn, JM 2000, Transfer function bounds on performance of binary turbo-coding followed by M-ary orthogonal signal mapping through interleaver. in IEEE International Conference on Communications. vol. 2, pp. 623-627, 2000 IEEE International Conference on Communications, New Orleans, LA, USA, 00/6/18.
Ohtsuki, Tomoaki ; Kahn, Joseph M. / Transfer function bounds on performance of binary turbo-coding followed by M-ary orthogonal signal mapping through interleaver. IEEE International Conference on Communications. Vol. 2 2000. pp. 623-627
@inproceedings{af40732ad5cd4a268f69efd8ab70c076,
title = "Transfer function bounds on performance of binary turbo-coding followed by M-ary orthogonal signal mapping through interleaver",
abstract = "We obtain upper bounds on the bit-error rate (BER) for maximum-likelihood (ML) decoding of binary turbo-codes followed by M-ary orthogonal signal mapping through a uniform interleaven. We use the transfer function bounding techniques to obtain the above bounds. Thus, the upper bounds correspond to the average bound over all inter-leavers 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 for a given increase in interleaver length, the improvement in BER is larger for turbo-coded 4-ary orthogonal signals than for turbo-coded binary orthogonal signals. We also show that the coding gains of turbo code for M-ary orthogonal signals becomes smaller as M is increased when the block length N is short.",
author = "Tomoaki Ohtsuki and Kahn, {Joseph M.}",
year = "2000",
language = "English",
volume = "2",
pages = "623--627",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Transfer function bounds on performance of binary turbo-coding followed by M-ary orthogonal signal mapping through interleaver

AU - Ohtsuki, Tomoaki

AU - Kahn, Joseph M.

PY - 2000

Y1 - 2000

N2 - We obtain upper bounds on the bit-error rate (BER) for maximum-likelihood (ML) decoding of binary turbo-codes followed by M-ary orthogonal signal mapping through a uniform interleaven. We use the transfer function bounding techniques to obtain the above bounds. Thus, the upper bounds correspond to the average bound over all inter-leavers 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 for a given increase in interleaver length, the improvement in BER is larger for turbo-coded 4-ary orthogonal signals than for turbo-coded binary orthogonal signals. We also show that the coding gains of turbo code for M-ary orthogonal signals becomes smaller as M is increased when the block length N is short.

AB - We obtain upper bounds on the bit-error rate (BER) for maximum-likelihood (ML) decoding of binary turbo-codes followed by M-ary orthogonal signal mapping through a uniform interleaven. We use the transfer function bounding techniques to obtain the above bounds. Thus, the upper bounds correspond to the average bound over all inter-leavers 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 for a given increase in interleaver length, the improvement in BER is larger for turbo-coded 4-ary orthogonal signals than for turbo-coded binary orthogonal signals. We also show that the coding gains of turbo code for M-ary orthogonal signals becomes smaller as M is increased when the block length N is short.

UR - http://www.scopus.com/inward/record.url?scp=0033725744&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033725744&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 623

EP - 627

BT - IEEE International Conference on Communications

ER -