25 research outputs found
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
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
Secrecy in the 2-User Symmetric Deterministic Interference Channel with Transmitter Cooperation
This work presents novel achievable schemes for the 2-user symmetric linear
deterministic interference channel with limited-rate transmitter cooperation
and perfect secrecy constraints at the receivers. The proposed achievable
scheme consists of a combination of interference cancelation, relaying of the
other user's data bits, time sharing, and transmission of random bits,
depending on the rate of the cooperative link and the relative strengths of the
signal and the interference. The results show, for example, that the proposed
scheme achieves the same rate as the capacity without the secrecy constraints,
in the initial part of the weak interference regime. Also, sharing random bits
through the cooperative link can achieve a higher secrecy rate compared to
sharing data bits, in the very high interference regime. The results highlight
the importance of limited transmitter cooperation in facilitating secure
communications over 2-user interference channels.Comment: 5 pages, submitted to SPAWC 201
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
Cooperative Relaying with State Available Non-Causally at the Relay
We consider a three-terminal state-dependent relay channel with the channel
state noncausally available at only the relay. Such a model may be useful for
designing cooperative wireless networks with some terminals equipped with
cognition capabilities, i.e., the relay in our setup. In the discrete
memoryless (DM) case, we establish lower and upper bounds on channel capacity.
The lower bound is obtained by a coding scheme at the relay that uses a
combination of codeword splitting, Gel'fand-Pinsker binning, and
decode-and-forward relaying. The upper bound improves upon that obtained by
assuming that the channel state is available at the source, the relay, and the
destination. For the Gaussian case, we also derive lower and upper bounds on
the capacity. The lower bound is obtained by a coding scheme at the relay that
uses a combination of codeword splitting, generalized dirty paper coding, and
decode-and-forward relaying; the upper bound is also better than that obtained
by assuming that the channel state is available at the source, the relay, and
the destination. In the case of degraded Gaussian channels, the lower bound
meets with the upper bound for some special cases, and, so, the capacity is
obtained for these cases. Furthermore, in the Gaussian case, we also extend the
results to the case in which the relay operates in a half-duplex mode.Comment: 62 pages. To appear in IEEE Transactions on Information Theor