Diversity-Multiplexing Tradeoff in Fading Interference Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

51 pages, submitted to IEEE Trans. Inf. Theory

Scientific paper

We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. We compute the diversity-multiplexing tradeoff (DMT) region of a fixed-power-split Han and Kobayashi (HK)-type superposition coding scheme and provide design criteria for the corresponding superposition codes. We demonstrate that this scheme is DMT-optimal under moderate, strong, and very strong interference by showing that it achieves a DMT outer bound that we derive. Further, under very strong interference, we show that a joint decoder is DMT-optimal and "decouples" the fading interference channel, i.e., from a DMT perspective, it is possible to transmit as if the interfering user were not present. In addition, we show that, under very strong interference, decoding interference while treating the intended signal as noise, subtracting the result out, and then decoding the desired signal, a process known as "stripping", achieves the optimal DMT region. Our proofs are constructive in the sense that code design criteria for achieving DMT-optimality (in the cases where we can demonstrate it) are provided.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Diversity-Multiplexing Tradeoff in Fading Interference Channels 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 Diversity-Multiplexing Tradeoff in Fading Interference Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diversity-Multiplexing Tradeoff in Fading Interference Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-541008

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.