Turbo space-time codes with time varying linear transformations

Hangjun Chen, Alexander Haimovich, Jon A. Sjogren

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

Turbo space-time codes with symbols preceded by randomly chosen unitary time variant linear transformations (TVLT) are investigated in this paper. It is shown that turbo codes with TVLT achieve full diversity gain and do not require exhaustive tests of the rank criterion. We prove that the coding gain performance of turbo space-time codes with TVLT improves with the Hamming distance between codewords (number of different columns). As an additional benefit of the application of TVLT, with the removal of the constant modulation condition, we prove that throughput rates achieved by these codes are significantly higher than those for conventional space-time codes. Numerical results are provided to demonstrate diversity gains, coding gains and rates of turbo space-time codes with TVLT.

Original languageEnglish (US)
Pages (from-to)486-493
Number of pages8
JournalIEEE Transactions on Wireless Communications
Volume6
Issue number2
DOIs
StatePublished - Feb 1 2007

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Keywords

  • Concatenated coding
  • MIMO

Fingerprint Dive into the research topics of 'Turbo space-time codes with time varying linear transformations'. Together they form a unique fingerprint.

Cite this