pith. sign in

arxiv: 1004.2300 · v1 · pith:FZYOTTFPnew · submitted 2010-04-14 · 💻 cs.IT · math.IT

Capacity Theorems for the AWGN Multi-Way Relay Channel

classification 💻 cs.IT math.IT
keywords capacityachievesboundcomplete-decode-forwardfunctional-decode-forwardhighraterelay
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.