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
Combining Decoded-and-Forwarded Signals in Gaussian Cooperative Channels
TL;DR: This paper more deeply looks at the case where the relays are in bad reception conditions and the cooperation powers are sufficiently high, and in this situation using a conventional MRC severely degrades the receiver performance.
Proceedings ArticleDOI
Virtual MIMO schemes for downlink space-frequency coding OFDM systems
TL;DR: This work evaluates the performance of single-relay cooperative scheme, where the source is equipped with a 2-antenna array and both the relay and destination with a single antenna, and compares against non-cooperative OFDM based systems for typical pedestrian scenarios based on LTE specifications.
And resource management
TL;DR: The behavior of predators, both natural and human, must be influenced by the need to obtain information pertaining to the location and abundance of their prey, and this fact opens up a number of questions of strategic nature for the predator.
Proceedings ArticleDOI
Capacity Performance of Amplify-and-Forward MIMO Relay with Transmit Antenna Selection and Maximal-Ratio Combining
TL;DR: C capacity performance analysis is presented for multiple-input multiple-output (MIMO) relay channels with transmit antenna selection and maximal-ratio combining receive in amplify-and-forward (AF) relay networks operating over flat Rayleigh fading channels.
Journal ArticleDOI
Outage Performance of Decode-and-Forward in Two-Way Relaying With Outdated CSI
TL;DR: A new relay selection metric is proposed to take into consideration both transmission rates and instantaneous link conditions between cooperating nodes to assess the accuracy of the analytical derivations and confirm the performance gain of the proposed scheme.
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.