272 research outputs found
Iterative pre-distortion of the non-linear satellite channel
Digital Video Broadcasting - Satellite - Second Generation (DVB-S2) is the
current European standard for satellite broadcast and broadband communications.
It relies on high order modulations up to 32-amplitude/phase-shift-keying
(APSK) in order to increase the system spectral efficiency. Unfortunately, as
the modulation order increases, the receiver becomes more sensitive to physical
layer impairments, and notably to the distortions induced by the power
amplifier and the channelizing filters aboard the satellite. Pre-distortion of
the non-linear satellite channel has been studied for many years. However, the
performance of existing pre-distortion algorithms generally becomes poor when
high-order modulations are used on a non-linear channel with a long memory. In
this paper, we investigate a new iterative method that pre-distorts blocks of
transmitted symbols so as to minimize the Euclidian distance between the
transmitted and received symbols. We also propose approximations to relax the
pre-distorter complexity while keeping its performance acceptable
Impact of Realistic Propagation Conditions on Reciprocity-Based Secret-Key Capacity
Secret-key generation exploiting the channel reciprocity between two
legitimate parties is an interesting alternative solution to cryptographic
primitives for key distribution in wireless systems as it does not rely on an
access infrastructure and provides information-theoretic security. The large
majority of works in the literature generally assumes that the eavesdropper
gets no side information about the key from her observations provided that (i)
it is spaced more than a wavelength away from a legitimate party and (ii) the
channel is rich enough in scattering. In this paper, we show that this
condition is not always verified in practice and we analyze the secret-key
capacity under realistic propagation conditions
Collisions of uniformly distributed identifiers with an application to MAC address anonymization
The main contribution of this paper consists in theoretical approximations of
the collision rate of random identifiers uniformly distributed in
buckets---along with bounds on the approximation errors. A secondary
contribution is a decentralized anonymization system of media access control
(MAC) addresses with a low collision rate. The main contribution supports the
secondary one in that it quantifies its collision rate, thereby allowing
designers to minimize while attaining specific collision rates. Recent
works in crowd monitoring based on WiFi probe requests, for which collected MAC
addresses should be anonymized, have inspired this research
Angle-of-Arrival based localization using polynomial chaos expansions
International audienceIn this paper, polynomial chaos expansions are applied to angle-of-arrival based localization. By using a polynomial chaos expansion on a least squares estimator, a new positioning method is designed. Simulation results show that the proposed method returns precise information about the statistical distribution of the position
Channel adapted precoding for interference-free uplink burst transmission
info:eu-repo/semantics/publishe
- …