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

Tomoaki Ohtsuki, Joseph M. Kahn

研究成果: Paper

4 被引用数 (Scopus)

抄録

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 182000 6 22

Other

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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

フィンガープリント 「Transfer function bounds on performance of binary turbo-coding followed by M-ary orthogonal signal mapping through interleaver」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル