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
Power and Resource Allocation for Orthogonal Multiple Access Relay Systems
TL;DR: The numerical results show that the joint allocation of power and the channel resource achieves significantly larger achievable rate regions than those achieved by power allocation alone with fixed channel resource allocation.
Journal ArticleDOI
Joint relay-pair selection for buffer-aided successive opportunistic relaying
Nikolaos Nomikos,Demosthenes Vouyioukas,Themistoklis Charalambous,Ioannis Krikidis,Prodromos Makris,Dimitrios N. Skoutas,Mikael Johansson,Charalabos Skianis +7 more
TL;DR: A buffer-aided successive opportunistic relay scheme where each time a relay-pair is selected with the target of rate maximization is proposed, to reduce the implementation complexity induced by centralized selection and avoid increased relay- Pair switching and channel state information acquisition.
Cooperative communication in wireless systems
TL;DR: Information theoretic models suitable for cooperation are described, achievable rate regions and outage probabilities are studied, and channel coding techniques are described that allow us to exploit the diversity advantages of cooperation.
Proceedings ArticleDOI
Rematch and forward for parallel relay networks
TL;DR: An analog modulo-lattice modulation of the codewords in the BC is used, which allows the relays to re-match the signal to the optimal spectrum of the MAC, thus demonstrating how a channel problem can gain from a joint source/channel approach.
Proceedings ArticleDOI
Relaying in CDMA networks: pathloss reduction and transmit power savings
TL;DR: In this paper, the authors examine various propagation models and network parameters and show to which extent the pathloss in cellular wireless systems can be reduced by the use of relay nodes in a two-hop scenario.
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.