Design of space-time turbo TCM on fading channels

Jinhong Yuan, Branka Vucetic, Zhuo Chen, Welly Firmanto

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

3 Citations (Scopus)

Abstract

Novel code design criteria for space-time codes on slow Rayleigh fading channels are presented. It is shown that the code performance is dominated by the minimum rank r and the minimum determinant of the codeword distance matrix when the product of the minimum rank r and the number of receive antennas n(R) is less than 4, which is consistent with the design criteria derived in [1]. However, when r . n(R) is greater than or equal to 4, the code error performance is dominated by the minimum trace of the codeword distance matrix. Furthermore, we present recursive space-time trellis coded modulation (STTC) which outperform feedforward STTC proposed in [1], [3] on slow and fast fading channels. A substantial increase in performance can be obtained by constructing spacetime turbo trellis coded modulation (ST turbo TCM) which consists of concatenated recursive STTC, decoded by iterative decoding algorithm. The proposed recursive STTC are used as constituent codes in this scheme. The proposed ST turbo TCM significantly outperform the best known STTC on both slow and fast fading channels.

Original languageEnglish
Title of host publicationProceedings 2001 IEEE Infromation Theory Workshop
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages123-125
Number of pages3
ISBN (Print)0780371194
Publication statusPublished - 2001
Externally publishedYes
Event2001 IEEE Information Theory Workshop - Cairns, Australia
Duration: 2 Sept 20017 Sept 2001

Conference

Conference2001 IEEE Information Theory Workshop
Country/TerritoryAustralia
CityCairns
Period2/09/017/09/01

Keywords

  • CODED MODULATION

Fingerprint

Dive into the research topics of 'Design of space-time turbo TCM on fading channels'. Together they form a unique fingerprint.

Cite this