## 抄録

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.

本文言語 | English |
---|---|

ページ | 623-627 |

ページ数 | 5 |

出版ステータス | Published - 2000 12月 3 |

外部発表 | はい |

イベント | 2000 IEEE International Conference on Communications - New Orleans, LA, USA 継続期間: 2000 6月 18 → 2000 6月 22 |

### Other

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

City | New Orleans, LA, USA |

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

## ASJC Scopus subject areas

- コンピュータ ネットワークおよび通信
- 電子工学および電気工学