# US 2012/0269204 A1 · Method for generating a robust timing correction in timing transfer systems

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0269204 A1
- Document ID: US20120269204A1
- Status: Published application
- Kind: A1
- Application number: 13/091,097
- Filed: 2011-04-20
- Published: 2012-10-25
- Earliest claimed: 2011-04-20
- Assignees: Symmetricom, Inc.
- Inventors: George P. ZAMPETTI
- Web page: https://patentgrep.com/patent/US20120269204A1

## CPC

- H04J 3/0697: {Synchronisation in a packet node}
- H04J 3/0667: {Bidirectional timestamps, e.g. NTP or PTP for compensation of clock drift and for compensation of propagation delays (arrangements for monitoring round trip delays in packet switching networks H04L43/0864)}
- H04L 43/0858: {One way delays}
- H04L 43/0864: Round trip delays
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

High accuracy timing over packet networks is achieved by generating correction factors from multiple separation intervals and timing information contained in packets in both directions between a master and a slave. The methods are based on evaluating the weighted average of short-term, medium-term, and long-term measurements of local clock offset. Weighted averages are used to develop robust correction terms that are modified with an α-shaping factor to provide additional immunity to packet network instabilities.

## Claims

### Claim 1

A method of correcting a clock, comprising:
receiving packets during at least first and second time windows;
computing transit delays associated with the packets based on time stamps contained in the packets received during the first and second time windows;
determining a representative transit delay for each of the first and second time windows;
estimating an offset of the clock based on the representative transit delays of at least two time windows; and
correcting the clock using the estimated offset.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
receiving packets during a plurality of additional time windows;
computing transit delays associated with the packets based on time stamps contained in the packets received during the additional time windows; and
determining a representative transit delay for each of the additional time windows.

### Claim 3 (depends on 2)

The method of claim 2, wherein:
the additional time windows include third and fourth time windows and fifth and sixth time windows, and
the first and second time windows are separated by a first time interval, the third and fourth time windows by a second time interval that is larger than the first time interval, and the fifth and sixth time windows by a third time interval that is larger than the first time interval.

### Claim 4 (depends on 3)

The method of claim 3, wherein said estimating the offset includes:
estimating a first offset based on the representative transit delays of the first and second time windows;
estimating a second offset based on the representative transit delays of the third and fourth time windows; and
estimating a third offset based on the representative transit delays of the fifth and sixth time windows.

### Claim 5 (depends on 4)

The method of claim 4, wherein the offset is estimated as a weighted average of the first, second, and third offsets.

### Claim 6 (depends on 1)

The method of claim 1, wherein the first and second time windows are of substantially the same size.

### Claim 7 (depends on 1)

The method of claim 1, wherein the clock is corrected using the currently estimated offset and one or more previously estimated offsets.

### Claim 8 (depends on 1)

The method of claim 1, wherein the representative transit delay for the first time window is a minimum transit delay computed for the first time window and the representative transit delay for the second time window is a minimum transit delay computed for the second time window.

### Claim 9 (depends on 1)

The method of claim 1, wherein the offset is a frequency offset.

### Claim 10

A method of correcting a clock, comprising:
receiving and transmitting packets during a time window;
computing transit delays associated with the packets based on time stamps contained in the received and transmitted packets;
determining a first representative transit delay of the received packets and a second representative transit delay of the transmitted packets;
estimating an offset of the clock based on the first and second representative transit delays; and
correcting the clock using the estimated offset.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
receiving and transmitting packets during a plurality of additional time windows;
computing transit delays associated with the packets received and transmitted during the additional time windows based on time stamps contained therein; and
for each additional time window, determining a representative transit delay of the packets received during the additional time window and a representative transit delay of the packets transmitted during the additional time window, and estimating an offset of the clock associated with the additional time window based on the representative transit delays of the packets received and transmitted during the additional time window.

### Claim 12 (depends on 11)

The method of claim 11, wherein the offset of the clock is estimated based on a first offset which is based on the first and second representative transit delays and additional offsets which are respectively based on the representative transit delays of the packets received and transmitted during the additional time windows.

### Claim 13 (depends on 12)

The method of claim 12, wherein the offset of the clock is estimated as a weighted average of the first offset and the additional offsets.

### Claim 14 (depends on 10)

The method of claim 10, wherein the clock is corrected using the currently estimated offset and one or more previously estimated offsets.

### Claim 15 (depends on 10)

The method of claim 10, wherein the first representative transit delay is a minimum transit delay computed for the received packets and the second representative transit delay is a minimum transit delay computed for the transmitted packets.

### Claim 16 (depends on 10)

The method of claim 10, wherein the offset is a time/phase offset.

### Claim 17

A method of correcting a clock, comprising:
storing representative transit delays associated with a plurality of previous time windows in a buffer;
computing transit delays associated with packets based on time stamps contained in the packets received and transmitted during a current time window;
determining a representative transit delay for each of the received packets and the transmitted packets;
storing the representative transit delays for the received packets and the transmitted packets in the buffer;
estimating an offset of the clock based on the representative transit delays stored in the buffer; and
correcting the clock using the estimated offset.

### Claim 18 (depends on 17)

The method of claim 17, wherein the offset is a frequency offset that is estimated based on representative transit delays associated with at least two time windows.

### Claim 19 (depends on 17)

The method of claim 17, wherein the offset is a time offset that is estimated based on representative transit delays for the packets received and transmitted during at least one time window.

### Claim 20

A clock correction device, comprising:
a buffer that stores representative transit delays associated with a plurality of time windows; and
a processing unit programmed to estimate an offset of the clock based on at least two representative transit delays stored in the buffer.

### Claim 21 (depends on 20)

The device of claim 20, wherein the processing unit is programmed to estimate the offset by:
estimating a first offset based on the representative transit delays of first and second time windows stored in the buffer; estimating a second offset based on the representative transit delays of third and fourth time windows stored in the buffer; and
estimating a third offset based on the representative transit delays of fifth and sixth time windows stored in the buffer.

### Claim 22 (depends on 21)

The device of claim 21, wherein the processing unit is programmed to estimate the offset as a weighted average of the first, second, and third offsets.

### Claim 23 (depends on 20)

The device of claim 20, wherein the processing unit is further programmed to compute transit delays associated with a group of packets based on time stamps contained in the packets, determine a representative transit delay based on the computed transit delays, and store the representative transit delay in the buffer.

### Claim 24 (depends on 20)

The device of claim 20, wherein the buffer is a circular buffer.

### Claim 25 (depends on 20)

The device of claim 20, wherein the offset is a frequency offset that is estimated based on representative transit delays associated with at least two time windows.

### Claim 26 (depends on 20)

The device of claim 20, wherein the offset is a time offset that is estimated based on representative transit delays associated with at least one time window.
