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

Abstract—For an nt transmit, nr receive antenna (nt × nr) MIMO system with quasi-static Rayleigh fading, it was shown by Elia et al. that space-time block code-schemes (STBCschemes) which have the non-vanishing determinant (NVD) property and are based on minimal-delay STBCs (STBC block length equals nt) with a symbol rate of nt complex symbols per channel use (rate-nt STBC) are diversity-multiplexing gain tradeoff (DMT)-optimal for arbitrary values of nr. Further, explicit linear STBC-schemes (LSTBC-schemes) with the NVD property were also constructed. However, for asymmetric MIMO systems (where nr <nt), with the exception of the Alamouti code-scheme for the 2×1 system and rate-1, diagonal STBC-schemes with NVD for an nt × 1 system, no known minimal-delay, rate-nr LSTBC-scheme has been shown to be DMT-optimal. In this paper, we first obtain an enhance

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

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