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
On the Performance of Cooperative Transmission Schemes in Industrial Wireless Sensor Networks
TL;DR: The simulation results show that, by utilizing a return channel, the IDF and IAF cooperative schemes achieve better performance than the other schemes in most cases.
Journal ArticleDOI
Dual-hop amplify-and-forward cooperative relaying in the presence of Tx and Rx in-phase and quadrature-phase imbalance
TL;DR: A compensation algorithm for the I/Q imbalance is proposed, which makes use of the received signals at the destination, from the source and the relay nodes, together with their conjugations to detect the transmitted signal.
Proceedings ArticleDOI
Performance analysis of amplify-and-forward cooperative communication systems with channel estimation errors
Yi Wu,Matthias Patzold +1 more
TL;DR: This paper studies the symbol-error-rate (SER) performance of a cooperative communication system operating in an amplify-and-forward (AF) mode, where the channel state information available at the receiver is an estimate of the channel gains with estimation errors.
Journal ArticleDOI
Minimum Error-Rate Linear Dispersion Codes for Cooperative Relays
TL;DR: A two-layer linear dispersion (LD) code is proposed for cooperative diversity systems and a simulation-based optimization algorithm is derived to optimize the LD code and power allocation in terms of block error rate.
Proceedings ArticleDOI
Cooperative Relay Scheduling under Partial State Information in Energy Harvesting Sensor Networks
TL;DR: This paper addresses the problem of transmission scheduling in such networks when only partial state information about the relays is available at the source as a Partially Observable Markov Decision Process (POMDP), and shows that it can be decomposed into an equivalent Markov decision process (MDP) problem.
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.