scispace - formally typeset
Open Access

Capacity theorems for the relay channel

Thomas M. Cover, +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

Hybrid Turbo FEC/ARQ Systems and Distributed Space-Time Coding for Cooperative Transmission

TL;DR: It is shown that multiplexing gains are observed even if the mobile station features a single antenna, provided that cell wide reuse of the relay radio resource is possible and the benefits of coded cooperation over direct transmission in terms of increased throughput.
Proceedings ArticleDOI

Brief survey on full-duplex relaying and its applications on 5G

TL;DR: This paper provides an overview of the state-of-the-art on self-interference cancellation techniques from antenna design to digital cancellation, and assess current developments in full-duplex relaying, some promising protocols and some of the performance analysis carried out so far.
Dissertation

Simultaneous wireless information and power transfer in full-duplex communication systems

TL;DR: In this paper, the authors investigated the potentials of simultaneous wireless information and power transfer (SWIPT) in FD communication systems and investigated the optimal transmit strategies, rate maximization and power minimizing approach for SWIPT in FD systems.
Proceedings ArticleDOI

Window decoding for the multiaccess channel with generalized feedback

TL;DR: Low-delay decoding schemes based on window decoding are developed for the multiaccess channel with generalized feedback (MAC-GF) and it is shown that window decoding sometimes incurs a rate loss as compared to backward decoding.
Journal ArticleDOI

Coding and system design for quantize-map-and-forward relaying

TL;DR: A low-complexity coding scheme and system design framework for the half duplex relay channel based on the Quantize-Map-and-Forward (QMF) relaying scheme that extends naturally to the high SNR regime using bit interleaved coded modulation (BICM).
References
More filters
Journal ArticleDOI

Noiseless coding of correlated information sources

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

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.
Related Papers (5)