Tensor space-time (TST) coding for MIMO wireless communication systems

  • Authors:
  • GéRard Favier;Michele N. Da Costa;André L. F. De Almeida;JoãO Marcos T. Romano

  • Affiliations:
  • I3S Laboratory, University of Nice-Sophia Antipolis, CNRS, France;I3S Laboratory, University of Nice-Sophia Antipolis, CNRS, France and DSPCom Laboratory, University of Campinas (UNICAMP), Brazil;GTEL-Wireless Telecom Research Group, Federal University of Ceará, Fortaleza, Brazil;DSPCom Laboratory, University of Campinas (UNICAMP), Brazil

  • Venue:
  • Signal Processing
  • Year:
  • 2012

Quantified Score

Hi-index 0.08

Visualization

Abstract

In this paper, we propose a tensor space-time (TST) coding for multiple-input multiple-output (MIMO) wireless communication systems. The originality of TST coding is that it allows spreading and multiplexing the transmitted symbols, belonging to R data streams, in both space (antennas) and time (chips and blocks) domains, owing the use of two (stream- and antenna-to-block) allocation matrices. This TST coding is defined in terms of a third-order code tensor admitting transmit antenna, data stream and chip as modes. Assuming flat Rayleigh fading propagation channels, the signals received by K receive antennas during P time blocks, composed of N symbol periods each, with J chips per symbol, form a fourth-order tensor that satisfies a new constrained tensor model, called a PARATUCK-(2,4) model. Conditions for identifiability and uniqueness of this model are established, and a performance analysis of TST coding is made, before presenting a blind receiver for joint channel estimation and symbol recovery. Finally, some simulation results are provided to evaluate the performance of this receiver.