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
Recent and Emerging Topics in Wireless Industrial Communications: A Selection
TL;DR: This paper discusses a selection of promising and interesting research areas in the design of protocols and systems for wireless industrial communications that have either emerged as hot topics in the industrial communications community in the last few years, or which could be worthwhile research Topics in the next few years.
Proceedings ArticleDOI
An efficient protocol for realizing cooperative diversity in wireless networks
TL;DR: Two variants of an energy-efficient cooperative diversity protocol are developed that combats fading induced by multipath propagation in wireless networks and can lead to reduced battery drain, longer network lifetime, and improved network performance in terms of, e.g., capacity.
Journal ArticleDOI
Hybrid Full-Duplex/Half-Duplex Relaying with Transmit Power Adaptation
TL;DR: This work proposes the combination of opportunistic mode selection and transmit power adaptation for maximizing instantaneous and average spectral efficiency after noting that the trade-off favors alternately the modes during operation.
Posted Content
Physical Network Coding in Two-Way Wireless Relay Channels
Petar Popovski,Hiroyuki Yomo +1 more
TL;DR: In this paper, the authors investigated the conditions for maximization of the two-way rate for each individual scheme: (1) the Decode-and-Forward (DF) 3-step schemes, (2) three different schemes with two steps: Amplify-and--Forward (AF), JDF and Denoise--and-forward (DNF), and the most interesting result of the paper is that, for some SNR configurations of the source-relay links, JDF yields identical maximal twoway rate as the upper bound on DNF.
Journal ArticleDOI
Convex Optimization-Based Beamforming
Alex B. Gershman,Nicholas D. Sidiropoulos,Shahram Shahbazpanahi,Mats Bengtsson,Bjorn Ottersten +4 more
TL;DR: It is demonstrated that convex optimization provides an indispensable set of tools for beamforming, enabling rigorous formulation and effective solution of both long-standing and emerging design problems.
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.