DMT-optimal, Low ML-Complexity STBC-Schemes for Asymmetric MIMO Systems

Srinath, Pavan K and Rajan, Sundar B (2012) DMT-optimal, Low ML-Complexity STBC-Schemes for Asymmetric MIMO Systems. In: IEEE International Symposium on Information Theory, JUL 01-06, 2012, Cambridge, MA .

PDF iee_int_sym_inf_the_pro_2012.pdf - Published Version Restricted to Registered users only Download (165kB) | Request a copy

Abstract

For an n(t) transmit, nr receive antenna (n(t) x n(r)) MIMO system with quasi- static Rayleigh fading, it was shown by Elia et al. that space-time block code-schemes (STBC-schemes) which have the non-vanishing determinant (NVD) property and are based on minimal-delay STBCs (STBC block length equals n(t)) with a symbol rate of n(t) complex symbols per channel use (rate-n(t) STBC) are diversity-multiplexing gain tradeoff (DMT)-optimal for arbitrary values of n(r). Further, explicit linear STBC-schemes (LSTBC-schemes) with the NVD property were also constructed. However, for asymmetric MIMO systems (where n(r) < n(t)), with the exception of the Alamouti code-scheme for the 2 x 1 system and rate-1, diagonal STBC-schemes with NVD for an nt x 1 system, no known minimal-delay, rate-n(r) LSTBC-scheme has been shown to be DMT-optimal. In this paper, we first obtain an enhanced sufficient criterion for an STBC-scheme to be DMT optimal and using this result, we show that for certain asymmetric MIMO systems, many well-known LSTBC-schemes which have low ML-decoding complexity are DMT-optimal, a fact that was unknown hitherto.

Item Type:	Conference Paper
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copyright for this article belongs to IEEE, NEW YORK,
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering > Electrical Communication Engineering - Technical Reports
Date Deposited:	07 Feb 2013 11:52
Last Modified:	07 Feb 2013 11:52
URI:	http://eprints.iisc.ac.in/id/eprint/45756

Actions (login required)

View Item