Systematic construction of linear transform based full-diversity, rate-one space-time frequency codes

  • Authors:

  • M. R. Bhavani Shankar;K. V. S. Hari

  • Affiliations:

  • KTH Signal Processing Lab, ACCESS Linnaeus Center, Royal Institute of Technology, Stockholm, SE, Sweden;Statistical Signal Processing Laboratory, Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, India

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2009

Quantified Score

Hi-index 35.68

Visualization

Abstract

In this paper, we generalize the existing rate-one space frequency (SF) and space-time frequency (STF) code constructions. The objective of this exercise is to provide a systematic design of full-divenity STF codes with high coding gain. Under this generalization, STF codes are formulated as linear transformations of data. Conditions on these linear transforms are then derived so that the resulting STF codes achieve full diversity and high coding gain with a moderate decoding complexity. Many of these conditions involve channel parameters like delay profile (DP) and temporal correlation. When these quantities are not available at the transmitter, design of codes that exploit full diversity on channels with arbitrary DP and temporal correlation is considered. Complete characterization of a class of such robust codes is provided and their bit error rate (BER) performance is evaluated. On the other hand, when channel DP and temporal correlation are available at the transmitter, linear transforms are optimized to maximize the coding gain of full-diversity STF codes. BER performance of such optimized codes is shown to be better than those of existing codes.