Computer Science – Information Theory
Scientific paper
2012-01-10
Computer Science
Information Theory
A few corrections have been incorporated in this version
Scientific paper
For an $n_t$ transmit, $n_r$ receive antenna ($n_t\times 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 \times 1$ system and rate-1, diagonal STBC-schemes with NVD for an $n_t \times 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.
Rajan Sundar B.
Srinath Pavan K.
No associations
LandOfFree
DMT-optimal, Low ML-Complexity STBC-Schemes for Asymmetric MIMO Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with DMT-optimal, Low ML-Complexity STBC-Schemes for Asymmetric MIMO Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and DMT-optimal, Low ML-Complexity STBC-Schemes for Asymmetric MIMO Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-462375