Results 1 
4 of
4
Explicit spacetime codes achieving the diversitymultiplexing gain tradeoff
 IEEE Trans. Inf. Theory
, 2006
"... Abstract — A recent result of Zheng and Tse states that over a quasistatic channel, there exists a fundamental tradeoff, referred to as the diversitymultiplexing gain (DMG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be simultaneously achieved by a spacetime ( ..."
Abstract

Cited by 59 (8 self)
 Add to MetaCart
(Show Context)
Abstract — A recent result of Zheng and Tse states that over a quasistatic channel, there exists a fundamental tradeoff, referred to as the diversitymultiplexing gain (DMG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be simultaneously achieved by a spacetime (ST) block code. This tradeoff is precisely known in the case of i.i.d. Rayleighfading, for T ≥ nt + nr − 1 where T is the number of time slots over which coding takes place and nt, nr are the number of transmit and receive antennas respectively. For T < nt + nr − 1, only upper and lower bounds on the DMG tradeoff are available. In this paper, we present a complete solution to the problem of explicitly constructing DMG optimal ST codes, i.e., codes that achieve the DMG tradeoff for any number of receive antennas. We do this by showing that for the square minimumdelay case when T = nt = n, cyclicdivisionalgebra (CDA) based ST codes having the nonvanishing determinant property are DMG optimal. While constructions of such codes were previously known for restricted values of n, we provide here a construction for such codes that is valid for all n. For the rectangular, T> nt case, we present two general techniques for building DMGoptimal rectangular ST codes from their square counterparts. A byproduct of our results establishes that the DMG tradeoff for all T ≥ nt is the same as that previously known to hold for T ≥ nt + nr − 1. Index Terms — diversitymultiplexing gain tradeoff, spacetime codes, explicit construction, cyclic division algebra. I.
Perfect SpaceTime Codes for Any Number of Antennas
"... In a recent paper, perfect (n × n) spacetime codes were introduced as the class of linear dispersion spacetime codes having full rate, nonvanishing determinant, a signal constellation isomorphic to either the rectangular or hexagonal lattices in 2n 2 dimensions and uniform average transmitted en ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
In a recent paper, perfect (n × n) spacetime codes were introduced as the class of linear dispersion spacetime codes having full rate, nonvanishing 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 ZhengTse DiversityMultiplexing Gain tradeoff (DMT), as well as excellent lowSNR performance. Yet perfect spacetime 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 spacetime codes and extend the notion of a perfect code to the rectangular case.
Perfect spacetime codes with minimum and nonminimum delay for any number of antennas
 IEEE Trans. Inform. Theory
, 2005
"... Abstract — Perfect spacetime codes were first introduced by Oggier et. al. to be the spacetime codes that have full rate, full diversitygain, nonvanishing determinant for increasing spectral efficiency, uniform average transmitted energy per antenna and good shaping of the constellation. These d ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
Abstract — Perfect spacetime codes were first introduced by Oggier et. al. to be the spacetime codes that have full rate, full diversitygain, nonvanishing determinant for increasing spectral efficiency, uniform average transmitted energy per antenna and good shaping of the constellation. These defining conditions jointly correspond to optimality with respect to the ZhengTse DMG tradeoff, independent of channel statistics, as well as to near optimality in maximizing mutual information. All the above traits endow the code with error performance that is currently unmatched. Yet perfect spacetime codes have been constructed only for 2, 3,4 and 6 transmit antennas. We construct minimum and nonminimum delay perfect codes for all channel dimensions. A. Definition of Perfect Codes I.
Explicit SpaceTime Codes Achieving The DiversityMultiplexing Gain Tradeoff
"... a quasistatic channel, there exists a fundamental tradeoff, referred to as the diversitymultiplexing gain (DMG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be simultaneously achieved by a spacetime (ST) block code. This tradeoff is precisely known in the case ..."
Abstract
 Add to MetaCart
(Show Context)
a quasistatic channel, there exists a fundamental tradeoff, referred to as the diversitymultiplexing gain (DMG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be simultaneously achieved by a spacetime (ST) block code. This tradeoff is precisely known in the case of i.i.d. Rayleighfading, for T ≥ nt + nr − 1 where T is the number of time slots over which coding takes place and nt, nr are the number of transmit and receive antennas respectively. For T < nt + nr − 1, only upper and lower bounds on the DMG tradeoff are available. In this paper, we present a complete solution to the problem of explicitly constructing DMG optimal ST codes, i.e., codes that achieve the DMG tradeoff for any number of receive antennas. We do this by showing that for the square minimumdelay case when T = nt = n, cyclicdivisionalgebra (CDA) based ST codes having the nonvanishing determinant property are DMG optimal. While constructions of such codes were previously known for restricted values of n, we provide here a construction for such codes that is valid for all n. For the rectangular, T> nt case, we present two general techniques for building DMGoptimal rectangular ST codes from their square counterparts. A byproduct of our results establishes that the DMG tradeoff for all T ≥ nt is the same as that previously known to hold for T ≥ nt + nr − 1. Index Terms — diversitymultiplexing gain tradeoff, spacetime codes, explicit construction, cyclic division algebra. I.