2,865 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
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/
A vector quantization approach to universal noiseless coding and quantization
A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may be noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to two-stage coding, in which the first stage code can be regarded as a vector quantizer that “quantizes” the input data of length n to one of a fixed collection of block codes. We apply the generalized Lloyd algorithm to the first-stage quantizer, using induced measures of rate and distortion, to design locally optimal two-stage codes. On a source of medical images, two-stage variable-rate vector quantizers designed in this way outperform standard (one-stage) fixed-rate vector quantizers by over 9 dB. The tail of the operational distortion-rate function of the first-stage quantizer determines the optimal rate of convergence of the redundancy of a universal sequence of two-stage codes. We show that there exist two-stage universal noiseless codes, fixed-rate quantizers, and variable-rate quantizers whose per-letter rate and distortion redundancies converge to zero as (k/2)n -1 log n, when the universe of sources has finite dimension k. This extends the achievability part of Rissanen's theorem from universal noiseless codes to universal quantizers. Further, we show that the redundancies converge as O(n-1) when the universe of sources is countable, and as O(n-1+ϵ) when the universe of sources is infinite-dimensional, under appropriate conditions
Entanglement-assisted communication of classical and quantum information
We consider the problem of transmitting classical and quantum information
reliably over an entanglement-assisted quantum channel. Our main result is a
capacity theorem that gives a three-dimensional achievable rate region. Points
in the region are rate triples, consisting of the classical communication rate,
the quantum communication rate, and the entanglement consumption rate of a
particular coding scheme. The crucial protocol in achieving the boundary points
of the capacity region is a protocol that we name the classically-enhanced
father protocol. The classically-enhanced father protocol is more general than
other protocols in the family tree of quantum Shannon theoretic protocols, in
the sense that several previously known quantum protocols are now child
protocols of it. The classically-enhanced father protocol also shows an
improvement over a time-sharing strategy for the case of a qubit dephasing
channel--this result justifies the need for simultaneous coding of classical
and quantum information over an entanglement-assisted quantum channel. Our
capacity theorem is of a multi-letter nature (requiring a limit over many uses
of the channel), but it reduces to a single-letter characterization for at
least three channels: the completely depolarizing channel, the quantum erasure
channel, and the qubit dephasing channel.Comment: 23 pages, 5 figures, 1 table, simplification of capacity region--it
now has the simple interpretation as the unit resource capacity region
translated along the classically-enhanced father trade-off curv
Communicating over Filter-and-Forward Relay Networks with Channel Output Feedback
Relay networks aid in increasing the rate of communication from source to
destination. However, the capacity of even a three-terminal relay channel is an
open problem. In this work, we propose a new lower bound for the capacity of
the three-terminal relay channel with destination-to-source feedback in the
presence of correlated noise. Our lower bound improves on the existing bounds
in the literature. We then extend our lower bound to general relay network
configurations using an arbitrary number of filter-and-forward relay nodes.
Such network configurations are common in many multi-hop communication systems
where the intermediate nodes can only perform minimal processing due to limited
computational power. Simulation results show that significant improvements in
the achievable rate can be obtained through our approach. We next derive a
coding strategy (optimized using post processed signal-to-noise ratio as a
criterion) for the three-terminal relay channel with noisy channel output
feedback for two transmissions. This coding scheme can be used in conjunction
with open-loop codes for applications like automatic repeat request (ARQ) or
hybrid-ARQ.Comment: 15 pages, 8 figures, to appear in IEEE Transactions on Signal
Processin
The Binary Energy Harvesting Channel with a Unit-Sized Battery
We consider a binary energy harvesting communication channel with a
finite-sized battery at the transmitter. In this model, the channel input is
constrained by the available energy at each channel use, which is driven by an
external energy harvesting process, the size of the battery, and the previous
channel inputs. We consider an abstraction where energy is harvested in binary
units and stored in a battery with the capacity of a single unit, and the
channel inputs are binary. Viewing the available energy in the battery as a
state, this is a state-dependent channel with input-dependent states, memory in
the states, and causal state information available at the transmitter only. We
find an equivalent representation for this channel based on the timings of the
symbols, and determine the capacity of the resulting equivalent timing channel
via an auxiliary random variable. We give achievable rates based on certain
selections of this auxiliary random variable which resemble lattice coding for
the timing channel. We develop upper bounds for the capacity by using a
genie-aided method, and also by quantifying the leakage of the state
information to the receiver. We show that the proposed achievable rates are
asymptotically capacity achieving for small energy harvesting rates. We extend
the results to the case of ternary channel inputs. Our achievable rates give
the capacity of the binary channel within 0.03 bits/channel use, the ternary
channel within 0.05 bits/channel use, and outperform basic Shannon strategies
that only consider instantaneous battery states, for all parameter values.Comment: Submitted to IEEE Transactions on Information Theory, August 201
Distributed Hypothesis Testing with Privacy Constraints
We revisit the distributed hypothesis testing (or hypothesis testing with
communication constraints) problem from the viewpoint of privacy. Instead of
observing the raw data directly, the transmitter observes a sanitized or
randomized version of it. We impose an upper bound on the mutual information
between the raw and randomized data. Under this scenario, the receiver, which
is also provided with side information, is required to make a decision on
whether the null or alternative hypothesis is in effect. We first provide a
general lower bound on the type-II exponent for an arbitrary pair of
hypotheses. Next, we show that if the distribution under the alternative
hypothesis is the product of the marginals of the distribution under the null
(i.e., testing against independence), then the exponent is known exactly.
Moreover, we show that the strong converse property holds. Using ideas from
Euclidean information theory, we also provide an approximate expression for the
exponent when the communication rate is low and the privacy level is high.
Finally, we illustrate our results with a binary and a Gaussian example
- …