169 research outputs found
Multiaccess Channels with State Known to Some Encoders and Independent Messages
We consider a state-dependent multiaccess channel (MAC) with state
non-causally known to some encoders. We derive an inner bound for the capacity
region in the general discrete memoryless case and specialize to a binary
noiseless case. In the case of maximum entropy channel state, we obtain the
capacity region for binary noiseless MAC with one informed encoder by deriving
a non-trivial outer bound for this case. For a Gaussian state-dependent MAC
with one encoder being informed of the channel state, we present an inner bound
by applying a slightly generalized dirty paper coding (GDPC) at the informed
encoder that allows for partial state cancellation, and a trivial outer bound
by providing channel state to the decoder also. The uninformed encoders benefit
from the state cancellation in terms of achievable rates, however, appears that
GDPC cannot completely eliminate the effect of the channel state on the
achievable rate region, in contrast to the case of all encoders being informed.
In the case of infinite state variance, we analyze how the uninformed encoder
benefits from the informed encoder's actions using the inner bound and also
provide a non-trivial outer bound for this case which is better than the
trivial outer bound.Comment: Accepted to EURASIP Journal on Wireless Communication and Networking,
Feb. 200
On Cooperative Multiple Access Channels with Delayed CSI at Transmitters
We consider a cooperative two-user multiaccess channel in which the
transmission is controlled by a random state. Both encoders transmit a common
message and, one of the encoders also transmits an individual message. We study
the capacity region of this communication model for different degrees of
availability of the states at the encoders, causally or strictly causally. In
the case in which the states are revealed causally to both encoders but not to
the decoder we find an explicit characterization of the capacity region in the
discrete memoryless case. In the case in which the states are revealed only
strictly causally to both encoders, we establish inner and outer bounds on the
capacity region. The outer bound is non-trivial, and has a relatively simple
form. It has the advantage of incorporating only one auxiliary random variable.
We then introduce a class of cooperative multiaccess channels with states known
strictly causally at both encoders for which the inner and outer bounds agree;
and so we characterize the capacity region for this class. In this class of
channels, the state can be obtained as a deterministic function of the channel
inputs and output. We also study the model in which the states are revealed,
strictly causally, in an asymmetric manner, to only one encoder. Throughout the
paper, we discuss a number of examples; and compute the capacity region of some
of these examples. The results shed more light on the utility of delayed
channel state information for increasing the capacity region of state-dependent
cooperative multiaccess channels; and tie with recent progress in this
framework.Comment: 54 pages. To appear in IEEE Transactions on Information Theory. arXiv
admin note: substantial text overlap with arXiv:1201.327
Multiaccess Channels with State Known to One Encoder: Another Case of Degraded Message Sets
We consider a two-user state-dependent multiaccess channel in which only one
of the encoders is informed, non-causally, of the channel states. Two
independent messages are transmitted: a common message transmitted by both the
informed and uninformed encoders, and an individual message transmitted by only
the uninformed encoder. We derive inner and outer bounds on the capacity region
of this model in the discrete memoryless case as well as the Gaussian case.
Further, we show that the bounds for the Gaussian case are tight in some
special cases.Comment: 5 pages, Proc. of IEEE International Symposium on Information theory,
ISIT 2009, Seoul, Kore
Wyner-Ziv Type Versus Noisy Network Coding For a State-Dependent MAC
We consider a two-user state-dependent multiaccess channel in which the
states of the channel are known non-causally to one of the encoders and only
strictly causally to the other encoder. Both encoders transmit a common message
and, in addition, the encoder that knows the states non-causally transmits an
individual message. We find explicit characterizations of the capacity region
of this communication model in both discrete memoryless and memoryless Gaussian
cases. The analysis also reveals optimal ways of exploiting the knowledge of
the state only strictly causally at the encoder that sends only the common
message when such a knowledge is beneficial. The encoders collaborate to convey
to the decoder a lossy version of the state, in addition to transmitting the
information messages through a generalized Gel'fand-Pinsker binning.
Particularly important in this problem are the questions of 1) optimal ways of
performing the state compression and 2) whether or not the compression indices
should be decoded uniquely. We show that both compression \`a-la noisy network
coding, i.e., with no binning, and compression using Wyner-Ziv binning are
optimal. The scheme that uses Wyner-Ziv binning shares elements with Cover and
El Gamal original compress-and-forward, but differs from it mainly in that
backward decoding is employed instead of forward decoding and the compression
indices are not decoded uniquely. Finally, by exploring the properties of our
outer bound, we show that, although not required in general, the compression
indices can in fact be decoded uniquely essentially without altering the
capacity region, but at the expense of larger alphabets sizes for the auxiliary
random variables.Comment: Submitted for publication to the 2012 IEEE International Symposium on
Information Theory, 5 pages, 1 figur
Bounds on the Capacity of the Relay Channel with Noncausal State at Source
We consider a three-terminal state-dependent relay channel with the channel
state available non-causally at only the source. Such a model may be of
interest for node cooperation in the framework of cognition, i.e.,
collaborative signal transmission involving cognitive and non-cognitive radios.
We study the capacity of this communication model. One principal problem is
caused by the relay's not knowing the channel state. For the discrete
memoryless (DM) model, we establish two lower bounds and an upper bound on
channel capacity. The first lower bound is obtained by a coding scheme in which
the source describes the state of the channel to the relay and destination,
which then exploit the gained description for a better communication of the
source's information message. The coding scheme for the second lower bound
remedies the relay's not knowing the states of the channel by first computing,
at the source, the appropriate input that the relay would send had the relay
known the states of the channel, and then transmitting this appropriate input
to the relay. The relay simply guesses the sent input and sends it in the next
block. The upper bound is non trivial and it accounts for not knowing the state
at the relay and destination. For the general Gaussian model, we derive lower
bounds on the channel capacity by exploiting ideas in the spirit of those we
use for the DM model; and we show that these bounds are optimal for small and
large noise at the relay irrespective to the strength of the interference.
Furthermore, we also consider a special case model in which the source input
has two components one of which is independent of the state. We establish a
better upper bound for both DM and Gaussian cases and we also characterize the
capacity in a number of special cases.Comment: Submitted to the IEEE Transactions on Information Theory, 54 pages, 6
figure
Bounds on the Capacity of the Relay Channel with Noncausal State Information at Source
We consider a three-terminal state-dependent relay channel with the channel
state available non-causally at only the source. Such a model may be of
interest for node cooperation in the framework of cognition, i.e.,
collaborative signal transmission involving cognitive and non-cognitive radios.
We study the capacity of this communication model. One principal problem in
this setup is caused by the relay's not knowing the channel state. In the
discrete memoryless (DM) case, we establish lower bounds on channel capacity.
For the Gaussian case, we derive lower and upper bounds on the channel
capacity. The upper bound is strictly better than the cut-set upper bound. We
show that one of the developed lower bounds comes close to the upper bound,
asymptotically, for certain ranges of rates.Comment: 5 pages, submitted to 2010 IEEE International Symposium on
Information Theor
Secure Degrees of Freedom of MIMO X-Channels with Output Feedback and Delayed CSIT
We investigate the problem of secure transmission over a two-user multi-input
multi-output (MIMO) X-channel in which channel state information is provided
with one-unit delay to both transmitters (CSIT), and each receiver feeds back
its channel output to a different transmitter. We refer to this model as MIMO
X-channel with asymmetric output feedback and delayed CSIT. The transmitters
are equipped with M-antennas each, and the receivers are equipped with
N-antennas each. For this model, accounting for both messages at each receiver,
we characterize the optimal sum secure degrees of freedom (SDoF) region. We
show that, in presence of asymmetric output feedback and delayed CSIT, the sum
SDoF region of the MIMO X-channel is same as the SDoF region of a two-user MIMO
BC with 2M-antennas at the transmitter, N-antennas at each receiver and delayed
CSIT. This result shows that, upon availability of asymmetric output feedback
and delayed CSIT, there is no performance loss in terms of sum SDoF due to the
distributed nature of the transmitters. Next, we show that this result also
holds if only output feedback is conveyed to the transmitters, but in a
symmetric manner, i.e., each receiver feeds back its output to both
transmitters and no CSIT. We also study the case in which only asymmetric
output feedback is provided to the transmitters, i.e., without CSIT, and derive
a lower bound on the sum SDoF for this model. Furthermore, we specialize our
results to the case in which there are no security constraints. In particular,
similar to the setting with security constraints, we show that the optimal sum
DoF region of the (M,M,N,N)--MIMO X-channel with asymmetric output feedback and
delayed CSIT is same as the DoF region of a two-user MIMO BC with 2M-antennas
at the transmitter, N-antennas at each receiver, and delayed CSIT. We
illustrate our results with some numerical examples.Comment: To Appear in IEEE Transactions on Information Forensics and Securit
- …