The Gaussian multiple access diamond channel

W Kang, N Liu - 2011 IEEE International Symposium on …, 2011 - ieeexplore.ieee.org
In this paper, we study the capacity of the diamond channel. We focus on the special case
where the channel between the source node and the two relay nodes are two separate links …

On the capacity of cloud radio access networks with oblivious relaying

IE Aguerri, A Zaidi, G Caire… - 2017 IEEE International …, 2017 - ieeexplore.ieee.org
We study the transmission over a network in which users send information to a remote
destination through relay nodes that are connected to the destination via finite-capacity error …

[PDF][PDF] Coding techniques for primitive relay channels

YH Kim - Proc. Forty-Fifth Annual Allerton Conf. Commun., Contr …, 2007 - eng.ucsd.edu
We give a comprehensive discussion on coding techniques for the primitive relay channel,
in which the channel input X is transmitted to the relay Y1 and the ultimate receiver Y over a …

Gaussian half-duplex relay networks: Improved constant gap and connections with the assignment problem

M Cardone, D Tuninetti, R Knopp… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
This paper considers a Gaussian relay network where a source transmits a message to a
destination with the help of N half-duplex relays. The information theoretic cut-set upper …

A digital interface for Gaussian relay and interference networks: Lifting codes from the discrete superposition model

M Anand, PR Kumar - IEEE transactions on information theory, 2011 - ieeexplore.ieee.org
For every Gaussian network, there exists a corresponding deterministic network called the
discrete superposition network. We show that this discrete superposition network provides a …

[PDF][PDF] On the capacity of 'cheap'relay networks

MA Khojastepour, A Sabharwal… - 37th Annual Conf …, 2003 - repository.rice.edu
We consider the communication problem in a multi-hop relay network where the
intermediate relay nodes cannot transmit and receive at the same time. The motivation for …

A new upper bound on the capacity of a primitive relay channel based on channel simulation

F Xue - IEEE transactions on information theory, 2014 - ieeexplore.ieee.org
An upper bound on the capacity of a primitive three-node discrete memoryless relay channel
is considered, where a source X wants to send information to destination Y with the help of a …

[PDF][PDF] On the capacity of multiple input erasure relay channels

R Khalili, K Salamatian - Proc. WINMEE, RAWNET and NETCOD …, 2005 - researchgate.net
In this paper we consider a network that consists of two senders and two receivers. We
further assume that each sender could act as a relay for other communications. The channel …

Network simplification: The Gaussian diamond network with multiple antennas

C Nazaroglu, JB Ebrahimi, A Özgür… - … on Information Theory …, 2011 - ieeexplore.ieee.org
We consider the N-relay Gaussian diamond network when the source and the destination
have ns≥ 2 and nd≥ 2 antennas respectively. We show that when ns= nd= 2 and when the …

On the capacity of cloud radio access networks with oblivious relaying

IE Aguerri, A Zaidi, G Caire… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
We study the transmission over a network in which users send information to a remote
destination through relay nodes that are connected to the destination via finite-capacity error …