Turbo space-time codes with time varying linear transformations
Document Type
Article
Publication Date
2-1-2007
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. © 2007 IEEE.
Identifier
33847765376 (Scopus)
Publication Title
IEEE Transactions on Wireless Communications
External Full Text Location
https://doi.org/10.1109/TWC.2007.04790
ISSN
15361276
First Page
486
Last Page
493
Issue
2
Volume
6
Recommended Citation
Chen, Hangjun; Haimovich, Alexander; and Sjogren, Jon A., "Turbo space-time codes with time varying linear transformations" (2007). Faculty Publications. 13547.
https://digitalcommons.njit.edu/fac_pubs/13547
