1,214 research outputs found
Communications systems research - Coding and synchronization studies
Low-rate command data link performance, serial orthogonal decoder analysis, and optimal codes and strong converse for transmission over noisy memoryless channel
The Impact of Hard-Decision Detection on the Energy Efficiency of Phase and Frequency Modulation
The central design challenge in next generation wireless systems is to have
these systems operate at high bandwidths and provide high data rates while
being cognizant of the energy consumption levels especially in mobile
applications. Since communicating at very high data rates prohibits obtaining
high bit resolutions from the analog-to-digital (A/D) converters, analysis of
the energy efficiency under the assumption of hard-decision detection is called
for to accurately predict the performance levels. In this paper, transmission
over the additive white Gaussian noise (AWGN) channel, and coherent and
noncoherent fading channels is considered, and the impact of hard-decision
detection on the energy efficiency of phase and frequency modulations is
investigated. Energy efficiency is analyzed by studying the capacity of these
modulation schemes and the energy required to send one bit of information
reliably in the low signal-to-noise ratio (SNR) regime. The capacity of
hard-decision-detected phase and frequency modulations is characterized at low
SNR levels through closed-form expressions for the first and second derivatives
of the capacity at zero SNR. Subsequently, bit energy requirements in the
low-SNR regime are identified. The increases in the bit energy incurred by
hard-decision detection and channel fading are quantified. Moreover, practical
design guidelines for the selection of the constellation size are drawn from
the analysis of the spectral efficiency--bit energy tradeoff.Comment: To appear in the IEEE Transactions on Wireless Communication
Distributed Detection over Fading MACs with Multiple Antennas at the Fusion Center
A distributed detection problem over fading Gaussian multiple-access channels
is considered. Sensors observe a phenomenon and transmit their observations to
a fusion center using the amplify and forward scheme. The fusion center has
multiple antennas with different channel models considered between the sensors
and the fusion center, and different cases of channel state information are
assumed at the sensors. The performance is evaluated in terms of the error
exponent for each of these cases, where the effect of multiple antennas at the
fusion center is studied. It is shown that for zero-mean channels between the
sensors and the fusion center when there is no channel information at the
sensors, arbitrarily large gains in the error exponent can be obtained with
sufficient increase in the number of antennas at the fusion center. In stark
contrast, when there is channel information at the sensors, the gain in error
exponent due to having multiple antennas at the fusion center is shown to be no
more than a factor of (8/pi) for Rayleigh fading channels between the sensors
and the fusion center, independent of the number of antennas at the fusion
center, or correlation among noise samples across sensors. Scaling laws for
such gains are also provided when both sensors and antennas are increased
simultaneously. Simple practical schemes and a numerical method using
semidefinite relaxation techniques are presented that utilize the limited
possible gains available. Simulations are used to establish the accuracy of the
results.Comment: 21 pages, 9 figures, submitted to the IEEE Transactions on Signal
Processin
The Security of Practical Quantum Key Distribution
Quantum key distribution (QKD) is the first quantum information task to reach
the level of mature technology, already fit for commercialization. It aims at
the creation of a secret key between authorized partners connected by a quantum
channel and a classical authenticated channel. The security of the key can in
principle be guaranteed without putting any restriction on the eavesdropper's
power.
The first two sections provide a concise up-to-date review of QKD, biased
toward the practical side. The rest of the paper presents the essential
theoretical tools that have been developed to assess the security of the main
experimental platforms (discrete variables, continuous variables and
distributed-phase-reference protocols).Comment: Identical to the published version, up to cosmetic editorial change
Optimal Power Allocation by Imperfect Hardware Analysis in Untrusted Relaying Networks
By taking a variety of realistic hardware imperfections into consideration,
we propose an optimal power allocation (OPA) strategy to maximize the
instantaneous secrecy rate of a cooperative wireless network comprised of a
source, a destination and an untrusted amplify-and-forward (AF) relay. We
assume that either the source or the destination is equipped with a large-scale
multiple antennas (LSMA) system, while the rest are equipped with a single
antenna. To prevent the untrusted relay from intercepting the source message,
the destination sends an intended jamming noise to the relay, which is referred
to as destination-based cooperative jamming (DBCJ). Given this system model,
novel closed-form expressions are presented in the high signal-to-noise ratio
(SNR) regime for the ergodic secrecy rate (ESR) and the secrecy outage
probability (SOP). We further improve the secrecy performance of the system by
optimizing the associated hardware design. The results reveal that by
beneficially distributing the tolerable hardware imperfections across the
transmission and reception radio-frequency (RF) front ends of each node, the
system's secrecy rate may be improved. The engineering insight is that equally
sharing the total imperfections at the relay between the transmitter and the
receiver provides the best secrecy performance. Numerical results illustrate
that the proposed OPA together with the most appropriate hardware design
significantly increases the secrecy rate.Comment: 29 pages, 7 figures, Submitted to IEEE Transactions on Wireless
Communication
Noncoherent Capacity of Underspread Fading Channels
We derive bounds on the noncoherent capacity of wide-sense stationary
uncorrelated scattering (WSSUS) channels that are selective both in time and
frequency, and are underspread, i.e., the product of the channel's delay spread
and Doppler spread is small. For input signals that are peak constrained in
time and frequency, we obtain upper and lower bounds on capacity that are
explicit in the channel's scattering function, are accurate for a large range
of bandwidth and allow to coarsely identify the capacity-optimal bandwidth as a
function of the peak power and the channel's scattering function. We also
obtain a closed-form expression for the first-order Taylor series expansion of
capacity in the limit of large bandwidth, and show that our bounds are tight in
the wideband regime. For input signals that are peak constrained in time only
(and, hence, allowed to be peaky in frequency), we provide upper and lower
bounds on the infinite-bandwidth capacity and find cases when the bounds
coincide and the infinite-bandwidth capacity is characterized exactly. Our
lower bound is closely related to a result by Viterbi (1967).
The analysis in this paper is based on a discrete-time discrete-frequency
approximation of WSSUS time- and frequency-selective channels. This
discretization explicitly takes into account the underspread property, which is
satisfied by virtually all wireless communication channels.Comment: Submitted to the IEEE Transactions on Information Theor
On the BICM Capacity
Optimal binary labelings, input distributions, and input alphabets are
analyzed for the so-called bit-interleaved coded modulation (BICM) capacity,
paying special attention to the low signal-to-noise ratio (SNR) regime. For
8-ary pulse amplitude modulation (PAM) and for 0.75 bit/symbol, the folded
binary code results in a higher capacity than the binary reflected gray code
(BRGC) and the natural binary code (NBC). The 1 dB gap between the additive
white Gaussian noise (AWGN) capacity and the BICM capacity with the BRGC can be
almost completely removed if the input symbol distribution is properly
selected. First-order asymptotics of the BICM capacity for arbitrary input
alphabets and distributions, dimensions, mean, variance, and binary labeling
are developed. These asymptotics are used to define first-order optimal (FOO)
constellations for BICM, i.e. constellations that make BICM achieve the Shannon
limit -1.59 \tr{dB}. It is shown that the \Eb/N_0 required for reliable
transmission at asymptotically low rates in BICM can be as high as infinity,
that for uniform input distributions and 8-PAM there are only 72 classes of
binary labelings with a different first-order asymptotic behavior, and that
this number is reduced to only 26 for 8-ary phase shift keying (PSK). A general
answer to the question of FOO constellations for BICM is also given: using the
Hadamard transform, it is found that for uniform input distributions, a
constellation for BICM is FOO if and only if it is a linear projection of a
hypercube. A constellation based on PAM or quadrature amplitude modulation
input alphabets is FOO if and only if they are labeled by the NBC; if the
constellation is based on PSK input alphabets instead, it can never be FOO if
the input alphabet has more than four points, regardless of the labeling.Comment: Submitted to the IEEE Transactions on Information Theor
Observing and Modeling the Physical Layer Phenomena in Open Optical Systems for Network planning and management
L'abstract è presente nell'allegato / the abstract is in the attachmen
- …