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
Capacity approaching codes for relay channels
TL;DR: In this paper, turbo-based coding scheme for relay systems together with iterative decoding algorithms is designed and the performance of the proposed schemes is about 1.0-1.5 dB away from the information theoretical limits for various channel models.
Journal ArticleDOI
A Soft Decode–Compress–Forward Relaying Scheme for Cooperative Wireless Networks
TL;DR: A new technique for soft information relaying, which is based on a soft decode-compress-forward relay protocol, which provides a means of using distributed low-density parity-check (LDPC) coding in conjunction with higher order modulation, such as pulse amplitude modulation (PAM) and quadrature amplitude modulation(QAM), which is effective even under poor source-relay link conditions.
Proceedings ArticleDOI
Cooperative Relaying with Imperfect Channel State Information
TL;DR: A suboptimum adaptive beamforming strategy is derived that maximizes a derived upper bound on the average system throughput and is shown that relay cooperation can significantly improve the overall system throughput.
Journal ArticleDOI
Relay Scheduling in the Half-Duplex Gaussian Parallel Relay Channel
TL;DR: It is proved that successive relaying, based on the DPC, asymptotically achieves the capacity of the network as well as the optimum scheduling of the relays.
Journal ArticleDOI
Uplink User-Assisted Relaying in Cellular Networks
Hussain Elkotby,Mai Vu +1 more
TL;DR: It is shown that user-assisted relaying can significantly improve per-user transmission rate despite of increased intercell interference, and this transmission rate gain is significant for active users near the cell edge and further increases with higher idle user density, supporting user- assisted relaying as a viable solution to crowded population areas.
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.