### 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 language | English |
---|---|

Title of host publication | IEEE International Conference on Communications |

Pages | 623-627 |

Number of pages | 5 |

Volume | 2 |

Publication status | Published - 2000 |

Externally published | Yes |

Event | 2000 IEEE International Conference on Communications - New Orleans, LA, USA Duration: 2000 Jun 18 → 2000 Jun 22 |

### Other

Other | 2000 IEEE International Conference on Communications |
---|---|

City | New Orleans, LA, USA |

Period | 00/6/18 → 00/6/22 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Conference on Communications.*vol. 2, pp. 623-627, 2000 IEEE International Conference on Communications, New Orleans, LA, USA, 00/6/18.

}

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 -