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
Posted Content
Outage Capacity of the Fading Relay Channel in the Low SNR Regime
A. Salman Avestimehr,David Tse +1 more
TL;DR: In this article, the outage capacity of relay channels in the low SNR and low outage probability regime was analyzed and it was shown that the bursty Amplify-Forward protocol is optimal in this regime.
Journal ArticleDOI
Design of an OFDM Cooperative Space-Time Diversity System
TL;DR: This paper designs a space-time cooperative system based on orthogonal frequency division multiplexing (OFDM), which is referred to as a cooperative (CO)-OFDM system, and devise a frame structure, on which to build practical timing and frequency synchronization algorithms and a channel estimation algorithm.
Journal ArticleDOI
Outage minimization with limited feedback for the fading relay channel
TL;DR: This work suggests that there is minimal power savings from using spatial power allocation at the transmitters, and finds practical methods to approach the theoretical performance limits through the use of power control with finite rate feedback.
Proceedings Article
On the Capacity of 'Cheap' Relay Networks
TL;DR: The capacities of the degraded cheap relay channel and the multi-hop net- work with cheap nodes are derived from the direct application of the upper bounds derived in (7).
Journal ArticleDOI
Bandwidth and Power Allocation for Cooperative Strategies in Gaussian Relay Networks
Ivana Maric,Roy D. Yates +1 more
TL;DR: In a large scale network, the choice of a coding strategy goes beyond determining a coding scheme at a node; it also determines the operating bandwidth, as well as the set of relays and best distribution of the relay power.
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.