ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Explicit Space-Time Codes Achieving the Diversity Multiplexing Gain Tradeoff

Elia, Petros and Kumar, KR and Pawar, Sameer A and Kumar, PV and Lu, HsiaoFeng (2006) Explicit Space-Time Codes Achieving the Diversity Multiplexing Gain Tradeoff. In: IEEE Transactions On Information Theory, 52 (9). 3869 -3884.

[img] PDF
4.pdf - Published Version
Restricted to Registered users only

Download (494kB) | Request a copy
Official URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumbe...


A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be simultaneously achieved by a space-time (ST) code. This tradeoff is precisely known in the case of independent and identically distributed (i.i.d.) Rayleigh fading, for T >= n(t) + n(r) - 1 where T is the number of time slots over which coding takes place and n(t), n(r) are the number of transmit and receive antennas, respectively. For T < n(t) + n(r) - 1, only upper and lower bounds on the D-MG tradeoff are available.In this paper, we present a complete solution to the problem of explicitly constructing D-MG optimal ST codes, i.e., codes that achieve the D-MG tradeoff for any number of receive antennas. We do this by showing that for the square minimum-delay case when T = n(t) - n, cyclic division-algebra (CDA)-based ST codes having the nonvanishing determinant property are D-MG 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 > n(t) case, we present two general techniques for building D-MG-optimal rectangular ST codes from their square counterparts. A byproduct of our results establishes that the D-MG tradeoff for all T >= n(t) is the same as that previously known to hold for T >= n(t)+n(r)-1.

Item Type: Journal Article
Publication: IEEE Transactions On Information Theory
Publisher: IEEE-Inst Electrical Electronics Engineers Inc
Additional Information: Copyright of this article belongs to IEEE-Inst Electrical Electronics Engineers Inc.
Keywords: Computer Science, Information Systems; Engineering, Electrical & Electronic;cyclic division algebra; diversity-multiplexing gain tradeoff; explicit construction; space-time codes;Construction; Channels; Decoder; Number.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 24 Mar 2009 05:16
Last Modified: 19 Sep 2010 04:55
URI: http://eprints.iisc.ac.in/id/eprint/17193

Actions (login required)

View Item View Item