In a bi-directional relay channel, a pair of nodes wish to exc hange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has mostly considered information theoretic limits of the bi-directional relay channel with t wo terminal nodes (or end users) and one relay. In this work we consider bi-directional relaying with one base station, multiple terminal nodes and one relay, all of which operate in half-duplex modes. We assume that each terminal node communicates with the base-station in a bi-directional fashion through t he relay and do not place any restrictions on the channels between the users, relays and base-stations; t hat is, each node has a direct link with every other node. Our contributions are three-fold: 1) the introd uction of four new temporal protocols which fully exploit the two-way nature of the data and outperform simple routing or multi-hop communication schemes by carefully combining network coding, random binning and user cooperation which exploit over-heard and own-message side information, 2) derivations of inner and outer bounds on the capacity region of the discrete-memoryless multi-pair two-way network, and 3) a numerical evaluation of the obtained achievable rate regions and outer bounds in Gaussian noise which illustrate the performance of the proposed protocols compared to simpler schemes, to each other, to the outer bounds, which highlight the relative gains achieved by network coding, random binning and compress-and-forward-type cooperation between terminal nodes.
Two-way communications were first considered by Shannon himself @cite_14 , in which he introduced inner and outer bounds on the capacity region of the two-way channel where two full-duplex nodes (which may transmit and receive simultaneously) wish to exchanges messages. Since full-duplex operation is, with current technology, of limited practical significance, in this work we assume that the nodes are half-duplex , i.e. at each point in time, a node can either transmit or receive symbols, but not both.
@cite_14
2057929374 2139947445 2964264449 2068889607
In this paper, a Gaussian two-way relay channel, where two source nodes exchange messages with each other through a relay, is considered. We assume that all nodes operate in full-duplex mode and there is no direct channel between the source nodes. We propose an achievable scheme composed of nested lattice codes for the uplink and structured binning for the downlink. Unlike conventional nested lattice codes, our codes utilize two different shaping lattices for source nodes based on a three-stage lattice partition chain, which is a key ingredient for producing the best gap-to-capacity results to date. Specifically, for all channel parameters, the achievable rate region of our scheme is within 1 2 bit from the capacity region for each user and its sum rate is within log3 2 bit from the sum capacity. In this paper, we study a three-node full-duplex network, where a base station is engaged in simultaneous up- and downlink communication in the same frequency band with two half-duplex mobile nodes. To reduce the impact of inter-node interference between the two mobile nodes on the system capacity, we study how an orthogonal side-channel between the two mobile nodes can be leveraged to achieve full-duplex-like multiplexing gains. We propose and characterize the achievable rates of four distributed full-duplex schemes, labeled bin-and-cancel, compress-and-cancel, estimate-and-cancel and decode-and-cancel. Of the four, bin-and-cancel is shown to achieve within 1 bit s Hz of the capacity region for all values of channel parameters. In contrast, the other three schemes achieve the near-optimal performance only in certain regimes of channel values. Asymptotic multiplexing gains of all proposed schemes are derived to show that the side-channel is extremely effective in regimes where inter-node interference has the highest impact. 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. Recent breakthroughs in wireless communica- tion show that by using new signal processing techniques, a wireless node is capable of transmitting and receiving simultaneously on the same frequency band by activating both of its RF chains, thus achieving full-duplex communica- tion and potentially doubling the link throughput. However, with two sets of RF chains, one can build a half-duplex multi-input and multi-output (MIMO) system that achieves the same gain. While this gain is the same between a pair of nodes, the gains are unclear when multiple nodes are involved, as in a general network. The key reason is that MIMO and full-duplex have different interference patterns. A MIMO transmission blocks transmissions around its receiver and receptions around its transmitter. A full-duplex bi- directional transmission blocks any transmission around the two communicating nodes, but allows a reception on one RF chain. Thus, in a general network, the requirements for the two technologies could result in potentially different achievable throughput regions. This work investigates the achievable throughput perfor- mance of MIMO, full-duplex and their variants that allow simultaneous activation of two RF chains. It is the first work of its kind to precisely characterize the conditions under which these technologies outperform each other for a general network topology under a binary interference model. The analytical results in this paper are validated using software-defined radios.