41,903 research outputs found
Optimal Coding Schemes for the Three-Receiver AWGN Broadcast Channel with Receiver Message Side Information
This paper investigates the capacity region of the three-receiver AWGN
broadcast channel where the receivers (i) have private-message requests and
(ii) may know some of the messages requested by other receivers as side
information. We first classify all 64 possible side information configurations
into eight groups, each consisting of eight members. We next construct
transmission schemes, and derive new inner and outer bounds for the groups.
This establishes the capacity region for 52 out of 64 possible side information
configurations. For six groups (i.e., groups 1, 2, 3, 5, 6, and 8 in our
terminology), we establish the capacity region for all their members, and show
that it tightens both the best known inner and outer bounds. For group 4, our
inner and outer bounds tighten the best known inner bound and/or outer bound
for all the group members. Moreover, our bounds coincide at certain regions,
which can be characterized by two thresholds. For group 7, our inner and outer
bounds coincide for four members, thereby establishing the capacity region. For
the remaining four members, our bounds tighten both the best known inner and
outer bounds.Comment: Authors' final version (to appear in IEEE Transactions on Information
Theory
Index Codes with Minimum Locality for Three Receiver Unicast Problems
An index code for a broadcast channel with receiver side information is locally decodable if every receiver
can decode its demand using only a subset of the codeword
symbols transmitted by the sender instead of observing the entire
codeword. Local decodability in index coding improves the error
performance when used in wireless broadcast channels, reduces
the receiver complexity and improves privacy in index coding.
The locality of an index code is the ratio of the number of
codeword symbols used by each receiver to the number message
symbols demanded by the receiver. Prior work on locality in
index coding have considered only single unicast and singleuniprior problems, and the optimal trade-off between broadcast
rate and locality is known only for a few cases. In this paper we
identify the optimal broadcast rate (including among non-linear
codes) for all three receiver unicast problems when the locality
is equal to the minimum possible value, i.e., equal to one. The
index code that achieves this optimal rate is based on a clique
covering technique and is well known. The main contribution
of this paper is in providing tight converse results by relating
locality to broadcast rate, and showing that this known index
coding scheme is optimal when locality is equal to one. Towards
this we derive several structural properties of the side information
graphs of three receiver unicast problems, and combine them
with information theoretic arguments to arrive at a converse
Capacity Bounds For Multi-User Channels With Feedback, Relaying and Cooperation
Recent developments in communications are driven by the goal of
achieving high data rates for wireless communication devices. To
achieve this goal, several new phenomena need to be investigated
from an information theoretic perspective. In this dissertation,
we focus on three of these phenomena: feedback, relaying and
cooperation. We study these phenomena for various multi-user
channels from an information theoretic point of view.
One of the aims of this dissertation is to study the performance
limits of simple wireless networks, for various forms of feedback
and cooperation. Consider an uplink communication system, where
several users wish to transmit independent data to a base-station.
If the base-station can send feedback to the users, one can expect
to achieve higher data-rates since feedback can enable cooperation
among the users. Another way to improve data-rates is to make use
of the broadcast nature of the wireless medium, where the users
can overhear each other's transmitted signals. This particular
phenomenon has garnered much attention lately, where users can
help in increasing each other's data-rates by utilizing the
overheard information. This overheard information can be
interpreted as a generalized form of feedback.
To take these several models of feedback and cooperation into
account, we study the two-user multiple access channel and the
two-user interference channel with generalized feedback. For all
these models, we derive new outer bounds on their capacity
regions. We specialize these results for noiseless feedback,
additive noisy feedback and user-cooperation models and show
strict improvements over the previously known bounds.
Next, we study state-dependent channels with rate-limited state
information to the receiver or to the transmitter. This
state-dependent channel models a practical situation of fading,
where the fade information is partially available to the receiver
or to the transmitter. We derive new bounds on the capacity of
such channels and obtain capacity results for a special sub-class
of such channels.
We study the effect of relaying by considering the parallel relay
network, also known as the diamond channel. The parallel relay
network considered in this dissertation comprises of a cascade of
a general broadcast channel to the relays and an orthogonal
multiple access channel from the relays to the receiver. We
characterize the capacity of the diamond channel, when the
broadcast channel is deterministic. We also study the diamond
channel with partially separated relays, and obtain capacity
results when the broadcast channel is either semi-deterministic or
physically degraded. Our results also demonstrate that feedback to
the relays can strictly increase the capacity of the diamond
channel.
In several sensor network applications, distributed lossless
compression of sources is of considerable interest. The presence
of adversarial nodes makes it important to design compression
schemes which serve the dual purpose of reliable source
transmission to legitimate nodes while minimizing the information
leakage to the adversarial nodes. Taking this constraint into
account, we consider information theoretic secrecy, where our aim
is to limit the information leakage to the eavesdropper. For this
purpose, we study a secure source coding problem with coded side
information from a helper to the legitimate user. We derive the
rate-equivocation region for this problem. We show that the helper
node serves the dual purpose of reducing the source transmission
rate and increasing the uncertainty at the adversarial node. Next,
we considered two different secure source coding models and
provide the corresponding rate-equivocation regions
A Unified Scheme for Two-Receiver Broadcast Channels with Receiver Message Side Information
This paper investigates the capacity regions of two-receiver broadcast
channels where each receiver (i) has both common and private-message requests,
and (ii) knows part of the private message requested by the other receiver as
side information. We first propose a transmission scheme and derive an inner
bound for the two-receiver memoryless broadcast channel. We next prove that
this inner bound is tight for the deterministic channel and the more capable
channel, thereby establishing their capacity regions. We show that this inner
bound is also tight for all classes of two-receiver broadcast channels whose
capacity regions were known prior to this work. Our proposed scheme is
consequently a unified capacity-achieving scheme for these classes of broadcast
channels.Comment: accepted and to be presented at the 2015 IEEE International Symposium
on Information Theory (ISIT 2015
On X-Channels with Feedback and Delayed CSI
The sum degrees of freedom (DoF) of the two-user MIMO X-channel is
characterized in the presence of output feedback and delayed channel state
information (CSI). The number of antennas at each transmitters is assumed to be
M and the number of antennas at each of the receivers is assumed to be N. It is
shown that the sum DoF of the two-user MIMO X-channel is the same as the sum
DoF of a two-user MIMO broadcast channel with 2M transmit antennas, and N
antennas at each receiver. Hence, for this symmetric antenna configuration,
there is no performance loss in the sum degrees of freedom due to the
distributed nature of the transmitters. This result highlights the usefulness
of feedback and delayed CSI for the MIMO X-channel.
The K-user X-channel with single antenna at each transmitter and each
receiver is also studied. In this network, each transmitter has a message
intended for each receiver. For this network, it is shown that the sum DoF with
partial output feedback alone is at least 2K/(K+1). This lower bound is
strictly better than the best lower bound known for the case of delayed CSI
assumption for all values of K.Comment: Submitted to IEEE ISIT 2012 on Jan 22, 201
Capacity of Coded Index Modulation
We consider the special case of index coding over the Gaussian broadcast
channel where each receiver has prior knowledge of a subset of messages at the
transmitter and demands all the messages from the source. We propose a
concatenated coding scheme for this problem, using an index code for the
Gaussian channel as an inner code/modulation to exploit side information at the
receivers, and an outer code to attain coding gain against the channel noise.
We derive the capacity region of this scheme by viewing the resulting channel
as a multiple-access channel with many receivers, and relate it to the 'side
information gain' -- which is a measure of the advantage of a code in utilizing
receiver side information -- of the inner index code/modulation. We demonstrate
the utility of the proposed architecture by simulating the performance of an
index code/modulation concatenated with an off-the-shelf convolutional code
through bit-interleaved coded-modulation.Comment: To appear in Proc. IEEE Int. Symp. Inf. Theory (ISIT) 2015, Hong
Kong, Jun. 2015. 5 pages, 4 figure
Coding Schemes for a Class of Receiver Message Side Information in AWGN Broadcast Channels
This paper considers the three-receiver AWGN broadcast channel where the
receivers (i) have private-message requests and (ii) know some of the messages
requested by other receivers as side information. For this setup, all possible
side information configurations have been recently classified into eight groups
and the capacity of the channel has been established for six groups (Asadi et
al., ISIT 2014). We propose inner and outer bounds for the two remaining
groups, groups 4 and 7. A distinguishing feature of these two groups is that
the weakest receiver knows the requested message of the strongest receiver as
side information while the in-between receiver does not. For group 4, the inner
and outer bounds coincide at certain regions. For group 7, the inner and outer
bounds coincide, thereby establishing the capacity, for four members out of all
eight members of the group; for the remaining four members, the proposed bounds
reduce the gap between the best known inner and outer bounds.Comment: accepted and to be presented at the 2014 IEEE Information Theory
Workshop (ITW
- …