Performance of serially concatenated space-time QPSK systems

Ibrahim Altunbas, Abbas Yongacoglu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

In this paper, error performance of a serially concatenated QPSK space-time system is investigated on quasi-static, block and rapid fading channels. We consider outer nonrecursive convolutional and inner recursive space-time trellis code case and iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is observed that when the recursive versions of some of the previously known space-time trellis codes are used as the inner codes, the Euclidean distance criterion based spaced-time codes lead to better error performance for both quasi-static and rapid fading channels. We also investigate the effects of various system parameters on the performance. We obtain the error performance for the large number of transmit and/or receive antennas increases the error performance improves.

Original languageEnglish
Title of host publicationProceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003
Pages271-276
Number of pages6
DOIs
Publication statusPublished - 2003
Event8th IEEE International Symposium on Computers and Communication, ISCC 2003 - Kemer-Antalya, Turkey
Duration: 30 Jun 20033 Jul 2003

Publication series

NameProceedings - IEEE Symposium on Computers and Communications
ISSN (Print)1530-1346

Conference

Conference8th IEEE International Symposium on Computers and Communication, ISCC 2003
Country/TerritoryTurkey
CityKemer-Antalya
Period30/06/033/07/03

Fingerprint

Dive into the research topics of 'Performance of serially concatenated space-time QPSK systems'. Together they form a unique fingerprint.

Cite this