114,562 research outputs found
On Continuous-Time Gaussian Channels
A continuous-time white Gaussian channel can be formulated using a white
Gaussian noise, and a conventional way for examining such a channel is the
sampling approach based on the Shannon-Nyquist sampling theorem, where the
original continuous-time channel is converted to an equivalent discrete-time
channel, to which a great variety of established tools and methodology can be
applied. However, one of the key issues of this scheme is that continuous-time
feedback and memory cannot be incorporated into the channel model. It turns out
that this issue can be circumvented by considering the Brownian motion
formulation of a continuous-time white Gaussian channel. Nevertheless, as
opposed to the white Gaussian noise formulation, a link that establishes the
information-theoretic connection between a continuous-time channel under the
Brownian motion formulation and its discrete-time counterparts has long been
missing. This paper is to fill this gap by establishing causality-preserving
connections between continuous-time Gaussian feedback/memory channels and their
associated discrete-time versions in the forms of sampling and approximation
theorems, which we believe will play important roles in the long run for
further developing continuous-time information theory.
As an immediate application of the approximation theorem, we propose the
so-called approximation approach to examine continuous-time white Gaussian
channels in the point-to-point or multi-user setting. It turns out that the
approximation approach, complemented by relevant tools from stochastic
calculus, can enhance our understanding of continuous-time Gaussian channels in
terms of giving alternative and strengthened interpretation to some long-held
folklore, recovering "long known" results from new perspectives, and rigorously
establishing new results predicted by the intuition that the approximation
approach carries
Reconciliation of a Quantum-Distributed Gaussian Key
Two parties, Alice and Bob, wish to distill a binary secret key out of a list
of correlated variables that they share after running a quantum key
distribution protocol based on continuous-spectrum quantum carriers. We present
a novel construction that allows the legitimate parties to get equal bit
strings out of correlated variables by using a classical channel, with as few
leaked information as possible. This opens the way to securely correcting
non-binary key elements. In particular, the construction is refined to the case
of Gaussian variables as it applies directly to recent continuous-variable
protocols for quantum key distribution.Comment: 8 pages, 4 figures. Submitted to the IEEE for possible publication.
Revised version to improve its clarit
Nomographic Functions: Efficient Computation in Clustered Gaussian Sensor Networks
In this paper, a clustered wireless sensor network is considered that is
modeled as a set of coupled Gaussian multiple-access channels. The objective of
the network is not to reconstruct individual sensor readings at designated
fusion centers but rather to reliably compute some functions thereof. Our
particular attention is on real-valued functions that can be represented as a
post-processed sum of pre-processed sensor readings. Such functions are called
nomographic functions and their special structure permits the utilization of
the interference property of the Gaussian multiple-access channel to reliably
compute many linear and nonlinear functions at significantly higher rates than
those achievable with standard schemes that combat interference. Motivated by
this observation, a computation scheme is proposed that combines a suitable
data pre- and post-processing strategy with a nested lattice code designed to
protect the sum of pre-processed sensor readings against the channel noise.
After analyzing its computation rate performance, it is shown that at the cost
of a reduced rate, the scheme can be extended to compute every continuous
function of the sensor readings in a finite succession of steps, where in each
step a different nomographic function is computed. This demonstrates the
fundamental role of nomographic representations.Comment: to appear in IEEE Transactions on Wireless Communication
- …