7,696 research outputs found
On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding
This work investigates the general two-user Compound Broadcast Channel (BC)
where an encoder wishes to transmit common and private messages to two
receivers while being oblivious to two possible channel realizations
controlling the communication. The focus is on the characterization of the
largest achievable rate region by resorting to more evolved encoding and
decoding techniques than the conventional coding for the standard BC. The role
of the decoder is first explored, and an achievable rate region is derived
based on the principle of "Interference Decoding" (ID) where each receiver
decodes its intended message and chooses to (non-uniquely) decode or not the
interfering message. This inner bound is shown to be capacity achieving for a
class of non-trivial compound BEC/BSC broadcast channels while the worst-case
of Marton's inner bound -based on "Non Interference Decoding" (NID)- fails to
achieve the capacity region. The role of the encoder is then studied, and an
achievable rate region is derived based on "Multiple Description" (MD) coding
where the encoder transmits a common as well as multiple dedicated private
descriptions to the many instances of the users channels. It turns out that MD
coding outperforms the single description scheme -Common Description (CD)
coding- for a class of compound Multiple Input Single Output Broadcast Channels
(MISO BC).Comment: 77 pages, 8 figures, Submitted to IEEE Trans. on Information Theor
Cooperative Strategies for Simultaneous and Broadcast Relay Channels
Consider the \emph{simultaneous relay channel} (SRC) which consists of a set
of relay channels where the source wishes to transmit common and private
information to each of the destinations. This problem is recognized as being
equivalent to that of sending common and private information to several
destinations in presence of helper relays where each channel outcome becomes a
branch of the \emph{broadcast relay channel} (BRC). Cooperative schemes and
capacity region for a set with two memoryless relay channels are investigated.
The proposed coding schemes, based on \emph{Decode-and-Forward} (DF) and
\emph{Compress-and-Forward} (CF) must be capable of transmitting information
simultaneously to all destinations in such set.
Depending on the quality of source-to-relay and relay-to-destination
channels, inner bounds on the capacity of the general BRC are derived. Three
cases of particular interest are considered: cooperation is based on DF
strategy for both users --referred to as DF-DF region--, cooperation is based
on CF strategy for both users --referred to as CF-CF region--, and cooperation
is based on DF strategy for one destination and CF for the other --referred to
as DF-CF region--. These results can be seen as a generalization and hence
unification of previous works. An outer-bound on the capacity of the general
BRC is also derived. Capacity results are obtained for the specific cases of
semi-degraded and degraded Gaussian simultaneous relay channels. Rates are
evaluated for Gaussian models where the source must guarantee a minimum amount
of information to both users while additional information is sent to each of
them.Comment: 32 pages, 7 figures, To appear in IEEE Trans. on Information Theor
Speeding up Future Video Distribution via Channel-Aware Caching-Aided Coded Multicast
Future Internet usage will be dominated by the consumption of a rich variety
of online multimedia services accessed from an exponentially growing number of
multimedia capable mobile devices. As such, future Internet designs will be
challenged to provide solutions that can deliver bandwidth-intensive,
delay-sensitive, on-demand video-based services over increasingly crowded,
bandwidth-limited wireless access networks. One of the main reasons for the
bandwidth stress facing wireless network operators is the difficulty to exploit
the multicast nature of the wireless medium when wireless users or access
points rarely experience the same channel conditions or access the same content
at the same time. In this paper, we present and analyze a novel wireless video
delivery paradigm based on the combined use of channel-aware caching and coded
multicasting that allows simultaneously serving multiple cache-enabled
receivers that may be requesting different content and experiencing different
channel conditions. To this end, we reformulate the caching-aided coded
multicast problem as a joint source-channel coding problem and design an
achievable scheme that preserves the cache-enabled multiplicative throughput
gains of the error-free scenario,by guaranteeing per-receiver rates unaffected
by the presence of receivers with worse channel conditions.Comment: 11 pages,6 figures,to appear in IEEE JSAC Special Issue on Video
Distribution over Future Interne
Lecture Notes on Network Information Theory
These lecture notes have been converted to a book titled Network Information
Theory published recently by Cambridge University Press. This book provides a
significantly expanded exposition of the material in the lecture notes as well
as problems and bibliographic notes at the end of each chapter. The authors are
currently preparing a set of slides based on the book that will be posted in
the second half of 2012. More information about the book can be found at
http://www.cambridge.org/9781107008731/. The previous (and obsolete) version of
the lecture notes can be found at http://arxiv.org/abs/1001.3404v4/
Cooperative Compute-and-Forward
We examine the benefits of user cooperation under compute-and-forward. Much
like in network coding, receivers in a compute-and-forward network recover
finite-field linear combinations of transmitters' messages. Recovery is enabled
by linear codes: transmitters map messages to a linear codebook, and receivers
attempt to decode the incoming superposition of signals to an integer
combination of codewords. However, the achievable computation rates are low if
channel gains do not correspond to a suitable linear combination. In response
to this challenge, we propose a cooperative approach to compute-and-forward. We
devise a lattice-coding approach to block Markov encoding with which we
construct a decode-and-forward style computation strategy. Transmitters
broadcast lattice codewords, decode each other's messages, and then
cooperatively transmit resolution information to aid receivers in decoding the
integer combinations. Using our strategy, we show that cooperation offers a
significant improvement both in the achievable computation rate and in the
diversity-multiplexing tradeoff.Comment: submitted to IEEE Transactions on Information Theor
The Arbitrarily Varying Broadcast Channel with Degraded Message Sets with Causal Side Information at the Encoder
In this work, we study the arbitrarily varying broadcast channel (AVBC), when
state information is available at the transmitter in a causal manner. We
establish inner and outer bounds on both the random code capacity region and
the deterministic code capacity region with degraded message sets. The capacity
region is then determined for a class of channels satisfying a condition on the
mutual informations between the strategy variables and the channel outputs. As
an example, we consider the arbitrarily varying binary symmetric broadcast
channel with correlated noises. We show cases where the condition holds, hence
the capacity region is determined, and other cases where there is a gap between
the bounds.Comment: arXiv admin note: substantial text overlap with arXiv:1701.0334
Relaying Simultaneous Multicast Messages
The problem of multicasting multiple messages with the help of a relay, which
may also have an independent message of its own to multicast, is considered. As
a first step to address this general model, referred to as the compound
multiple access channel with a relay (cMACr), the capacity region of the
multiple access channel with a "cognitive" relay is characterized, including
the cases of partial and rate-limited cognition. Achievable rate regions for
the cMACr model are then presented based on decode-and-forward (DF) and
compress-and-forward (CF) relaying strategies. Moreover, an outer bound is
derived for the special case in which each transmitter has a direct link to one
of the receivers while the connection to the other receiver is enabled only
through the relay terminal. Numerical results for the Gaussian channel are also
provided.Comment: This paper was presented at the IEEE Information Theory Workshop,
Volos, Greece, June 200
- …