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
A Spatial Self-Interference Nullification Method for Full Duplex Amplify-And-Forward MIMO Relays
Byungjin Chun,Yong Hoon Lee +1 more
TL;DR: A spatial self-interference nullification method employing extra transmit antennas in FD-AF multiple-input-multiple-output (MIMO) relay systems is proposed, and characteristics of the proposed system when there exist channel estimation errors are analyzed.
Proceedings ArticleDOI
Cooperative diversity through virtual arrays in multihop networks
TL;DR: A multihop cellular network architecture which takes advantage of cooperation among users to induce a diversity gain, and derives the coding strategy, for such a virtual array, that maximizes the sum of the rates from the MTs to the BS, under the constraint of a given total available power.
Proceedings ArticleDOI
Nonlinear Amplifier Distortion in Cooperative Amplify-and-Forward OFDM Systems
TL;DR: In this article, a maximum ratio combiner (MRC) is introduced that includes the effects of the amplifier distortions and a power amplifier nonlinearity cancellation (PANC) technique that is suitable for cooperative systems.
Proceedings ArticleDOI
Virtual MIMO Channels in Cooperative Multi-hop Wireless Sensor Networks
TL;DR: Results show that the performance of the proposed virtual MIMO channels is equal to that of real MIMo channels but for a small SNR loss.
Proceedings ArticleDOI
Minimum energy communication over a relay channel
A. El Gamal,S. Zahedi +1 more
TL;DR: In this paper, upper and lower bounds on the minimum energy-per-bit required for reliable communication over AWGN relay channels were investigated, and the upper bound was shown to be less than 2.
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.