• Keine Ergebnisse gefunden

Hardware Implementation of the GCS Algorithm

N/A
N/A
Protected

Academic year: 2021

Aktie "Hardware Implementation of the GCS Algorithm"

Copied!
20
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Hardware

Implementation of the

GCS Algorithm

(2)

GCS Algorithm - Intuition

• slow condition:

• fast condition:

≥ (2s-2)κ

≤ (2s-2)κ

≤ (2s-1)κ

≥ (2s-1)κ

(3)

Difference to Lecture

ideal measurement uncertainty real measurement max

min

(slow)

(fast)

4κ

ideal measurement uncertainty real measurement max

min

(slow)

(fast)

3κ

two sided error

default to slow

bounded skew (6κ)

discrete time

(4)

GCS Algorithm - Pseudo Code

≥ (2s-2)κ

≤ (2s-2)κ

≤ (2s-1)κ

≥ (2s-1)κ

(5)

GCS Algorithm - Modules

• Identify three modules

• Adjustable Clock

• Time Measurement

• Controller

forall clock ticks do

for each neighbour do measureskew in κ

end

max ← select max skew;

min ← select min skew;

if |max| > |min| then enter fast mode;

else

enter slow mode;

end

end

(6)

Adjustable Clock - VCO recap

• Voltage Controlled Oscillator (VCO)

• two speed modes

• slow (MODE <= low)

• fast(MODE <= high)

• metastability safe

• If MODE <= [low, high]

• Then speed [slow, fast]∈

(7)

Time Measurement - TDC recap

• Time to Digital Converter (TDC)

• for each neighbor

• inputs:

• local clock

• neighbor clock

• delay element = 2κ

• neighbor may be ahead or behind

one sid ed

(8)

Time Measurement - custom TDC

• delay the neighbor clock

• both are synchronized:

measi = 111 000

• neighbor clock is ahead:

000 000, 100 000, 110 000

• neighbor clock is behind:

111 100, 111 110, 111 111

(9)

Time Measurement - encoding

• neighbor ahead

• xxx 000

• meas[5,4,3]

• neighbor behind

• 111 xxx

• meas[2,1,0]

111 000 110 000 100 000 000 000

111 111 111 110 111 100 111 000

-2κ

-4κ -6κ

(10)

Controller - recap boolean circuits

• Input: measurement for each neighbor i

• measi[5,4,3,2,1,0]

• Output: VCO control (slow / fast)

• MODE

• Functionality:

(11)

Controller - select maximum

• neighbor ahead:

• meas[5,4,3]

• for each bit:

• AND over all measurements

(12)

Controller - select minimum

• neighbor behind

• meas[2,1,0]

• for each bit:

• OR over all

measurements

(13)

Controller - If |max| > |min|

• output high

• if max is more ahead, than min is behind

• max has more 0s,

than min has 1s

(14)

Controller - If |max| > |min|

• output high

• if max is more ahead, than min is behind

• max has more 0s, than min has 1s

• example:

synchronized

(15)

Controller - If |max| > |min|

• output high

• if max is more ahead, than min is behind

• max has more 0s, than min has 1s

• example:

• max = 2κ, min = 0κ

(16)

Controller - If |max| > |min|

• output high

• if max is more ahead, than min is behind

• max has more 0s, than min has 1s

• example:

• max = 0κ, min = -4κ

(17)

What about Metastability?

Option 1:

• use synchronizers

• for each neighbor

• delay the measurement for 1-2 clock cycles

Option 2:

• metastability safe design

• VCO can handle metastability

• build Controller accordingly

(18)

Simulation Demo

• 4 nodes

• at 2 GHz

• speed up μ = 10

-4

• drift ρ = 10

-5

• levels κ = 10 ps

• error δ = 5 ps

Referenzen

ÄHNLICHE DOKUMENTE

For instance, after having set a goal, people may procrastinate in acting on their intentions and thus fail to initiate goal-directed behavior. Furthermore, in everyday life

By forming implementation intentions, people can strategically switch from conscious and effortful action initiation (guided by goal intentions in the action phase) to

It was determined that the best method to preliminarily investigate the mental representation of implement at ion intentions' dual components was to compare the

The fractal traversal al- gorithm trades efficiently space against time by adapting the parameter h (the height of a subtree, see Fig. 2), however the minimal space it uses for

First, the solution of a Max-Min problem makes it possible to evaluate upper and/or lower bounds of the objective function for some optimization problem under uncertainty

Para las partes metálicas o de vidrio, utilizar productos comerciales de limpieza destinados a este tipo de materiales, de acuerdo con las instrucciones colocadas sobre

The following theorem (also from Chapter 2 of slides) has an analogous formulation..

[r]