Related papers: Approximately achieving Gaussian relay network cap…
We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a…
This paper studies the transceiver design of the Gaussian two-pair two-way relay channel (TWRC), where two pairs of users exchange information through a common relay in a pairwise manner. Our main contribution is to show that the capacity…
A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…
This paper considers Gaussian relay networks where a source transmits a message to a sink terminal with the help of one or more relay nodes. The relays work in half-duplex mode, in the sense that they can not transmit and receive at the…
Consider a wireless Gaussian network where a source wishes to communicate with a destination with the help of N full-duplex relay nodes. Most practical systems today route information from the source to the destination using the best path…
A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3 receivers, and a central relay is considered. The transmitters wish to send information to their corresponding receivers via a two phase communication protocol. The…
We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel…
In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under…
A number of recent papers have provided evidence that practical design questions about neural networks may be tackled theoretically by studying the behavior of random networks. However, until now the tools available for analyzing random…
The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter communicating to a remote…
Gaussian networks are fundamental objects in network information theory. Here many senders and receivers are connected by physically motivated Gaussian channels while auxiliary Gaussian components, such as Gaussian relays, are entailed.…
This paper studies the effectiveness of relaying for interference mitigation in an interference-limited communication scenario. We are motivated by the observation that in a cellular network, a relay node placed at the cell edge observes a…
This paper considers a general Gaussian relay network where a source transmits a message to a destination with the help of N half-duplex relays. It proves that the information theoretic cut-set upper bound to the capacity can be achieved to…
We consider the N-relay Gaussian diamond network where a source node communicates to a destination node via N parallel relays through a cascade of a Gaussian broadcast (BC) and a multiple access (MAC) channel. Introduced in 2000 by Schein…
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given…
In this paper we develop a low-complexity coding scheme and system design framework for the half duplex relay channel based on the Quantize-Map-and-Forward (QMF) relay- ing scheme. The proposed framework allows linear complexity operations…
Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem…
For every Gaussian network, there exists a corresponding deterministic network called the discrete superposition network. We show that this discrete superposition network provides a near-optimal digital interface for operating a class…
The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel…
The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel…