127,344 research outputs found
Finite-Block-Length Analysis in Classical and Quantum Information Theory
Coding technology is used in several information processing tasks. In
particular, when noise during transmission disturbs communications, coding
technology is employed to protect the information. However, there are two types
of coding technology: coding in classical information theory and coding in
quantum information theory. Although the physical media used to transmit
information ultimately obey quantum mechanics, we need to choose the type of
coding depending on the kind of information device, classical or quantum, that
is being used. In both branches of information theory, there are many elegant
theoretical results under the ideal assumption that an infinitely large system
is available. In a realistic situation, we need to account for finite size
effects. The present paper reviews finite size effects in classical and quantum
information theory with respect to various topics, including applied aspects
Trusted Noise in Continuous-Variable Quantum Key Distribution: a Threat and a Defense
We address the role of the phase-insensitive trusted preparation and
detection noise in the security of a continuous-variable quantum key
distribution, considering the Gaussian protocols on the basis of coherent and
squeezed states and studying them in the conditions of Gaussian lossy and noisy
channels. The influence of such a noise on the security of Gaussian quantum
cryptography can be crucial, even despite the fact that a noise is trusted, due
to a strongly nonlinear behavior of the quantum entropies involved in the
security analysis. We recapitulate the known effect of the preparation noise in
both direct and reverse-reconciliation protocols, as well as the detection
noise in the reverse-reconciliation scenario. As a new result, we show the
negative role of the trusted detection noise in the direct-reconciliation
scheme. We also describe the role of the trusted preparation or detection noise
added at the reference side of the protocols in improving the robustness of the
protocols to the channel noise, confirming the positive effect for the
coherent-state reverse-reconciliation protocol. Finally, we address the
combined effect of trusted noise added both in the source and the detector.Comment: 25 pages, 9 figure
Precoding for Outage Probability Minimization on Block Fading Channels
The outage probability limit is a fundamental and achievable lower bound on
the word error rate of coded communication systems affected by fading. This
limit is mainly determined by two parameters: the diversity order and the
coding gain. With linear precoding, full diversity on a block fading channel
can be achieved without error-correcting code. However, the effect of precoding
on the coding gain is not well known, mainly due to the complicated expression
of the outage probability. Using a geometric approach, this paper establishes
simple upper bounds on the outage probability, the minimization of which yields
to precoding matrices that achieve very good performance. For discrete
alphabets, it is shown that the combination of constellation expansion and
precoding is sufficient to closely approach the minimum possible outage
achieved by an i.i.d. Gaussian input distribution, thus essentially maximizing
the coding gain.Comment: Submitted to Transactions on Information Theory on March 23, 201
Massive MIMO performance evaluation based on measured propagation data
Massive MIMO, also known as very-large MIMO or large-scale antenna systems,
is a new technique that potentially can offer large network capacities in
multi-user scenarios. With a massive MIMO system, we consider the case where a
base station equipped with a large number of antenna elements simultaneously
serves multiple single-antenna users in the same time-frequency resource. So
far, investigations are mostly based on theoretical channels with independent
and identically distributed (i.i.d.) complex Gaussian coefficients, i.e.,
i.i.d. Rayleigh channels. Here, we investigate how massive MIMO performs in
channels measured in real propagation environments. Channel measurements were
performed at 2.6 GHz using a virtual uniform linear array (ULA) which has a
physically large aperture, and a practical uniform cylindrical array (UCA)
which is more compact in size, both having 128 antenna ports. Based on
measurement data, we illustrate channel behavior of massive MIMO in three
representative propagation conditions, and evaluate the corresponding
performance. The investigation shows that the measured channels, for both array
types, allow us to achieve performance close to that in i.i.d. Rayleigh
channels. It is concluded that in real propagation environments we have
characteristics that can allow for efficient use of massive MIMO, i.e., the
theoretical advantages of this new technology can also be harvested in real
channels.Comment: IEEE Transactions on Wireless Communications, 201
Secret-key generation from wireless channels: Mind the reflections
Secret-key generation in a wireless environment exploiting the randomness and
reciprocity of the channel gains is considered. A new channel model is proposed
which takes into account the effect of reflections (or re-radiations) from
receive antenna elements, thus capturing an physical property of practical
antennas. It turns out that the reflections have a deteriorating effect on the
achievable secret-key rate between the legitimate nodes at high
signal-to-noise-power-ratio (SNR). The insights provide guidelines in the
design and operation of communication systems using the properties of the
wireless channel to prevent eavesdropping.Comment: 6 pages, 9 figure
Reciprocity Calibration for Massive MIMO: Proposal, Modeling and Validation
This paper presents a mutual coupling based calibration method for
time-division-duplex massive MIMO systems, which enables downlink precoding
based on uplink channel estimates. The entire calibration procedure is carried
out solely at the base station (BS) side by sounding all BS antenna pairs. An
Expectation-Maximization (EM) algorithm is derived, which processes the
measured channels in order to estimate calibration coefficients. The EM
algorithm outperforms current state-of-the-art narrow-band calibration schemes
in a mean squared error (MSE) and sum-rate capacity sense. Like its
predecessors, the EM algorithm is general in the sense that it is not only
suitable to calibrate a co-located massive MIMO BS, but also very suitable for
calibrating multiple BSs in distributed MIMO systems.
The proposed method is validated with experimental evidence obtained from a
massive MIMO testbed. In addition, we address the estimated narrow-band
calibration coefficients as a stochastic process across frequency, and study
the subspace of this process based on measurement data. With the insights of
this study, we propose an estimator which exploits the structure of the process
in order to reduce the calibration error across frequency. A model for the
calibration error is also proposed based on the asymptotic properties of the
estimator, and is validated with measurement results.Comment: Submitted to IEEE Transactions on Wireless Communications,
21/Feb/201
- …