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
Journal ArticleDOI
Statistical channel knowledge-based optimum power allocation for relaying protocols in the high SNR regime
TL;DR: The results show that optimal power allocation brings impressive coding gains over equal power allocation, and the analysis reveals that the coding gain gap between the AF and DF protocols can also be reduced by the optimalPower allocation.
Journal ArticleDOI
Interference Channels With Source Cooperation
TL;DR: In this article, the role of cooperation in managing interference was investigated by studying the two-user Gaussian interference channel where the source nodes can both transmit and receive in full duplex, and the sum capacity of this channel was obtained within a gap of a constant number of bits.
Journal ArticleDOI
Channel Capacity Over Generalized Fading Channels: A Novel MGF-Based Approach for Performance Analysis and Design of Wireless Communication Systems
TL;DR: A novel and unified communication-theoretic framework for the analysis of channel capacity over fading channels is proposed and it is shown that the framework can handle various fading channel models, communication types, and adaptation transmission policies.
Posted Content
Performance Bounds for Bi-Directional Coded Cooperation Protocols
TL;DR: In this article, the performance bounds for coded bi-directional cooperation over a shared half-duplex channel with the help of a relay were derived for each of three protocols.
Journal ArticleDOI
Joint Subcarrier Pairing and Power Allocation for OFDM Transmission With Decode-and-Forward Relaying
TL;DR: Simulation results show that the proposed algorithms almost achieve the optimal weighted sum rate and outperform the existing methods in various channel conditions.
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.