Broadcast diamond channel: Transmission strategies and bounds

Z Al-qudah, A Ababneh - Journal of the Franklin Institute, 2021 - Elsevier
This paper proposes a new multiuser communication model in which a source with
broadcast capabilities wants to transmit two different messages to two different destinations …

General and new inner bound for multiple‐access relay channel and two certain capacity theorems

A Sahebalam, G Abed Hodtani - IET Communications, 2013 - Wiley Online Library
In this study, the authors obtain a general and new achievable rate region and some certain
capacity theorems for multiple‐access relay channel (MARC), using partial decode‐and …

On the capacity of the half-duplex diamond channel under fixed scheduling

H Bagheri, AS Motahari… - IEEE transactions on …, 2014 - ieeexplore.ieee.org
The diamond channel is a dual-hop communication system composed of a source, and a
destination connected through two noninterfering relays. Operating in the half-duplex mode …

On the asymptotic capacity of Gaussian relay networks

M Gastpar, M Vetterli - Proceedings IEEE International …, 2002 - ieeexplore.ieee.org
We determine the asymptotic capacity of a Gaussian multiple-relay channel as the number
of relays tends to infinity. The upper bound is an application of the cut-set theorem, and the …

On the achievable rates of the diamond relay channel with conferencing links

C Huang, J Jiang, S Cui - IEEE transactions on communications, 2012 - ieeexplore.ieee.org
We consider the half-duplex diamond relay channel, which consists of one source-
destination pair and two relay nodes connected with two-way rate-limited out-of-band …

Multiple access relay channel: achievable rates over orthogonal channels

W Al-Sawalmeh, Z Al-qudah, KA Darabkh - AEU-International Journal of …, 2019 - Elsevier
In this paper, we consider the multiple access relay channel (MARC) in which two users
want to communicate with a destination in the presence of a common intermediate node, the …

Capacity of a more general glass of relay channels

GA Hodtani, MR Aref - 2008 International Symposium on …, 2008 - ieeexplore.ieee.org
Capacity has been found for degraded, reversely degraded, full feedback, semi-
deterministic, orthogonal relay channels, also for a class of deterministic relay channels and …

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 …

Improving on the cut-set bound for general primitive relay channels

X Wu, A Özgür - 2016 IEEE International Symposium on …, 2016 - ieeexplore.ieee.org
Consider a primitive relay channel, where, a source X wants to send information to a
destination Y with the help of a relay Z and the relay can communicate to the destination via …

Capacity of a class of relay channels with orthogonal components

A El Gamal, S Zahedi - IEEE Transactions on Information …, 2005 - ieeexplore.ieee.org
The capacity of a class of discrete-memoryless relay channels with orthogonal channels
from the sender to the relay receiver and from the sender and relay to the receiver is shown …