Results 251 to 260 of about 15,250,999 (308)

Data synchronization with timing

IEEE Transactions on Information Theory, 2001
Summary: This paper proposes and analyzes data synchronization techniques that not only resynchronize after encoded bits are corrupted by insertion, deletion, or substitution errors, but also produce estimates of the time indexes of the decoded data symbols, in order to determine their positions in the original source sequence. The techniques are based
Navin Kashyap, David L. Neuhoff
openaire   +1 more source

Time-adaptive algorithms for synchronization

Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94, 1994
We consider concurrent systems in which there is an unknown upper bound on memory access time. Such a model is inherently different from the asynchronous model, where no such bound exists, and also from timing-based models, where such a bound exists and is known a priori.
Rajeev Alur, Hagit Attiya, Gadi Taubenfeld   +2 more
openaire   +2 more sources

Assuring Resilient Time Synchronization

2008 Symposium on Reliable Distributed Systems, 2008
In many distributed and pervasive systems the clocks of nodes are required to be synchronized to a unique global time. Due to unpredictable system and environment characteristics, the distance of a local clock from global time is a variable factor very hard to predict.
BONDAVALLI, ANDREA, CECCARELLI, ANDREA, L. Falai   +2 more
openaire   +3 more sources

On Maximum-Likelihood Timing Synchronization

IEEE Transactions on Communications, 2007
In this paper, we address the issue of symbol timing recovery for a coded burst transmission system. As direct maximum-likelihood (ML) estimation is intractable, we resort to the expectation-maximization (EM) algorithm in order to derive a receiver that iterates between data detection and synchronization.
Herzet, Cedric, Wymeersch, Henk, Moeneclaey, Marc, Vandendorpe, Luc   +3 more
openaire   +1 more source

Timing and Synchronization

1995
The WIS network will consist of digital access and nodal switches interconnected by time division multiplexed and bulk encrypted links. Timing and Synchronization (T & S) functions are therefore of vital importance for WIS. The synchronization concept must define the technical criteria to distribute and maintain permitted timing relationships at the ...
Ince, A. Nejat, Wilhelmsen, Dag, Sankur, Bülent   +2 more
openaire   +2 more sources

Datalog in Time and Space, Synchronously. [PDF]

, 2013
Motivated by recent developments of Datalog-based languages for highly distributed systems [9], in this paper we introduce a version of Datalog: specifically tailored for distributed programming [2] in synchronous settings, along with its operational and declarative semantics.
Matteo Interlandi, TANCA, LETIZIA, Sonia Bergamaschi   +2 more
openaire   +2 more sources

A CMOS synchronous time amplifier

2013 IEEE 10th International Conference on ASIC, 2013
This paper presents a synchronous time amplifier (TA). The proposed TA has predictable amplification process delay and can be synchronous with a clock signal. The TA is implemented and simulated in 0.18 µm CMOS process. It works with 100 Ms/s under 1-V voltage.
Siliang Hua, Donghui Wang, Yan Liu
openaire   +1 more source

Internet time synchronization: the network time protocol

IEEE Transactions on Communications, 1991
The network time protocol (NTP), which is designed to distribute time information in a large, diverse system, is described. It uses a symmetric architecture in which a distributed subnet of time servers operating in a self-organizing, hierarchical configuration synchronizes local clocks within the subnet and to national time standards via wire, radio ...
openaire   +1 more source

Synchronized Recursive Timed Automata

2015
We present synchronized recursive timed automata SRTA that extend timed automata with a stack. Each frame of a stack is composed of rational-valued clocks, and SRTA synchronously increase the values of all the clocks within the stack. Our main contribution is to show that the reachability problem of SRTA is ExpTime-complete. This decidability contrasts
Yuya Uezato, Yasuhiko Minamide
openaire   +2 more sources

Synchronic Times

2017
The seventh chapter retraces the encounter of the French philosopher Daniel Bensaid and the work of Walter Benjamin, that reveals a resonance between two crucial turns of the twentieth century—1940 and 1990—through a vision of history based on the idea of remembrance.
openaire   +1 more source