Open Access
Capacity theorems for the relay channel
Thomas M. Cover,A. El Gamal +1 more
- Vol. 80, pp 572-584
TLDR
An achievable lower bound to the capacity of the general relay channel is established and superposition block Markov encoding is used to show achievability of C, and converses are established.About:
The article was published on 1979-09-01 and is currently open access. It has received 3918 citations till now. The article focuses on the topics: Relay channel & Channel capacity.read more
Citations
More filters
Proceedings ArticleDOI
When is compress-and-forward optimal?
Si-Hyeon Lee,Sae-Young Chung +1 more
TL;DR: Why a combination of DF and CF is optimal for the network and its capacity is given by a simple expression is discussed, which generalizes to a certain class of tree networks with an arbitrary number of nodes consisting of multiple cascaded diamond relay networks.
Journal ArticleDOI
Spectral Efficiency and Relay Energy Efficiency of Full-Duplex Relay Channel
TL;DR: This paper investigates the relationship among SE, REE, and system design by taking into account the effect of RSI for a general class of cooperation schemes by studying bounds on the SE of full-duplex relay channel with decode-forward (DF) relaying, compress- forward (CF) relays, and amplify-forward [AF] relaying in the presence of R SI.
Journal ArticleDOI
Symmetric Capacity of the Gaussian Interference Channel With an Out-of-Band Relay to Within 1.15 Bits
Ye Tian,Aylin Yener +1 more
TL;DR: In this paper, a symmetric Gaussian interference channel with an out-of-band relay channel (OBRC) was studied and the sum capacity of this channel was established for all possible channel parameters.
Journal ArticleDOI
Generalized Signal Alignment: On the Achievable DoF for Multi-User MIMO Two-Way Relay Channels
Kangqi Liu,Meixia Tao +1 more
TL;DR: A new transmission framework, generalized signal alignment (GSA), is proposed, which is to form network-coded symbols by aligning every pair of signals to be exchanged in a compressed subspace at the relay.
Journal Article
Sawtooth Relaying
TL;DR: This work considers the three-node AWGN relay channel with a memoryless relay with a single-variable deterministic mapping, and proposes to use a "modulo function" or a "triangular function" to implement the mapping at the relay.
References
More filters
Journal ArticleDOI
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
Journal ArticleDOI
Three-terminal communication channels
TL;DR: A coding theorem and weak converse are proved and a necessary and sufficient condition for a positive capacity is derived and upper and lower bounds on the capacity are obtained, which coincide for channels with symmetric structure.
Journal ArticleDOI
Source coding with side information and a converse for degraded broadcast channels
Rudolf Ahlswede,János Körner +1 more
TL;DR: In Section H of the paper, a characterization of the capacity region for degraded broadcast channels (DBC's) is given, which was conjectured by Bergmans and is somewhat sharper than the one obtained by Gallager.
Journal ArticleDOI
A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
TL;DR: It is established that the Slepian-Wolf theorem is true without change for arbitrary ergodic processes \{(X_i,Y_i)\}_{i=1}^{\infty} and countably infinite alphabets.
Journal ArticleDOI
On source coding with side information at the decoder
TL;DR: The characterization of the family of rate triples (R_0,R_1, R_2) for which this system can deliver essentially perfect reproductions of X and Y and the principal result is a characterization of this family via an information-theoretic minimization.