Error performance of serially concatenated space-time coding


Altunbas I. , Yongacoglu A.

JOURNAL OF COMMUNICATIONS AND NETWORKS, vol.5, no.2, pp.135-140, 2003 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 5 Issue: 2
  • Publication Date: 2003
  • Doi Number: 10.1109/jcn.2003.6596559
  • Title of Journal : JOURNAL OF COMMUNICATIONS AND NETWORKS
  • Page Numbers: pp.135-140

Abstract

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.