Generally explicit space-time codes with nonvanishing determinants for arbitrary numbers of transmit antennas

  • Authors:
  • Hua-Chieh Li;Ming-Yang Chen

  • Affiliations:
  • Department of Mathematics, National Taiwan Normal University, Taipei, Taiwan;Department of Electrical Engineering, Stanford University, Stanford, CA

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.84

Visualization

Abstract

Nonvanishing determinants have emerged as an attractive criterion enabling a space-time code achieve the optimal diversity-multiplexing gains tradeoff. It seems that cyclic division algebras play the most crucial role in designing a space-time code with nonvanishing determinants. In this paper, we explicitly construct space-time codes for arbitrary numbers of transmit antennas that achieve nonvanishing determinants and the optimal diversity-multiplexing gains tradeoff over Z[i]. Unlike previous methods usually arising a field compositum for two or more fields, our scheme, which only requires one simple extension, constitutes a much more efficient and feasible advancement whether in theory or practice.