34,806 research outputs found
A 1-bit Synchronization Algorithm for a Reduced Complexity Energy Detection UWB Receiver
This work investigates the possibility of performing synchronization in a reduced complexity Energy Detection receiver. A new receiver scheme employing a single comparator only is defined and the related synchronization algorithm is presented. The possibility of synchronizing has been analyzed both for an idealized Dirac Delta input signal and for realistic UWB signals obtained through the TG4a channel model. The matlab simulations show that it is possible to obtain coarse synchronization using a simple maximum detection algorithm computed on collected energies for the ideal case of Dirac Delta pulses. For realistic UWB signals better synchronization performances are possible by employing a searchback algorithm. Due to the low complexity of the receiver scheme, the synchronization algorithm requires a long locking time
Eigenvector Synchronization, Graph Rigidity and the Molecule Problem
The graph realization problem has received a great deal of attention in
recent years, due to its importance in applications such as wireless sensor
networks and structural biology. In this paper, we extend on previous work and
propose the 3D-ASAP algorithm, for the graph realization problem in
, given a sparse and noisy set of distance measurements. 3D-ASAP
is a divide and conquer, non-incremental and non-iterative algorithm, which
integrates local distance information into a global structure determination.
Our approach starts with identifying, for every node, a subgraph of its 1-hop
neighborhood graph, which can be accurately embedded in its own coordinate
system. In the noise-free case, the computed coordinates of the sensors in each
patch must agree with their global positioning up to some unknown rigid motion,
that is, up to translation, rotation and possibly reflection. In other words,
to every patch there corresponds an element of the Euclidean group Euc(3) of
rigid transformations in , and the goal is to estimate the group
elements that will properly align all the patches in a globally consistent way.
Furthermore, 3D-ASAP successfully incorporates information specific to the
molecule problem in structural biology, in particular information on known
substructures and their orientation. In addition, we also propose 3D-SP-ASAP, a
faster version of 3D-ASAP, which uses a spectral partitioning algorithm as a
preprocessing step for dividing the initial graph into smaller subgraphs. Our
extensive numerical simulations show that 3D-ASAP and 3D-SP-ASAP are very
robust to high levels of noise in the measured distances and to sparse
connectivity in the measurement graph, and compare favorably to similar
state-of-the art localization algorithms.Comment: 49 pages, 8 figure
The Simulation Model Partitioning Problem: an Adaptive Solution Based on Self-Clustering (Extended Version)
This paper is about partitioning in parallel and distributed simulation. That
means decomposing the simulation model into a numberof components and to
properly allocate them on the execution units. An adaptive solution based on
self-clustering, that considers both communication reduction and computational
load-balancing, is proposed. The implementation of the proposed mechanism is
tested using a simulation model that is challenging both in terms of structure
and dynamicity. Various configurations of the simulation model and the
execution environment have been considered. The obtained performance results
are analyzed using a reference cost model. The results demonstrate that the
proposed approach is promising and that it can reduce the simulation execution
time in both parallel and distributed architectures
Synchronization with partial state coupling on SO(n)
This paper studies autonomous synchronization of k agents whose states evolve
on SO(n), but which are only coupled through the action of their states on one
"reference vector" in Rn for each link. Thus each link conveys only partial
state information at each time, and to reach synchronization agents must
combine this information over time or throughout the network. A natural
gradient coupling law for synchronization is proposed. Extensive convergence
analysis of the coupled agents is provided, both for fixed and time-varying
reference vectors. The case of SO(3) with fixed reference vectors is discussed
in more detail. For comparison, we also treat the equivalent setting in Rn,
i.e. with states in Rn and connected agents comparing scalar product of their
states with a reference vector.Comment: to be submitted to SIAM Journal on Control and Optimizatio
- …