18,696 research outputs found
Multiple Access Channels with Combined Cooperation and Partial Cribbing
In this paper we study the multiple access channel (MAC) with combined
cooperation and partial cribbing and characterize its capacity region.
Cooperation means that the two encoders send a message to one another via a
rate-limited link prior to transmission, while partial cribbing means that each
of the two encoders obtains a deterministic function of the other encoder's
output with or without delay. Prior work in this field dealt separately with
cooperation and partial cribbing. However, by combining these two methods we
can achieve significantly higher rates. Remarkably, the capacity region does
not require an additional auxiliary random variable (RV) since the purpose of
both cooperation and partial cribbing is to generate a common message between
the encoders. In the proof we combine methods of block Markov coding, backward
decoding, double rate-splitting, and joint typicality decoding. Furthermore, we
present the Gaussian MAC with combined one-sided cooperation and quantized
cribbing. For this model, we give an achievability scheme that shows how many
cooperation or quantization bits are required in order to achieve a Gaussian
MAC with full cooperation/cribbing capacity region. After establishing our main
results, we consider two cases where only one auxiliary RV is needed. The first
is a rate distortion dual setting for the MAC with a common message, a private
message and combined cooperation and cribbing. The second is a state-dependent
MAC with cooperation, where the state is known at a partially cribbing encoder
and at the decoder. However, there are cases where more than one auxiliary RV
is needed, e.g., when the cooperation and cribbing are not used for the same
purposes. We present a MAC with an action-dependent state, where the action is
based on the cooperation but not on the cribbing. Therefore, in this case more
than one auxiliary RV is needed
Characterization of Information Channels for Asymptotic Mean Stationarity and Stochastic Stability of Non-stationary/Unstable Linear Systems
Stabilization of non-stationary linear systems over noisy communication
channels is considered. Stochastically stable sources, and unstable but
noise-free or bounded-noise systems have been extensively studied in
information theory and control theory literature since 1970s, with a renewed
interest in the past decade. There have also been studies on non-causal and
causal coding of unstable/non-stationary linear Gaussian sources. In this
paper, tight necessary and sufficient conditions for stochastic stabilizability
of unstable (non-stationary) possibly multi-dimensional linear systems driven
by Gaussian noise over discrete channels (possibly with memory and feedback)
are presented. Stochastic stability notions include recurrence, asymptotic mean
stationarity and sample path ergodicity, and the existence of finite second
moments. Our constructive proof uses random-time state-dependent stochastic
drift criteria for stabilization of Markov chains. For asymptotic mean
stationarity (and thus sample path ergodicity), it is sufficient that the
capacity of a channel is (strictly) greater than the sum of the logarithms of
the unstable pole magnitudes for memoryless channels and a class of channels
with memory. This condition is also necessary under a mild technical condition.
Sufficient conditions for the existence of finite average second moments for
such systems driven by unbounded noise are provided.Comment: To appear in IEEE Transactions on Information Theor
The Sender-Excited Secret Key Agreement Model: Capacity, Reliability and Secrecy Exponents
We consider the secret key generation problem when sources are randomly
excited by the sender and there is a noiseless public discussion channel. Our
setting is thus similar to recent works on channels with action-dependent
states where the channel state may be influenced by some of the parties
involved. We derive single-letter expressions for the secret key capacity
through a type of source emulation analysis. We also derive lower bounds on the
achievable reliability and secrecy exponents, i.e., the exponential rates of
decay of the probability of decoding error and of the information leakage.
These exponents allow us to determine a set of strongly-achievable secret key
rates. For degraded eavesdroppers the maximum strongly-achievable rate equals
the secret key capacity; our exponents can also be specialized to previously
known results.
In deriving our strong achievability results we introduce a coding scheme
that combines wiretap coding (to excite the channel) and key extraction (to
distill keys from residual randomness). The secret key capacity is naturally
seen to be a combination of both source- and channel-type randomness. Through
examples we illustrate a fundamental interplay between the portion of the
secret key rate due to each type of randomness. We also illustrate inherent
tradeoffs between the achievable reliability and secrecy exponents. Our new
scheme also naturally accommodates rate limits on the public discussion. We
show that under rate constraints we are able to achieve larger rates than those
that can be attained through a pure source emulation strategy.Comment: 18 pages, 8 figures; Submitted to the IEEE Transactions on
Information Theory; Revised in Oct 201
Successive Refinement with Decoder Cooperation and its Channel Coding Duals
We study cooperation in multi terminal source coding models involving
successive refinement. Specifically, we study the case of a single encoder and
two decoders, where the encoder provides a common description to both the
decoders and a private description to only one of the decoders. The decoders
cooperate via cribbing, i.e., the decoder with access only to the common
description is allowed to observe, in addition, a deterministic function of the
reconstruction symbols produced by the other. We characterize the fundamental
performance limits in the respective settings of non-causal, strictly-causal
and causal cribbing. We use a new coding scheme, referred to as Forward
Encoding and Block Markov Decoding, which is a variant of one recently used by
Cuff and Zhao for coordination via implicit communication. Finally, we use the
insight gained to introduce and solve some dual channel coding scenarios
involving Multiple Access Channels with cribbing.Comment: 55 pages, 15 figures, 8 tables, submitted to IEEE Transactions on
Information Theory. A shorter version submitted to ISIT 201
Molecular basis for heat desensitization of TRPV1 ion channels.
The transient receptor potential vanilloid 1 (TRPV1) ion channel is a prototypical molecular sensor for noxious heat in mammals. Its role in sustained heat response remains poorly understood, because rapid heat-induced desensitization (Dh) follows tightly heat-induced activation (Ah). To understand the physiological role and structural basis of Dh, we carried out a comparative study of TRPV1 channels in mouse (mV1) and those in platypus (pV1), which naturally lacks Dh. Here we show that a temperature-sensitive interaction between the N- and C-terminal domains of mV1 but not pV1 drives a conformational rearrangement in the pore leading to Dh. We further show that knock-in mice expressing pV1 sensed heat normally but suffered scald damages in a hot environment. Our findings suggest that Dh evolved late during evolution as a protective mechanism and a delicate balance between Ah and Dh is crucial for mammals to sense and respond to noxious heat
- …