Ramanarayanan, Krishnakumar and Natarajan, Naveen and Kannan, Sreeram and Kumar, Vijay P (2008) On the Successive Refinability of MIMO channels: DMT and codes. In: National Conference on Communication, IIT Bombay, IIT Bombay.
2008_D1_1.pdf - Published Version
Restricted to Registered users only
Download (108Kb) | Request a copy
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.
|Item Type:||Conference Paper|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||20 Sep 2011 08:37|
|Last Modified:||20 Sep 2011 08:37|
Actions (login required)