An achievable rate region for the multiple-access channel with feedback
Thomas M. Cover,Cyril Leung +1 more
Reads0
Chats0
TLDR
This region generally exceeds the achievable rate region without feedback and exceeds the rate point found by Gaarder and Wolf for the binary erasure multiple-access channel with feedback.Abstract:
An achievable rate region R_{1} \leq I(X_{1};Y|X_{2},U), R_{2} \leq I(X_{2}; Y|X_{1},U), R_{1}+R_{2} \leq I(X_{1}, X_{2};Y) , where p(u,x_{l},x_{2},y)= p(u)p(x_{l}|u)p(x_{2}|u)p(y|x_{l},x_{2}) , is established for the multiple-access channel with feedback. Time sharing of these achievable rates yields the rate region of this paper. This region generally exceeds the achievable rate region without feedback and exceeds the rate point found by Gaarder and Wolf for the binary erasure multiple-access channel with feedback. The presence of feedback allows the independent transmitters to understand each other's intended transmissions before the receiver has sufficient information to achieve the desired decoding. This allows the transmitters to cooperate in the transmission of information that resolves the residual uncertainty of the receiver. At the same time, independent information from the transmitters is superimposed on the cooperative correction information. The proof involves list codes and block Markov encoding.read more
Citations
More filters
Journal ArticleDOI
User cooperation diversity. Part I. System description
TL;DR: Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
Journal ArticleDOI
Cooperative strategies and capacity theorems for relay networks
TL;DR: The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial channel knowledge is available at the transmitters, and cases where local user cooperation is permitted.
Book
Network Information Theory
Abbas El Gamal,Young-Han Kim +1 more
TL;DR: In this article, a comprehensive treatment of network information theory and its applications is provided, which provides the first unified coverage of both classical and recent results, including successive cancellation and superposition coding, MIMO wireless communication, network coding and cooperative relaying.
Dissertation
Cooperative diversity in wireless networks: algorithms and architectures
TL;DR: This dissertation develops energy-efficient algorithms that employ certain kinds of cooperation among terminals, and illustrates how one might incorporate these algorithms into various network architectures, including current cellular and ad-hoc networks.
Journal ArticleDOI
Comments on broadcast channels
TL;DR: The key ideas in the theory of broadcast channels are illustrated by discussing some of the progress toward finding the capacity region.
References
More filters
Journal ArticleDOI
Broadcast channels
TL;DR: This work introduces the problem of a single source attempting to communicate information simultaneously to several receivers and determines the families of simultaneously achievable transmission rates for many extreme classes of channels to lead to a new approach to the compound channels problem.
Journal ArticleDOI
Recent results in the Shannon theory
TL;DR: The first part of this paper consists of short summaries of recent work in five rather traditional areas of the Shannon theory, namely: source and channel coding theorems for new situations, and calculation of source rate and channel capacity.
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 coding theorem for multiple access channels with correlated sources
David Slepian,Jack Keil Wolfd +1 more
TL;DR: This paper shows that e, which depends only on the channel, is convex and gives formulas to determine it exactly and is the natural generalization of channel capacity to this situation.