Related papers: Adaptive-time Synchronization Algorithm for Superl…
Sampling is classically performed by recording the amplitude of an input signal at given time instants; however, sampling and reconstructing a signal using multiple devices in parallel becomes a more difficult problem to solve when the…
The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions…
The clock synchronization problem is to determine the time difference T between two spatially separated parties. We improve on I. Chuang's quantum clock synchronization algorithm and show that it is possible to obtain T to n bits of…
In this article, we present an algorithm that drives the outputs of a network of agents to jointly track the solutions of time-varying optimization problems in a way that is robust to asynchrony in the agents' operations. We consider three…
This work proposes and studies the distributed resource allocation problem in asynchronous and stochastic settings. We consider a distributed system with multiple workers and a coordinating server with heterogeneous computation and…
This paper examines synchronization of computer clocks connected via a data network and proposes a skewless algorithm to synchronize them. Unlike existing solutions, which either estimate and compensate the frequency difference (skew) among…
In this paper, to synchronize Ultra Wideband (UWB) systems in ad-hoc multi-user environments, we propose a new timing acquisition approach for achieving a good performance despite the difficulties to get there. Synchronization constraints…
We present an algorithm for synchronous deterministic Byzantine consensus, tolerant to links failures and links asynchrony. It cares for a class of networks with specific needs, where both safety and liveness are essential, and timely…
This work introduces a methodology for studying synchronization in adaptive networks with heterogeneous plasticity (adaptation) rules. As a paradigmatic model, we consider a network of adaptively coupled phase oscillators with…
In this paper, we focus on an asynchronous distributed optimization problem. In our problem, each node is endowed with a convex local cost function, and is able to communicate with its neighbors over a directed communication network.…
We present a Stochastic Optimization Method (SOM) for the reconstruction of the spectral functions (SPFs) from Euclidean correlation functions. In this approach the SPF is parameterized as a sum of randomly distributed boxes. By varying the…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…
We present two types of meta-algorithm that can greatly improve the accuracy of existing algorithms for integrating the equations of motion of dynamical systems. The first meta-algorithm takes an integrator that is time-symmetric only for…
We consider $\mathbb{Z}_2$-synchronization on the Euclidean lattice. Every vertex of $\mathbb{Z}^d$ is assigned an independent symmetric random sign $\theta_u$, and for every edge $(u,v)$ of the lattice, one observes the product…
We present a methodology for synchronization of chaotic oscillators with linear feedback control. The proposed method is based on analyzing the chaotic oscillator as a multi-mode linear system and deriving sufficient conditions for…
The main focus of recent time synchronization research is developing power-efficient synchronization methods that meet pre-defined accuracy requirements. However, an aspect that has been often overlooked is the high dynamics of the network…
Clock synchronization is a necessary component in modern distributed systems, especially Wirless Sensor Networks (WSNs). Despite the great effort and the numerous improvements, the existing synchronization schemes do not yet address the…
Quantum key distribution (QKD) enables information-theoretically secure communication against eavesdropping. However, phase instability remains a challenge across many QKD applications, particularly in schemes such as twin-field QKD and…
High-precision frequency alignment with classical communication channels is difficult due to noise, propagation delays, and signal degradation. Current optical methods, commonly involving frequency combs, are capable of synchronising clocks…
Samples from a high-dimensional AR[1] process are observed by a sender which can communicate only finitely many bits per unit time to a receiver. The receiver seeks to form an estimate of the process value at every time instant in…