On the achievable diversity-multiplexing tradeoff in interference channels

Details On the achievable diversity-multiplexing tradeoff in interference channels On the achievable diversity-multiplexing tradeoff in interference channels

2009-03-12

arxiv.org/abs/0903.2226v2

Computer Science

Information Theory

5 pages, 1 figure

Scientific paper

We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. For the case of very strong interference, we prove that 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 diversity-multiplexing tradeoff (DMT) outer bound derived in Akuiyibo and Leveque, Int. Zurich Seminar on Commun., 2008. The proof is constructive in the sense that it provides corresponding code design criteria for DMT optimality. For general interference levels, we compute the DMT of a fixed-power-split Han and Kobayashi type superposition coding scheme, provide design criteria for the corresponding superposition codes, and find that this scheme is DMT-optimal for certain multiplexing rates.

Affiliated with

Also associated with

No associations

Rating

On the achievable diversity-multiplexing tradeoff in 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 On the achievable diversity-multiplexing tradeoff in interference channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the achievable diversity-multiplexing tradeoff in interference channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-37022