Skip to content

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

by Krishnakumar Ramanarayanan, Naveen Natarajan, Sreeram Kannan, P Vijay Kumar
National Conference on Communications 2008 ()


Diversity embedded space time codes are high rate codes that are\ndesigned such that they have a high diversity code embedded within\nthem. A recent work by Diggavi and Tse characterizes the\nperformance limits that can be achieved by diversity embedded\nspace-time codes in terms of the achievable Diversity Multiplexing\nTradeoff (DMT). In particular, they have shown that the trade off is\nsuccessively refinable for rayleigh fading channels with one degree\nof freedom using superposition coding and Successive Interference\nCancellation (SIC). However, for Multiple-Input Multiple-Output\n(MIMO) channels, the questions of successive refinability remains\nopen.\n\nWe consider MIMO Channels under superposition coding and SIC. We\nderive an upper bound on the successive refinement characteristics\nof the DMT. We then construct explicit space time codes that achieve\nthe derived upper bound. These codes, constructed from cyclic\ndivision algebras, have minimal delay. Our results establish that\nwhen the channel has more than one degree of freedom, the DMT is not\nsuccessive refinable using superposition coding and SIC. The\nchannels considered in this work can have arbitrary fading\nstatistics.

Cite this document (BETA)

Readership Statistics

1 Reader on Mendeley
by Discipline
100% Computer Science
by Academic Status
100% Researcher

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in