Simple schedules for half-duplex networks
S Brahma, A Oezguer, C Fragouli - 2012 IEEE International …, 2012 - ieeexplore.ieee.org
We consider the diamond network where a source communicates with the destination
through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity …
through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity …
On the capacity of the single source multiple relay single destination mesh network
In this paper, we derive the information theoretic capacity of a special class of mesh
networks. A mesh network is a heterogeneous wireless network in which the transmission …
networks. A mesh network is a heterogeneous wireless network in which the transmission …
A partial compress-and-forward strategy for relay-assisted wireless networks based on rateless coding
W Ding, M Shikh-Bahaei - IEEE Transactions on Vehicular …, 2023 - ieeexplore.ieee.org
In this work, we propose a novel partial compress-and-forward (PCF) scheme for improving
the maximum achievable transmission rate of a diamond relay network with two noisy relays …
the maximum achievable transmission rate of a diamond relay network with two noisy relays …
On the capacity of the noncausal relay channel
L Wang, M Naghshvar - IEEE Transactions on Information …, 2017 - ieeexplore.ieee.org
This paper studies the noncausal relay channel, also known as the relay channel with
unlimited look ahead, introduced by by El Gamal, Hassanpour, and Mammen. Unlike the …
unlimited look ahead, introduced by by El Gamal, Hassanpour, and Mammen. Unlike the …
Capacity theorems for relay channels with ISI
In this paper we initially study degraded relay channels with finite-length intersymbol
interference (ISI). For such channels, we show that the decode-and-forward strategy …
interference (ISI). For such channels, we show that the decode-and-forward strategy …
Minimal complete relay decoding networks
EF Moore - IBM Journal of Research and Development, 1960 - ieeexplore.ieee.org
The standard relay-contact-tree network has been used extensively for many years. If n is
the number of relays involved, it has always been assumed that the 2 (2 n− 1) contacts used …
the number of relays involved, it has always been assumed that the 2 (2 n− 1) contacts used …
Gaussian relay channel capacity to within a fixed number of bits
W Chang, SY Chung, YH Lee - arXiv preprint arXiv:1011.5065, 2010 - arxiv.org
Gaussian Relay Channel Capacity to Within a Fixed Number of Bits Page 1 arXiv:1011.5065v1
[cs.IT] 23 Nov 2010 1 Gaussian Relay Channel Capacity to Within a Fixed Number of Bits …
[cs.IT] 23 Nov 2010 1 Gaussian Relay Channel Capacity to Within a Fixed Number of Bits …
Analog network coding in the generalized high-SNR regime
B Liu, N Cai - 2011 IEEE International Symposium on …, 2011 - ieeexplore.ieee.org
In a recent paper [4], Maríc et al. analyzed the performance of the analog network coding
(ANC) in a layered relay network for the high-SNR regime. They have proved that under the …
(ANC) in a layered relay network for the high-SNR regime. They have proved that under the …
Efficient capacity computation and power optimization for relay networks
F Parvaresh, R Etkin - IEEE Transactions on Information Theory, 2013 - ieeexplore.ieee.org
The capacity or approximations to capacity of various single-source single-destination relay
network models has been characterized in terms of the cut-set upper bound. In principle, a …
network models has been characterized in terms of the cut-set upper bound. In principle, a …
Transcoding: A new strategy for relay channels
The relay channel is a traditional information-theoretic problem which has important
applications in the Internet of Things (IoT) and other future communication networks. In this …
applications in the Internet of Things (IoT) and other future communication networks. In this …