On the Rate Achievable for Gaussian Relay Channels Using Superposition Forwarding

Details On the Rate Achievable for Gaussian Relay Channels Using Superposition Forwarding On the Rate Achievable for Gaussian Relay Channels Using Superposition Forwarding

2010-10-15

arxiv.org/abs/1010.3071v1

Computer Science

Information Theory

19 pages. 4 figures

Scientific paper

We analyze the achievable rate of the superposition of block Markov encoding (decode-and-forward) and side information encoding (compress-and-forward) for the three-node Gaussian relay channel. It is generally believed that the superposition can out perform decode-and-forward or compress-and-forward due to its generality. We prove that within the class of Gaussian distributions, this is not the case: the superposition scheme only achieves a rate that is equal to the maximum of the rates achieved by decode-and-forward or compress-and-forward individually. We also present a superposition scheme that combines broadcast with decode-and-forward, which even though does not achieve a higher rate than decode-and-forward, provides us the insight to the main result mentioned above.

Affiliated with

Also associated with

No associations

Rating

On the Rate Achievable for Gaussian Relay Channels Using Superposition Forwarding 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 Rate Achievable for Gaussian Relay Channels Using Superposition Forwarding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Rate Achievable for Gaussian Relay Channels Using Superposition Forwarding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-203414