Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff
Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar and, Hsiao-feng Lu

TL;DR
This paper constructs explicit space-time codes that achieve the optimal diversity-multiplexing gain tradeoff for any number of antennas and time slots, advancing the design of efficient MIMO communication systems.
Contribution
It provides a complete construction of D-MG optimal space-time codes for all antenna configurations and time slots, including new CDA-based codes for all sizes.
Findings
CDA-based codes are D-MG optimal for all n
Rectangular codes can be derived from square codes
D-MG tradeoff is consistent for all T >= n_t
Abstract
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) block code. This tradeoff is precisely known in the case of 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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Techniques · Error Correcting Code Techniques · graph theory and CDMA systems
