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
Cooperative diversity for wireless ad hoc networks
TL;DR: The latest advances made in determining the theoretical capacity bounds are surveyed and the best practical code designs reported so far are described, predicting that cooperative communication can provide increased capacity and power savings in ad hoc networks.
Journal ArticleDOI
Performance Analysis of OSTBC Transmission in Amplify-and-Forward Cooperative Relay Networks
TL;DR: A performance analysis is presented for amplify-and-forward (AF) cooperative relay networks employing transmit antenna diversity with orthogonal space-time block codes (OSTBCs), where multiple antennas are equipped at the transmitter.
Journal ArticleDOI
Interference Channels with Destination Cooperation
TL;DR: The two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being able to both transmit and receive is studied and the coding scheme employed builds up on the superposition scheme of Han and Kobayashi for two- user interference channels without cooperation.
Posted Content
Capacity of a Class of Modulo-Sum Relay Channels
M. Aleksic,Peyman Razaghi,Wei Yu +2 more
TL;DR: The capacity of a class of modular additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination, is shown to be strictly below the cut-set bound in general and achievable using a quantize-and-forward strategy at the relay.
Journal ArticleDOI
Cooperative wireless multicast: performance analysis and power/location optimization
H.V. Zhao,Weifeng Su +1 more
TL;DR: This paper investigates cooperative multicast schemes that use a maximal ratio combiner to enhance the received signal-to-noise ratio (SNR) and compares the two cooperation strategies, and shows that distributed cooperative multicasts is preferred since it achieves a lower outage probability without introducing extra overhead for control messages.
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.