text: The multiway relay channel is a multicast network where L users exchange data through a relay. In this paper, the capacity region of a class of multiway relay channels is derived, where the channel inputs and outputs take values over finite fields. The cut-set upper bound to the capacity region is derived and is shown to be achievable by our proposed functional-decode-forward coding strategy. More specifically, for the general case where the users can transmit at possibly different rates, functional-decode-forward, combined with rate splitting and joint source-channel decoding, is proved to achieve the capacity region; while for the case where all users transmit at a common rate, rate splitting and joint source-channel decoding are not required to achieve the capacity. That the capacity-achieving coding strategies do not utilize the users' received signals in the users' encoding functions implies that feedback does not increase the capacity region of this class of multiway relay channels.
  @cite_35: We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact characterization of the end-to-end capacity when there is a single source and a single destination and an arbitrary number of relay nodes. This result is a natural generalization of the max-flow min-cut theorem for wireline networks. Finally to demonstrate the connections between deterministic model and Gaussian model, we look at two examples: the single-relay channel and the diamond network. We show that in each of these two examples, the capacity-achieving scheme in the corresponding deterministic model naturally suggests a scheme in the Gaussian model that is within 1 bit and 2 bit respectively from cut-set upper bound, for all values of the channel gains. This is the first part of a two-part paper; the sequel [1] will focus on the proof of the max-flow min-cut theorem of a class of deterministic networks of which our model is a special case.
  @cite_22: SUMMARY This paper explores the two-user Gaussian interference channel through the lens of a natural deterministic channel model. The main result is that the deterministic channel uniformly approximates the Gaussian channel, the capacity regions differing by a universal constant. The problem of finding the capacity of the Gaussian channel to within a constant error is therefore reduced to that of finding the capacity of the far simpler deterministic channel. Thus, the paper provides an alternative derivation of the recent constant gap capacity characterisation of Etkin, Tse and Wang. Additionally, the deterministic model gives significant insight towards the Gaussian channel. Copyright © 2008 John Wiley & Sons, Ltd.
  @cite_23: We characterize the generalized degrees of freedom of the K user symmetric Gaussian interference channel where all desired links have the same signal-to-noise ratio (SNR) and all undesired links carrying interference have the same interference-to-noise ratio, INR = SNRα. We find that the number of generalized degrees of freedom per user, d(α), does not depend on the number of users, so that the characterization is identical to the 2 user interference channel with the exception of a singularity at α = 1 where d(1) = 1 K. The achievable schemes use multilevel coding with a nested lattice structure that opens the possibility that the sum of interfering signals can be decoded at a receiver even though the messages carried by the interfering signals are not decodable.
  @cite_25: We study the capacity of the full-duplex bidirectional (or two-way) relay channel with two nodes and one relay. The channels in the forward direction are assumed to be different (in general) than the channels in the backward direction, i.e. channel reciprocity is not assumed. We use the recently proposed deterministic approach to capture the essence of the problem and to determine a good transmission and relay strategy for the Gaussian channel. Depending on the ratio of the individual channel gains, we propose to use either a simple amplify-and-forward or a particular superposition coding strategy at the relay. We analyze the achievable rate region and show that the scheme achieves to within 3 bits the cut-set bound for all values of channel gains.
  @cite_20: In this paper we study the capacity region of the multi-pair bidirectional (or two-way) wireless relay network, in which a relay node facilitates the communication between multiple pairs of users. This network is a generalization of the well known bidirectional relay channel, where we have only one pair of users. We examine this problem in the context of the deterministic channel interaction model, which eliminates the channel noise and allows us to focus on the interaction between signals. We characterize the capacity region of this network when the relay is operating at either full-duplex mode or half-duplex mode (with non adaptive listen-transmit scheduling). In both cases we show that the cut-set upper bound is tight and, quite interestingly, the capacity region is achieved by a simple equation-forwarding strategy.
summary: A channel model similar to the finite field channel considered in this paper is the deterministic (noiseless) channel. In the deterministic model, the channel output is the arithmetic summation of the channel inputs, and there is no noise. The deterministic model has been used to construct coding strategies and to gain insights for more general channels. This approach has been applied to the multiple-access channel @cite_35 , the broadcast channel @cite_35 , the interference channel @cite_22 @cite_23 , the deterministic TWRC @cite_25 , and the deterministic multi-pair TWRC @cite_20 . For the deterministic TWRC and the deterministic multi-pair TWRC, it has been shown that linear coding achieves the capacities, an observation similar to that in this paper for the finite field MWRC.