Capacity bounds for multiuser channels with non-causal channel state information at the transmitters
Reza Khosravi-Farsani,Farokh Marvasti +1 more
- pp 195-199
Reads0
Chats0
TLDR
In this paper, capacity inner and outer bounds are established for multiuser channels with Channel State Information known non-causally at the transmitters: The Multiple Access Channel (MAC), the Broadcast Channel with common information, and the Relay Channel.Abstract:
In this paper, capacity inner and outer bounds are established for multiuser channels with Channel State Information (CSI) known non-causally at the transmitters: The Multiple Access Channel (MAC), the Broadcast Channel (BC) with common information, and the Relay Channel (RC). For each channel, the actual capacity region is also derived in some special cases. Specifically, it is shown that for some deterministic models with non-causal CSI at the transmitters, similar to Costa's Gaussian channel, the availability of CSI at the deterministic receivers does not affect the capacity region.read more
Citations
More filters
Journal ArticleDOI
Bounds on the Capacity of the Relay Channel With Noncausal State at the Source
TL;DR: A three-terminal state-dependent relay channel with the channel state available noncausally at only the source is considered, which may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal transmission involving cognitive and noncognitive radios.
Journal ArticleDOI
The State-Dependent Semideterministic Broadcast Channel
Amos Lapidoth,Ligong Wang +1 more
TL;DR: In this paper, the capacity region of the state-dependent semideterministic broadcast channel with non-causal state information at the transmitter was derived, and it was shown that appending the state to the deterministic output does not increase capacity.
Journal ArticleDOI
Capacity Region of Cooperative Multiple-Access Channel With States
TL;DR: Two optimal coding schemes that perform this state compression differently are developed and it is shown that when used as parts of appropriately tuned encoding and decoding processes, both compression à-la noisy network coding by Lim or the quantize-map-and-forward by Avestimeher, and compression using Wyner-Ziv binning are optimal.
Journal ArticleDOI
Secret Writing on Dirty Paper: A Deterministic View
TL;DR: In this paper, a deterministic view is taken and the problem of wiretap channel with side information is revisited and a precise characterization of the secrecy capacity is obtained for a linear deterministic model.
Proceedings ArticleDOI
Multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder
TL;DR: In this article, the capacity region of a two-user state-dependent multiaccess channel with non-causally known states of the channel to one of the encoders and only strictly causally to the other encoder was studied.
References
More filters
Journal ArticleDOI
Capacity theorems for the relay channel
Thomas M. Cover,Abbas El Gamal +1 more
TL;DR: In this article, the capacity of the Gaussian relay channel was investigated, and a lower bound of the capacity was established for the general relay channel, where the dependence of the received symbols upon the inputs is given by p(y,y) to both x and y. In particular, the authors proved that if y is a degraded form of y, then C \: = \: \max \!p(x,y,x,2})} \min \,{I(X,y), I(X,Y,Y,X,Y
Journal ArticleDOI
Writing on dirty paper (Corresp.)
TL;DR: It is shown that the optimal transmitter adapts its signal to the state S rather than attempting to cancel it, which is also the capacity of a standard Gaussian channel with signal-to-noise power ratio P/N.
Capacity theorems for the relay channel
Thomas M. Cover,A. El Gamal +1 more
TL;DR: 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.
Journal ArticleDOI
A coding theorem for the discrete memoryless broadcast channel
TL;DR: A coding theorem for the discrete memoryless broadcast channel is proved for the case where no common message is to he transmitted and the result is tight for broadcast channels having one deterministic component.