35,589 research outputs found
The Capacity of Three-Receiver AWGN Broadcast Channels with Receiver Message Side Information
This paper investigates the capacity region of three-receiver AWGN broadcast
channels where the receivers (i) have private-message requests and (ii) know
the messages requested by some other receivers as side information. We classify
these channels based on their side information into eight groups, and construct
different transmission schemes for the groups. For six groups, we characterize
the capacity region, and show that it improves both the best known inner and
outer bounds. For the remaining two groups, we improve the best known inner
bound by using side information during channel decoding at the receivers.Comment: This is an extended version of the same-titled paper submitted to
IEEE International Symposium on Information Theory (ISIT) 201
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
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
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
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
- …