Error performance of serially concatenated space-time coding

Altunbas I. , Yongacoglu A.

JOURNAL OF COMMUNICATIONS AND NETWORKS, cilt.5, sa.2, ss.135-140, 2003 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 5 Konu: 2
  • Basım Tarihi: 2003
  • Doi Numarası: 10.1109/jcn.2003.6596559
  • Sayfa Sayıları: ss.135-140


In this paper, we investigate the error performance of a serially concatenated system using a nonrecursive convolutional code as the outer code and a recursive QPSK space-time trellis code as the inner code on quasi-static and rapid Rayleigh fading channels. At the receiver, we consider iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is shown that better error performance can be obtained by using low complexity outer and/or inner codes and the Euclidean distance criterion based recursive space-time inner codes. We also obtain new systems with large number of trasmit and/or receive antennas providing good error performance.