Capacity Theorems for the AWGN Multi-Way Relay Channel

Details Capacity Theorems for the AWGN Multi-Way Relay Channel Capacity Theorems for the AWGN Multi-Way Relay Channel

2010-04-14

arxiv.org/abs/1004.2300v1

Proceedings of the 2010 IEEE International Sysmposium on Information Theory (ISIT 2010), Austin, USA, pp. 664-668, June 13-18,

Computer Science

Information Theory

accepted and to be presented at ISIT 2010

Scientific paper

10.1109/ISIT.2010.5513576

The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and compress-forward are shown to be bounded away from the cut-set upper bound at high signal-to-noise ratios (SNR). It is known that the gap between the compress-forward rate and the capacity upper bound is a constant at high SNR, and that between the complete-decode-forward rate and the upper bound increases with SNR at high SNR. In this paper, a functional-decode-forward coding strategy is proposed. It is shown that for L >= 3, complete-decode-forward achieves the capacity when SNR <= 0 dB, and functional-decode-forward achieves the capacity when SNR >= 0 dB. For L=$, functional-decode-forward achieves the capacity asymptotically as SNR increases.

Affiliated with

Also associated with

No associations

Rating

Capacity Theorems for the AWGN Multi-Way Relay Channel 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 Capacity Theorems for the AWGN Multi-Way Relay Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity Theorems for the AWGN Multi-Way Relay Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524896