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
Partial converse for a relay channel
TL;DR: A special case of the general discrete memoryless relay channel is studied, which consists of an input x, a relay output z, a channel output y, and a noiseless channel of capacity C/sub r/ allowing the relay sender to send additional information to the decoder.
Proceedings ArticleDOI
Distributed space-time coding for multihop networks
TL;DR: This work considers a distributed block Alamouti scheme, valid for frequency selective channels, where it takes explicitly into account the errors in the source-relay link and derives a closed form expression for the bit error rate in the simple case of BPSK transmission.
Journal ArticleDOI
Cooperative Relaying With State Available Noncausally at the Relay
TL;DR: In this paper, the authors considered a three-terminal state-dependent relay channel with the channel state noncausally available at only the relay, and derived lower and upper bounds on the capacity.
Journal ArticleDOI
MMSE-based joint source and relay precoding design for amplify-and-forward MIMO relay networks
Ronghong Mo,Yong Chew +1 more
TL;DR: Numerical results show that both the minimum mean-square (MSE) performance and the capacity achieved by the two proposed schemes improve with the increase in signal-to-noise- ratio (SNR).
Journal ArticleDOI
Improving the rates in wireless relay systems through superposition coding
Petar Popovski,E. de Carvalho +1 more
TL;DR: It is demonstrated that the SC-relaying can be ported even to the case of uncoded systems, where it is shown how to select the transmission scheme in order to maximize the throughput between the source and the destination.
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.