Clock synchronization using a linear process model

✍ Scribed by James Aweya; Delfin Y. Montuno; Michel Ouellette; Kent Felske

• Publisher: John Wiley and Sons
• Year: 2005
• Tongue: English
• Weight: 437 KB
• Volume: 16
• Category: Article
• ISSN: 1055-7148
• DOI: 10.1002/nem.583

✦ Synopsis

Abstract

In this paper, we present a clock synchronization scheme based on a simple linear process model which describes the behaviors of clocks at a transmitter and a receiver. In the clock synchronization scheme, a transmitter sends explicit time indications or timestamps to a receiver, which uses them to synchronize its local clock to that of the transmitter. Here, it is assumed that there is no common network clock available to the transmitter and the receiver and, instead, the receiver relies on locking its clock to the arrival of the timestamps sent by the transmitter. The clock synchronization algorithm used by the receiver is based on a weighted least‐squares criterion. Using this algorithm, the receiver observes and processes several consecutive clock samples (timestamps) to generate accurate timing signals. This algorithm is very efficient computationally, and requires the storage of only a small number of clock samples in order to generate accurate timing signals. Copyright © 2006 John Wiley & Sons, Ltd.