On the Successive Refinability of {MIMO} channels: {DMT} and Codes

  • Ramanarayanan K
  • Natarajan N
  • Kannan S
 et al. 
  • 1

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

Diversity embedded space time codes are high rate codes that are
designed such that they have a high diversity code embedded within
them. A recent work by Diggavi and Tse characterizes the
performance limits that can be achieved by diversity embedded
space-time codes in terms of the achievable Diversity Multiplexing
Tradeoff (DMT). In particular, they have shown that the trade off is
successively refinable for rayleigh fading channels with one degree
of freedom using superposition coding and Successive Interference
Cancellation (SIC). However, for Multiple-Input Multiple-Output
(MIMO) channels, the questions of successive refinability remains
open.

We consider MIMO Channels under superposition coding and SIC. We
derive an upper bound on the successive refinement characteristics
of the DMT. We then construct explicit space time codes that achieve
the derived upper bound. These codes, constructed from cyclic
division algebras, have minimal delay. Our results establish that
when the channel has more than one degree of freedom, the DMT is not
successive refinable using superposition coding and SIC. The
channels considered in this work can have arbitrary fading
statistics.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links

Authors

  • Krishnakumar Ramanarayanan

  • Naveen Natarajan

  • Sreeram Kannan

  • P Vijay Kumar

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free