Skip to main content
Article thumbnail
Location of Repository

Perfect Space-Time Codes for Any Number of Antennas

By Petros Elia, B. A. Sethuraman and P. Vijay Kumar

Abstract

In a recent paper, perfect (n × n) space-time codes were introduced as the class of linear dispersion space-time codes having full rate, non-vanishing determinant, a signal constellation isomorphic to either the rectangular or hexagonal lattices in 2n 2 dimensions and uniform average transmitted energy per antenna. Consequence of these conditions include optimality of perfect codes with respect to the Zheng-Tse Diversity-Multiplexing Gain tradeoff (DMT), as well as excellent low-SNR performance. Yet perfect space-time codes have been constructed only for 2, 3, 4 and 6 transmit antennas. In this paper, we construct perfect codes for all channel dimensions, present some additional attributes of this class of space-time codes and extend the notion of a perfect code to the rectangular case

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.3476
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.csun.edu/~asethura/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.